We investigate the computational complexity of two closely related classes of combinatorial
optimization problems for linear systems which arise in various fields such as machine …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

This book presents a nearly complete classification of various restricted classes of
computational problems called Boolean constraint satisfaction problems. Roughly, these are …

This paper continues the investigation of the connection between probabilistically checkable
proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on …

Four fundamental graph problems, Minimum vertex cover, Maximum independent set,
Minimum dominating set and Maximum cut, are shown to be APX-complete even for cubic …

We present a linear programming-based method for finding" gadgets," ie, combinatorial
structures reducing constraints of one optimization problem to constraints of another. A key …

We study optimization problems that may be expressed as" Boolean constraint satisfaction
problems." An instance of a Boolean constraint satisfaction problem is given by m …

Comparing the complexity of different combinatorial optimization problems has been an
extremely active research area during the last 23 years. This has led to the definition of …

Four fundamental graph problems, Minimum vertex cover, Maximum independent set,
Minimum dominating set and Maximum cut, are shown to be APX-complete even for cubic …

We study the Max k-Cut problem and its dual, the Min k-Partition problem: given G=(V; E)
and w: E! R+, nd an edge set of minimum weight whose removal makes G k-colorable. For …