Publications
Tight Lower Bounds for the Asymetric k-Center Problem.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC04).
(2004). Integrality Ratio for Group Steiner Trees and Directed Steiner Trees.
Proceedings of the Twelfth Symposium on Discrete Algorithms (SODA).
(2003). An Improved Approximation Algorithm for Vertex Cover with Hard Capacities.
Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP 2003). 164-175.
(2003). Asymmetric K-Center Is Log* N-Hard to Approximate.
Journal of the ACM. 52(4), 538-551.
(2005).