Approximating the diameter of planar graphs in near linear time

Oren Weimann; Raphael Yuster

doi:10.1007/978-3-642-39206-1_70

Approximating the diameter of planar graphs in near linear time

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

Abstract

We present a (1 + ε)-approximation algorithm running in O(f(ε)·n log⁴ n) time for finding the diameter of an undirected planar graph with n vertices and with non-negative edge lengths.

Original language	English
Title of host publication	Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings
Pages	828-839
Number of pages	12
Edition	PART 1
DOIs	https://doi.org/10.1007/978-3-642-39206-1_70
State	Published - 2013
Event	40th International Colloquium on Automata, Languages, and Programming, ICALP 2013 - Riga, Latvia Duration: 8 Jul 2013 → 12 Jul 2013

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 1
Volume	7965 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	40th International Colloquium on Automata, Languages, and Programming, ICALP 2013
Country/Territory	Latvia
City	Riga
Period	8/07/13 → 12/07/13

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-39206-1_70

Cite this

Weimann, O., & Yuster, R. (2013). Approximating the diameter of planar graphs in near linear time. In Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings (PART 1 ed., pp. 828-839). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7965 LNCS, No. PART 1). https://doi.org/10.1007/978-3-642-39206-1_70

@inproceedings{69cc8bf7a9e84c8a8dc4e9cb4e700460,

title = "Approximating the diameter of planar graphs in near linear time",

abstract = "We present a (1 + ε)-approximation algorithm running in O(f(ε)·n log4 n) time for finding the diameter of an undirected planar graph with n vertices and with non-negative edge lengths.",

author = "Oren Weimann and Raphael Yuster",

year = "2013",

doi = "10.1007/978-3-642-39206-1_70",

language = "English",

isbn = "9783642392054",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

number = "PART 1",

pages = "828--839",

booktitle = "Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings",

edition = "PART 1",

note = "40th International Colloquium on Automata, Languages, and Programming, ICALP 2013 ; Conference date: 08-07-2013 Through 12-07-2013",

}

Weimann, O & Yuster, R 2013, Approximating the diameter of planar graphs in near linear time. in Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings. PART 1 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 1, vol. 7965 LNCS, pp. 828-839, 40th International Colloquium on Automata, Languages, and Programming, ICALP 2013, Riga, Latvia, 8/07/13. https://doi.org/10.1007/978-3-642-39206-1_70

Approximating the diameter of planar graphs in near linear time. / Weimann, Oren ; Yuster, Raphael.
Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings. PART 1. ed. 2013. p. 828-839 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7965 LNCS, No. PART 1).

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

TY - GEN

T1 - Approximating the diameter of planar graphs in near linear time

AU - Weimann, Oren

AU - Yuster, Raphael

PY - 2013

Y1 - 2013

N2 - We present a (1 + ε)-approximation algorithm running in O(f(ε)·n log4 n) time for finding the diameter of an undirected planar graph with n vertices and with non-negative edge lengths.

AB - We present a (1 + ε)-approximation algorithm running in O(f(ε)·n log4 n) time for finding the diameter of an undirected planar graph with n vertices and with non-negative edge lengths.

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

U2 - 10.1007/978-3-642-39206-1_70

DO - 10.1007/978-3-642-39206-1_70

M3 - Conference contribution

AN - SCOPUS:84880268178

SN - 9783642392054

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 828

EP - 839

BT - Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings

T2 - 40th International Colloquium on Automata, Languages, and Programming, ICALP 2013

Y2 - 8 July 2013 through 12 July 2013

ER -

Weimann O , Yuster R. Approximating the diameter of planar graphs in near linear time. In Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings. PART 1 ed. 2013. p. 828-839. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1). doi: 10.1007/978-3-642-39206-1_70

Approximating the diameter of planar graphs in near linear time

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this