On the effective enumerability of NP problems

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

Volumn 4169 LNCS, Issue , 2006, Pages 215-226

  Chen, Jianer ^a   Kanj, Iyad A ^b   Meng, Jie ^a   Xia, Ge ^c   Zhang, Fenghui ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

^b DEPAUL UNIVERSITY   (United States)

^c LAFAYETTE COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COLOR CODES; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING; TREES (MATHEMATICS);

COMPUTATIONAL OPTIMIZATIONS; ENUMERATION ALGORITHMS; SEARCH TREES;

COMPUTATION THEORY;

EID: 33750246482     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11847250_20     Document Type: Conference Paper

References (31)

1. J. ALBER, H. BODLAENDER, H. FERNAU, T. KLOKS, AND R. NIEDERMEIER, Fixed parameter algorithms for dominating set and related problems on planar graphs, Algorithmica 33, pp. 461-493, (2002).
2. N. ALON, R. YUSTER, AND U. ZWICK, Color-coding, Journal of the ACM 42, pp. 844-856, (1995).
3. V. ARVIND AND V. RAMAN, Approximation algorithms for some parameterized counting problems, ISAAC'02, pp. 453-464, (2002).
4. G. AUSIELLO, P. CRESCENZI, G. GAMBOSI, V. KANN, A. MARCHETTI-SPACCAMELA, M. PROTASI, Complexity and Approximation, Combinatorial optimization problems and their approximability properties, Springer-Verlag, 1999.
5. H. BODLAENDER, Treewidth: algorithmic techniques and results, Lecture Notes in Computer Science 1295, pp. 19-36, (1997).
6. J. CHEN, I. A. KANJ, AND W. JIA, Vertex cover: further observations and further improvements, Journal of Algorithms 41, pp. 280-301, (2001).
7. J. CHEN, S. LU, S.-H. SZE, AND F. ZHANG, Improved algorithms for the k-path problem, Manuscript, (2005).
8. C. CHEGIREDDY AND H. HAMACHER, Algorithms for finding K-best perfect matchings, Discrete Applied Mathematics 18, pp. 155-165, (1987).
9. S. CHIEN, A determinant-based algorithm for counting perfect matching in a general graph, SODA'04, pp. 728-735, (2004).
10. T. CORMEN, C. LEISERSON, R. RIVEST, AND C. STEIN, Introduction to Algorithms, 2nd Edition, McGraw-Hill Book Company, Boston, MA, 2001.
11. V. DAHLLOF AND P. JONSSON, An algorithm for counting maximum weighted independent sets and its applications, SODA'02, pp. 292-298, (2002).
12. M. DYER, Approximate counting by dynamic programming, STOC'03, pp. 693-699, (2003).
13. R.G. DOWNEY AND M.R. FELLOWS, Parameterized Complexity, Springer-Verlag, 1999.
14. D. EPPSTEIN, Finding the k shortest paths, SIAM J. Computing 28-2, pp. 652-673, (1998).
15. M. FELLOWS, C. KNAUER, N. NISHIMURA, P. RAGDE, F. ROSAMOND, U. STEGE, D. THILIKOS, AND S. WHITESIDES, Faster fixed-parameter tractable algorithms for matching and packing problems, Lecture Notes in Computer Science 3221, (2004), pp. 311-322.
16. H. FERNAU, On parameterized enumeration, COCOON'02, pp. 564-573, (2002).
17. J. FLUM AND M. GROHE, The parameterized complexity of counting problems, SIAM Journal on Computing 33, pp. 892-922, (2004).
18. V. GURUSWAMI, List decoding of error-correcting codes, Lecture Notes in Computer Science 3282, 2005.
19. H. HUNT III, M. MARATHE, V. RADHAKRISHNAN, AND R. STEARNS, The complexity of planar counting problems, SIAM Journal on Computing 27, pp. 1142-1167, (1998).
20. B. KELLEY, R. SHARAN, R. KARP, T. SITTLER, D. ROOT, B. STOCKWELL, AND T. IDEKER, Conserved pathways within bacteria and yeast as revealed by global protein network alignment, Proc. Natl. Acad. Sci. USA 100, pp. 11394-11399, (2003).
21. T. KLOKS, Treewidth, computations and approximations, Lecture Notes in Computer Science 842, (1994).
22. I. KOUTIS, A faster parameterized algorithm for set packing, Information Processing Letters 94, (2005), pp. 7-9.
23. S. NAKANO, Efficient generation of triconnected plane triangulations, COCOON'01, pp. 131-141, (2001).
24. C. H. PAPADIMITRIOU, Computational Complexity, Addison-Wesley, 1994.
25. P. PEVZNER AND S.-H. SZE, Combinatorial approaches to finding subtle signals in DNA sequences, ISMB'2000, pp. 269-278, (2000).
26. S. RAVI AND H. HUNT III, An application of the planar separator theorem to counting problems, Information Processing Letters 25, pp. 317-321, (1987).
27. J. SCOTT, T. IDEKER, R. KARP, AND R. SHARAN, Efficient algorithms for detecting signaling pathways in protein interaction networks, RECOMB 2005, to appear.
28. E. TOMITA, A. TANAKA, AND H. TAKAHASHI, The worst-case time complexity for generating all maximal cliques, COCOON'04, pp. 161-170, (2004).
29. L. VALIANT, The complexity of computing the permanent, Theoretical Computer Science 8, pp. 189-201, (1979).
30. D. MOELLE, S. RICHTER, P. ROSSMANITH, Enumerate and Expand: New Runtime Bound for Vertex Cover Variants, COCOON 06, to appear
31. JIANER CHEN, IYAD A. KANJ, JIE MENG, GE XIA, FENGHUI ZHANG, On the Effective Enumerability of NP Problems, Technique Report tr2006-5-2, Department of Computer Science, Texas A&M University.