{"id":"https://openalex.org/W2060807538","doi":"https://doi.org/10.1145/1374376.1374486","title":"Additive guarantees for degree bounded directed network design","display_name":"Additive guarantees for degree bounded directed network design","publication_year":2008,"publication_date":"2008-05-17","ids":{"openalex":"https://openalex.org/W2060807538","doi":"https://doi.org/10.1145/1374376.1374486","mag":"2060807538"},"language":"en","primary_location":{"id":"doi:10.1145/1374376.1374486","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1374376.1374486","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the fortieth 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/A5008689083","display_name":"Nikhil Bansal","orcid":"https://orcid.org/0000-0002-6290-0894"},"institutions":[{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":["IBM T. J. Watson Research, Yorktown Heights, NY, USA"],"affiliations":[{"raw_affiliation_string":"IBM T. J. Watson Research, Yorktown Heights, NY, USA","institution_ids":["https://openalex.org/I4210114115"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074837451","display_name":"Rohit Khandekar","orcid":null},"institutions":[{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rohit Khandekar","raw_affiliation_strings":["IBM T. J. Watson Research, Yorktown Heights, NY, USA"],"affiliations":[{"raw_affiliation_string":"IBM T. J. Watson Research, Yorktown Heights, NY, USA","institution_ids":["https://openalex.org/I4210114115"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051270969","display_name":"Viswanath Nagarajan","orcid":"https://orcid.org/0000-0002-9514-5581"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Viswanath Nagarajan","raw_affiliation_strings":["CMU, Pittsburgh, PA, USA","CMU, pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"CMU, Pittsburgh, PA, USA","institution_ids":[]},{"raw_affiliation_string":"CMU, pittsburgh, PA, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008689083"],"corresponding_institution_ids":["https://openalex.org/I4210114115"],"apc_list":null,"apc_paid":null,"fwci":11.5246,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.988029,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"769","last_page":"778"},"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.9968000054359436,"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/T10083","display_name":"Graphene research and applications","score":0.9807999730110168,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.7399265170097351},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.69822758436203},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5838031768798828},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3226082921028137},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31932657957077026}],"concepts":[{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.7399265170097351},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.69822758436203},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5838031768798828},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3226082921028137},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31932657957077026},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","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}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1145/1374376.1374486","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1374376.1374486","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the fortieth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/ad4235ce-2b0e-4a9d-b590-ce2e3aef40ea","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/ad4235ce-2b0e-4a9d-b590-ce2e3aef40ea","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Khandekar, R & Nagarajan, V 2008, Additive guarantees for degree bounded directed network design. in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC'08, Victoria BC, Canada, May 17-20, 2008). Association for Computing Machinery, Inc., New York, pp. 769-778. https://doi.org/10.1145/1374376.1374486","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:693882","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=693882","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0097-5397","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.140.5383","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.5383","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.andrew.cmu.edu/~viswanat/papers/dir-deg.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.215.969","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.969","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.andrew.cmu.edu/user/viswanat/papers/dir-deg.pdf","raw_type":"text"},{"id":"pmh:oai:library.tue.nl:693882","is_oa":false,"landing_page_url":"http://repository.tue.nl/693882","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0097-5397","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:694848","is_oa":false,"landing_page_url":"http://repository.tue.nl/694848","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:tue:oai:pure.tue.nl:publications/ad4235ce-2b0e-4a9d-b590-ce2e3aef40ea","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/ad4235ce-2b0e-4a9d-b590-ce2e3aef40ea","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC'08, Victoria BC, Canada, May 17-20, 2008), 769 - 778","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1577487475","https://openalex.org/W1775129636","https://openalex.org/W1971422464","https://openalex.org/W1972453585","https://openalex.org/W1975536230","https://openalex.org/W1983496943","https://openalex.org/W1998141189","https://openalex.org/W2002764437","https://openalex.org/W2012586162","https://openalex.org/W2054232722","https://openalex.org/W2055155874","https://openalex.org/W2055505431","https://openalex.org/W2063807274","https://openalex.org/W2066700938","https://openalex.org/W2083210138","https://openalex.org/W2099338166","https://openalex.org/W2110257828","https://openalex.org/W2118656253","https://openalex.org/W2157421865","https://openalex.org/W2172955861","https://openalex.org/W4233360797","https://openalex.org/W4234130962","https://openalex.org/W4241372588"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2911598644"],"abstract_inverted_index":{"We":[0,65,119,175,379,412,420,460],"present":[1],"polynomial-time":[2],"approximation":[3,69,465,510],"algorithms":[4,299],"for":[5,16,72,124,156,172,184,367,466],"some":[6],"degree-bounded":[7,116,186,322,494],"directed":[8,25,335],"network":[9,323],"design":[10],"problems.":[11,162],"Our":[12,133,163,298,396],"main":[13],"result":[14,134,149,248,482,500],"is":[15,165,189,272,326,347,399,493],"intersecting":[17,37],"supermodular":[18,38,131],"connectivity":[19,32],"with":[20,28,83,208,363],"degree":[21,63,233,274,344],"bounds:":[22],"given":[23,428],"a":[24,31,54,67,111,231,239,247,256,266,280,288,339,375,441,462,502],"graph":[26,432],"G=(V,E)":[27],"non-negative":[29,437],"edge-costs,":[30],"requirement":[33],"specified":[34],"by":[35,310,383,390],"an":[36,80,169,203,429],"function":[39],"f,":[40],"and":[41,49,100,136,259,314,316,389,402,436,498,513],"upper":[42],"bounds":[43],"av,":[44],"bvv\u2208":[45],"V":[46],"on":[47,167,246,295],"in-degrees":[48,84],"out-degrees":[50,92,209],"of":[51,58,129,142,160,229,249,275,282,290,305,321,356,371,392,408,483,490,506,511],"vertices,":[52],"find":[53,440],"minimum-cost":[55,115,442],"f-connected":[56,81],"subgraph":[57,82],"G":[59,449],"that":[60,71,178,254,264,352,450],"satisfies":[61],"the":[62,106,114,125,138,151,157,173,179,185,193,221,226,273,276,301,319,334,343,350,359,369,385,406,415,422,481,507],"bounds.":[64,345],"give":[66,238],"bicriteria":[68],"algorithm":[70,164],"any":[73,206],"0":[74],"\u2264":[75,77],"\u03b5":[76],"1/2,":[78],"computes":[79],"at":[85,93,102,210,217,452,474],"most":[86,94,103,211,453,475],"\u2308":[87,95],"av/1-\u03b5":[88],"\u2309":[89,97],"+":[90,98,213],"4,":[91,99],"bv/1-\u03b5":[96,212],"cost":[101,216],"1/\u03b5":[104],"times":[105,220],"optimum.":[107],"This":[108,244,346],"includes,":[109],"as":[110],"special":[112,227,488],"case,":[113],"arborescence":[117,187,207,234],"problem.":[118,174],"also":[120,176,404,413],"obtain":[121,461],"similar":[122],"results":[123],"(more":[126],"general)":[127],"class":[128],"crossing":[130,424],"requirements.":[132],"extends":[135],"improves":[137,245,480],"(3av+4,":[139],"3bv+4,":[140],"3)-approximation":[141],"Lau":[143,250,311,317],"et":[144,251,261,292,312,485],"al.":[145,252,262,293,313,486],"Setting":[146],"\u03b5=0,":[147],"our":[148,283,499],"gives":[150,255,265,501],"first":[152],"purely":[153],"additive":[154,242,464],"guarantee":[155],"unweighted":[158],"versions":[159],"these":[161,331],"based":[166],"rounding":[168,303,387],"LP":[170,195,223],"relaxation":[171],"prove":[177],"above":[180],"cost-degree":[181],"trade-off":[182],"(even":[183],"problem)":[188],"optimal":[190,222,277],"relative":[191],"to":[192,329,333,349,417],"natural":[194],"relaxation.":[196],"For":[197,225],"every":[198],"0<\u03b5":[199],"<1,":[200],"we":[201,237,285],"show":[202],"instance":[204],"where":[205,270],"O(1)":[214],"has":[215,358],"least":[218],"1-o(1)/\u03b5":[219],"value.":[224],"case":[228,489],"finding":[230],"minimum":[232,423,495],"(without":[235],"costs),":[236],"stronger":[240,393],"+2":[241],"approximation.":[243],"[13]":[253],"2\u0394*+2":[257],"guarantee,":[258],"Klein":[260],"[11]":[263],"(1+\u03b5)\u0394*+O(log1+\u03b5":[267],"n)":[268],"bound,":[269],"\u0394*":[271],"arborescence.":[278],"As":[279],"corollary":[281],"result,":[284],"(almost)":[286],"settle":[287],"conjecture":[289],"Bang-Jensen":[291],"[1]":[294],"low-degree":[296],"arborescences.":[297],"use":[300],"iterative":[302,386],"technique":[304,398,416],"Jain,":[306],"which":[307],"was":[308],"used":[309],"Singh":[315,512],"in":[318,342,374,448,473],"context":[320],"design.":[324],"It":[325],"however":[327],"non-trivial":[328],"extend":[330],"techniques":[332],"setting":[336],"without":[337],"incurring":[338],"multiplicative":[340],"violation":[341],"due":[348],"fact":[351],"known":[353],"polyhedral":[354],"characterization":[355],"arborescences":[357],"cut-constraints":[360],"which,":[361],"along":[362],"degree-constraints,":[364],"are":[365],"unsuitable":[366],"arguing":[368],"existence":[370],"integral":[372],"variables":[373],"basic":[376],"feasible":[377],"solution.":[378],"overcome":[380],"this":[381,467,478,491],"difficulty":[382],"enhancing":[384],"steps":[388],"means":[391],"counting":[394,397],"arguments.":[395],"quite":[400],"general,":[401],"it":[403,446],"simplifies":[405],"proofs":[407],"many":[409],"previous":[410],"results.":[411],"apply":[414],"undirected":[418,430],"graphs.":[419],"consider":[421],"spanning":[425,443,496],"tree":[426,444],"problem:":[427],"edge-weighted":[431],"G,":[433],"edge-subsets":[434],"Eii=1k,":[435],"integers":[438],"bii=1k,":[439],"(if":[445],"exists)":[447],"contains":[451],"bi":[454],"edges":[455],"from":[456],"each":[457,470],"set":[458],"Ei.":[459],"+(r-1)":[463],"problem,":[468],"when":[469],"edge":[471],"lies":[472],"r":[476],"sets;":[477],"considerably":[479],"Bilo":[484],"A":[487],"problem":[492],"tree,":[497],"substantially":[503],"easier":[504],"proof":[505],"recent":[508],"+1":[509],"Lau.":[514]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}