Article

On-Line Algorithms for Shortest Path Problems on Planar Digraphs

Author:

Hristo DjidjevAuthors Info & Claims

WG '96: Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science

Pages 151 - 165

Published: 12 June 1996 Publication History

Abstract

No abstract available.

Cited By

View all

Long YPettie SMarx D(2021)Planar distance oracles with better time-space tradeoffsProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458213(2517-2536)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458213
Charalampopoulos PMozes STebeka BChan T(2019)Exact distance oracles for planar graphs with failing verticesProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310562(2110-2123)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.5555/3310435.3310562
Charalampopoulos PGawrychowski PMozes SWeimann OCharikar MCohen E(2019)Almost optimal distance oracles for planar graphsProceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing10.1145/3313276.3316316(138-151)Online publication date: 23-Jun-2019
https://dl.acm.org/doi/10.1145/3313276.3316316
Show More Cited By

Index Terms

On-Line Algorithms for Shortest Path Problems on Planar Digraphs
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms
  2. Mathematical software
2. Theory of computation
  1. Design and analysis of algorithms

Index terms have been assigned to the content through auto-classification.

Recommendations

Complexity of some inverse shortest path lengths problems

The input to an inverse shortest path lengths problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not necessarily conform to the shortest path lengths in G. The goal is to modify ...
Improved algorithms for the k simple shortest paths and the replacement paths problems

Given a directed, non-negatively weighted graph G=(V,E) and s,t@?V, we consider two problems. In the k simple shortest paths problem, we want to find the k simple paths from s to t with the k smallest weights. In the replacement paths problem, we want ...
Efficient Shortest Path Simplex Algorithms

<P>We consider the specialization of the primal simplex algorithm to the problem of finding a tree of directed shortest paths from a given node to all other nodes in a network of n nodes or finding a directed cycle of negative length. Two efficient ...

Comments

Information & Contributors

Information

Published In

WG '96: Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science

June 1996

403 pages

ISBN:3540625593

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 12 June 1996

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

25
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Long YPettie SMarx D(2021)Planar distance oracles with better time-space tradeoffsProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458213(2517-2536)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458213
Charalampopoulos PMozes STebeka BChan T(2019)Exact distance oracles for planar graphs with failing verticesProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310562(2110-2123)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.5555/3310435.3310562
Charalampopoulos PGawrychowski PMozes SWeimann OCharikar MCohen E(2019)Almost optimal distance oracles for planar graphsProceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing10.1145/3313276.3316316(138-151)Online publication date: 23-Jun-2019
https://dl.acm.org/doi/10.1145/3313276.3316316
Abboud AGawrychowski PMozes SWeimann OCzumaj A(2018)Near-optimal compression for the planar graph metricProceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3174304.3175305(530-549)Online publication date: 7-Jan-2018
https://dl.acm.org/doi/10.5555/3174304.3175305
Gawrychowski PMozes SWeimann OWulff-Nilsen CCzumaj A(2018)Better tradeoffs for exact distance oracles in planar graphsProceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3174304.3175304(515-529)Online publication date: 7-Jan-2018
https://dl.acm.org/doi/10.5555/3174304.3175304
Aleksandrov LChapuis GDjidjev HSuzumura TGarcia-Gasulla DDayarathna M(2016)Parallel Shortest-Path Queries in Planar GraphsProceedings of the ACM Workshop on High Performance Graph Processing10.1145/2915516.2915518(9-16)Online publication date: 31-May-2016
https://dl.acm.org/doi/10.1145/2915516.2915518
Schild ASommer C(2015)On Balanced Separators in Road NetworksProceedings of the 14th International Symposium on Experimental Algorithms - Volume 912510.1007/978-3-319-20086-6_22(286-297)Online publication date: 29-Jun-2015
https://dl.acm.org/doi/10.1007/978-3-319-20086-6_22
Sommer C(2014)Shortest-path queries in static networksACM Computing Surveys10.1145/253053146:4(1-31)Online publication date: 1-Mar-2014
https://dl.acm.org/doi/10.1145/2530531
Kawarabayashi KSommer CThorup MKhanna S(2013)More compact oracles for approximate distances in undirected planar graphsProceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms10.5555/2627817.2627857(550-563)Online publication date: 6-Jan-2013
https://dl.acm.org/doi/10.5555/2627817.2627857
Kaplan HMozes SNussbaum YSharir M(2012)Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applicationsProceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms10.5555/2095116.2095147(338-355)Online publication date: 17-Jan-2012
https://dl.acm.org/doi/10.5555/2095116.2095147
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Complexity of some inverse shortest path lengths problems

Improved algorithms for the k simple shortest paths and the replacement paths problems

Efficient Shortest Path Simplex Algorithms

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations