{"id":"https://openalex.org/W2109914429","doi":"https://doi.org/10.1145/1073970.1073999","title":"A truthful mechanism for the non-utilitarian minimum radius spanning tree problem","display_name":"A truthful mechanism for the non-utilitarian minimum radius spanning tree problem","publication_year":2005,"publication_date":"2005-07-18","ids":{"openalex":"https://openalex.org/W2109914429","doi":"https://doi.org/10.1145/1073970.1073999","mag":"2109914429"},"language":"en","primary_location":{"id":"doi:10.1145/1073970.1073999","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1073970.1073999","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087770784","display_name":"Guido Proietti","orcid":"https://orcid.org/0000-0003-1009-5552"},"institutions":[{"id":"https://openalex.org/I26415053","display_name":"University of L'Aquila","ror":"https://ror.org/01j9p1r26","country_code":"IT","type":"education","lineage":["https://openalex.org/I26415053"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Guido Proietti","raw_affiliation_strings":["Universit\u00e0 di L'Aquila, Coppito, Italy"],"affiliations":[{"raw_affiliation_string":"Universit\u00e0 di L'Aquila, Coppito, Italy","institution_ids":["https://openalex.org/I26415053"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109904634","display_name":"Peter Widmayer","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Peter Widmayer","raw_affiliation_strings":["Institut f\u00fcr Theoretische Informatik, ETH Zentrum, Z\u00fcrich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Theoretische Informatik, ETH Zentrum, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5087770784"],"corresponding_institution_ids":["https://openalex.org/I26415053"],"apc_list":null,"apc_paid":null,"fwci":5.2195,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.95169957,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"33","issue":null,"first_page":"195","last_page":"202"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9883999824523926,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6317420601844788},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5823472142219543},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.574979841709137},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.5641181468963623},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.5584166049957275},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.48273107409477234},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.4537423551082611},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42917561531066895},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4143597483634949},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3799181282520294},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3730102777481079},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.19830194115638733},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.18759778141975403},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.14355498552322388}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6317420601844788},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5823472142219543},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.574979841709137},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5641181468963623},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.5584166049957275},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.48273107409477234},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.4537423551082611},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42917561531066895},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4143597483634949},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3799181282520294},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3730102777481079},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.19830194115638733},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.18759778141975403},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.14355498552322388},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1073970.1073999","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1073970.1073999","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1508550312","https://openalex.org/W1577822536","https://openalex.org/W1589209679","https://openalex.org/W1788743225","https://openalex.org/W1976179404","https://openalex.org/W1978228527","https://openalex.org/W1980943820","https://openalex.org/W1986022261","https://openalex.org/W1999483000","https://openalex.org/W2012634103","https://openalex.org/W2015007620","https://openalex.org/W2023658462","https://openalex.org/W2048500523","https://openalex.org/W2060208149","https://openalex.org/W2078040677","https://openalex.org/W2099584630","https://openalex.org/W2120100612","https://openalex.org/W2123839217","https://openalex.org/W2126170153","https://openalex.org/W2126703810","https://openalex.org/W4245095675","https://openalex.org/W4248328481"],"related_works":["https://openalex.org/W2408068853","https://openalex.org/W620960161","https://openalex.org/W1997570556","https://openalex.org/W2911818503","https://openalex.org/W4390962175","https://openalex.org/W2039611868","https://openalex.org/W2045244794","https://openalex.org/W4232108645","https://openalex.org/W2071845176","https://openalex.org/W2596986022"],"abstract_inverted_index":{"Let":[0],"a":[1,7,33,42,45,58,67,78,84,122,134,157,161,181,194],"communication":[2,17],"network":[3],"be":[4],"modelled":[5],"by":[6,133],"graph":[8,23],"G=(V,E)":[9],"of":[10,35,56,107,117,129,164],"n":[11],"nodes":[12,20],"and":[13,137,171],"m":[14],"edges.":[15],"Classic":[16],"operations":[18],"among":[19],"in":[21,40,87,121,125,166,193],"the":[22,52,60,72,75,97,102,105,108,115,138,186],"(e.g.,":[24],"broadcasting,":[25],"multicasting,":[26],"gossiping,":[27],"etc.)":[28],"usually":[29],"take":[30],"place":[31],"on":[32,148],"subgraph":[34],"G,":[36],"which":[37,70,126],"is":[38,49,66,131,177],"built":[39],"such":[41,57],"way":[43],"that":[44,159],"given":[46],"objective":[47],"function":[48],"optimized.":[50],"Among":[51],"many":[53],"possible":[54],"topologies":[55],"subgraph,":[59],"minimum":[61],"radius":[62],"spanning":[63],"tree":[64,69],"(MRST)":[65],"rooted":[68],"minimizes":[71],"distance":[73],"from":[74,104,185],"root":[76],"to":[77,95,189],"farthest":[79],"node.":[80],"The":[81],"MRST":[82,120,163,192],"finds":[83],"natural":[85],"application":[86],"several":[88],"facility":[89],"location":[90],"problems,":[91],"since":[92],"it":[93],"allows":[94],"minimize":[96],"maximum":[98],"delay":[99],"for":[100,142],"reaching":[101],"center":[103],"periphery":[106],"tree.":[109],"In":[110],"this":[111,176],"paper,":[112],"we":[113,155],"consider":[114],"problem":[116],"computing":[118],"an":[119,191],"non-cooperative":[123],"setting":[124],"each":[127],"edge":[128,145],"G":[130,165],"controlled":[132],"selfish":[135],"agent,":[136],"cost":[139],"she":[140],"asks":[141],"using":[143],"her":[144,149],"depends":[146],"only":[147],"private":[150],"information.":[151],"Under":[152],"these":[153],"assumptions,":[154],"provide":[156],"mechanism":[158],"computes":[160],"true":[162],"O(mn\u221an+n3":[167],"log":[168],"n)":[169],"time":[170,187],"O(n2":[172],"\u221an)":[173],"space.":[174],"Interestingly,":[175],"just":[178],"at":[179],"most":[180],"linear":[182],"factor":[183],"away":[184],"needed":[188],"compute":[190],"canonical":[195],"centralized":[196],"framework.":[197]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}