IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v25y2025i2d10.1007_s11067-024-09645-z.html
   My bibliography  Save this article

Node Coincidence in Metric Minimum Weighted Length Graph Embeddings

Author

Listed:
  • Frank Plastria

    (Vrije Universiteit Brussel)

Abstract

The minisum multifacility location problem is viewed as finding an embedding of a graph in a metric space under additional constraints such as a number of fixed vertex locations, minimising the sum of weighted lengths of all edges. We show that certain nontrivial minimal cuts in the graph are sets of nodes that will necessarily coincide at any or at some optimal solution, irrespective of the fixed locations and the metric. This new property strongly generalises all coincidence conditions known in literature. In fact we show that it is best possible for coincidence with a fixed vertex at any position in arbitrary metric spaces. For coincidence among free vertices a different property of graph symmetry is also sufficient, and we conjecture its best possibility in conjunction with the minimal cut condition. All such instance-independent coincidences (both in at least one and in all optimal solutions) may be determined efficiently.

Suggested Citation

  • Frank Plastria, 2025. "Node Coincidence in Metric Minimum Weighted Length Graph Embeddings," Networks and Spatial Economics, Springer, vol. 25(2), pages 533-565, June.
    • Handle: RePEc:kap:netspa:v:25:y:2025:i:2:d:10.1007_s11067-024-09645-z
    DOI: 10.1007/s11067-024-09645-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11067-024-09645-z
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11067-024-09645-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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:kap:netspa:v:25:y:2025:i:2:d:10.1007_s11067-024-09645-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.