IDEAS home Printed from https://ideas.repec.org/p/hal/wpaper/hal-00242975.html
   My bibliography  Save this paper

A linear programming approach to increasing the weight of all minimum spanning trees

Author

Listed:
  • Mourad Baïou

    (CECO - Laboratoire d'économétrie de l'École polytechnique - X - École polytechnique - CNRS - Centre National de la Recherche Scientifique)

  • Fancisco Barahona

    (CECO - Laboratoire d'économétrie de l'École polytechnique - X - École polytechnique - CNRS - Centre National de la Recherche Scientifique)

Abstract

Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so that the value of all minimum spanning trees is equal to some target value. We formulate this as a combinatorial linear program and give an algorithm.

Suggested Citation

  • Mourad Baïou & Fancisco Barahona, 2005. "A linear programming approach to increasing the weight of all minimum spanning trees," Working Papers hal-00242975, HAL.
    • Handle: RePEc:hal:wpaper:hal-00242975
    Note: View the original document on HAL open archive server: https://hal.science/hal-00242975
    as

    Download full text from publisher

    File URL: https://hal.science/hal-00242975/document
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Francisco Barahona, 1995. "Packing Spanning Trees," Mathematics of Operations Research, INFORMS, vol. 20(1), pages 104-115, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jerome Galtier, 2018. "Fast approximation of matroid packing and covering," Annals of Operations Research, Springer, vol. 271(2), pages 575-598, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jain, Kamal & Vazirani, Vijay V., 2010. "Eisenberg-Gale markets: Algorithms and game-theoretic properties," Games and Economic Behavior, Elsevier, vol. 70(1), pages 84-106, September.

    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:hal:wpaper:hal-00242975. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.