Skip to main content
SpringerLink
Log in

Enumerate and Measure: Improving Parameter Budget Management

  • Conference paper
Parameterized and Exact Computation (IPEC 2010)

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

Included in the following conference series:

Abstract

Measure & Conquer (M&C) is the prominent technique for analyzing exact algorithms for computationally hard problems . It tries to balance worse and better situations within the algorithm analysis.

Several obstacles prevent the application of this technique in parameterized algorithmics, making it rarely applied in this area. However, these difficulties can be handled in some situations. We will exemplify this with two problems related to Vertex Cover, namely Connected Vertex Cover and Edge Dominating Set. For both problems, several parameterized algorithms have been published, all based on the idea of first enumerating minimal vertex covers and then producing solutions to the requested problem. Using M&C in this context will improve on the hitherto published running times, offering some unifying view. In contrast to some of the earlier suggested algorithms, ours will use polynomial space.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Chen, J., Kanj, I.A., Xia, G.: Labeled search trees and amortized analysis: improved upper bounds for NP-hard problems. Algorithmica 43, 245–273 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  2. Daligault, J., Gutin, G., Kim, E.J., Yeo, A.: FPT algorithms and kernels for the directed k-leaf problem. J. Comput. Syst. Sci. 76, 144–152 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  3. Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through colors and IDs. In: ICALP 2009, Part I. LNCS, vol. 5555, pp. 378–389. Springer, Heidelberg (2009)

    Google Scholar 

  4. Fernau, H.: Edge dominating set: efficient enumeration-based exact algorithms. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 142–153. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  5. Fernau, H., Gaspers, S., Raible, D.: Exact and parameterized algorithms for max internal spanning tree. In: Paul, C., Habib, M. (eds.) Graph-Theoretic Concepts in Computer Science. LNCS, vol. 5911, pp. 100–111. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Fernau, H., Manlove, D.F.: Vertex and edge covers with clustering properties: Complexity and algorithms. J. Disc. Alg. 7, 149–167 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  7. Fernau, H., Raible, D.: Exact algorithms for maximum acyclic subgraph on a superclass of cubic graphs. In: Nakano, S.-i., Rahman, M. S. (eds.) WALCOM 2008. LNCS, vol. 4921, pp. 144–156. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  8. Fomin, F.V., Gaspers, S., Saurabh, S., Stepanov, A.A.: On two techniques of combining branching and treewidth. Algorithmica 54, 181–207 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  9. Fomin, F.V., Grandoni, F., Kratsch, D.: A measure & conquer approach for the analysis of exact algorithms. J. ACM 56(5) (2009)

    Google Scholar 

  10. Fujito, T., Doi, T.: A 2-approximation NC algorithm for connected vertex cover and tree cover. Inform. Process Lett. 90, 59–63 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  11. Guo, J., Niedermeier, R., Wernicke, S.: Parameterized complexity of vertex cover variants. Theory Comput. Syst. 41, 501–520 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kneis, J., Langer, A., Rossmanith, P.: A new algorithm for finding trees with many leaves. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 270–281. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  13. Mölle, D., Richter, S., Rossmanith, P.: Enumerate and expand: Improved algorithms for connected vertex cover and tree cover. Theory Comput. Syst. 43, 234–253 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  14. Nederlof, J.: Fast polynomial-space algorithms using Möbius inversion: Improving on Steiner tree and related problems. In: ICALP 2009, Part I. LNCS, vol. 5555, pp. 713–725. Springer, Heidelberg (2009)

    Google Scholar 

  15. Prieto, E.: Systematic Kernelization in FPT Algorithm Design. PhD thesis, The University of Newcastle, Australia (2005)

    Google Scholar 

  16. Raible, D., Fernau, H.: An amortized search tree analysis for k -Leaf Spanning Tree. In: SOFSEM. LNCS, vol. 5901, pp. 672–684. Springer, Heidelberg (2010)

    Google Scholar 

  17. Raman, V., Saurabh, S., Sikdar, S.: Improved exact exponential algorithms for vertex bipartization and other problems. In: Coppo, M., Lodi, E., Pinna, G.M. (eds.) ICTCS 2005. LNCS, vol. 3701, pp. 375–389. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  18. van Rooij, J.M.M., Bodlaender, H.L.: Design by measure and conquer, a faster exact algorithm for dominating set. In: STACS, Schloss Dagstuhl — Leibniz-Zentrum für Informatik, Germany. LIPIcs, vol. 1, pp. 657–668 (2008)

    Google Scholar 

  19. van Rooij, J.M.M., Bodlaender, H.L.: Exact algorithms for edge domination. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol. 5018, pp. 214–225. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  20. Yannakakis, M., Gavril, F.: Edge dominating sets in graphs. SIAM J. Appl. Math. 38, 364–372 (1980)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FB 4—Abteilung Informatik, Univ.Trier, 54286, Trier, Germany

    Daniel Binkele-Raible & Henning Fernau

Authors
  1. Daniel Binkele-Raible
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Henning Fernau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The Institute of Mathematical Sciences, Chennai, India

    Venkatesh Raman

  2. The Institute of Mathematical Sciences, 600113, Chennai, India

    Saket Saurabh

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Binkele-Raible, D., Fernau, H. (2010). Enumerate and Measure: Improving Parameter Budget Management. In: Raman, V., Saurabh, S. (eds) Parameterized and Exact Computation. IPEC 2010. Lecture Notes in Computer Science, vol 6478. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17493-3_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17493-3_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17492-6

  • Online ISBN: 978-3-642-17493-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation