IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v39y2020i2d10.1007_s10878-019-00490-2.html
   My bibliography  Save this article

Degree bounded bottleneck spanning trees in three dimensions

Author

Listed:
  • Patrick J. Andersen

    (The University of Melbourne)

  • Charl J. Ras

    (The University of Melbourne)

Abstract

The geometric $$\delta $$δ-minimum spanning tree problem ($$\delta $$δ-MST) is the problem of finding a minimum spanning tree for a set of points in a normed vector space, such that no vertex in the tree has a degree which exceeds $$\delta $$δ, and the sum of the lengths of the edges in the tree is minimum. The similarly defined geometric $$\delta $$δ-minimum bottleneck spanning tree problem ($$\delta $$δ-MBST), is the problem of finding a degree bounded spanning tree such that the length of the longest edge is minimum. For point sets that lie in the Euclidean plane, both of these problems have been shown to be NP-hard for certain specific values of $$\delta $$δ. In this paper, we investigate the $$\delta $$δ-MBST problem in 3-dimensional Euclidean space and 3-dimensional rectilinear space. We show that the problems are NP-hard for certain values of $$\delta $$δ, and we provide inapproximability results for these cases. We also describe new approximation algorithms for solving these 3-dimensional variants, and then analyse their worst-case performance.

Suggested Citation

  • Patrick J. Andersen & Charl J. Ras, 2020. "Degree bounded bottleneck spanning trees in three dimensions," Journal of Combinatorial Optimization, Springer, vol. 39(2), pages 457-491, February.
    • Handle: RePEc:spr:jcomop:v:39:y:2020:i:2:d:10.1007_s10878-019-00490-2
    DOI: 10.1007/s10878-019-00490-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-019-00490-2
    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-019-00490-2?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.

    References listed on IDEAS

    as
    1. O. Berman & D. Einav & G. Handler, 1990. "The Constrained Bottleneck Problem in Networks," Operations Research, INFORMS, vol. 38(1), pages 178-181, February.
    2. Abraham P. Punnen & K. P. K. Nair, 1996. "An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 8(1), pages 41-44, February.
    Full references (including those not matched with items on IDEAS)

    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. Lara Turner & Abraham Punnen & Yash Aneja & Horst Hamacher, 2011. "On generalized balanced optimization problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 73(1), pages 19-27, February.
    2. Arora, Shalini & Puri, M. C., 1998. "A variant of time minimizing assignment problem," European Journal of Operational Research, Elsevier, vol. 110(2), pages 314-325, October.
    3. Abraham P. Punnen & Ruonan Zhang, 2011. "Quadratic bottleneck problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(2), pages 153-164, March.
    4. de Lima Pinto, Leizer & Bornstein, Cláudio Thomás & Maculan, Nelson, 2009. "The tricriterion shortest path problem with at least two bottleneck objective functions," European Journal of Operational Research, Elsevier, vol. 198(2), pages 387-391, October.
    5. Y. Wang & H. Yan & C. Sriskandarajah, 1996. "The weighted sum of split and diameter clustering," Journal of Classification, Springer;The Classification Society, vol. 13(2), pages 231-248, September.

    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:39:y:2020:i:2:d:10.1007_s10878-019-00490-2. 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: 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.