On the Minimum Eccentricity Shortest Path Problem
DOI10.1007/978-3-319-21840-3_23zbMath1373.68265OpenAlexW2400528205MaRDI QIDQ3449826
Arne Leitert, Feodor F. Dragan
Publication date: 30 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-21840-3_23
Analysis of algorithms and problem complexity (68Q25) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)
Related Items (9)
Cites Work
- Unnamed Item
- An exact algorithm for minimum distortion embedding
- Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
- Hardness and approximation of minimum distortion embeddings
- HAMILTONian circuits in chordal bipartite graphs
- Domination and total domination on asteroidal triple-free graphs
- Minimum Eccentricity Shortest Paths in Some Structured Graph Classes
- Line-Distortion, Bandwidth and Path-Length of a Graph
- Low-distortion embeddings of general metrics into the line
- Distortion Is Fixed Parameter Tractable
- Linear time algorithms for dominating pairs in asteroidal triple-free graphs
- Diametral path graphs
This page was built for publication: On the Minimum Eccentricity Shortest Path Problem
