Minimum Eccentricity Shortest Path Problem: an Approximation Algorithm and Relation with the k-Laminarity Problem

Abstract : The Minimum Eccentricity Shortest Path (MESP) Problem consists in determining a shortest path (a path whose length is the distance between its extremities) of minimum eccentricity in a graph. It was introduced by Dragan and Leitert [9] who described a linear-time algorithm which is an 8-approximation of the problem. In this paper, we study deeper the double-BFS procedure used in that algorithm and extend it to obtain a linear-time 3-approximation algorithm. We moreover study the link between the MESP problem and the notion of laminarity, introduced by Völkel et al [12], corresponding to its restriction to a diameter (i.e. a shortest path of maximum length), and show tight bounds between MESP and laminarity parameters.
Liste complète des métadonnées

Cited literature [14 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01366782
Contributor : Etienne Birmele <>
Submitted on : Thursday, September 15, 2016 - 12:41:47 PM
Last modification on : Thursday, April 11, 2019 - 4:02:09 PM
Document(s) archivé(s) le : Friday, December 16, 2016 - 1:59:30 PM

Files

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01366782, version 1
  • ARXIV : 1609.04593

Collections

Citation

Etienne Birmelé, Fabien de Montgolfier, Léo Planche. Minimum Eccentricity Shortest Path Problem: an Approximation Algorithm and Relation with the k-Laminarity Problem. 2016. ⟨hal-01366782⟩

Share

Metrics

Record views

145

Files downloads

412