Solving MAX-r-SAT above a tight lower bound

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 511-517

  Alon, Noga ^a   Gutin, Gregory ^b   Kim, Eun Jung ^b   Szeider, Stefan ^c   Yeo, Anders ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITY OF LONDON   (United Kingdom)

^c VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING; POLYNOMIAL APPROXIMATION;

BOOLEAN CONSTRAINT; EXACT ALGORITHMS; FIXED-PARAMETER TRACTABILITY; GRAPH MATCHINGS; POLYNOMIAL-TIME REDUCTION; PROBABILISTIC ARGUMENTS; PROBLEM INSTANCES; TRUTH ASSIGNMENT;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 77951692326     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.44     Document Type: Conference Paper

References (21)

1. N. Alon, G. Gutin and M. Krivelevich, Algorithms with large domination ratio, J. Algorithms 50 (2004), 118-131.
2. N. Alon and J.H. Spencer, The Probabilistic Method, 3rd edition, Wiley, New York, 2008.
3. B. Aspvall, M. F. Plass, and R. E. Tarjan. A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Information Processing Letters, 8(3):121-123, 1979.
4. C. Berge. Sur le couplage maximum d'un graphe. C. R. Acad. Sci. Paris, 247:258-259, 1958.
5. J. A. Bondy and U. S. R. Murty. Graph theory, volume 244 of Graduate Texts in Mathematics. Springer Verlag, New York, 2008.
6. p-product spaces. Seminar on Functional Analysis, 1979-1980 (in French), 1980, Exp. No. 4A, 9.
7. R. G. Downey and M. R. Fellows. Parameterized Complexity. Monographs in Computer Science. Springer Verlag, 1999.
8. J. Flum and M. Grohe. Parameterized Complexity Theory, volume XIV of Texts in Theoretical Computer Science. An EATCS Series. Springer Verlag, 2006.
9. M. R. Garey, D. S. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theoret. Comput. Sci., 1(3):237-267, 1976.
10. G. Gutin, E. J. Kim, M. Mnich, and A. Yeo. Ordinal Embedding Relaxations Parameterized Above Tight Lower Bound. CoRR technical report (abs/0907.5427), http://arxiv.org/abs/0907.5427.
11. G. Gutin, E. J. Kim, S. Szeider, and A. Yeo. A probabilistic approach to problems parameterized above tight lower bound. CoRR technical report (abs/0906.1356), http://arxiv.org/abs/0906.1356. (Accepted at IWPEC'09, The Fourth International Workshop on Parameterized and Exact Computation, IT University of Copenhagen, Denmark, September 10-11, 2009.)
12. G. Gutin, A. Rafiey, S. Szeider, and A. Yeo. The linear arrangement problem parameterized above guaranteed value. Theory Comput. Syst., 41:521-538, 2007.
13. G. Gutin, S. Szeider, and A. Yeo. Fixed-parameter complexity of minimum profile problems. Algorithmica, 52(2):133-152, 2008.
14. J. Håstad. Some optimal inapproximability results. J. ACM, 48(4):798-859, 2001.
15. P. Heggernes, C. Paul, J. A. Telle, and Y. Villanger. Interval completion with few edges. In STOC'07 - Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pages 374-381. ACM, 2007.
16. Full version appeared in SIAM J. Comput. 38(5), 2008/09.
17. K. Iwama. CNF-satisfiability test by counting and polynomial average time. SIAM J. Comput., 18(2):385-391, 1989.
18. D. S. Johnson. Approximation algorithms for combinatorial problems. In Fifth Annual ACM Symposium on Theory of Computing (Austin, Tex., 1973), pages 38-49. Assoc. Comput. Mach., New York, 1973.
19. M. Mahajan and V. Raman. Parameterizing above guaranteed values: MaxSat and MaxCut. J. Algorithms, 31(2):335-354, 1999.
20. M. Mahajan, V. Raman, and S. Sikdar. Parameterizing above or below guaranteed values. J. of Computer and System Sciences, 75(2):137-153, 2009.
21. R. Niedermeier. Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications. Oxford University Press, 2006.