ISSN:
1432-0541
Keywords:
Satisfiability
;
Combinatorial optimization
;
Stable roommates problem
;
Approximation algorithm
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract Given a satisfiable Boolean formula in 2-CNF, it is NP-hard to find a satisfying assignment that contains a minimum number of true variables. A polynomial-time approximation algorithm is given that finds an assignment with at most twice as many true variables as necessary. The algorithm also works for a weighted generalization of the problem. An application to the optimal stable roommates problem is given in detail, and other applications are mentioned.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01758838
Permalink