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

FOCS

2008

IEEE

2008

IEEE

We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applicable to a certain subclass of algorithms that compute a solution in a constant number of phases. The technique is based on greedily considering local improvements in random order. The problems amenable to our technique include Vertex Cover, Maximum Matching, Maximum Weight Matching, Set Cover, and Minimum Dominating Set. For example, for Maximum Matching, we give the ﬁrst constant-time algorithm that for the class of graphs of degree bounded by d, computes the maximum matching size to within εn, for any ε > 0, where n is the number of nodes in the graph. The running time of the algorithm is independent of n, and only depends on d and ε.

Related Content

Added |
29 May 2010 |

Updated |
29 May 2010 |

Type |
Conference |

Year |
2008 |

Where |
FOCS |

Authors |
Huy N. Nguyen, Krzysztof Onak |

Comments (0)