Shortest paths in directed planar graphs with negative lengths: A linear-space O(n log2 n)-time algorithm

Philip Klein; Shay Mozes; Oren Weimann

Shortest paths in directed planar graphs with negative lengths: A linear-space O(n log² n)-time algorithm

Philip Klein, Shay Mozes, Oren Weimann

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We give an O(n log² n)-time, linear-space algorithm that, given a directed planar graph with positive and negative arc-lengths, and given a node s, finds the distances from s to all nodes. The best previously known algorithm requires O(n log³ n) time and O(n log n) space.

Original language	English
Title of host publication	Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms
Pages	236-245
Number of pages	10
State	Published - 2009
Externally published	Yes
Event	20th Annual ACM-SIAM Symposium on Discrete Algorithms - New York, NY, United States Duration: 4 Jan 2009 → 6 Jan 2009

Publication series

Name	Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Conference

Conference	20th Annual ACM-SIAM Symposium on Discrete Algorithms
Country/Territory	United States
City	New York, NY
Period	4/01/09 → 6/01/09

ASJC Scopus subject areas

Software
General Mathematics

Cite this

@inproceedings{9b6d5fe44ed242fe92f4b7b0c7e0a2f8,

title = "Shortest paths in directed planar graphs with negative lengths: A linear-space O(n log2 n)-time algorithm",

abstract = "We give an O(n log2 n)-time, linear-space algorithm that, given a directed planar graph with positive and negative arc-lengths, and given a node s, finds the distances from s to all nodes. The best previously known algorithm requires O(n log3 n) time and O(n log n) space.",

author = "Philip Klein and Shay Mozes and Oren Weimann",

year = "2009",

language = "English",

isbn = "9780898716801",

series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

pages = "236--245",

booktitle = "Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms",

note = "20th Annual ACM-SIAM Symposium on Discrete Algorithms ; Conference date: 04-01-2009 Through 06-01-2009",

}

Klein, P, Mozes, S & Weimann, O 2009, Shortest paths in directed planar graphs with negative lengths: A linear-space O(n log² n)-time algorithm. in Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 236-245, 20th Annual ACM-SIAM Symposium on Discrete Algorithms, New York, NY, United States, 4/01/09.

Shortest paths in directed planar graphs with negative lengths: A linear-space O(n log² n)-time algorithm. / Klein, Philip; Mozes, Shay; Weimann, Oren.
Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms. 2009. p. 236-245 (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Shortest paths in directed planar graphs with negative lengths

T2 - 20th Annual ACM-SIAM Symposium on Discrete Algorithms

AU - Klein, Philip

AU - Mozes, Shay

AU - Weimann, Oren

PY - 2009

Y1 - 2009

N2 - We give an O(n log2 n)-time, linear-space algorithm that, given a directed planar graph with positive and negative arc-lengths, and given a node s, finds the distances from s to all nodes. The best previously known algorithm requires O(n log3 n) time and O(n log n) space.

AB - We give an O(n log2 n)-time, linear-space algorithm that, given a directed planar graph with positive and negative arc-lengths, and given a node s, finds the distances from s to all nodes. The best previously known algorithm requires O(n log3 n) time and O(n log n) space.

UR - http://www.scopus.com/inward/record.url?scp=70349140043&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:70349140043

SN - 9780898716801

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 236

EP - 245

BT - Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms

Y2 - 4 January 2009 through 6 January 2009

ER -