liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Approximating integer programs with positive right-hand sides
Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology. (TCSLAB)
Ecole Polytechnique.
2010 (English)In: INFORMATION PROCESSING LETTERS, ISSN 0020-0190, Vol. 110, no 10, 351-355 p.Article in journal (Refereed) Published
Abstract [en]

We study minimisation of integer linear programs with positive right-hand sides. We show that such programs can be approximated within the maximum absolute row sum of the constraint matrix A whenever the variables are allowed to take values in N. This result is optimal under the unique games conjecture. When the variables are restricted to bounded domains, we show that finding a feasible solution is NP-hard in almost all cases.

Place, publisher, year, edition, pages
Elsevier Science B.V., Amsterdam. , 2010. Vol. 110, no 10, 351-355 p.
Keyword [en]
Approximation algorithms, Integer programming
National Category
Computer Science
URN: urn:nbn:se:liu:diva-56686DOI: 10.1016/j.ipl.2010.02.011ISI: 000277661100001OAI: diva2:321234
Available from: 2010-05-31 Created: 2010-05-31 Last updated: 2010-12-29

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Jonsson, Peter
By organisation
TCSLAB - Theoretical Computer Science LaboratoryThe Institute of Technology
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 22 hits
ReferencesLink to record
Permanent link

Direct link