IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v6y2025i1d10.1007_s43069-025-00416-1.html
   My bibliography  Save this article

Length-Minimizing LED Trees

Author

Listed:
  • Mariana Sarkociová Remešíková

    (Slovak University of Technology in Bratislava)

  • Peter Sarkoci

    (Slovak University of Technology in Bratislava)

  • Mária Trnovská

    (Physics and Informatics)

Abstract

In this paper, we introduce a previously not studied type of Euclidean tree called LED (Leaves of Equal Depth) tree. LED trees can be used, for example, in computational phylogeny, since they are a natural representative of the time evolution of a set of species in a feature space. This work is focused on LED trees that are length minimizers for a given set of leaves and a given isomorphism type. The underlying minimization problem can be seen as a variant of the classical Euclidean Steiner tree problem. Even though it has a convex objective function, it is rather non-trivial, since it has a non-convex feasible set. The main contribution of this paper is that we prove the uniqueness of a stationary point of the length function on the feasible set. Moreover, we prove several geometrical characteristics of the length minimizers that are analogous to the properties of Steiner minimal trees. We also explore some geometrical and topological properties of the feasible set. At the end, to demonstrate the applicability of our theoretical results, we show an example of an application in historical linguistics.

Suggested Citation

  • Mariana Sarkociová Remešíková & Peter Sarkoci & Mária Trnovská, 2025. "Length-Minimizing LED Trees," SN Operations Research Forum, Springer, vol. 6(1), pages 1-38, March.
    • Handle: RePEc:spr:snopef:v:6:y:2025:i:1:d:10.1007_s43069-025-00416-1
    DOI: 10.1007/s43069-025-00416-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-025-00416-1
    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/s43069-025-00416-1?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:snopef:v:6:y:2025:i:1:d:10.1007_s43069-025-00416-1. 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.