An LP-designed algorithm for constraint satisfaction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4168 LNCS, Issue , 2006, Pages 588-599

  Scott, Alexander D ^a   Sorkin, Gregory B ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; LINEAR PROGRAMMING; PROBLEM SOLVING;

CONSTRAINT SATISFACTION; MAX BISECTION; TIME ALGORITHM;

CONSTRAINT THEORY;

EID: 33750743399     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11841036_53     Document Type: Conference Paper

References (9)

1. n), J. Algorithms 54 (2005), no. 2, 168-204.
2. [GHNR03] Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, and Peter Rossmanith, Worst-case upper bounds for MAX-2-SAT with an application to MAXCUT, Discrete Appl. Math. 130 (2003), no. 2, 139-155.
3. |E|/4, Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI) 203 (2002), no. Teor. Slozhn. Vychisl. 7, 129-138, 183.
4. [KR05] Joachim Kneis and Peter Rossmanith, A new satisfiability algorithm with applications to Max-Cut, Tech. Report AIB-2005-08, Department of Computer Science, RWTH Aachen, 2005.
5. [SS03] Alexander D. Scott and Gregory B. Sorkin, Faster algorithms for MAX CUT and MAX CSP, with polynomial expected time for sparse instances, Proc. 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Lecture Notes in Comput. Sci., vol. 2764, Springer, August 2003, pp. 382-395.
6. [SS04] _, A faster exponential-time algorithm for Max 2-Sat, Max Cut, and Max k-Cut, Tech. Report RC23456 (W0412-001), IBM Research Report, December 2004, See http://domino.research.ibm.com/library/cyberdig.nsf.
7. [SS06] _, Generalized constraint satisfaction problems, Tech. Report RC23935, IBM Research Report, April 2006, See http://domino.research.ibm.com/ library/cyberdig.nsf.
8. [TSSW00] Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, and David P. Williamson, Gadgets, approximation, and linear programming, SIAM J. Comput. 29 (2000), no. 6, 2074-2097.
9. [Wil04] Ryan Williams, A new algorithm for optimal constraint satisfaction and its implications, Proc. 31st International Colloquium on Automata, Languages and Programming (ICALP), 2004.