{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T16:17:19Z","timestamp":1756311439161,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228943"},{"type":"electronic","value":"9783540278214"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27821-4_13","type":"book-chapter","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T18:54:06Z","timestamp":1284490446000},"page":"139-150","source":"Crossref","is-referenced-by-count":20,"title":["Cost-Sharing Mechanisms for Network Design"],"prefix":"10.1007","author":[{"given":"Anupam","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aravind","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c9va","family":"Tardos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rompel, J.: Randomness-efficient oblivious sampling. In: Proc. 35th FOCS, pp. 276\u2013287 (1994)","DOI":"10.1109\/SFCS.1994.365687"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Even, G., Goldreich, O., Luby, M., Nisan, N., Veli\u010dkovi\u0107, B.: Approximations of general independent distributions. In: Proc. 24th STOC, pp. 10\u201316 (1992)","DOI":"10.1145\/129712.129714"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Gupta, A., Kumar, A., Kleinberg, J., Rastogi, R., Yener, B.: Provisioning a Virtual Private Network: A network design problem for multicommodity flow. In: Proc. 33rd STOC, pp. 389\u2013398 (2001)","DOI":"10.1145\/380752.380830"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Gupta, A., Kumar, A., Roughgarden, T.: Simpler and better approximation algorithms for network design. In: 35th STOC, pp. 365\u2013372 (2003)","DOI":"10.1145\/780542.780597"},{"key":"13_CR5","unstructured":"Kent, K.J., Skorin-Kapov, D.: Population monotonic cost allocations on MSTs. In: Proceedings of the 6th International Conference on Operational Research, Rovinj, 1996 pp. 43\u201348 (1996)"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/PL00004200","volume":"18","author":"H. Moulin","year":"2001","unstructured":"Moulin, H., Shenker, S.: Strategyproof sharing of submodular costs: budget balance versus efficiency. Economic Theor.\u00a018, 511\u2013533 (2001)","journal-title":"Economic Theor."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Jain, K., Vazirani, V.: Applications of approximation algorithms to cooperative games. In: Proc. 33rd STOC, pp. 364\u2013372 (2001)","DOI":"10.1145\/380752.380825"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Karger, D.R., Minkoff, M.: Building Steiner trees with incomplete global knowledge. In: Proc. 41th FOCS, pp. 613\u2013623 (2000)","DOI":"10.1109\/SFCS.2000.892329"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"P\u00e1l, M., Tardos, \u00c9.: Group Strategyproof Mechanisms via Primal-Dual Algorithms. In: Proc. 44th FOCS, pp. 584\u2013593 (2003)","DOI":"10.1109\/SFCS.2003.1238231"},{"key":"13_CR10","unstructured":"Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: Proc. 11th SODA, pp. 770\u2013779 (2000)"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/S089548019223872X","volume":"8","author":"J.P. Schmidt","year":"1995","unstructured":"Schmidt, J.P., Siegel, A., Srinivasan, A.: Chernoff-Hoeffding bounds for applications with limited independence. SIAM J. Discrete Math.\u00a08, 223\u2013250 (1995)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27821-4_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T20:41:00Z","timestamp":1740516060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27821-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228943","9783540278214"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27821-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}