{"id":"https://openalex.org/W7084402895","doi":"https://doi.org/10.4230/lipics.esa.2025.38","title":"Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique","display_name":"Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7084402895","doi":"https://doi.org/10.4230/lipics.esa.2025.38"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:24506","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.38","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol351-esa2025/LIPIcs.ESA.2025.38/LIPIcs.ESA.2025.38.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol351-esa2025/LIPIcs.ESA.2025.38/LIPIcs.ESA.2025.38.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Kumar, Nikhil","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Kumar, Nikhil","raw_affiliation_strings":["University of Waterloo, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Waterloo, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Nan, J. J.","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Nan, J. J.","raw_affiliation_strings":["University of Waterloo, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Waterloo, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":null,"display_name":"Swamy, Chaitanya","orcid":"https://orcid.org/0000-0003-1108-7941"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Swamy, Chaitanya","raw_affiliation_strings":["University of Waterloo, Canada"],"raw_orcid":"https://orcid.org/0000-0003-1108-7941","affiliations":[{"raw_affiliation_string":"University of Waterloo, Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.31673228,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10295","display_name":"Plasmonic and Surface Plasmon Research","score":0.8335000276565552,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10295","display_name":"Plasmonic and Surface Plasmon Research","score":0.8335000276565552,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10131","display_name":"Gold and Silver Nanoparticles Synthesis and Applications","score":0.09669999778270721,"subfield":{"id":"https://openalex.org/subfields/2504","display_name":"Electronic, Optical and Magnetic Materials"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.009399999864399433,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.618399977684021},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.548799991607666},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5095000267028809},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4927999973297119},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.44429999589920044},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.34470000863075256},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3379000127315521},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.3172000050544739}],"concepts":[{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.618399977684021},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.548799991607666},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5310999751091003},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5095000267028809},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4927999973297119},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4447000026702881},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.44429999589920044},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43389999866485596},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4147000014781952},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.34470000863075256},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3379000127315521},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33410000801086426},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3296999931335449},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.3172000050544739},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3109000027179718},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3093000054359436},{"id":"https://openalex.org/C17758045","wikidata":"https://www.wikidata.org/wiki/Q2642629","display_name":"Multigraph","level":3,"score":0.30390000343322754},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.2955000102519989},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.28850001096725464},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.28519999980926514},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.28130000829696655},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.2750999927520752},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.2563000023365021}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:24506","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.38","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol351-esa2025/LIPIcs.ESA.2025.38/LIPIcs.ESA.2025.38.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.esa.2025.38","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.esa.2025.38","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:24506","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.38","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol351-esa2025/LIPIcs.ESA.2025.38/LIPIcs.ESA.2025.38.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3547378653","display_name":null,"funder_award_id":"327620-09","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"}],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7084402895.pdf","grobid_xml":"https://content.openalex.org/works/W7084402895.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"the":[1,52,74,79,136,139,158,195,207,213,231,259],"classical":[2],"survivable-network-design":[3],"problem":[4],"(SNDP),":[5],"we":[6,181],"are":[7,238],"given":[8,208],"an":[9],"undirected":[10],"graph":[11,101],"G":[12,134,154],"=":[13],"(V,":[14],"E),":[15],"non-negative":[16],"edge":[17],"costs,":[18],"and":[19,28,105,165,233,255,297],"some":[20,311],"k":[21],"tuples":[22],"(s_i,t_i,r_i),":[23],"where":[24,73,194],"s_i,t_i":[25],"\u2208":[26,30],"V":[27],"r_i":[29],"\u2124_+.":[31],"The":[32,241],"objective":[33,75],"is":[34,59,76,141,148,197,251],"to":[35,77,122,133,142,170,198,212,258,265,280,293,300],"find":[36,78,143],"a":[37,68,108,114,126,144,183,200,266,289,302],"minimum-cost":[38,80,201],"subset":[39,81,202],"H":[40,146],"\u2286":[41,94,227],"E":[42],"such":[43],"that":[44,61,84,112,147,205],"each":[45],"s_i-t_i":[46],"pair":[47],"remains":[48],"connected":[49],"even":[50],"after":[51],"failure":[53],"of":[54,82,110,117,163,186,203,236,269],"any":[55],"r_i-1":[56],"edges.":[57],"It":[58],"well-known":[60],"SNDP":[62,111,172,192,237],"can":[63],"be":[64,277],"equivalently":[65],"modeled":[66],"using":[67],"weakly-supermodular":[69],"cut-requirement":[70,210,243],"function":[71,211,244],"f,":[72],"edges":[83,89,204,222],"picks":[85],"at":[86,149],"least":[87,150],"f(S)":[88],"across":[90,223],"every":[91,224],"cut":[92,225,271],"S":[93,226],"V.":[95,228],"Recently,":[96],"motivated":[97],"by":[98,218],"fault-tolerance":[99],"in":[100,161],"spanners,":[102],"Dinitz,":[103],"Koranteng,":[104],"Kortsartz":[106],"proposed":[107],"variant":[109],"enforces":[113],"relative":[115,176,187],"level":[116],"fault":[118],"tolerance":[119],"with":[120],"respect":[121],"G.":[123],"Even":[124],"if":[125],"feasible":[127],"SNDP-solution":[128],"may":[129],"not":[130,239,252,263],"exist":[131],"due":[132],"lacking":[135],"required":[137],"fault-tolerance,":[138],"goal":[140,196],"solution":[145],"as":[151,153],"fault-tolerant":[152],"itself.":[155],"They":[156],"formalize":[157],"latter":[159],"condition":[160],"terms":[162],"paths":[164],"fault-sets,":[166],"which":[167],"gives":[168],"rise":[169],"path-relative":[171,234,249],"(which":[173],"they":[174],"call":[175],"SNDP).":[177],"Along":[178],"these":[179,316],"lines,":[180],"introduce":[182],"new":[184,312],"model":[185],"network":[188],"design,":[189],"called":[190],"cut-relative":[191,232],"(CR-SNDP),":[193],"select":[199],"satisfies":[206],"(weakly-supermodular)":[209],"maximum":[214],"extent":[215],"possible,":[216],"i.e.,":[217],"picking":[219],"min{f(S),":[220],"|\u03b4_G(S)|}":[221],"Unlike":[229],"SNDP,":[230],"versions":[235],"equivalent.":[240],"resulting":[242],"for":[245,284,306,315],"CR-SNDP":[246],"(as":[247],"also":[248,309],"SNDP)":[250],"weakly":[253],"supermodular,":[254],"extreme-point":[256],"solutions":[257],"natural":[260],"LP-relaxation":[261],"need":[262],"correspond":[264],"laminar":[267],"family":[268],"tight":[270,303],"constraints.":[272],"Consequently,":[273],"standard":[274],"techniques":[275],"cannot":[276],"used":[278],"directly":[279],"design":[281],"approximation":[282],"algorithms":[283],"this":[285,295],"problem.":[286],"We":[287,308],"develop":[288],"novel":[290],"decomposition":[291],"technique":[292],"circumvent":[294],"difficulty":[296],"use":[298],"it":[299],"give":[301],"2-approximation":[304],"algorithm":[305],"CR-SNDP.":[307],"show":[310],"hardness":[313],"results":[314],"relative-SNDP":[317],"problems.":[318]},"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}