{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T19:35:11Z","timestamp":1760297711967,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681380"},{"type":"electronic","value":"9783540681410"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11944874_11","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T18:41:09Z","timestamp":1164652869000},"page":"112-123","source":"Crossref","is-referenced-by-count":14,"title":["Optimal Cost-Sharing Mechanisms for Steiner Forest Problems"],"prefix":"10.1007","author":[{"given":"Shuchi","family":"Chawla","sequence":"first","affiliation":[]},{"given":"Tim","family":"Roughgarden","sequence":"additional","affiliation":[]},{"given":"Mukund","family":"Sundararajan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"11_CR1","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1137\/S0097539792236237","volume":"24","author":"A. Agrawal","year":"1995","unstructured":"Agrawal, A., Klein, P., Ravi, R.: When trees collide: an approximation algorithm for the generalized Steiner problem on networks. SIAM Journal on Computing\u00a024(3), 440\u2013456 (1995)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/S0899-8256(03)00176-3","volume":"47","author":"A. Archer","year":"2004","unstructured":"Archer, A., Feigenbaum, J., Krishnamurthy, A., Sami, R., Shenker, S.: Approximation and collusion in multicast cost sharing. Games and Economic Behavior\u00a047(1), 36\u201371 (2004)","journal-title":"Games and Economic Behavior"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Bartal, Y.: Probabilistic approximations of metric spaces and its algorithmic applications. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS), pp. 184\u2013193 (1996)","DOI":"10.1109\/SFCS.1996.548477"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: Proceedings of the 35th Annual ACM Symposium on the Theory of Computing (STOC) (2003)","DOI":"10.1145\/780542.780608"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0304-3975(03)00085-9","volume":"304","author":"J. Feigenbaum","year":"2003","unstructured":"Feigenbaum, J., Krishnamurthy, A., Sami, R., Shenker, S.: Hardness results for multicast cost sharing. Theoretical Computer Science\u00a0304, 215\u2013236 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1006\/jcss.2001.1754","volume":"63","author":"J. Feigenbaum","year":"2001","unstructured":"Feigenbaum, J., Papadimitriou, C., Shenker, S.: Sharing the cost of multicast transmissions. Journal of Computer and System Sciences\u00a063(1), 21\u201341 (2001)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM Journal on Computing\u00a024(2), 296\u2013317 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0047-2727(76)90049-9","volume":"6","author":"J. Green","year":"1976","unstructured":"Green, J., Kohlberg, E., Laffont, J.J.: Partial equilibrium approach to the free rider problem. Journal of Public Economics\u00a06, 375\u2013394 (1976)","journal-title":"Journal of Public Economics"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-540-27821-4_13","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"A. Gupta","year":"2004","unstructured":"Gupta, A., Srinivasan, A., Tardos, \u00c9.: Cost-sharing mechanisms for network design. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 139\u2013150. Springer, Heidelberg (2004)"},{"key":"11_CR10","unstructured":"Immorlica, N., Mahdian, M., Mirrokni, V.S.: Limitations of cross-monotonic cost-sharing schemes. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 602\u2013611 (2005)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Jain, K., Vazirani, V.: Applications of approximation algorithms to cooperative games. In: Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing (STOC), pp. 364\u2013372 (2001)","DOI":"10.1145\/380752.380825"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Jain, K., Vazirani, V.: Equitable cost allocations via primal-dual-type algorithms. In: Proceedings of the 34th Annual ACM Symposium on the Theory of Computing (STOC), pp. 313\u2013321 (2002)","DOI":"10.1145\/509907.509956"},{"key":"11_CR13","unstructured":"Kent, K., Skorin-Kapov, D.: Population monotonic cost allocation on mst\u2019s. In: Operational Research Proceedings KOI, pp. 43\u201348 (1996)"},{"key":"11_CR14","unstructured":"K\u00f6nemann, J., Leonardi, S., Sch\u00e4fer, G.: A group-strategyproof mechanism for Steiner forests. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 612\u2013619 (2005)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1007\/11523468_85","volume-title":"Automata, Languages and Programming","author":"J. K\u00f6nemann","year":"2005","unstructured":"K\u00f6nemann, J., Leonardi, S., Sch\u00e4fer, G., van Zwam, S.: From primal-dual to cost shares and back: A stronger LP relaxation for the steiner forest problem. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1051\u20131063. Springer, Heidelberg (2005)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Leonardi, S., Sch\u00e4fer, G.: Cross-monotonic cost-sharing methods for connected facility location. In: Proceedings of the Fifth ACM Conference on Electronic Commerce (EC), pp. 242\u2013243 (2004)","DOI":"10.1145\/988772.988814"},{"key":"11_CR17","volume-title":"Microeconomic Theory","author":"A. Mas-Colell","year":"1995","unstructured":"Mas-Colell, A., Whinston, M.D., Green, J.R.: Microeconomic Theory. Oxford University Press, Oxford (1995)"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s003550050145","volume":"16","author":"H. Moulin","year":"1999","unstructured":"Moulin, H.: Incremental cost sharing: Characterization by coalition strategy-proofness. Social Choice and Welfare\u00a016, 279\u2013320 (1999)","journal-title":"Social Choice and Welfare"},{"key":"11_CR19","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 Theory\u00a018, 511\u2013533 (2001)","journal-title":"Economic Theory"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"P\u00e1l, M., Tardos, \u00c9.: Group strategyproof mechanisms via primal-dual algorithms. In: Proceedings of the 44th Annual Symposium on Foundations of Computer Science (FOCS), pp. 584\u2013593 (2003)","DOI":"10.1109\/SFCS.2003.1238231"},{"key":"11_CR21","volume-title":"Aggregation and Revelation of Preferences","author":"K. Roberts","year":"1979","unstructured":"Roberts, K.: The characterization of implementable choice rules. In: Laffont, J.J. (ed.) Aggregation and Revelation of Preferences. North-Holland, Amsterdam (1979)"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Sundararajan, M.: Approximately efficient cost-sharing mechanisms (submitted, 2006)","DOI":"10.1145\/1132516.1132528"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Sundararajan, M.: New trade-offs in cost-sharing mechanisms. In: Proceedings of the 38th Annual ACM Symposium on the Theory of Computing (STOC), pp. 79\u201388 (2006)","DOI":"10.1145\/1132516.1132528"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11944874_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T04:50:02Z","timestamp":1736657402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11944874_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540681380","9783540681410"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11944874_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}