Open problems around exact algorithms

Discrete Applied Mathematics

Volumn 156, Issue 3, 2008, Pages 397-405

  Woeginger, Gerhard J ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Combinatorial optimization; Computational complexity

Indexed keywords

ALGORITHMS; FUNCTION EVALUATION; PROBLEM SOLVING;

EXPONENTIAL TIME SOLUTIONS; POINTERS;

BOUNDARY CONDITIONS;

EID: 38049061650     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.03.023     Document Type: Article

References (43)

1. Afrati F., Cosmadakis S., Papadimitriou C.H., Papageorgiou G., and Papakonstantinou N. The complexity of the travelling repairman problem. RAIRO Inform. Théor. Appl. 20 (1986) 79-87
2. Alon N., Yuster R., and Zwick U. Color-coding. J. ACM 42 (1995) 844-856
3. Banzhaf III J.F. Weighted voting doesn't work: a mathematical analysis. Rutgers Law Rev. 19 (1965) 317-343
4. Bax E.T. Inclusion and exclusion algorithm for the Hamiltonian path problem. Inform. Process. Lett. 47 (1993) 203-207
5. Bax E.T. Algorithms to count paths and cycles. Inform. Process. Lett. 52 (1994) 249-252
6. Bax E.T., and Franklin J. A finite-difference sieve to count paths and cycles by length. Inform. Process. Lett. 60 (1996) 171-176
7. R. Beigel, Finding maximum independent sets in sparse and general graphs, in: Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms (SODA'1999), 1999, pp. 856-857.
8. M. Ben-Or, Lower bounds for algebraic computation trees. in: Proceedings of the 15th Annual ACM Symposium on the Theory of Computing (STOC'1983), 1983, pp. 80-86.
9. Coppersmith D. Rectangular matrix multiplication revisited. J. Complexity 13 (1997) 42-49
10. Coppersmith D., and Winograd S. Matrix multiplication via arithmetic progressions. J. Symbolic Comput. 9 (1990) 251-280
11. 2 on linear search programs for the knapsack problem. J. Comput. System Sci. 16 (1978) 413-417
12. Downey R.G., and Fellows M.R. Fixed-parameter tractability and completeness II: on completeness for W[1]. Theoret. Comput. Sci. 141 (1995) 109-131
13. Downey R.G., and Fellows M.R. Parameterized complexity, Springer Monographs in Computer Science (1999), Springer, Berlin
14. F. Eisenbrand, F. Grandoni, On the complexity of fixed parameter clique and dominating set. Theoret. Comput. Sci., 2004.
15. D. Eppstein, The traveling salesman problem for cubic graphs, in: Proceedings of the 8th International Workshop on Algorithms and Data Structures (WADS'2003), Lecture Notes in Computer Science, vol. 2748, 2003, pp. 307-318.
16. Erickson J. Lower bounds for linear satisfiability problems. Chicago J. Theoret. Comput. Sci. 1999 8 (1999)
17. J. Erickson, Private communication, 2004.
18. | E | / 4. Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. 293 (2002) 129-138 (in Russian)
19. U. Feige, J. Kilian, On limited versus polynomial nondeterminism, Chicago J. Theoret. Comput. Sci., 1997.
20. 2) problems in computational geometry. Comput. Geom. 5 (1995) 165-185
21. Held M., and Karp R.M. A dynamic programming approach to sequencing problems. J. SIAM 10 (1962) 196-210
22. Horowitz E., and Sahni S. Computing partitions with applications to the knapsack problem. J. ACM 21 (1974) 277-292
23. Huang X., and Pan V. Fast rectangular matrix multiplication and applications. J. Complexity 14 (1998) 257-299
24. Hwang R.Z., Chang R.C., and Lee R.C.T. The searching over separators strategy to solve some NP-hard problems in subexponential time. Algorithmica 9 (1993) 398-423
25. Itai A., Papadimitriou C.H., and Swarcfiter J.L. Hamiltonian paths in grid graphs. SIAM J. Comput. 11 (1982) 676-686
26. Itai A., and Rodeh M. Finding a minimum circuit in a graph. SIAM J. Comput. 7 (1978) 413-423
27. V. Kann, On the approximability of NP-complete optimization problems, Ph.D. Thesis, Kungliga Tekniska Högskolan, Stockholm, 1992.
28. Karp R.M. Dynamic programming meets the principle of inclusion and exclusion. Oper. Res. Lett. 1 (1982) 49-51
29. B. Klinz, G.J. Woeginger, Faster algorithms for computing power indices in weighted majority games, Math. Social Sci., 2004.
30. Lawler E.L. A note on the complexity of the chromatic number problem. Inform. Process. Lett. 5 (1976) 66-67
31. Lipton R.J., and Tarjan R.E. A separator theorem for planar graphs. SIAM J. Appl. Math. 36 (1979) 177-189
32. Lipton R.J., and Tarjan R.E. Applications of a planar separator theorem. SIAM J. Comput. 9 (1980) 615-627
33. Moon J.W. On maximal transitive subtournaments. Proc. Edinburgh Math. Soc. 17 (1971) 345-349
34. Nešetřil J., and Poljak S. On the complexity of the subgraph problem. Comment. Math. Univ. Carolin. 26 (1985) 415-419
35. Prasad K., and Kelly J.S. NP-completeness of some problems concerning voting games. Internat. J. Game Theory 19 (1990) 1-9
36. Robson J.M. Algorithms for maximum independent sets. J. Algorithms 7 (1986) 425-440
37. n / 4) algorithm for certain NP-complete problems. SIAM J. Comput. 10 (1981) 456-464
38. Schwikowski B., and Speckenmeyer E. On enumerating all minimal solutions of feedback problems. Discrete Appl. Math. 117 (2002) 253-265
39. W.D. Smith, Studies in computational geometry motivated by mesh generation. Ph.D. Thesis, Princeton University, Princeton.
40. E. Speckenmeyer, On feedback problems in digraphs, in: Proceedings of the 15th Workshop on Graph-Theoretic Concepts in Computer Science (WG'1989), Lecture Notes in Computer Science, vol. 411, Springer, Berlin, 1989, pp. 218-231.
41. Tarjan R.E., and Trojanowski A.E. Finding a maximum independent set. SIAM J. Comput. 6 (1977) 537-546
42. R. Williams, A new algorithm for optimal constraint satisfaction and its implications, in: Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP'2004), Springer, Berlin, 2004.
43. G.J. Woeginger, Exact algorithms for NP-hard problems: a survey, in: Combinatorial Optimization-Eureka, you shrink!", Lecture Notes in Computer Science, vol. 2570, Springer, Berlin, 2003, pp. 185-207.