{"id":"https://openalex.org/W1989669912","doi":"https://doi.org/10.1137/050643635","title":"A Constant Factor Approximation for the Single Sink Edge Installation Problem","display_name":"A Constant Factor Approximation for the Single Sink Edge Installation Problem","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W1989669912","doi":"https://doi.org/10.1137/050643635","mag":"1989669912"},"language":"en","primary_location":{"id":"doi:10.1137/050643635","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050643635","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":true,"oa_status":"green","oa_url":"https://repository.upenn.edu/bitstreams/4a654289-8351-4c4c-b9ce-7dc1817a1f4f/download","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114008024","display_name":"Sudipto Guha","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sudipto Guha","raw_affiliation_strings":["sudipto@cis.upenn.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"sudipto@cis.upenn.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","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":"last","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":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.3434,"has_fulltext":true,"cited_by_count":34,"citation_normalized_percentile":{"value":0.95730206,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"38","issue":"6","first_page":"2426","last_page":"2442"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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.9994000196456909,"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.9983000159263611,"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.7276729345321655},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.7220948934555054},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.708458423614502},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.6391804218292236},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5592747330665588},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.549192488193512},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.5077544450759888},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46912169456481934},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.43820616602897644},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4335387945175171},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4261783957481384},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40825003385543823},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.354472815990448},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.11666902899742126}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7276729345321655},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.7220948934555054},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.708458423614502},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.6391804218292236},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5592747330665588},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.549192488193512},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.5077544450759888},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46912169456481934},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.43820616602897644},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4335387945175171},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4261783957481384},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40825003385543823},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.354472815990448},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.11666902899742126},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/050643635","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050643635","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:repository.upenn.edu:cis_papers-1442","is_oa":true,"landing_page_url":"https://repository.upenn.edu/cis_papers/411","pdf_url":"https://repository.upenn.edu/bitstreams/4a654289-8351-4c4c-b9ce-7dc1817a1f4f/download","source":{"id":"https://openalex.org/S4306402083","display_name":"ScholarlyCommons (University of Pennsylvania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79576946","host_organization_name":"University of Pennsylvania","host_organization_lineage":["https://openalex.org/I79576946"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Departmental Papers (CIS)","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.24.3011","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.3011","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/~sudipto/mypapers/buyatbulk.ps","raw_type":"text"},{"id":"pmh:oai:repository.upenn.edu:20.500.14332/6460","is_oa":false,"landing_page_url":"https://repository.upenn.edu/handle/20.500.14332/6460","pdf_url":null,"source":{"id":"https://openalex.org/S4306402083","display_name":"ScholarlyCommons (University of Pennsylvania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79576946","host_organization_name":"University of Pennsylvania","host_organization_lineage":["https://openalex.org/I79576946"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"published","raw_type":"Article"}],"best_oa_location":{"id":"pmh:oai:repository.upenn.edu:cis_papers-1442","is_oa":true,"landing_page_url":"https://repository.upenn.edu/cis_papers/411","pdf_url":"https://repository.upenn.edu/bitstreams/4a654289-8351-4c4c-b9ce-7dc1817a1f4f/download","source":{"id":"https://openalex.org/S4306402083","display_name":"ScholarlyCommons (University of Pennsylvania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79576946","host_organization_name":"University of Pennsylvania","host_organization_lineage":["https://openalex.org/I79576946"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Departmental Papers (CIS)","raw_type":"text"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.4699999988079071}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1989669912.pdf","grobid_xml":"https://content.openalex.org/works/W1989669912.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1532411173","https://openalex.org/W1696776098","https://openalex.org/W1759768216","https://openalex.org/W1786215221","https://openalex.org/W1991407520","https://openalex.org/W2041571997","https://openalex.org/W2059149798","https://openalex.org/W2076746184","https://openalex.org/W2082353536","https://openalex.org/W2104701012","https://openalex.org/W2106676868","https://openalex.org/W2124295613","https://openalex.org/W2133156969","https://openalex.org/W2142758253","https://openalex.org/W2149929647","https://openalex.org/W2169143327","https://openalex.org/W4239031269","https://openalex.org/W6677156346","https://openalex.org/W6713549877"],"related_works":["https://openalex.org/W1973529814","https://openalex.org/W1509863433","https://openalex.org/W1991566967","https://openalex.org/W2039333724","https://openalex.org/W2784330691","https://openalex.org/W1967535279","https://openalex.org/W2173317315","https://openalex.org/W2810411596","https://openalex.org/W1854155592","https://openalex.org/W2499461890"],"abstract_inverted_index":{"We":[0,68,116],"present":[1,70,125],"the":[2,7,47,56,64,76,106,134],"first":[3],"constant":[4,73,127,139],"approximation":[5,74,129],"to":[6,17,32,40,75,114],"single":[8,42],"sink":[9],"buy-at-bulk":[10],"network":[11,20,49],"design":[12,18],"problem,":[13],"where":[14,61],"we":[15,94],"have":[16],"a":[19,36,41,51,71,89,126,138],"by":[21,137],"buying":[22],"pipes":[23],"of":[24,38,59,66,99,108],"different":[25],"costs":[26],"and":[27,86,124],"capacities":[28],"per":[29],"unit":[30],"length":[31],"route":[33],"demands":[34],"at":[35],"set":[37,65],"sources":[39],"sink.":[43],"The":[44],"distances":[45],"in":[46,91],"underlying":[48],"form":[50],"metric.":[52],"This":[53],"result":[54],"improves":[55],"previous":[57],"bound":[58],"$O(\\log|R|)$,":[60],"R":[62],"is":[63],"sources.":[67],"also":[69],"better":[72],"related":[77],"Access":[78],"Network":[79],"Design":[80],"problem.":[81],"Our":[82],"algorithms":[83],"are":[84],"randomized":[85],"combinatorial.":[87],"As":[88],"subroutine":[90],"our":[92],"algorithm,":[93],"use":[95],"an":[96,110],"interesting":[97],"variant":[98,119],"facility":[100,112,122],"location":[101,123],"with":[102],"lower":[103,135],"bounds":[104,136],"on":[105],"amount":[107],"demand":[109],"open":[111],"needs":[113],"serve.":[115],"call":[117],"this":[118],"load":[120],"balanced":[121],"factor":[128],"for":[130],"it,":[131],"while":[132],"relaxing":[133],"factor.":[140]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}