Skip to main content
SpringerLink
Log in

Iterative Compression and Exact Algorithms

  • Conference paper
Book cover Mathematical Foundations of Computer Science 2008 (MFCS 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5162))

Abstract

Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. The main purpose of this paper is to show that iterative compression can also be used in the design of exact exponential time algorithms. We exemplify our findings with algorithms for the Maximum Independent Set problem, a counting version of k-Hitting Set and the Maximum Induced Cluster Subgraph problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Björklund, A., Husfeldt, T.: Inclusion–Exclusion Algorithms for Counting Set Partitions. In: Proceedings of FOCS 2006, pp. 575–582 (2006)

    Google Scholar 

  2. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets Mobius: Fast Subset Convolution. In: Proceedings of STOC 2007, pp. 67–74 (2007)

    Google Scholar 

  3. Byskov, J.M.: Enumerating maximal independent sets with applications to graph colouring. Oper. Res. Lett. 32(6), 547–556 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  4. Chen, J., Liu, Y., Lu, S., Razgon, I., O’Sullivan, B.: A Fixed-Parameter Algorithm for the Directed Feedback Vertex Set Problem. In: Proceedings of STOC 2008, pp. 177–186 (2008)

    Google Scholar 

  5. Dehne, F., Langston, M.A., Luo, X., Pitre, S., Shaw, P., Zhang, Y.: The Cluster Editing Problem: Implementations and Experiments. In: Proceedings of IWPEC 2006, pp. 13–24 (2006)

    Google Scholar 

  6. Dehne, F., Fellows, M., Langston, M., Rosamond, F., Stevens, K.: An O(2O(k) n 3) FPT algorithm for the undirected feedback vertex set problem. In: Proceedings of COCOON 2005, pp. 859–869 (2005)

    Google Scholar 

  7. Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2), 248–264 (1972)

    Article  MATH  Google Scholar 

  8. Fellows, M.R., Langston, M.A., Rosamond, F.A., Shaw, P.: Efficient Parameterized Preprocessing for Cluster Editing. In: Proceedings of FCT 2007, pp. 312–321 (2007)

    Google Scholar 

  9. Fernau, H.: Parameterized Algorithms for Hitting Set: The Weighted Case. In: Proceedings of CIAC 2006, pp. 332–343 (2006)

    Google Scholar 

  10. Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and conquer: A simple O (20.288 n) independent set algorithm. In: Proceedings of SODA 2006, pp. 18–25 (2006)

    Google Scholar 

  11. Guo, J.: A More Effective Linear Kernelization for Cluster Editing. In: Proceedings of ESCAPE 2007, pp. 36–47 (2007)

    Google Scholar 

  12. Guo, J., Gramm, J., Hüffner, F., Niedermeier, R., Wernicke, S.: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. J. Comput. Syst. Sci. 72(8), 1386–1396 (2006)

    Article  MATH  Google Scholar 

  13. Hopcroft, J.E., Karp, R.M.: An n 5/2 algorithm for maximum matching in bipartite graphs. SIAM J. Computing 2(4), 225–231 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  14. Hüffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Fixed-parameter algorithms for cluster vertex deletion. In: Proceedings of LATIN 2008, pp. 711–722 (2008)

    Google Scholar 

  15. Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: On Generating All Maximal Independent Sets. Inf. Process. Lett. 27(3), 119–123 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  16. Koivisto, M.: An O(2n) Algorithm for Graph Colouring and Other Partitioning Problems via Inclusion-Exclusion. In: Proceedings of FOCS 2006, pp. 583–590 (2006)

    Google Scholar 

  17. Moon, J.W., Mose, L.: On Cliques in Graphs. Israel J. Mathematics 3, 23–28 (1965)

    Article  MATH  Google Scholar 

  18. Rahmann, S., Wittkop, T., Baumbach, J., Martin, M., Trub, A., Böcker, S.: Exact and Heuristic Algorithms for Weighted Cluster Editing. In: Proceedings of Comput. Syst. Bioinformatics Conference 2007, vol. 6(1), pp. 391–401 (2007)

    Google Scholar 

  19. Raman, V., Saurabh, S., Sikdar, S.: Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques. Theory Comput. Syst. 41(3), 1432–4350 (2007)

    Article  MathSciNet  Google Scholar 

  20. Reed, B.A., Smith, K., Vetta, A.: Finding odd cycle transversals. Oper. Res. Lett. 32(4), 299–301 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  21. Robson, J.M.: Algorithms for maximum independent sets. J. Algorithms 7, 425–440 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  22. Tarjan, R., Trojanowski, A.: Finding a maximum independent set. SIAM J. Computing 6(3), 537–546 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  23. Wahlstrom, M.: Algorithms, measures and upper bounds for satisfiability and related problems, PhD thesis, Linkoping University, Sweden (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, University of Bergen, N-5020, Bergen, Norway

    Fedor V. Fomin, Serge Gaspers & Saket Saurabh

  2. Laboratoire d’Informatique Théorique et Appliquée, Université Paul Verlaine - Metz, 57045, Metz Cedex 01, France

    Dieter Kratsch & Mathieu Liedloff

Authors
  1. Fedor V. Fomin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Serge Gaspers
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dieter Kratsch
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mathieu Liedloff
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Saket Saurabh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Edward Ochmański Jerzy Tyszkiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fomin, F.V., Gaspers, S., Kratsch, D., Liedloff, M., Saurabh, S. (2008). Iterative Compression and Exact Algorithms. In: Ochmański, E., Tyszkiewicz, J. (eds) Mathematical Foundations of Computer Science 2008. MFCS 2008. Lecture Notes in Computer Science, vol 5162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85238-4_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85238-4_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85237-7

  • Online ISBN: 978-3-540-85238-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation