Skip to main content
SpringerLink
Log in

On Parameterized Enumeration

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2387))

Included in the following conference series:

Abstract

We study several versions of parameterized enumeration. The idea is always to have an algorithm which outputs all solutions (in a certain sense) to a given problem instance. Such an algorithm will be analysed from the viewpoint of parameterized complexity. We show how to apply enumeration techniques in a number of examples. In particular, we give a fixed parameter algorithm for the reconfiguration of faulty chips when providing so-called shared and linked spares.

Most of the work was done while the author was with Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 13, D-72076 Tübingen, Germany.

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. J. Alber, H. L. Bodlaender, H. Fernau, and R. Niedermeier. Fixed parameter algorithms for planar dominating set and related problems. In M. M. Halldórsson, editor, 7th Scandinavian Workshop on Algorithm Theory SWAT 2000, volume 1851 of LNCS, pages 97–110, 2000. Long version to appear in Algorithmica.

    Chapter  Google Scholar 

  2. J. Alber, H. Fernau, and R. Niedermeier. Parameterized complexity: exponential speedup for planar graph problems. In F. Orejas, P. G. Spirakis, and J. v. Leeuwen, editors, International Colloquium on Automata, Languages and Programming ICALP’01, volume 2076 of LNCS, pages 261–272. Springer, 2001.

    Chapter  Google Scholar 

  3. H. L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209:1–45, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  4. J. Chen and I. A. Kanj. On constrained minimum vertex covers of bipartite graphs: Improved algorithms. In A. Brandstädt and V. B. Le, editors, Graph-Theoretic Concepts in Computer Science WG’01, volume 2204 of LNCS, pages 55–65. Springer, 2001.

    Chapter  Google Scholar 

  5. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.

    Google Scholar 

  6. H. Fernau. On parameterized enumeration. Technical Report WSI-2001-21, Universität Tübingen (Germany), Wilhelm-Schickard-Institut für Informatik, 2001.

    Google Scholar 

  7. H. Fernau. Parameterized maximization. Technical Report WSI-2001-22, Universität Tübingen (Germany), Wilhelm-Schickard-Institut für Informatik, 2001.

    Google Scholar 

  8. H. Fernau and R. Niedermeier. An efficient exact algorithm for constraint bipartite vertex cover. Journal of Algorithms, 38(2):374–410, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  9. M. K. Goldberg, T. H. Spencer, and D. A. Berque. A low-exponential algorithm for counting vertex covers. Graph Theory, Combinatorics, Algorithms, and Applications, 1:431–444, 1995.

    MathSciNet  Google Scholar 

  10. J. Gramm and R. Niedermeier. Quartet inconsistency is fixed parameter tractable. In A. Amir and G. M. Landau, editors, Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching (CPM 2001), volume 2089 of LNCS, pages 241–256. Springer, 2001.

    Google Scholar 

  11. R. W. Haddad, A. T. Dahbura, and A. B. Sharma. Increased throughput for the testing and repair of RAMs with redundancy. IEEE Transactions on Computers, 40(2):154–166, Feb. 1991.

    Google Scholar 

  12. S.-Y. Kuo and W. Fuchs. Efficient spare allocation for reconfigurable arrays. IEEE Design and Test, 4:24–31, Feb. 1987.

    Google Scholar 

  13. K. Mehlhorn. Graph algorithms and NP-completeness. Heidelberg: Springer, 1984.

    MATH  Google Scholar 

  14. S. Nakano. Efficient generation of triconnected plane triangulations. In J. Wang, editor, Computing and Combinatorics, Proceedings COCOON 2001, volume 2108 of LNCS, pages 131–141. Springer, 2001.

    Google Scholar 

  15. R. Niedermeier and P. Rossmanith. Upper bounds for vertex cover further improved. In C. Meinel and S. Tison, editors, Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science (STACS’99), volume 1563 of LNCS, pages 561–570. Springer, 1999.

    Google Scholar 

  16. N. Nishimura, P. Ragde, and D. M. Thilikos. Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover. In F. Dehne, J.-R. Sack, and R. Tamassia, editors, Proc. 7th Workshop Algorithms and Data Structures WADS, volume 2125 of LNCS, pages 75–86. Springer, 2001.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of CS and EE, University of Newcastle, University Drive, NSW, 2308, Callaghan, Australia

    Henning Fernau

Authors
  1. Henning Fernau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara, California, 93106, USA

    Oscar H. Ibarra

  2. Department of Mathematics, National University of Singapore, Singapore, Singapore, 117543

    Louxin Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fernau, H. (2002). On Parameterized Enumeration. In: Ibarra, O.H., Zhang, L. (eds) Computing and Combinatorics. COCOON 2002. Lecture Notes in Computer Science, vol 2387. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45655-4_60

Download citation

  • DOI: https://doi.org/10.1007/3-540-45655-4_60

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45655-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation