A minimum length covering subgraph of a network

DOI10.1007/BF02097806zbMath0707.90059OpenAlexW2030399290MaRDI QIDQ920001

Timothy J. Lowe, James E. Ward, Tae Ung Kim, Richard L. Francis

Publication date: 1989

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02097806

zbMATH Keywords

shortest pathtransport systemconnected networkNP- hardcentral facility

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Related Items (6)

Comments on: ``Extensive facility location problems on networks: an updated review ⋮ Approximating the tree and tour covers of a graph ⋮ A review of extensive facility location in networks ⋮ Efficient solution methods for covering tree problems ⋮ Unnamed Item ⋮ A unifying location model on tree graphs based on submodularity property

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• The maximum covering/shortest path problem: A multiobjective network design and routing formulation
• The hierarchical network design problem
• The location of central structures in trees
• The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
• The optimal location of a path or tree in a tree network
• Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
• Optimal Minimax Path of a Single Service Unit on a Network to Nonservice Destinations
• The 1-Center Problem: Exploiting Block Structure

This page was built for publication: A minimum length covering subgraph of a network