IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-540-76796-1_9.html
   My bibliography  Save this book chapter

Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems

In: Research Trends in Combinatorial Optimization

Author

Listed:
  • Stefan Hougardy

    (University of Bonn, Research Institute for Discrete Mathematics)

Abstract

Summary Many real-world problems require graphs of such large size that polynomial time algorithms are too costly as soon as their runtime is superlinear. Examples include problems in VLSI-design or problems in bioinformatics. For such problems the question arises: What is the best solution that can be obtained in linear time? We survey linear time approximation algorithms for some classical problems from combinatorial optimization, e.g. matchings and branchings.

Suggested Citation

  • Stefan Hougardy, 2009. "Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems," Springer Books, in: William Cook & László Lovász & Jens Vygen (ed.), Research Trends in Combinatorial Optimization, chapter 9, pages 185-200, Springer.
    • Handle: RePEc:spr:sprchp:978-3-540-76796-1_9
    DOI: 10.1007/978-3-540-76796-1_9
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-540-76796-1_9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.