✦ LIBER ✦

An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs

✍ Scribed by Kawarabayashi, Ken-Ichi; Kobayashi, Yusuke

Book ID: 120635969
Publisher: Association for Computing Machinery
Year: 2013
Tongue: English
Weight: 557 KB
Volume: 9
Category: Article
ISSN: 1549-6325
DOI: 10.1145/2438645.2438648

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simple linear algorithm for the edge-d

A simple linear algorithm for the edge-disjoint (s, t)-paths problem in undirected planar graphs

✍ Laurent Coupry 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 400 KB

Let G = (v!E) be an undirected planar graph, and s, 1 E V, s # f. We present a linear algorithm to compute a set of edge-disjoint (s, t)-paths of maximum cardinality in G. In other words, the problem is to find a maximum unit flow from s to r in a non-weighted graph. The main purpose is not to show

A linear time algorithm for the induced

A linear time algorithm for the induced disjoint paths problem in planar graphs

✍ Ken-ichi Kawarabayashi; Yusuke Kobayashi 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 259 KB

An approximation algorithm for the maxim

An approximation algorithm for the maximum independent set problem in cubic planar graphs

✍ Elarbi Choukhmane; John Franco 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 289 KB 👁 1 views

[ACM Press the 43rd annual ACM symposium

[ACM Press the 43rd annual ACM symposium - San Jose, California, USA (2011.06.06-2011.06.08)] Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11 - Breaking o(n 1/2 )-approximation algorithms for the edge-disjoint paths problem with congestion two

✍ Kawarabayashi, Ken-ichi; Kobayashi, Yusuke 📂 Article 📅 2011 🏛 ACM Press ⚖ 422 KB