{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:59:24Z","timestamp":1742972364315,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":9,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_437","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:37:39Z","timestamp":1214505459000},"page":"973-975","source":"Crossref","is-referenced-by-count":0,"title":["Truthful Multicast"],"prefix":"10.1007","author":[{"given":"Weizhao","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang-Yang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"437_CR1_437","doi-asserted-by":"crossref","unstructured":"Anderegg, L., Eidenbenz, S.: Ad hoc-VCG: a\u00a0truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents. In: Proceedings of the 9th annual international conference on Mobile computing and networking. pp.\u00a0245\u2013259 ACM Press, New York (2003)","DOI":"10.1145\/938985.939011"},{"issue":"1","key":"437_CR2_437","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. J.\u00a0Comput. Syst. Sci. 63(1), 21\u201341 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"437_CR3_437","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J., Papadimitriou, C., Sami, R., Shenker, S.: A\u00a0BGP-based mechanism for lowest-cost routing. In: Proceedings of the 2002 ACM Symposium on Principles of Distributed Computing, pp.\u00a0173\u2013182. Monterey, 21\u201324 July 2002","DOI":"10.1145\/571825.571856"},{"issue":"1","key":"437_CR4_437","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1006\/jagm.1995.1029","volume":"19","author":"P. Klein","year":"1995","unstructured":"Klein, P., Ravi, R.: A\u00a0nearly best-possible approximation algorithm for node-weighted Steiner trees. J.\u00a0Algorithms 19(1), 104\u2013115 (1995)","journal-title":"J. Algorithms"},{"key":"437_CR5_437","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. In: Proc. 31st Annual Symposium on Theory of Computing (STOC99), Atlanta, 1\u20134 May 1999, pp.\u00a0129\u2013140 (1999)","DOI":"10.1145\/301250.301287"},{"issue":"6","key":"437_CR6_437","first-page":"573","volume":"24","author":"H. Takahashi","year":"1980","unstructured":"Takahashi, H., Matsuyama, A.: An approximate solution for the Steiner problem in graphs. Math. Jap. 24(6), 573\u2013577 (1980)","journal-title":"Math. Jap."},{"issue":"5","key":"437_CR7_437","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1109\/TMC.2006.66","volume":"5","author":"W. Wang","year":"2006","unstructured":"Wang, W., Li, X.-Y.: Low-Cost routing in selfish and rational wireless ad hoc networks. IEEE Trans. Mobile Comput. 5(5), 596\u2013607 (2006)","journal-title":"IEEE Trans. Mobile Comput."},{"key":"437_CR8_437","doi-asserted-by":"crossref","unstructured":"Wang, W., Li, X.-Y., Wang, Y.: Truthful multicast in selfish wireless networks. In: Proceedings of the 10th ACM Annual international Conference on Mobile Computing and Networking, Philadelphia, 26 September \u2013 1 October 2004","DOI":"10.1145\/1023720.1023745"},{"key":"437_CR9_437","doi-asserted-by":"crossref","unstructured":"Zhong, S., Li, L., Liu, Y., Yang, Y.R.: On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks\u00a0\u2013an integrated approach using game theoretical and cryptographic techniques. In: Proceedings of the 11th ACM Annual international Conference on Mobile Computing and Networking, Cologne, 28 August \u2013 2 September 2005","DOI":"10.1145\/1080829.1080841"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_437","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T01:55:34Z","timestamp":1662170134000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_437"}},"subtitle":["2004; Wang, Li, Wang"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_437","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}