{"id":"https://openalex.org/W2108573551","doi":"https://doi.org/10.1137/050629665","title":"Cost-Distance: Two Metric Network Design","display_name":"Cost-Distance: Two Metric Network Design","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2108573551","doi":"https://doi.org/10.1137/050629665","mag":"2108573551"},"language":"en","primary_location":{"id":"doi:10.1137/050629665","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050629665","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5113788789","display_name":"Adam Meyerson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Adam Meyerson","raw_affiliation_strings":["awm@cs.ucla.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"awm@cs.ucla.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047351951","display_name":"Kamesh Munagala","orcid":"https://orcid.org/0000-0003-2636-9650"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kamesh Munagala","raw_affiliation_strings":["kamesh@cs.duke.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"kamesh@cs.duke.edu#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036190625","display_name":"Serge Plotkin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Serge Plotkin","raw_affiliation_strings":["plotkin@cs.stanford.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"plotkin@cs.stanford.edu#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.3058,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.95674711,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"38","issue":"4","first_page":"1648","last_page":"1659"},"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.9969000220298767,"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.9969000220298767,"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.9546999931335449,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9473000168800354,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8169581890106201},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6750943064689636},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.657265841960907},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.6065769791603088},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.5718483328819275},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5689082145690918},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.49416258931159973},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4878859519958496},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48713013529777527},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44747018814086914},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33443892002105713},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3263437747955322},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.10376882553100586},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08877569437026978}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8169581890106201},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6750943064689636},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.657265841960907},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.6065769791603088},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.5718483328819275},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5689082145690918},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.49416258931159973},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4878859519958496},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48713013529777527},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44747018814086914},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33443892002105713},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3263437747955322},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.10376882553100586},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08877569437026978},{"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/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}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1137/050629665","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050629665","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.125.6123","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.6123","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucla.edu/~awm/papers/costdistance.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.28.5044","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.5044","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.stanford.edu/~plotkin/2metrics-TR.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.296.9290","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.296.9290","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.duke.edu/~kamesh/bicriteria.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.33.2688","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.2688","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.stanford.edu/~kamesh/bicriteria.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.62.3288","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.3288","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://troll-w.stanford.edu/plotkin/2metrics-TR.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.89.6675","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.6675","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.duke.edu/~kamesh/bicriteria.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.94.6213","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.6213","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.stanford.edu/~kamesh/bicriteria.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1972454391","https://openalex.org/W1975290397","https://openalex.org/W1986237945","https://openalex.org/W1987503114","https://openalex.org/W2001139415","https://openalex.org/W2045045217","https://openalex.org/W2061594253","https://openalex.org/W2151250580","https://openalex.org/W2152950844","https://openalex.org/W2163196406","https://openalex.org/W2444497673","https://openalex.org/W2951475756"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W1998126097","https://openalex.org/W4242016769","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W2004321562","https://openalex.org/W2087658830","https://openalex.org/W328736688","https://openalex.org/W2995411114"],"abstract_inverted_index":{"We":[0,30,49],"present":[1],"the":[2,11,20,32,45,62],"Cost-Distance":[3],"problem:":[4],"finding":[5],"a":[6],"Steiner":[7,103],"tree":[8],"which":[9],"optimizes":[10],"sum":[12,21],"of":[13,22,47,81],"edge":[14],"costs":[15,87],"along":[16,25],"one":[17],"metric":[18],"and":[19,99,105,116],"source-sink":[23],"distances":[24],"an":[26],"unrelated":[27],"second":[28],"metric.":[29],"give":[31],"first":[33,63],"known":[34,64,121],"$O(\\log":[35],"k)$":[36],"randomized":[37],"approximation":[38,66],"scheme":[39],"for":[40,67,123],"Cost-Distance,":[41,57],"where":[42],"k":[43],"is":[44,111],"number":[46],"sources.":[48],"reduce":[50],"several":[51],"common":[52],"network":[53],"design":[54,125],"problems":[55,70],"to":[56,114],"obtaining":[58],"(in":[59],"some":[60],"cases)":[61],"logarithmic":[65],"them.":[68],"These":[69],"include":[71],"single-sink":[72],"buy-at-bulk":[73,124],"with":[74,85,96],"variable":[75],"pipe":[76],"types":[77],"between":[78],"different":[79],"sets":[80],"nodes,":[82],"facility":[83,107],"location":[84],"buy-at-bulk\u2013type":[86],"on":[88],"edges":[89],"(integrated":[90],"logistics),":[91],"constructing":[92],"single-source":[93],"multicast":[94],"trees":[95],"good":[97],"cost":[98],"delay":[100],"properties,":[101],"priority":[102],"trees,":[104],"multilevel":[106],"location.":[108],"Our":[109],"algorithm":[110],"also":[112],"easier":[113],"implement":[115],"significantly":[117],"faster":[118],"than":[119],"previously":[120],"algorithms":[122],"problems.":[126]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}