IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/vyid10.1007_s10878-020-00579-z.html
   My bibliography  Save this article

Exact algorithms for finding constrained minimum spanning trees

Author

Listed:
  • Pei Yao

    (Fuzhou University)

  • Longkun Guo

    (Fuzhou University
    Qilu University of Technology (Shandong Academy of Sciences)
    Shandong Computer Science Center, (National Supercomputer Center in Jinan))

Abstract

For a given undirected graph with each edge associated with a weight and a length, the constrained minimum spanning tree (CMST) problem aims to compute a minimum weight spanning tree with total length bounded by a given fixed integer $$L\in {\mathbb {Z}}^{+}$$L∈Z+. In the paper, we first present an exact algorithm with a runtime $$O(mn^{2})$$O(mn2) for CMST when the edge length is restricted to 0 and 1 based on combining the local search method and our developed bicameral edge replacement approach. Then we extend the algorithm to solve a more general case when the edge length is restricted to 0, 1 and 2 via iteratively improving a feasible solution of CMST towards an optimum solution. At last, numerical experiments are carried out to validate the practical performance of the proposed algorithms by comparing with previous algorithms as baselines.

Suggested Citation

  • Pei Yao & Longkun Guo, 0. "Exact algorithms for finding constrained minimum spanning trees," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-19.
    • Handle: RePEc:spr:jcomop:v::y::i::d:10.1007_s10878-020-00579-z
    DOI: 10.1007/s10878-020-00579-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-020-00579-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-020-00579-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:jcomop:v::y::i::d:10.1007_s10878-020-00579-z. 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.