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

Approximation Algorithms for Finding a Maximum-Weight Spanning Connected Subgraph with given Vertex Degrees

In: Operations Research Proceedings 2004

Author

Listed:
  • Alexey E. Baburin

    (Sobolev Institute of Mathematics)

  • Edward Kh. Gimadi

    (Sobolev Institute of Mathematics)

Abstract

In the paper a problem of finding a maximum-weight spanning connected subgraph with given vertex degrees is considered. The problem is MAX SNP-hard, because it is a generalization of a well-known Traveling Salesman Problem. Approximation algorithms are constructed for deterministic and random instances. Performance bounds of these algorithms are presented.

Suggested Citation

  • Alexey E. Baburin & Edward Kh. Gimadi, 2005. "Approximation Algorithms for Finding a Maximum-Weight Spanning Connected Subgraph with given Vertex Degrees," Operations Research Proceedings, in: Hein Fleuren & Dick Hertog & Peter Kort (ed.), Operations Research Proceedings 2004, pages 343-351, Springer.
    • Handle: RePEc:spr:oprchp:978-3-540-27679-1_43
    DOI: 10.1007/3-540-27679-3_43
    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 search for a similarly titled item that would be available.

    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:oprchp:978-3-540-27679-1_43. 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.