{"id":"https://openalex.org/W2054728000","doi":"https://doi.org/10.1145/2591796.2591837","title":"Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements","display_name":"Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements","publication_year":2014,"publication_date":"2014-05-31","ids":{"openalex":"https://openalex.org/W2054728000","doi":"https://doi.org/10.1145/2591796.2591837","mag":"2054728000"},"language":"en","primary_location":{"id":"doi:10.1145/2591796.2591837","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2591796.2591837","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-sixth annual ACM symposium on Theory of 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/A5025907388","display_name":"Alina Ene","orcid":"https://orcid.org/0000-0002-5818-1807"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]},{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["GB","US"],"is_corresponding":true,"raw_author_name":"Alina Ene","raw_affiliation_strings":["Princeton University and University of Warwick"],"affiliations":[{"raw_affiliation_string":"Princeton University and University of Warwick","institution_ids":["https://openalex.org/I39555362","https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052582756","display_name":"Ali Vakilian","orcid":"https://orcid.org/0000-0001-5049-7594"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ali Vakilian","raw_affiliation_strings":["CSAIL, MIT"],"affiliations":[{"raw_affiliation_string":"CSAIL, MIT","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025907388"],"corresponding_institution_ids":["https://openalex.org/I20089843","https://openalex.org/I39555362"],"apc_list":null,"apc_paid":null,"fwci":1.0967,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.78582995,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"754","last_page":"763"},"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.9993000030517578,"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.9993000030517578,"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.9904999732971191,"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.9810000061988831,"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/bounded-function","display_name":"Bounded function","score":0.8374201059341431},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.7464284300804138},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6591528058052063},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6469765901565552},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5467485189437866},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5112195014953613},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48226743936538696},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.45834681391716003},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.4525241255760193},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.434080570936203},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3246007561683655},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30232691764831543},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07733878493309021}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.8374201059341431},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.7464284300804138},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6591528058052063},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6469765901565552},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5467485189437866},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5112195014953613},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48226743936538696},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.45834681391716003},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.4525241255760193},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.434080570936203},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3246007561683655},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30232691764831543},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07733878493309021},{"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2591796.2591837","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2591796.2591837","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-sixth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:wrap.warwick.ac.uk:64302","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Conference Item"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.650.5708","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.650.5708","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.princeton.edu/~aene/papers/deg-bd-stoc.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6007961983","display_name":null,"funder_award_id":"CCF-1016684","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"},{"id":"https://openalex.org/G6958986694","display_name":null,"funder_award_id":"EP/D063191/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"},{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1486942466","https://openalex.org/W1614197999","https://openalex.org/W1965398738","https://openalex.org/W1968690018","https://openalex.org/W1975884818","https://openalex.org/W1985672402","https://openalex.org/W2015382802","https://openalex.org/W2055505431","https://openalex.org/W2066700938","https://openalex.org/W2069138465","https://openalex.org/W2095894980","https://openalex.org/W2099338166","https://openalex.org/W2131776672","https://openalex.org/W2157421865","https://openalex.org/W2161190897","https://openalex.org/W2163661406","https://openalex.org/W2172955861","https://openalex.org/W2174245573","https://openalex.org/W2405374478","https://openalex.org/W2552451242","https://openalex.org/W2610631890","https://openalex.org/W3122273056","https://openalex.org/W4206641303"],"related_works":["https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W4256429076","https://openalex.org/W2012063272","https://openalex.org/W2348092930","https://openalex.org/W3161230432","https://openalex.org/W2062850566","https://openalex.org/W4308716484","https://openalex.org/W2098284475","https://openalex.org/W2501971168"],"abstract_inverted_index":{"We":[0,108,169],"consider":[1],"degree":[2,15,39,75],"bounded":[3,16],"network":[4,176],"design":[5,177],"problems":[6,133,178],"with":[7,32,124,134,182],"element":[8,125],"and":[9,38,45,71,93,128],"vertex":[10,97,135,156],"connectivity":[11,46,69,126,136],"requirements.":[12,137],"In":[13],"the":[14,22,36,43,68,74,78,110,120,151],"Survivable":[17],"Network":[18],"Design":[19],"(SNDP)":[20],"problem,":[21],"input":[23],"is":[24,57,99,146,158],"an":[25],"undirected":[26],"graph":[27],"G":[28,65],"=":[29],"(V,":[30],"E)":[31],"weights":[33],"w(e)":[34],"on":[35,42,77],"edges":[37,105,166],"bounds":[40,76],"b(v)":[41,104,165],"vertices,":[44,85],"requirements":[47,70,127],"r(uv)":[48,88],"for":[49,80,119,129],"each":[50,81,96,155],"pair":[51,82],"uv":[52,83],"of":[53,64,84],"vertices.":[54],"The":[55],"goal":[56],"to":[58,101,160,175,185],"select":[59],"a":[60,141],"minimum-weight":[61],"subgraph":[62,142],"H":[63,86,143],"that":[66,154],"meets":[67],"it":[72],"satisfies":[73],"vertices:":[79],"has":[87],"disjoint":[89],"paths":[90],"between":[91],"u":[92],"v;":[94],"additionally,":[95],"v":[98,157],"incident":[100,159],"at":[102,147,161],"most":[103,148,162],"in":[106,167,179],"H.":[107,168],"give":[109],"first":[111],"(O(1),":[112,187],"O(1)":[113,149,163,188],"\u00b7":[114,164,189],"b(v))":[115],"bicriteria":[116,191],"approximation":[117],"algorithms":[118,139],"degree-bounded":[121,131],"SNDP":[122,132],"problem":[123],"several":[130],"Our":[138],"construct":[140],"whose":[144],"weight":[145],"times":[150],"optimal":[152],"such":[153],"can":[170],"also":[171],"extend":[172],"our":[173],"approach":[174],"directed":[180],"graphs":[181],"out-degree":[183],"constraints":[184],"obtain":[186],"b+(v))":[190],"approximation.":[192]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}