{"id":"https://openalex.org/W2012931756","doi":"https://doi.org/10.1145/2312005.2312045","title":"Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design","display_name":"Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design","publication_year":2012,"publication_date":"2012-06-25","ids":{"openalex":"https://openalex.org/W2012931756","doi":"https://doi.org/10.1145/2312005.2312045","mag":"2012931756"},"language":"en","primary_location":{"id":"doi:10.1145/2312005.2312045","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2312005.2312045","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-fourth 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/A5033930662","display_name":"Guy E. Blelloch","orcid":"https://orcid.org/0000-0003-0224-9187"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guy E. Blelloch","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA","Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078381067","display_name":"Anupam Gupta","orcid":"https://orcid.org/0000-0001-5579-3405"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anupam Gupta","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA","Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054849628","display_name":"Kanat Tangwongsan","orcid":"https://orcid.org/0000-0001-9775-8165"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kanat Tangwongsan","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA","Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3892,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.81137147,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"205","last_page":"213"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.996999979019165,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9919000267982483,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/binary-logarithm","display_name":"Binary logarithm","score":0.6771865487098694},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.6708502769470215},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6180992126464844},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.5945689678192139},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5929868221282959},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5596324801445007},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5278764963150024},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5135338306427002},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.49876999855041504},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4601583480834961},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44949907064437866},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.42573392391204834},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4172459840774536},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39581042528152466},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19930648803710938}],"concepts":[{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6771865487098694},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.6708502769470215},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6180992126464844},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.5945689678192139},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5929868221282959},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5596324801445007},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5278764963150024},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5135338306427002},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.49876999855041504},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4601583480834961},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44949907064437866},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.42573392391204834},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4172459840774536},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39581042528152466},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19930648803710938},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2312005.2312045","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2312005.2312045","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.361.2498","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.361.2498","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~ktangwon/research/spaa12-frt.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1595208863","https://openalex.org/W1981859328","https://openalex.org/W1985704385","https://openalex.org/W1995875735","https://openalex.org/W2003207175","https://openalex.org/W2023518480","https://openalex.org/W2041571997","https://openalex.org/W2046946959","https://openalex.org/W2048972466","https://openalex.org/W2058295780","https://openalex.org/W2090879820","https://openalex.org/W2092901467","https://openalex.org/W2104507648","https://openalex.org/W2114493937","https://openalex.org/W2120490947","https://openalex.org/W2133156969","https://openalex.org/W2287432258","https://openalex.org/W2993383518","https://openalex.org/W3030774092","https://openalex.org/W6648982606"],"related_works":["https://openalex.org/W2009836834","https://openalex.org/W2914691919","https://openalex.org/W2070751425","https://openalex.org/W2055625272","https://openalex.org/W2963158951","https://openalex.org/W2036758175","https://openalex.org/W2099271296","https://openalex.org/W1577155814","https://openalex.org/W2084593768","https://openalex.org/W2038796709"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"parallel":[3,42,138],"algorithms":[4,34],"for":[5,104,111,126,140],"embedding":[6,24],"an":[7,99,107],"arbitrary":[8,127],"n-point":[9],"metric":[10],"space":[11],"into":[12],"a":[13,41],"distribution":[14],"of":[15,31,58,67,129],"dominating":[16],"trees":[17],"with":[18,123],"O(log":[19,101,109],"n)":[20,49,53,92],"expected":[21],"stretch.":[22],"Such":[23],"has":[25],"proved":[26],"useful":[27],"in":[28,35,46],"the":[29,36,65,68,119,132,136,141],"design":[30],"many":[32],"approximation":[33],"sequential":[37],"setting.":[38],"We":[39],"give":[40,98],"algorithm":[43,83,103,117,122,139],"that":[44],"runs":[45],"O(n2":[47],"log":[48],"work":[50,89],"and":[51,90,106,131],"O(log2":[52,91],"depth---these":[54],"bounds":[55],"are":[56],"independent":[57],"\u0394":[59,75],"=":[60],"(maxx,y":[61],"d(x,y))/(minx\u2260":[62],"y":[63],"d(x,y)),":[64],"ratio":[66],"largest":[69],"to":[70,87],"smallest":[71],"distance.":[72],"Moreover,":[73],"when":[74],"is":[76,118,135],"exponentially":[77],"bounded":[78],"(\u0394":[79],"\u2264":[80],"2O(n)),":[81],"our":[82],"can":[84],"be":[85],"improved":[86],"O(n2)":[88],"depth.":[93],"Using":[94],"these":[95],"results,":[96],"we":[97],"RNC":[100,108,121],"k)-approximation":[102],"k-median":[105,116],"n)-approximation":[110],"buy-at-bulk":[112,133],"network":[113],"design.":[114],"The":[115],"first":[120,137],"non-trivial":[124],"guarantees":[125],"values":[128],"k,":[130],"result":[134],"problem.":[142]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}