The approximability of non-Boolean satisfiability problems and restricted integer programming☆
Under an Elsevier user license
open archive
Keywords
Parallel approximation algorithms
Non-approximability
Positive linear programming
Randomized rounding
Non-Boolean constraint satisfaction
Maximum capacity representatives
Cited by (0)
- ☆
Preliminary version appeared in Proceedings of 15th Annual Symposium on Theoretical Aspects of Computer Science, STACS’98.
- 1
This research was partially supported by the ALCOM FT Research Project No. IST-1999-14186 and CICYT Project TRACER TIC2002-04498-C05-03.
Copyright © 2004 Elsevier B.V. All rights reserved.