Instant Recognition of Half Integrality and 2-Approximations (1998)
| Venue: | In Proceedings of the 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization |
| Citations: | 5 - 0 self |
BibTeX
@INPROCEEDINGS{Hochbaum98instantrecognition,
author = {Dorit S. Hochbaum},
title = {Instant Recognition of Half Integrality and 2-Approximations},
booktitle = {In Proceedings of the 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization},
year = {1998},
pages = {99--110},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. We define a class of integer programs with constraints that involve up to three variables each. A generic constraint in such integer program is of the form ax + by z + c, where the variable z appears only in that constraint. For such binary integer programs it is possible to derive half integral superoptimal solutions in polynomial time. The scheme is also applicable with few modifications to nonbinary integer problems. For some of these problems it is possible to round the half integral solution to a 2-approximate solution. This extends the class of integer programs with at most two variables per constraint that were analyzed in [HMNT93]. The approximation algorithms here provide an improvement in running time and range of applicability compared to existing 2-approximations. Furthermore, we conclude that problems in the framework are MAX SNP-hard and at least as hard to approximate as vertex cover. Problems that are amenable to the analysis provided here are easily recognized. The ...
