On the union of intermediate nodes of shortest paths

Xiang Li, Xiaodong Hu and Wonjun Lee ()
Additional contact information
Xiang Li: Chinese Academy of Sciences
Xiaodong Hu: Chinese Academy of Sciences
Wonjun Lee: Korea University

Journal of Combinatorial Optimization, 2013, vol. 26, issue 1, No 6, 82-85

Abstract: Abstract Consider a connected graph G=(V,E). For a pair of nodes u and v, denote by M uv the set of intermediate nodes of a shortest path between u and v. We are intertested in minimization of the union ⋃ u,v∈V M uv . We will show that this problem is NP-hard and cannot have polynomial-time ρlnδ-approximation for 0

Keywords: Intersection of shortest paths; Greedy approximation (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-011-9436-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:26:y:2013:i:1:d:10.1007_s10878-011-9436-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-011-9436-9

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().