Solving min ones 2-sat as fast as vertex cover.

Neeldhara Misra N. S. Narayanaswamy Venkatesh Raman Bal Sri Shankar

Published in: Theor. Comput. Sci. (2013)

Keyphrases

vertex cover
approximation algorithms
planar graphs
combinatorial optimization
partial order
precedence constraints
upper bound
sat solvers
special case
scheduling problem