99 search results - page 1 / 20 » Distance Approximation in Bounded-Degree and General Sparse ... |
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
ECCC
2000
13 years 4 months ago
2000
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
STOC
2007
ACM
14 years 5 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
EJC
2008
13 years 5 months ago
2008
We study restricted homomorphism dualities in the context of classes with bounded expansion. This presents a generalization of restricted dualities obtained earlier for bounded deg...