280 search results - page 1 / 56 » Distributed Approximation Algorithms for Planar Graphs |
CIAC
2006
Springer
13 years 10 months ago
2006
Springer
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 approximat...
STOC
2010
ACM
13 years 11 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
FOCS
2005
IEEE
14 years 16 days ago
2005
IEEE
In joint work with ´Eva Tardos in 1995, we asked whether it was possible to obtain a polynomial-time, polylogarithmic approximation algorithm for the disjoint paths problem in th...
NIPS
2007
13 years 8 months ago
2007
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
COMPGEOM
2009
ACM
14 years 1 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...