{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T18:42:53Z","timestamp":1730313773115,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,7,18]]},"DOI":"10.1145\/1073970.1073999","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"195-202","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["A truthful mechanism for the non-utilitarian minimum radius spanning tree problem"],"prefix":"10.1145","author":[{"given":"Guido","family":"Proietti","sequence":"first","affiliation":[{"name":"Universit\u00e0 di L'Aquila, Coppito, Italy"}]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[{"name":"Institut f\u00fcr Theoretische Informatik, ETH Zentrum, Z\u00fcrich, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2005,7,18]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proc. of the 42nd Annual Symp. on Foundations of Computer Science (FOCS'01)","author":"Archer A.","year":"2001","unstructured":"A. Archer and \u00c9. Tardos, Truthful mechanisms for one-parameter agents , Proc. of the 42nd Annual Symp. on Foundations of Computer Science (FOCS'01) , 482--491, 2001 . A. Archer and \u00c9. Tardos, Truthful mechanisms for one-parameter agents, Proc. of the 42nd Annual Symp. on Foundations of Computer Science (FOCS'01), 482--491, 2001."},{"key":"e_1_3_2_1_2_1","volume-title":"Internetworking Technologies Handbook","author":"Cisco Systems Inc.","year":"2004","unstructured":"Cisco Systems Inc. \u00a9 , Internetworking Technologies Handbook , Cisco Press , 2004 . Cisco Systems Inc.\u00a9, Internetworking Technologies Handbook, Cisco Press, 2004."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01726210"},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. 13th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA'02)","author":"Demetrescu C.","year":"2002","unstructured":"C. Demetrescu and M. Thorup , Oracles for distances avoiding a link-failure , Proc. 13th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA'02) , 838--843, 2002 . C. Demetrescu and M. Thorup, Oracles for distances avoiding a link-failure, Proc. 13th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA'02), 838--843, 2002."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.v43:2"},{"issue":"4","key":"e_1_3_2_1_6_1","first-page":"37","article-title":"Incentives and Internet computation","volume":"33","author":"Feigenbaum J.","year":"2002","unstructured":"J. Feigenbaum and S. Shenker , Incentives and Internet computation , ACM SIGACT News , 33 ( 4 ): 37 -- 54 , 2002 . J. Feigenbaum and S. Shenker, Incentives and Internet computation, ACM SIGACT News, 33(4):37--54, 2002.","journal-title":"ACM SIGACT News"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.2307\/1914085"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11549468_103"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/11533719_40"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(89)90065-5"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/1-4020-8141-3_15"},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. of the 18th National Conference on Artificial Intelligence and 14th Conference on Innovative Applications of Artificial Intelligence (AAAI\/IAAI'02)","author":"Mu'alem A.","year":"2002","unstructured":"A. Mu'alem and N. Nisan , Truthful approximation mechanisms for restricted combinatorial auctions , Proc. of the 18th National Conference on Artificial Intelligence and 14th Conference on Innovative Applications of Artificial Intelligence (AAAI\/IAAI'02) , AAAI Press, 379--384 , 2002 . A. Mu'alem and N. Nisan, Truthful approximation mechanisms for restricted combinatorial auctions, Proc. of the 18th National Conference on Artificial Intelligence and 14th Conference on Innovative Applications of Artificial Intelligence (AAAI\/IAAI'02), AAAI Press, 379--384, 2002."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00175-7"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-004-1099-9"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/352871.352898"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1999.0790"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/321879.321884"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/322154.322161"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90137-5"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"}],"event":{"name":"SPAA05: 17th ACM Symposium on Parallelism in Algorithms and Architectures 2005","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Las Vegas Nevada USA","acronym":"SPAA05"},"container-title":["Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1073970.1073999","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T02:25:31Z","timestamp":1673144731000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1073970.1073999"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7,18]]},"references-count":20,"alternative-id":["10.1145\/1073970.1073999","10.1145\/1073970"],"URL":"https:\/\/doi.org\/10.1145\/1073970.1073999","relation":{},"subject":[],"published":{"date-parts":[[2005,7,18]]},"assertion":[{"value":"2005-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}