Skip to main content
SpringerLink
Log in

Randomized Contraction

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 47 Accesses

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Chen J, Liu Y, Lu S (2009) An improved parameterized algorithm for the minimum node multiway cut problem. Algorithmica 55(1):1–13. doi:10.1007/s00453-007-9130-6

    Article  MathSciNet  MATH  Google Scholar 

  2. Chitnis RH, Cygan M, Hajiaghayi M, Pilipczuk M, Pilipczuk M (2012) Designing FPT algorithms for cut problems using randomized contractions. In: 53rd annual IEEE symposium on foundations of computer science (FOCS 2012), New Brunswick, 20–23 Oct 2012. IEEE Computer Society, pp 460–469. doi:10.1109/FOCS.2012.29

    Google Scholar 

  3. Cygan M, Pilipczuk M, Pilipczuk M, Wojtaszczyk JO (2013) On multiway cut parameterized above lower bounds. TOCT 5(1):3. doi:10.1145/2462896.2462899

    Article  MathSciNet  MATH  Google Scholar 

  4. Kawarabayashi K, Thorup M (2011) The minimum k-way cut of bounded size is fixed-parameter tractable. In: Ostrovsky R (ed) IEEE 52nd annual symposium on foundations of computer science (FOCS 2011), Palm Springs, 22–25 Oct 2011. IEEE Computer Society, pp 160–169. doi:10.1109/FOCS.2011.53

    Google Scholar 

  5. Marx D (2006) Parameterized graph separation problems. Theor Comput Sci 351(3):394–406. doi:10.1016/j.tcs.2005.10.007

    Article  MathSciNet  MATH  Google Scholar 

  6. Naor M, Schulman LJ, Srinivasan A (1995) Splitters and near-optimal derandomization. In: 36th annual symposium on foundations of computer science, Milwaukee, 23–25 Oct 1995. IEEE Computer Society, pp 182–191. doi:10.1109/SFCS.1995. 492475

    Google Scholar 

  7. Wahlström M (2014) Half-integrality, LP-branching and FPT algorithms. In: Chekuri C (ed) Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete algorithms (SODA 2014), Portland, 5–7 Jan 2014. SIAM, pp 1762–1781. doi:10.1137/1.9781611973402.128

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, University of Warsaw, Warsaw, Poland

    Marek Cygan

Authors
  1. Marek Cygan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marek Cygan .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Cygan, M. (2016). Randomized Contraction. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_764

Download citation

Publish with us

Policies and ethics

Search

Navigation