Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Algorithms pp 1175–1177Cite as

LP Based Parameterized Algorithms

  • Reference work entry
  • First Online:

  • 65 Accesses

Years and Authors of Summarized Original Work

  • 2013; Cygan, Pilipczuk, Pilipczuk, Wojtaszczyk

  • 2014; Lokshtanov, Narayanaswamy, Raman, Ramanujan, Saurabh

  • 2014; Wahlstrom

Problem Definition

Linear and integer programs have played a crucial role in the theory of approximation algorithms for combinatorial optimization problems. While they have also been central in identifying polynomial time solvable problems, it is only recently that these tools have been put to use in designing exact algorithms for NP-complete problems. Following the paradigm of above-guarantee parameterization in fixed-parameter tractability, these efforts have focused on designing algorithms where the exponential component of the running time depends only on the excess of the solution above the optimum value of a linear program for the problem.

Method Description

The linear program obtained from a given integer linear program (ILP) by relaxing the integrality conditions on the variables is called the standard relaxation...

This is a preview of subscription content, 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

Learn about institutional subscriptions

Recommended Reading

  1. Akiba T, Iwata Y (2015) Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover. In: Proceedings of the seventeenth workshop on algorithm engineering and experiments, ALENEX 2015, San Diego, 5 Jan 2015, pp 70–81

    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, pp 460–469

    Google Scholar 

  3. Cygan M, Pilipczuk M, Pilipczuk M (2012) On group feedback vertex set parameterized by the size of the cutset. In: Graph-theoretic concepts in computer science – 38th international workshop, WG 2012, Jerusalem, 26–28 June 2012, revised selected papers, pp 194–205

    Google Scholar 

  4. Cygan M, Pilipczuk M, Pilipczuk M, Wojtaszczyk JO (2013) On multiway cut parameterized above lower bounds. Trans Comput Theory 5(1):3

    MathSciNet  MATH  Google Scholar 

  5. Guillemot S (2011) FPT algorithms for path-transversal and cycle-transversal problems. Discret Optim 8(1):61–71

    Article  MathSciNet  MATH  Google Scholar 

  6. Hochbaum DS (2002) Solving integer programs over monotone inequalities in three variables: a framework for half integrality and good approximations. Eur J Oper Res 140(2):291–321

    Article  MathSciNet  MATH  Google Scholar 

  7. Iwata Y, Oka K, Yoshida Y (2014) Linear-time FPT algorithms via network flow. In: Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete algorithms, SODA 2014, Portland, 5–7 Jan 2014, pp 1749–1761

    Google Scholar 

  8. Lokshtanov D, Narayanaswamy NS, Raman V, Ramanujan MS, Saurabh S (2014) Faster parameterized algorithms using linear programming. ACM Trans Algorithms 11(2):15

    Article  MathSciNet  Google Scholar 

  9. Narayanaswamy NS, Raman V, Ramanujan MS, Saurabh S (2012) LP can be a cure for parameterized problems. In: 29th international symposium on theoretical aspects of computer science, STACS 2012, Paris, 29th Feb – 3rd Mar 2012, pp 338–349

    Google Scholar 

  10. Nemhauser GL, Trotter LE (1974) Properties of vertex packing and independence system polyhedra. Math Program 6:48–61

    Article  MathSciNet  MATH  Google Scholar 

  11. Nemhauser GL, Trotter LE (1975) Vertex packings: structural properties and algorithms. Math Program 8:232–248

    Article  MathSciNet  MATH  Google Scholar 

  12. Reed BA, Smith K, Vetta A (2004) Finding odd cycle transversals. Oper Res Lett 32(4):299–301

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, University of Bergen, Bergen, Norway

    M. S. Ramanujan

Authors
  1. M. S. Ramanujan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. S. Ramanujan .

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

Ramanujan, M.S. (2016). LP Based Parameterized Algorithms. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_778

Download citation

Publish with us

Policies and ethics

Search

Navigation