Publications

Found 5 results
Author Title Type [ Year(Asc)]
Filters: Author is Guy Kortsarz  [Clear All Filters]
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.
2004
Chuzhoy, J., Guha S., Halperin E., Khanna S., Kortsarz G., & Naor S.. (2004).  Tight Lower Bounds for the Asymetric k-Center Problem. Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC04).
2003
Gandhi, R., Halperin E., Khuller S., Kortsarz G., & Srinivasan A. (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.
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).
2002
Kortsarz, G., Krauthgamer R., & Lee J. R. (2002).  Hardness of Approximation for Vertex-Connectivity Network Design Problems.