On the union of intermediate nodes of shortest paths

DOI10.1007/S10878-011-9436-9zbMATH Open1275.90117OpenAlexW1986192370MaRDI QIDQ358654FDOQ358654

Authors: Xiaodong Hu, Wonjun Lee, Xiang Li 

Publication date: 9 August 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-011-9436-9

Recommendations

• Finding the shortest paths by node combination
• Shortest paths in intersection graphs of unit disks
• Shortest path methods: A unifying approach
• On the structure of unique shortest paths in graphs
• The undirected two disjoint shortest paths problem
• scientific article; zbMATH DE number 1062626
• On short paths interdiction problems: Total and node-wise limited interdiction
• Unified all-pairs shortest path algorithms in the chordal hierarchy
• Approximability of unsplittable shortest path routing problems
• Approximating Shortest Paths in Graphs

zbMATH Keywords

Greedy approximationintersection of shortest paths

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• A Greedy Heuristic for the Set-Covering Problem
• Title not available (Why is that?)
• Efficient distributed algorithms for topology control problem with shortest path constraints

This page was built for publication: On the union of intermediate nodes of shortest paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q358654)