{"id":"https://openalex.org/W1991337804","doi":"https://doi.org/10.1145/1835698.1835777","title":"Rapid randomized pruning for fast greedy distributed algorithms","display_name":"Rapid randomized pruning for fast greedy distributed algorithms","publication_year":2010,"publication_date":"2010-07-25","ids":{"openalex":"https://openalex.org/W1991337804","doi":"https://doi.org/10.1145/1835698.1835777","mag":"1991337804"},"language":"en","primary_location":{"id":"doi:10.1145/1835698.1835777","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1835698.1835777","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","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/A5001595234","display_name":"Saurav Pandit","orcid":null},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Saurav Pandit","raw_affiliation_strings":["University of Iowa, Iowa City, IA, USA","University of Iowa; Iowa City; IA; USA"],"affiliations":[{"raw_affiliation_string":"University of Iowa, Iowa City, IA, USA","institution_ids":["https://openalex.org/I126307644"]},{"raw_affiliation_string":"University of Iowa; Iowa City; IA; USA","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013414239","display_name":"Sriram V. Pemmaraju","orcid":"https://orcid.org/0000-0002-0834-3476"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sriram V. Pemmaraju","raw_affiliation_strings":["University of Iowa, Iowa City, IA, USA","University of Iowa; Iowa City; IA; USA"],"affiliations":[{"raw_affiliation_string":"University of Iowa, Iowa City, IA, USA","institution_ids":["https://openalex.org/I126307644"]},{"raw_affiliation_string":"University of Iowa; Iowa City; IA; USA","institution_ids":["https://openalex.org/I126307644"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5001595234"],"corresponding_institution_ids":["https://openalex.org/I126307644"],"apc_list":null,"apc_paid":null,"fwci":2.3417,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.87671286,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"325","last_page":"334"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/pruning","display_name":"Pruning","score":0.7873646020889282},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5950410962104797},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5873959064483643},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5809437036514282},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5781339406967163},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.5543639659881592},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5356993079185486},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.4948415160179138},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4889875650405884},{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.4726352095603943},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.41381511092185974},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37647783756256104},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3398212194442749}],"concepts":[{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.7873646020889282},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5950410962104797},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5873959064483643},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5809437036514282},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5781339406967163},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.5543639659881592},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5356993079185486},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.4948415160179138},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4889875650405884},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.4726352095603943},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.41381511092185974},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37647783756256104},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3398212194442749},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1835698.1835777","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1835698.1835777","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.44999998807907104,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1854155592","https://openalex.org/W1973393028","https://openalex.org/W1991407520","https://openalex.org/W1998137177","https://openalex.org/W2046554800","https://openalex.org/W2052494364","https://openalex.org/W2076746184","https://openalex.org/W2090222354","https://openalex.org/W2090964330","https://openalex.org/W2101622070","https://openalex.org/W2139841919","https://openalex.org/W2157054705","https://openalex.org/W2163322487","https://openalex.org/W2166590374","https://openalex.org/W3083234306"],"related_works":["https://openalex.org/W2913385138","https://openalex.org/W2543884594","https://openalex.org/W2025050335","https://openalex.org/W1966079129","https://openalex.org/W3204684126","https://openalex.org/W4234897719","https://openalex.org/W2117839333","https://openalex.org/W1504892637","https://openalex.org/W3117290964","https://openalex.org/W2163115662"],"abstract_inverted_index":{"We":[0,89],"start":[1],"by":[2],"defining":[3],"a":[4,23,91,113,135,176],"pruning":[5,68,96,141],"process":[6,69,97],"involving":[7],"sellers":[8,27,34,127],"on":[9,14],"one":[10],"side":[11],"and":[12,128,132,157,162,174],"buyers":[13,59,131],"the":[15,26,30,37,44,47,51,67,95,121,124,144,180],"other.":[16],"The":[17],"goal":[18],"is":[19,120,134],"to":[20,36,55,62,73],"quickly":[21],"select":[22],"subset":[24],"of":[25,46,50,78,94,116,123,126,130],"so":[28],"that":[29,32,57],"products":[31,54],"these":[33],"bring":[35],"market":[38],"has":[39],"small":[40,136],"cost":[41,49,114],"ratio,":[42],"i.e.,":[43],"ratio":[45,115],"total":[48],"selected":[52],"sellers'":[53],"amount":[56],"interested":[58],"are":[60],"willing":[61],"pay.":[63],"As":[64],"modeled":[65],"here,":[66],"can":[70],"be":[71],"used":[72],"speed":[74],"up":[75],"distributed":[76,152],"implementations":[77],"greedy":[79],"algorithms":[80,154,166],"(e.g.,":[81],"for":[82,99,155],"minimum":[83],"dominating":[84],"set,":[85],"facility":[86,158],"location,":[87],"etc).":[88],"present":[90],"randomized":[92],"instance":[93],"that,":[98],"any":[100],"positive":[101],"k,":[102],"runs":[103],"in":[104,171],"O(k)":[105],"communication":[106],"rounds":[107,173],"with":[108],"O(log":[109],"N)-sized":[110],"messages,":[111],"yielding":[112],"O(Nc/k).":[117],"Here":[118],"N":[119],"product":[122],"number":[125,129],"c":[133],"constant.":[137],"Using":[138],"this":[139],"O(k)-round":[140,151],"algorithm":[142],"as":[143],"basis,":[145],"we":[146],"derive":[147],"several":[148],"simple,":[149],"greedy,":[150],"approximation":[153,169,183],"MDS":[156],"location":[159],"(both":[160],"metric":[161],"non-metric":[163],"versions).":[164],"Our":[165],"achieve":[167],"optimal":[168],"ratios":[170],"polylogarithmic":[172],"shave":[175],"\"logarithmic":[177],"factor\"":[178],"off":[179],"best,":[181],"known,":[182],"factor,":[184],"typically":[185],"achieved":[186],"using":[187],"LP-rounding":[188],"techniques.":[189]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}