Name
Title | ||
|---|---|---|
Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds. |
Abstract | ||
|---|---|---|
We give a simple, randomized greedy algorithm for the maximum satisfiability problem (MAX SAT) that obtains a 3/4-approximation in expectation. In contrast to previously known 3/4-approximation algorithms, our algorithm does not use flows or linear programming. Hence we provide a positive answer to a question posed by Williamson in 1998 on whether such an algorithm exists. Moreover, we show that Johnson's greedy algorithm cannot guarantee a 3/4-approximation, even if the variables are processed in a random order. Thereby we partially solve a problem posed by Chen, Friesen, and Zheng in 1999. In order to explore the limitations of the greedy paradigm, we use the model of priority algorithms of Borodin, Nielsen, and Rackoff. Since our greedy algorithm works in an online scenario where the variables arrive with their set of undecided clauses, we wonder if a better approximation ratio can be obtained by further fine-tuning its random decisions. For a particular information model we show that no priority algorithm can approximate Online MAX SAT within 3/4 + epsilon (for any epsilon > 0). We further investigate the strength of deterministic greedy algorithms that may choose the variable ordering. Here we show that no adaptive priority algorithm can achieve approximation ratio 3/4. We propose two ways in which this inapproximability result can be bypassed. First we show that if our greedy algorithm is additionally given the variable assignments of an optimal solution to the canonical LP relaxation, then we can derandomize its decisions while preserving the overall approximation guarantee. Second we give a simple, deterministic algorithm that performs an additional pass over the input. We show that this 2-pass algorithm satisfies clauses with a total weight of at least 3/4 OPTLP, where OPTLP is the objective value of the canonical linear program. Moreover, we demonstrate that our analysis is tight and detail how each pass can be implemented in linear time. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1137/15M1053369 | SIAM JOURNAL ON COMPUTING |
Keywords | Field | DocType |
approximation algorithms,greedy algorithms,maximum satisfiability problem,priority algorithms,randomized algorithms | Maximum satisfiability problem,Discrete mathematics,Approximation algorithm,Randomized algorithm,Combinatorics,Greedy algorithm,Linear programming,SIMPLE algorithm,Greedy randomized adaptive search procedure,Mathematics | Journal |
Volume | Issue | ISSN |
46 | 3 | 0097-5397 |
Citations | PageRank | References |
6 | 0.45 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matthias Poloczek | 1 | 53 | 6.39 |
| Georg Schnitger | 2 | 464 | 54.63 |
| David P. Williamson | 3 | 3564 | 413.34 |
| Anke Van Zuylen | 4 | 291 | 22.10 |