Skip to main content
SpringerLink
Log in

Improved Fixed-Parameter Algorithms for Two Feedback Set Problems

  • Conference paper
Algorithms and Data Structures (WADS 2005)

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

Included in the following conference series:

Abstract

Settling a ten years open question, we show that the NP-complete Feedback Vertex Set problem is deterministically solvable in O(c k · m) time, where m denotes the number of graph edges, k denotes the size of the feedback vertex set searched for, and c is a constant. As a second result, we present a fixed-parameter algorithm for the NP-complete Edge Bipartization problem with runtime O(2k · m 2).

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. Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM Journal on Discrete Mathematics 3(2), 289–297 (1999)

    Article  MathSciNet  Google Scholar 

  2. Bar-Yehuda, R., Geiger, D., Naor, J., Roth, R.M.: Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference. SIAM Journal on Computing 27(4), 942–959 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  3. Becker, A., Bar-Yehuda, R., Geiger, D.: Randomized algorithms for the Loop Cutset problem. Journal of Artificial Intelligence Research 12, 219–234 (2000)

    MATH  MathSciNet  Google Scholar 

  4. Bodlaender, H.L.: On disjoint cycles. International Journal of Foundations of Computer Science 5, 59–68 (1994)

    Article  MATH  Google Scholar 

  5. Dehne, F., Fellows, M., Langston, M., Rosamond, F., Stevens, K.: An \(\mathcal O^*(2^{O(k)})\) FPT algorithm for the undirected feedback vertex set problem. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 859–869. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness. Congressus Numerantium 87, 161–187 (1992)

    MathSciNet  Google Scholar 

  7. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)

    Google Scholar 

  8. Fellows, M.R.: New directions and new challenges in algorithm design and complexity, parameterized. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 505–520. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  9. Festa, P., Pardalos, P.M., Resende, M.G.C.: Feedback set problems. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, vol. A, pp. 209–258. Kluwer, Dordrecht (1999)

    Google Scholar 

  10. Fiorini, S., Hardy, N., Reed, B., Vetta, A.: Planar graph bipartization in linear time. In: Proc. 2nd GRACO. Electronic Notes in Discrete Mathematics (2005)

    Google Scholar 

  11. Garg, N., Vazirani, V.V., Yannakakis, M.: Approximate max-flow min-(multi)cut theorems and their applications. SIAM Journal on Computing 25(2), 235–251 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  12. Hüffner, F.: Algorithm engineering for optimal graph bipartization. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 240–252. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  13. Kahng, A.B., Vaya, S., Zelikovsky, A.: New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout. In: Proc. Asia and South Pacific Design Automation Conference, pp. 133–138 (2001)

    Google Scholar 

  14. Kanj, I., Pelsmajer, M., Schaefer, M.: Parameterized algorithms for feedback vertex set. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 235–247. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  15. Lund, C., Yannakakis, M.: The approximation of maximum subgraph problems. In: Lingas, A., Carlsson, S., Karlsson, R. (eds.) ICALP 1993. LNCS, vol. 700, pp. 40–51. Springer, Heidelberg (1993)

    Google Scholar 

  16. Niedermeier, R.: Ubiquitous parameterization—invitation to fixed-parameter algorithms. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 84–103. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  17. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2005) (forthcoming)

    Google Scholar 

  18. Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43, 425–440 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  19. Pop, M., Kosack, D.S., Salzberg, S.L.: Hierarchical scaffolding with Bambus. Genome Research 14, 149–159 (2004)

    Article  Google Scholar 

  20. Raman, V., Saurabh, S., Subramanian, C.R.: Faster fixed parameter tractable algorithms for undirected feedback vertex set. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 241–248. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  21. Raman, V., Saurabh, S., Subramanian, C.R.: Faster algorithms for feedback vertex set. In: Proc. 2nd GRACO. Electronic Notes in Discrete Mathematics (2005)

    Google Scholar 

  22. Reed, B., Smith, K., Vetta, A.: Finding odd cycle transversals. Operations Research Letters 32, 299–301 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  23. Wernicke, S.: On the algorithmic tractability of single nucleotide polymorphism (SNP) analysis and related problems. Diplomarbeit, WSI für Informatik, Universität Tübingen (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Friedrich-Schiller-Universität Jena, Ernst-Abbe-Platz 2, D-07743, Jena, Germany

    Jiong Guo, Falk Hüffner, Rolf Niedermeier & Sebastian Wernicke

  2. Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 13, D-72076, Tübingen, Germany

    Jens Gramm

Authors
  1. Jiong Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jens Gramm
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Falk Hüffner
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Rolf Niedermeier
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Sebastian Wernicke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Carleton University, Ottawa, Canada

    Frank Dehne

  2. Cheriton School of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ont., Canada

    Alejandro López-Ortiz

  3. School of Computer Science, Carleton University, 1125 Colonel By Drive, K1S 5B6, Ottawa, Canada

    Jörg-Rüdiger Sack

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guo, J., Gramm, J., Hüffner, F., Niedermeier, R., Wernicke, S. (2005). Improved Fixed-Parameter Algorithms for Two Feedback Set Problems. In: Dehne, F., López-Ortiz, A., Sack, JR. (eds) Algorithms and Data Structures. WADS 2005. Lecture Notes in Computer Science, vol 3608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11534273_15

Download citation

  • DOI: https://doi.org/10.1007/11534273_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28101-6

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation