{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:33:43Z","timestamp":1725564823516},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540222309"},{"type":"electronic","value":"9783540277965"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27796-5_23","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T21:47:42Z","timestamp":1283723262000},"page":"255-266","source":"Crossref","is-referenced-by-count":10,"title":["Sharing the Cost of Multicast Transmissions in Wireless Networks"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Penna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carmine","family":"Ventre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-540-24749-4_37","volume-title":"STACS 2004","author":"C. Ambuehl","year":"2004","unstructured":"Ambuehl, C., Clementi, A., Di Ianni, M., Lev-Tov, N., Monti, A., Peleg, D., Rossi, G., Silvestri, R.: Efficient algorithms for low-energy bounded-hop broadcast in adhoc wireless networks. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 418\u2013427. Springer, Heidelberg (2004)"},{"key":"23_CR2","unstructured":"Ambuehl, C., Clementi, A., Penna, P., Rossi, G., Silvestri, R.: Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. In: Proc. of SIROCCO, pp. 1\u201316 (2003)"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Anderegg, L., Eidenbenz, S.: Ad hoc-VCG: A Truthful and Cost-Efficient Routing Protocol for Mobile Ad Hoc Networks with Selfish Agents. In: Proc. of ACM MOBICOM, pp. 245\u2013259 (2003)","DOI":"10.1145\/938985.939011"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Bil\u00f3, V., Di Francescomarino, C., Flammini, M., Melideo, G.: Sharing the Cost of Multicast Transmissions in Wireless Networks. In: Proc. of SPAA (June 2004)","DOI":"10.1145\/1007912.1007940"},{"key":"23_CR5","first-page":"71","volume-title":"Proc. of IFIP-TCS","author":"D.M. Blough","year":"2002","unstructured":"Blough, D.M., Leoncini, M., Resta, G., Santi, P.: On the symmetric range assignment problem in wireless ad hoc networks. In: Proc. of IFIP-TCS, vol.\u00a0223, pp. 71\u201382. Kluwer, Dordrecht (2002)"},{"key":"23_CR6","first-page":"119","volume-title":"Proc. of IFIP-TCS","author":"G. Calinescu","year":"2002","unstructured":"Calinescu, G., Mandoiu, I.I., Zelikovsky, A.: Symmetric connectivity with minimum power consumption in radio networks. In: Proc. of IFIP-TCS, vol.\u00a0223, pp. 119\u2013130. Kluwer, Dordrecht (2002)"},{"key":"23_CR7","unstructured":"Chawla, S., Kitchin, D., Rajan, U., Ravi, R., Sinha, A.: Profit maximization mechanisms for the extended multicast game. Technical report, School of Computer Science, Carnegie Mellon University (2002)"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Clarke, E.H.: Multipart Pricing of Public Goods. Public Choice, 17\u201333 (1971)","DOI":"10.1007\/BF01726210"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-44693-1_11","volume-title":"STACS 2001","author":"A. Clementi","year":"2001","unstructured":"Clementi, A., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: On the complexity of computing minimum energy consumption broadcast subgraphs. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.\u00a02010, pp. 121\u2013131. Springer, Heidelberg (2001)"},{"key":"23_CR10","unstructured":"Clementi, A., Huiban, G., Penna, P., Rossi, G., Verhoeven, Y.C.: Some recent theoretical advances and open questions on energy consumption in ad-hoc wireless networks. In: Proc. of Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE), pp. 23\u201338 (2001)"},{"issue":"1-3","key":"23_CR11","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1016\/S0304-3975(02)00538-8","volume":"299","author":"A. Clementi","year":"2003","unstructured":"Clementi, A., Di Ianni, M., Silvestri, R.: The minimum broadcast range assignment problem on linear multi-hop wireless networks. Theoretical Computer Science\u00a0299(1-3), 751\u2013761 (2003)","journal-title":"Theoretical Computer Science"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-3-540-48413-4_21","volume-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques","author":"A. Clementi","year":"1999","unstructured":"Clementi, A., Penna, P., Silvestri, R.: Hardness results for the power range assignment problem in packet radio networks. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol.\u00a01671, pp. 197\u2013208. Springer, Heidelberg (1999)"},{"key":"23_CR13","unstructured":"Ephremides, A., Nguyen, G.D., Wieselthier, J.E.: On the Construction of Energy-Effficient Broadcast and Multicast Trees in Wireless Networks. In: Proc. of INFOCOM, pp. 585\u2013594 (2000)"},{"key":"23_CR14","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, K., 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":"23_CR15","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. Journal of Computer and System Sciences\u00a063(1), 21\u201341 (2001)","journal-title":"Journal of Computer and System Sciences"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J., Shenker, S.: Distributed algorithmic mechanism design: Recent results and future directions. In: Proc. of ACM DIALM, pp. 1\u201313 (2002)","DOI":"10.1145\/570810.570812"},{"key":"23_CR17","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 Econmics\u00a06, 375\u2013394 (1976)","journal-title":"Journal of Public Econmics"},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"617","DOI":"10.2307\/1914085","volume":"41","author":"T. Groves","year":"1973","unstructured":"Groves, T.: Incentive in Teams. Econometrica\u00a041, 617\u2013631 (1973)","journal-title":"Econometrica"},{"issue":"4","key":"23_CR19","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S. Guha","year":"1998","unstructured":"Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica\u00a020(4), 374\u2013387 (1998)","journal-title":"Algorithmica"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Jain, K., Vazirani, V.V.: Applications of approximation algorithms to cooperative games. In: Proc. of STOC (2001)","DOI":"10.1145\/380752.380825"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Jain, K., Vazirani, V.V.: Equitable cost allocations via primal-dual-type algorithms. In: Proc. of STOC (2002)","DOI":"10.1145\/509907.509956"},{"issue":"4","key":"23_CR22","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF01294129","volume":"14","author":"S. Khuller","year":"1995","unstructured":"Khuller, S., Raghavachari, B., Young, N.: Balancing minimum spanning trees and shortest-path trees. Algorithmica\u00a014(4), 305\u2013321 (1995)","journal-title":"Algorithmica"},{"key":"23_CR23","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0304-3975(98)00223-0","volume":"243","author":"L.M. Kirousis","year":"2000","unstructured":"Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. Theoretical Computer Science\u00a0243, 289\u2013305 (2000)","journal-title":"Theoretical Computer Science"},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"Moulin, H., Shenker, S.: Strategyproof sharing of submodular costs: Budget balance versus efficiency. Economic Theory (1997)","DOI":"10.2139\/ssrn.42940"},{"key":"23_CR25","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N. Nisan","year":"2001","unstructured":"Nisan, N., Ronen, A.: Algorithmic Mechanism Design. Games and Economic Behavior\u00a035, 166\u2013196 (2001); Extended abstract in STOC1999 (1999)","journal-title":"Games and Economic Behavior"},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Algorithms, Games, and the Internet. In: Proc. of STOC (2001)","DOI":"10.1145\/380752.380883"},{"key":"23_CR27","doi-asserted-by":"crossref","unstructured":"Penna, P., Ventre, C.: Sharing the Cost of Multicast Transmissions in Wireless Networks. Technical report, CRESCCO (2003), www.ceid.upatras.gr\/crescco\/","DOI":"10.1007\/978-3-540-27796-5_23"},{"key":"23_CR28","unstructured":"Roberts, K.: The characterization of implementable choice rules. Aggregation and Revelation of Preferences, 321\u2013348 (1979)"},{"key":"23_CR29","doi-asserted-by":"crossref","unstructured":"Vickrey, W.: Counterspeculation, Auctions and Competitive Sealed Tenders. Journal of Finance, 8\u201337 (1961)","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"},{"key":"#cr-split#-23_CR30.1","unstructured":"Wan, P.-J., Calinescu, G., Li, X.-Y., Frieder, O.: Minimum-energy broadcasting in static ad hoc wireless networks. In: Proc. of INFOCOM (2001);"},{"key":"#cr-split#-23_CR30.2","doi-asserted-by":"crossref","unstructured":"Journal version in Wireless Networks??8(6), 607???617 (2002)","DOI":"10.1023\/A:1020381720601"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27796-5_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:20:59Z","timestamp":1605759659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27796-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540222309","9783540277965"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27796-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}