1. Archer, A.: Inapproximability of the asymmetric facility location and k-median problems (2000), http://www2.research.att.com/~aarcher/Research/asym-hard.ps
2. Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for k-median and facility location problems. SIAM J. Comput. 33(3), 544–562 (2004)
3. Asadpour, A., Goemans, M.X., Mądry, A., Oveis Gharan, S., Saberi, A.: An O(logn/loglogn)-approximation algorithm for the asymmetric traveling salesman problem. In: SODA 2010: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 379–389 (2010)
4. Chekuri, C., Vondrák, J., Zenklusen, R.: Dependent randomized rounding for matroid polytopes and applications. CoRR abs/0909.4348 (2009), http://arxiv.org/abs/0909.4348
5. Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Tech. Rep. 388, Graduate School of Industrial Administration, CMU (1976)