Confronting hardness using a hybrid approach

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 1-10

  Vassilevska, Virginia ^a   Williams, Ryan ^a   Woo, Shan Leung Maverick ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HYBRID ALGORITHMS; POLYNOMIAL TIME SELECTOR;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; POLYNOMIALS;

HARDNESS TESTING;

EID: 33244469920     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109558     Document Type: Conference Paper

References (39)

1. N. Alon, R. Yuster, and U. Zwick. Color-coding. J. ACM, 42(4):844-856, 1995.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. J. ACM, 45(3):501-555, 1998.
3. B. S. Baker. Approximation algorithms for NP-complete problems on planar graphs. J. ACM, 41(1):153-180, 1994.
4. R. Bellman. Dynamic programming treatment of the travelling salesman problem. J. ACM, 9(1):61-63, 1962.
5. A. Blum, G. Konjevod, R. Ravi, and S. Vempala. Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems. Theor. Comput. Sci., 235(1):25-42, 2000.
6. H. L. Bodlaender. On linear time minor tests with depth-first search. J. Algorithms, 14(1):1-23, 1993.
7. H. L. Bodlaender, M. R. Fellows, and M. T. Hallett. Beyond NP-completeness for problems of bounded width: Hardness for the W hierarchy. In Symp. on Theory of Computing, pages 449-458, 1994.
8. L. Cai and D. W. Juedes. On the existence of subexponential parameterized algorithms. J. Comput. and Syst. Sciences, 67(4):789-807, 2003.
9. J. Chen, X. Huang, I. A. Kanj, and G. Xia. Linear FPT reductions and computational lower bounds. In Symp. on Theory of Computing, pages 212-221, 2004.
10. E. Dantsin, M. Gavrilovich, E. A. Hirsch, and B. Konev. MAX SAT approximation beyond the limits of polynomial-time approximation. Annals of Pure and Applied Logic, 113(1-3):81-94, 2001.
11. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.
12. W. R. Dyksen and C. R. Gritter. Scientific computing and the algorithm selection problem. Expert Systems for Scientific Computing, pages 19-31, 1992.
13. U. Feige. A threshold of In n for approximating set cover. J. ACM, 45(4):634-652, 1998.
14. U. Feige. Coping with the NP-hardness of the graph bandwidth problem. In Scandinavian Workshop on Algorithm Theory, pages 10-19, 2000.
15. U. Feige and K. Talwar. Approximating the bandwidth of caterpillars. In RANDOM-APPROX, pages 62-73, 2005.
16. H. N. Gabow. Finding paths and cycles of superpolylogarithmic length. In Symp. on Theory of Computing, pages 407-416, 2004.
17. M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM, 42:1115-1145, 1995.
18. C. P. Gomes and B. Selman. Algorithm portfolios. Art. Intell., 126(1-2):43-62, 2001.
19. A. Gupta and N. Nishimura. Sequential and parallel algorithms for embedding problems on classes of partial k-trees. In Scandinavian Workshop on Algorithm Theory, pages 172-182, 1994.
20. J. Håstad. Some optimal inapproximability results. J. ACM, 48(4):798-859, 2001.
21. J. Håstad and S. Venkatesh. On the advantage over a random assignment. Random Structures and Algorithms, 25(3):117-149, 2004.
22. M. Held and R. M. Karp. A dynamic programming approach to sequencing problems. J. of the Society of Industrial and Applied Mathematics, 10:196-210, 1962.
23. E. A. Hirsch. A fast deterministic algorithm for formulas that have many satisfying assignments. Logic Jour. of the IGPL, 6(1):59-71, 1998.
24. E.A. Hirsch. Worst-case study of local search for MAx-k-SAT. Discr. Applied Mathematics, 130(2):173-184, 2003.
25. R. Impagliazzo, R. Paturi, and F. Zane. Which problems have strongly exponential complexity? J. Comput. and Syst. Sciences, 63(4):512-530, 2001.
26. M. Jerrum and U. V. Vazirani. A mildly exponential approximation algorithm for the permanent. Algoriihmica, 16(3):392-401, 1996.
27. M.-Y. Kao, Y. Ma, M. Sipser, and Y. L. Yin. Optimal constructions of hybrid algorithms. J. Algorithms, 29(1):142-164, 1998.
28. D. R. Karger, R. Motwani, and G. D. S. Ramkumar. On approximating the longest path in a graph. Algorithmica, 18(1):82-98, 1997.
29. S. Khot, G. Kindler, E. Mossel, and R. O'Donnell. Optimal inapproximability results for max-cut and other 2-variable csps? In Foundations of Comp. Sci., pages 146-154, 2004.
30. R. Krauthgamer, J. R. Lee, M. Mendel, and A. Naor. Measured descent: A new embedding method for finite metrics. In Foundations of Comp. Sci., pages 434-443, 2004.
31. K. Leyton-Brown, E. Nudelman, G. Andrew, J. Mc-Fadden, and Y. Shoham. Boosting as a metaphor for algorithm design. In Principles and Practice of Constraint Programming, pages 899-903, 2003.
32. A. Lingas and M. Wahlen. On approximation of the maximum clique minor containment problem and some subgraph homeomorphism problems. Electronic Colloquium on Comput. Complexity, 11(39), 2004.
33. S. A. Plotkin, S. Rao, and W. D. Smith. Shallow excluded minors and improved graph decompositions. In Symp. on Discr. Algorithms, pages 462-470, 1994.
34. J. R. Rice. The algorithm selection problem. Advances in Computers, 15:65-118, 1976.
35. S. Sahni and T. Gonzalez. P-complete approximation problems. J. ACM, 23:555-565, 1976.
36. J. B. Saxe. Dynamic programming algorithms for recognizing small bandwidth graphs in polynomial time. SIAM J. on Algebraic and Discr. Methods, 1(4):363-369, 1980.
37. A. D. Scott and G. B. Sorkin. Faster algorithms for max cut and max csp, with polynomial expected time for sparse instances. In RANDOM-APPROX, pages 382-395, 2003.
38. V. Vassilevska, R. Williams, and S. L. M. Woo. Confronting hardness using a hybrid approach. Technical report, Computer Science Department, Carnegie Mellon University, April 2005. CMU-CS-05-125.
39. R. Williams. A new algorithm for optimal constraint satisfaction and its applications. Electronic Colloquium on Comput. Complexity, 11(32), 2004.