Publications
Asymmetric K-Center Is Log* N-Hard to Approximate.
Journal of the ACM. 52(4), 538-551.
(2005). Tight Lower Bounds for the Asymetric k-Center Problem.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC04).
(2004).