Fast polynomial-space algorithms using möbius inversion: Improving on steiner tree and related problems

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

Volumn 5555 LNCS, Issue PART 1, 2009, Pages 713-725

  Nederlof, Jesper ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC PROGRAMMING ALGORITHM; HAMILTONIAN PATH; INCLUSION-EXCLUSION; INTEGER WEIGHTS; K TERMINALS; PARTITION PROBLEM; POLYNOMIAL SPACE; SPACE ALGORITHMS; SPANNING TREE; STEINER TREES;

ALGORITHMS; DYNAMIC PROGRAMMING; LINGUISTICS; POLYNOMIALS; SYSTEMS ENGINEERING; TRANSLATION (LANGUAGES);

GRAPH THEORY;

EID: 70449116195     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02927-1_59     Document Type: Conference Paper

References (20)

1. Bax, E.T.: Recurrence-Based Reductions for Inclusion and Exclusion Algorithms Applied to #P Problems (1996)
2. Björklund, A., Husfeldt, T.: Exact algorithms for exact satisfiability and number of perfect matchings. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 548-559. Springer, Heidelberg (2006)
3. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets möbius: fast subset convolution. In: STOC, pp. 67-74 (2007)
4. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Computing the tutte polynomial in vertex-exponential time. In: FOCS, pp. 677-686 (2008)
5. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Trimmed moebius inversion and graphs of bounded degree. In: STACS, pp. 85-96 (2008)
6. Björklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM Journal on Computing, special issue dedicated to selected papers from FOCS 2006, 575-582 (2006)
7. Bodlaender, H.L., Kratsch, D.: An exact algorithm for graph coloring with polynomial memory. Technical Report UU-CS-2006-015, Department of Information and Computing Sciences, Utrecht University (2006)
8. Chung, F.R.K., Graham, R.L.: On the cover polynomial of a digraph. J. Comb. Theory, Ser. B 65(2), 273-290 (1995)
9. Dreyfus, S., Wagner, R.: The Steiner problem in graphs. Networks 1, 195-207 (1972)
10. Fernau, H., Raible, D., Gaspers, S., Stepanov, A.A.: Exact exponential time algorithms for max internal spanning tree. CoRR, abs/0811.1875 (2008)
11. Fomin, F.V., Grandoni, F., Kratsch, D.: Faster steiner tree computation in polynomial-space. In: Halperin, D., Mehlhorn, K. (eds.) Esa 2008. LNCS, vol. 5193, pp. 430-441. Springer, Heidelberg (2008)
12. Fuchs, B., Kern, W., Molle, D., Richter, S., Rossmanith, P., Wang, X.: Dynamic programming for minimum Steiner trees. Theory of Computing Systems 41(3), 493-500 (2007)
13. Gaspers, S., Saurabh, S., Stepanov, A.A.: A moderately exponential time algorithm for full degree spanning tree. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 479-489. Springer, Heidelberg (2008)
14. Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. Journal of the Society for Industrial and Applied Mathematics 10(1), 196-210 (1962)
15. Jaeger, F., Vertigan, D.L., Welsh, D.J.A.: On the computational complexity of the jones and tutte polynomials. Mathematical Proceedings of the Cambridge Philosophical Society 108(01), 35-53 (1990)
16. Karp, R.M.: Dynamic programming meets the principle of inclusion and exclusion. Oper. Res. Lett. 1, 49-51 (1982)
17. Kohn, S., Gottlieb, A., Kohn, M.: A generating function approach to the traveling salesman problem. In: ACM 1977: Proceedings of the 1977 annual conference, pp. 294-300. ACM, New York (1977)
18. Nederlof, J.: Inclusion exclusion for hard problems. Master's thesis, Utrecht University (August 2008)
19. van Rooij, J.M.M., Nederlof, J., van Dijk, T.C.: Inclusion/exclusion meets measure and conquer: Exact algorithms for counting dominating sets. Technical Report UU-CS-2008-043, Utrecht, The Netherlands (2008)
20. Woeginger, G.J.: Space and time complexity of exact algorithms: Some open problems. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004, vol. 3162, pp. 281-290. Springer, Heidelberg (2004)