{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:28:19Z","timestamp":1737437299015,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755197"},{"type":"electronic","value":"9783540755203"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-75520-3_45","type":"book-chapter","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T03:46:33Z","timestamp":1189741593000},"page":"498-509","source":"Crossref","is-referenced-by-count":1,"title":["Pricing Tree Access Networks with Connected Backbones"],"prefix":"10.1007","author":[{"given":"Vineet","family":"Goyal","sequence":"first","affiliation":[]},{"given":"Anupam","family":"Gupta","sequence":"additional","affiliation":[]},{"given":"Stefano","family":"Leonardi","sequence":"additional","affiliation":[]},{"given":"R.","family":"Ravi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"45_CR1","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"},{"issue":"3","key":"45_CR2","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 (Preliminary version in 23rd STOC, 1991). SIAM J. Comput.\u00a024(3), 440\u2013456 (1995)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"45_CR3","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s00453-002-0968-3","volume":"34","author":"M. Andrews","year":"2002","unstructured":"Andrews, M., Zhang, L.: Approximation algorithms for access network design (Preliminary version in 39th FOCS, 1998). Algorithmica\u00a034(2), 197\u2013215 (2002)","journal-title":"Algorithmica"},{"key":"45_CR4","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":"45_CR5","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.H., Shenker, S.: Sharing the cost of multicast transmissions (Special issue on internet algorithms). J. Comput. System Sci.\u00a063(1), 21\u201341 (2001)","journal-title":"J. Comput. System Sci."},{"key":"45_CR6","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1145\/380752.380830","volume-title":"STOC","author":"A. Gupta","year":"2001","unstructured":"Gupta, A., Kumar, A., Kleinberg, J., Rastogi, R., Yener, B.: Provisioning a Virtual Private Network: A network design problem for multicommodity flow. In: STOC. Proceedings of the 33rd ACM Symposium on the Theory of Computing, pp. 389\u2013398. ACM Press, New York (2001)"},{"key":"45_CR7","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":"45_CR8","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1145\/780542.780597","volume-title":"STOC","author":"A. Gupta","year":"2003","unstructured":"Gupta, A., Kumar, A., Roughgarden, T.: Simpler and better approximation algorithms for network design. In: STOC. Proceedings of the 35th ACM Symposium on the Theory of Computing, pp. 365\u2013372. ACM Press, New York (2003)"},{"key":"45_CR9","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1145\/1007352.1007419","volume-title":"STOC","author":"A. Gupta","year":"2004","unstructured":"Gupta, A., P\u00e1l, M., Ravi, R., Sinha, A.: Boosted sampling: Approximation algorithms for stochastic optimization problems. In: STOC. Proceedings of the 36th ACM Symposium on the Theory of Computing, pp. 417\u2013426. ACM Press, New York (2004)"},{"key":"45_CR10","doi-asserted-by":"crossref","unstructured":"Gupta, A., Ravi, R., Sinha, A.: An edge in time saves nine: LP rounding approximation algorithms for stochastic network design. In: Proceedings of the 45th Symposium on the Foundations of Computer Science (FOCS), pp. 218\u2013227 (2004)","DOI":"10.1109\/FOCS.2004.11"},{"key":"45_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"45_CR12","first-page":"933","volume-title":"SODA","author":"A. Hayrapetyan","year":"2005","unstructured":"Hayrapetyan, A., Swamy, C., Tardos, \u00c9.: Network design for information networks. In: SODA. Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms, pp. 933\u2013942. ACM Press, New York (2005)"},{"key":"45_CR13","first-page":"684","volume-title":"SODA","author":"N. Immorlica","year":"2004","unstructured":"Immorlica, N., Karger, D., Minkoff, M., Mirrokni, V.: On the costs and benefits of procrastination: Approximation algorithms for stochastic combinatorial optimization problems. In: SODA. Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms, pp. 684\u2013693. ACM Press, New York (2004)"},{"key":"45_CR14","first-page":"602","volume-title":"Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"N. Immorlica","year":"2005","unstructured":"Immorlica, N., Mahdian, M., Mirrokni, V.S.: Limitations of cross-monotonic cost sharing schemes. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 602\u2013611. ACM Press, New York (2005)"},{"key":"45_CR15","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/380752.380825","volume-title":"STOC","author":"K. Jain","year":"2001","unstructured":"Jain, K., Vazirani, V.: Applications of approximation algorithms to cooperative games. In: STOC. Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, pp. 364\u2013372. ACM Press, New York (2001)"},{"key":"45_CR16","first-page":"612","volume-title":"Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"J. K\u00f6nemann","year":"2005","unstructured":"K\u00f6nemann, J., Leonardi, S., Sch\u00e4fer, G.: A group-strategyproof mechanism for Steiner forests. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 612\u2013619. ACM Press, New York (2005)"},{"key":"45_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1007\/11523468_75","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. 930\u2013942. Springer, Heidelberg (2005)"},{"key":"45_CR18","doi-asserted-by":"crossref","unstructured":"Karger, D.R., Minkoff, M.: Building Steiner trees with incomplete global knowledge. In: Proceedings of the 41th Symposium on the Foundations of Computer Science (FOCS), pp. 613\u2013623 (2000)","DOI":"10.1109\/SFCS.2000.892329"},{"key":"45_CR19","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). Croatian Oper. Res. Soc., Zagreb, pp. 43\u201348 (1996)"},{"issue":"1-3","key":"45_CR20","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/j.tcs.2004.07.033","volume":"326","author":"S. Leonardi","year":"2004","unstructured":"Leonardi, S., Sch\u00e4fer, G.: Cross-monotonic cost sharing methods for connected facility location games. Theor. Comput. Sci.\u00a0326(1-3), 431\u2013442 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"45_CR21","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"},{"issue":"3","key":"45_CR22","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. Econom. Theory\u00a018(3), 511\u2013533 (2001)","journal-title":"Econom. Theory"},{"key":"45_CR23","doi-asserted-by":"crossref","unstructured":"P\u00e1l, M., Tardos, \u00c9.: Group strategyproof mechanisms via primal-dual algorithms. In: Proceedings of the 44th Symposium on the Foundations of Computer Science (FOCS), pp. 584\u2013593 (2003)","DOI":"10.1109\/SFCS.2003.1238231"},{"key":"45_CR24","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":"45_CR25","unstructured":"Roughgarden, T., Sundararajan, M.: Approximately efficient cost-sharing mechanisms. (Unpublished manuscript)"},{"key":"45_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/3-540-48481-7_4","volume-title":"Algorithms - ESA\u201999","author":"R. Ravi","year":"1999","unstructured":"Ravi, R., Salman, F.S.: Approximation algorithms for the traveling purchaser problem and its variants in network design. In: Ne\u0161et\u0159il, J. (ed.) ESA 1999. LNCS, vol.\u00a01643, pp. 29\u201340. Springer, Heidelberg (1999)"},{"key":"45_CR27","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Sundararajan, M.: New trade-offs in cost-sharing mechanisms. In: STOC (2006)","DOI":"10.1145\/1132516.1132528"},{"issue":"4","key":"45_CR28","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s00453-004-1112-3","volume":"40","author":"C. Swamy","year":"2004","unstructured":"Swamy, C., Kumar, A.: Primal-dual algorithms for connected facility location problems. Algorithmica\u00a040(4), 245\u2013269 (2004)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75520-3_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T00:01:28Z","timestamp":1737417688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75520-3_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540755197","9783540755203"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75520-3_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}