Skip to main content
Springer Nature Link
Log in

Solving Multicut Faster Than 2n

  • Conference paper
Algorithms - ESA 2014 (ESA 2014)

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

Included in the following conference series:

  • 2288 Accesses

Abstract

In the Multicut problem, we are given an undirected graph G = (V,E) and a family \(\mathcal{T} = \{({s_i}{t_i}) \mid s_i, t_i \in V\}\) of pairs of requests and the objective is to find a minimum sized set S ⊆ V such that every connected component of G ∖ S contains at most one of s i and t i for any pair \(({s_i}{t_i})\in \mathcal{T}\). In this paper we give the first non-trivial algorithm for Multicut running in time  \(\mathcal{O}(1.987^n)\).

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Bousquet, N., Daligault, J., Thomassé, S.: Multicut is FPT. In: Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing, STOC 2011, pp. 459–468. ACM, New York (2011), http://doi.acm.org/10.1145/1993636.1993698

    Google Scholar 

  2. Cǎlinescu, G., Fernandes, C.G., Reed, B.: Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. Journal of Algorithms 48(2), 333–359 (2003), http://www.sciencedirect.com/science/article/pii/S0196677403000737

  3. Chawla, S., Krauthgamer, R., Kumar, R., Rabani, Y., Sivakumar, D.: On the hardness of approximating multicut and sparsest-cut. Computational Complexity 15(2), 94–114 (2006), http://dx.doi.org/10.1007/s00037-006-0210-9

    Article  MATH  MathSciNet  Google Scholar 

  4. Chen, J., Liu, Y., Lu, S., O’Sullivan, B., Razgon, I.: A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM 55(5) (2008)

    Google Scholar 

  5. Chitnis, R., Fomin, F., Lokshtanov, D., Misra, P., Ramanujan, M., Saurabh, S.: Faster exact algorithms for some terminal set problems. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 150–162. Springer, Heidelberg (2013), http://dx.doi.org/10.1007/978-3-319-03898-8_14

    Chapter  Google Scholar 

  6. Chitnis, R.H., Hajiaghayi, M., Marx, D.: Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset. In: Rabani, Y. (ed.) SODA, pp. 1713–1725. SIAM (2012)

    Google Scholar 

  7. Cygan, M., Pilipczuk, M., Pilipczuk, M., Wojtaszczyk, J.O.: On multiway cut parameterized above lower bounds. In: Marx, D., Rossmanith, P. (eds.) IPEC 2011. LNCS, vol. 7112, pp. 1–12. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  8. 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  MATH  MathSciNet  Google Scholar 

  9. Fomin, F.V., Grandoni, F., Kratsch, D.: A measure & conquer approach for the analysis of exact algorithms. J. ACM 56(5), 25:1–25:32 (2009), http://doi.acm.org/10.1145/1552285.1552286

  10. Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2010)

    Book  Google Scholar 

  11. Fomin, F., Heggernes, P., Kratsch, D., Papadopoulos, C., Villanger, Y.: Enumerating minimal subset feedback vertex sets. Algorithmica 69(1), 216–231 (2014), http://dx.doi.org/10.1007/s00453-012-9731-6

    Article  MathSciNet  Google Scholar 

  12. Garg, N., Vazirani, V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18(1), 3–20 (1997), http://dx.doi.org/10.1007/BF02523685

    Article  MATH  MathSciNet  Google Scholar 

  13. Iwata, Y.: A faster algorithm for dominating set analyzed by the potential method. In: Marx, D., Rossmanith, P. (eds.) IPEC 2011. LNCS, vol. 7112, pp. 41–54. Springer, Heidelberg (2012), http://dx.doi.org/10.1007/978-3-642-28050-4_4

    Chapter  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  15. Marx, D., Razgon, I.: Fixed-parameter tractability of multicut parameterized by the size of the cutset. In: STOC, pp. 469–478 (2011)

    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., O’Sullivan, B.: Almost 2-sat is fixed-parameter tractable. J. Comput. Syst. Sci. 75(8), 435–450 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  18. Robson, J.: Algorithms for maximum independent sets. Journal of Algorithms 7(3), 425–440 (1986), http://www.sciencedirect.com/science/article/pii/0196677486900325

    Article  MATH  MathSciNet  Google Scholar 

  19. Xiao, M., Nagamochi, H.: An improved exact algorithm for undirected feedback vertex set. In: Widmayer, P., Xu, Y., Zhu, B. (eds.) COCOA 2013. LNCS, vol. 8287, pp. 153–164. Springer, Heidelberg (2013), http://dx.doi.org/10.1007/978-3-319-03780-6_14

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Bergen, Norway

    Daniel Lokshtanov & Saket Saurabh

  2. Institute of Mathematical Sciences, Chennai, India

    Saket Saurabh

  3. Faculty of Information Technology, Czech Technical University in Prague, Czech Republic

    Ondřej Suchý

Authors
  1. Daniel Lokshtanov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Saket Saurabh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ondřej Suchý
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Massachusetts Institute of Technology, Cambridge, MA, USA

    Andreas S. Schulz

  2. Karlsruhe Institute of Technology (KIT), Kaiserstruhe 12, 76131, Karlsruhe, Germany

    Dorothea Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lokshtanov, D., Saurabh, S., Suchý, O. (2014). Solving Multicut Faster Than 2n . In: Schulz, A.S., Wagner, D. (eds) Algorithms - ESA 2014. ESA 2014. Lecture Notes in Computer Science, vol 8737. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44777-2_55

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-44777-2_55

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-44776-5

  • Online ISBN: 978-3-662-44777-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation