{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:43:34Z","timestamp":1725543814085},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354741"},{"type":"electronic","value":"9783540354758"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780823_23","type":"book-chapter","created":{"date-parts":[[2006,6,23]],"date-time":"2006-06-23T14:45:59Z","timestamp":1151073959000},"page":"295-309","source":"Crossref","is-referenced-by-count":2,"title":["On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem"],"prefix":"10.1007","author":[{"given":"Davide","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"given":"Luciano","family":"Gual\u00e0","sequence":"additional","affiliation":[]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Amb\u00fchl, C., Clementi, A., Penna, P., Rossi, G., Silvestri, R.: Energy consumption in radio networks: selfish agents and rewarding mechanisms. In: Proc. 10th Int. Colloquium on Structural Information Complexity (SIROCCO 2003). Proceedings in Informatics, vol.\u00a017, pp. 1\u201316. Carleton Scientific (2003)"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Archer, A., Tardos, \u00c9.: Truthful mechanisms for one-parameter agents. In: Proc. 42nd IEEE Symp. on Foundations of Computer Science (FOCS 2001), pp. 482\u2013491 (2001)","DOI":"10.1109\/SFCS.2001.959924"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Briest, P., Krysta, P., V\u00f6cking, B.: Approximation techniques for utilitarian mechanism design. In: Proc. 37th Ann. ACM Symp. on Theory of Computing (STOC 2005), pp. 39\u201348 (2005)","DOI":"10.1145\/1060590.1060597"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01726210","volume":"8","author":"E. Clarke","year":"1971","unstructured":"Clarke, E.: Multipart pricing of public goods. Public Choice\u00a08, 17\u201333 (1971)","journal-title":"Public Choice"},{"issue":"4","key":"23_CR5","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. of the ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"J. of the ACM"},{"issue":"4","key":"23_CR6","doi-asserted-by":"publisher","first-page":"617","DOI":"10.2307\/1914085","volume":"41","author":"T. Groves","year":"1973","unstructured":"Groves, T.: Incentives in teams. Econometrica\u00a041(4), 617\u2013631 (1973)","journal-title":"Econometrica"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/11533719_40","volume-title":"Computing and Combinatorics","author":"L. Gual\u00e0","year":"2005","unstructured":"Gual\u00e0, L., Proietti, G.: A Truthful (2\u20132\/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 390\u2013400. Springer, Heidelberg (2005)"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1007\/11549468_103","volume-title":"Euro-Par 2005 Parallel Processing","author":"L. Gual\u00e0","year":"2005","unstructured":"Gual\u00e0, L., Proietti, G.: Efficient truthful mechanisms for the single-source shortest paths tree problem. In: Cunha, J.C., Medeiros, P.D. (eds.) Euro-Par 2005. LNCS, vol.\u00a03648, pp. 941\u2013951. Springer, Heidelberg (2005)"},{"issue":"1","key":"23_CR9","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R. Hassin","year":"1992","unstructured":"Hassin, R.: Approximation schemes for restricted shortest path problems. Math. Oper. Res.\u00a017(1), 36\u201342 (1992)","journal-title":"Math. Oper. Res."},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Hershberger, J., Suri, S.: Vickrey prices and shortest paths: what is an edge worth? In: Proc. 42nd IEEE Symp. on Foundations of Computer Science (FOCS 2001), pp. 252\u2013259 (2001)","DOI":"10.1109\/SFCS.2001.959899"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Kao, M.-Y., Li, X.-Y., Wang, W.: Towards truthful mechanisms for binary demand games: a general framework. In: Proc. 6th ACM Conference on Electronic Commerce (EC 2005), pp. 213\u2013222 (2005)","DOI":"10.1145\/1064009.1064032"},{"issue":"4","key":"23_CR12","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.E.: Balancing minimum spanning trees and shortest-path trees. Algorithmica\u00a014(4), 305\u2013321 (1995)","journal-title":"Algorithmica"},{"issue":"1","key":"23_CR13","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1006\/jagm.1998.0930","volume":"28","author":"M.V. Marathe","year":"1998","unstructured":"Marathe, M.V., Ravi, R., Sundaram, R., Ravi, S.S., Rosenkrantz, D.J., Hunt III, H.B.: Bicriteria network design problems. J. Algorithms\u00a028(1), 142\u2013171 (1998)","journal-title":"J. Algorithms"},{"key":"23_CR14","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 Behaviour\u00a035, 166\u2013196 (2001)","journal-title":"Games and Economic Behaviour"},{"key":"23_CR15","volume-title":"A Course in Game Theory","author":"M.J. Osborne","year":"1994","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory. MIT Press, Cambridge (1994)"},{"issue":"1","key":"23_CR16","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/505241.505243","volume":"49","author":"S. Pettie","year":"2002","unstructured":"Pettie, S., Ramachandran, V.: An optimal minimum spanning tree algorithm. J. of the ACM\u00a049(1), 16\u201334 (2002)","journal-title":"J. of the ACM"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Phillips, C.A.: The network inhibition problem. In: Proc. 25th Ann. ACM Symp. on Theory of Computing (STOC 1993), pp. 776\u2013785 (1993)","DOI":"10.1145\/167088.167286"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Proietti, G., Widmayer, P.: A truthful mechanism for the non-utilitarian minimum radius spanning tree problem. In: Proc. 17th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA 2005), pp. 195\u2013202 (2005)","DOI":"10.1145\/1073970.1073999"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/0020-0190(82)90137-5","volume":"14","author":"R.E. Tarjan","year":"1982","unstructured":"Tarjan, R.E.: Sensitivity analysis of minimum spanning trees and shortest path problems. Inform. Proc. Lett.\u00a014, 30\u201333 (1982)","journal-title":"Inform. Proc. Lett."},{"key":"23_CR20","doi-asserted-by":"publisher","first-page":"8","DOI":"10.2307\/2977633","volume":"16","author":"W. Vickrey","year":"1961","unstructured":"Vickrey, W.: Counterspeculation, auctions and competitive sealed tenders. J. of Finance\u00a016, 8\u201337 (1961)","journal-title":"J. of Finance"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780823_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:17:13Z","timestamp":1619507833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780823_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354741","9783540354758"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11780823_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}