Author:
Bleischwitz Yvonne,Schoppmann Florian
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Agrawal, A., Klein, P., Ravi, R.: When trees collide: An approximation algorithm for the generalized steiner problem in networks. SIAM Journal on Computing 24(3), 445–456 (1995)
2. Lecture Notes in Computer Science;S. Chawla,2006
3. Devanur, N.R., Mihail, M., Vazirani, V.V.: Strategyproof cost-sharing mechanisms for set cover and facility location games. Decision Support Systems 39(1), 11–22 (2005)
4. Goemans, M., Bertsimas, D.: Survivable networks, linear programming relaxations and the parsimonious property. Mathematical Programming 60, 145–166 (1993)
5. Immorlica, N., Mahdian, M., Mirrokni, V.: Limitations of cross-monotonic cost sharing schemes. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 602–611 (2005)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献