Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CIAC
2006
Springer

favoriteEmaildiscussreport

100views Algorithms» more CIAC 2006»

Distributed Approximation Algorithms for Planar Graphs

13 years 8 months ago

Distributed Approximation Algorithms for Planar Graphs

Download math.la.asu.edu

In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximation ratio in both cases approaches one with n tending to infinity and the number of synchronous communication rounds is poly-logarithmic in n. Our algorithms are purely deterministic.

Andrzej Czygrinow, Michal Hanckowiak, Edyta Szyman

Real-time Traffic

Algorithms | CIAC 2006 | Distributed Algorithms | Minimum Dominating Set | Synchronous Communication Rounds |

claim paper

Related Content

» Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth

» An Approximation Algorithm for the Disjoint Paths Problem in EvenDegree Planar Graphs

» Local Algorithms for Approximate Inference in MinorExcluded Graphs

» Randomly removing g handles at once

» Fast and Compact Oracles for Approximate Distances in Planar Graphs

» A polynomialtime approximation scheme for planar multiway cut

» Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems

» Edgedisjoint paths in Planar graphs with constant congestion

» Minimum Dominating Set Approximation in Graphs of Bounded Arboricity

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2006
Where	CIAC
Authors	Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska

Comments (0)