Publications

Found 6 results
Author Title Type [ Year(Desc)]
Filters: Author is Robert Krauthgamer  [Clear All Filters]
2002
Kortsarz, G., Krauthgamer R., & Lee J. R. (2002).  Hardness of Approximation for Vertex-Connectivity Network Design Problems.
Krauthgamer, R., & Lee J. R. (2002).  The Intrinsic Dimensionality of Graphs.
2003
Halperin, E., Buhler J., Karp R. M., Krauthgamer R., & Westover B. P. (2003).  Detecting Protein Sequences via Metric Embeddings. Proceedings of the 11th International Conference on Intelligent Systems for Molecular Biology (ISMB). 122-129.
Halperin, E., Kortsarz G., Krauthgamer R., Srinivasan A., & Wang N.. (2003).  Integrality Ratio for Group Steiner Trees and Directed Steiner Trees. Proceedings of the Twelfth Symposium on Discrete Algorithms (SODA).
Halperin, E., & Krauthgamer R. (2003).  Polylogarithmic Inapproximability. Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC).
2005
Chuzhoy, J., Guha S., Halperin E., Khanna S., Kortsarz G., Krauthgamer R., et al. (2005).  Asymmetric K-Center Is Log* N-Hard to Approximate. Journal of the ACM. 52(4), 538-551.