Skip to main content
SpringerLink
Log in

On Multiway Cut Parameterized above Lower Bounds

  • Conference paper
Parameterized and Exact Computation (IPEC 2011)

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

Included in the following conference series:

Abstract

In this paper we consider two above lower bound parameterizations of the Node Multiway Cut problem — above the maximum separating cut and above a natural LP-relaxation — and prove them to be fixed-parameter tractable. Our results imply O *(4k) algorithms for Vertex Cover above Maximum Matching and Almost 2-SAT as well as an O *(2k) algorithm for Node Multiway Cut with a standard parameterization by the solution size, improving previous bounds for these problems.

The first two authors were partially supported by National Science Centre grant no. N206 567140 and Foundation for Polish Science.

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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. Bousquet, N., Daligault, J., Thomassé, S.: Multicut is FPT. In: Proc. of STOC 2011 (to appear, 2011)

    Google Scholar 

  2. Chen, J., Liu, Y., Lu, S.: An improved parameterized algorithm for the minimum node multiway cut problem. Algorithmica 55(1), 1–13 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chen, J., Liu, Y., Lu, S., O’Sullivan, B., Razgon, I.: A fixed-parameter algorithm for the directed feedback vertex set problem. In: Proc. of STOC 2008, pp. 177–186 (2008)

    Google Scholar 

  4. Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM J. Comput. 23(4), 864–894 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  5. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999), citeseer.ist.psu.edu/downey98parameterized.html

    Book  MATH  Google Scholar 

  6. Fellows, M.R., Hermelin, D., Rosamond, F.A., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410, 53–61 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  7. Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science, 1st edn. An EATCS Series. Springer, Heidelberg (2006), http://www.worldcat.org/isbn/3540299521

    MATH  Google Scholar 

  8. Garg, N., Vazirani, V.V., Yannakakis, M.: Multiway cuts in node weighted graphs. J. Algorithms 50(1), 49–61 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  9. Guillemot, S.: FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol. 5018, pp. 129–140. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  10. Gutin, G., van Iersel, L., Mnich, M., Yeo, A.: All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average have Kernels with Quadratic Numbers of Variables. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I, LNCS, vol. 6346, pp. 326–337. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  11. Gutin, G., Kim, E.J., Lampis, M., Mitsou, V.: Vertex cover problem parameterized above and below tight bounds. Theory Comput. Syst. 48(2), 402–410 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  12. Mahajan, M., Raman, V.: Parameterizing above guaranteed values: Maxsat and maxcut. J. Algorithms 31(2), 335–354 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  13. Marx, D.: Parameterized graph separation problems. Theor. Comput. Sci. 351(3), 394–406 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  14. Marx, D., Razgon, I.: Fixed-parameter tractability of multicut parameterized by the size of the cutset. In: Proc. of STOC 2011 (to appear, 2011)

    Google Scholar 

  15. Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press, USA (2006), http://www.worldcat.org/isbn/0198566077

    Book  MATH  Google Scholar 

  16. Raman, V., Ramanujan, M.S., Saurabh, S.: Paths, Flowers and Vertex Cover. In: Demetrescu, C., Halldórsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 382–393. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  17. Razgon, I.: Computing multiway cut within the given excess over the largest minimum isolating cut. CoRR abs/1011.6267 (2010)

    Google Scholar 

  18. Razgon, I.: Large isolating cuts shrink the multiway cut. CoRR abs/1104.5361 (2011)

    Google Scholar 

  19. Razgon, I., O’Sullivan, B.: Almost 2-SAT is fixed-parameter tractable. J. Comput. Syst. Sci. 75(8), 435–450 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  20. Xiao, M.: Simple and improved parameterized algorithms for multiterminal cuts. Theory Comput. Syst. 46(4), 723–736 (2010)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, University of Warsaw, Poland

    Marek Cygan, Marcin Pilipczuk & Michał Pilipczuk

  2. Google Inc., Cracow, Poland

    Jakub Onufry Wojtaszczyk

Authors
  1. Marek Cygan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marcin Pilipczuk
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michał Pilipczuk
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jakub Onufry Wojtaszczyk
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. MTA SZTAKI, Lágymányosi u. 11, 1111, Budapest, Hungary

    Dániel Marx

  2. Lehrgebiet Theoretische Informatik, RWTH Aachen, Ahornstraße 55, 52056, Aachen, Germany

    Peter Rossmanith

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cygan, M., Pilipczuk, M., Pilipczuk, M., Wojtaszczyk, J.O. (2012). On Multiway Cut Parameterized above Lower Bounds. In: Marx, D., Rossmanith, P. (eds) Parameterized and Exact Computation. IPEC 2011. Lecture Notes in Computer Science, vol 7112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28050-4_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28050-4_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28049-8

  • Online ISBN: 978-3-642-28050-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation