Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and k-median (1998)
| Venue: | In Proceedings of the 30th Annual ACM Symposium on Theory of Computing |
| Citations: | 53 - 7 self |
BibTeX
@INPROCEEDINGS{Charikar98roundingvia,
author = {Moses Charikar and Chandra Chekuri and Ashish Goel and Sudipto Guha},
title = {Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and k-median},
booktitle = {In Proceedings of the 30th Annual ACM Symposium on Theory of Computing},
year = {1998},
pages = {114--123}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Most optimization problems on an undirected graph reduce in complexity when restricted to instances on a tree. A recent result [3] for probabilistically approximating graph metrics by trees such that no edge stretches (in an expected sense) by more than a factor of O(log 2 n) has resulted in several approximation algorithms which exploit the ease of solving problems on trees. The tree construction in [3] is inherently randomized and a natural question to ask is whether approximation algorithms which use this construction can be derandomized. We present a general framework for derandomizing approximation algorithms which use the above tree construction as a primitive. Let \Pi be a graph optimization problem which can be expressed as an integer program with 0-1 variables ¯ x(e) for each edge and with an objective function expressible as...
