Publications
Polylogarithmic Inapproximability.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC).
(2003).
(2002).
Integrality Ratio for Group Steiner Trees and Directed Steiner Trees.
Proceedings of the Twelfth Symposium on Discrete Algorithms (SODA).
(2003). Detecting Protein Sequences via Metric Embeddings.
Proceedings of the 11th International Conference on Intelligent Systems for Molecular Biology (ISMB). 122-129.
(2003). Asymmetric K-Center Is Log* N-Hard to Approximate.
Journal of the ACM. 52(4), 538-551.
(2005).