Author:
Chrobak Marek,Kenyon Claire,Noga John,Young Neal E.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference30 articles.
1. Archer, A., Rajagopalan, R., Shmoys, D.B.: Lagrangian relaxation for the k-median problem: new insights and continuity properties. In: Proc. 11th European Symp. on Algorithms (ESA), pp. 31–42 (2003)
2. Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristic for k-median and facility location problems. In: Proc. 33rd Symp. Theory of Computing (STOC), pp. 21–29. ACM, New York (2001)
3. 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)
4. Buchbinder, N., Naor, J.: Improved bounds for online routing and packing via a primal-dual approach. In: Proc. 46th Symp. Foundations of Computer Science (FOCS), pp. 293–304 (2006)
5. Chakrabarti, S., Phillips, C.A., Schulz, A.S., Shmoys, D.B., Stein, C., Wein, J.: Improved scheduling algorithms for minsum criteria. In: Automata, Languages and Programming, pp. 646–657 (1996)
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献