{"id":"https://openalex.org/W4281812620","doi":"https://doi.org/10.4230/lipics.icalp.2022.37","title":"Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver","display_name":"Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4281812620","doi":"https://doi.org/10.4230/lipics.icalp.2022.37"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:16378","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.37","pdf_url":null,"source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.37","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016828567","display_name":"Parinya Chalermsook","orcid":"https://orcid.org/0009-0000-2833-0472"},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Chalermsook, Parinya","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001969602","display_name":"Chien\u2010Chung Huang","orcid":"https://orcid.org/0000-0003-3482-2646"},"institutions":[{"id":"https://openalex.org/I4210162280","display_name":"Laboratoire de G\u00e9ologie de l\u2019\u00c9cole Normale Sup\u00e9rieure","ror":"https://ror.org/05vg9cw43","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I2746051580","https://openalex.org/I29607241","https://openalex.org/I4210148025","https://openalex.org/I4210162280"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Huang, Chien-Chung","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074369690","display_name":"Danupon Nanongkai","orcid":"https://orcid.org/0000-0003-4468-2675"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]},{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["DK","SE"],"is_corresponding":false,"raw_author_name":"Nanongkai, Danupon","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010547647","display_name":"Thatchaphol Saranurak","orcid":"https://orcid.org/0000-0001-8386-7168"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Saranurak, Thatchaphol","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052135559","display_name":"Pattara Sukprasert","orcid":"https://orcid.org/0000-0003-4624-7546"},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sukprasert, Pattara","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5068060092","display_name":"Sorrachai Yingchareonthawornchai","orcid":"https://orcid.org/0000-0002-7169-0163"},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Yingchareonthawornchai, Sorrachai","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":5,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1325,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.43820078,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9890999794006348,"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.9890999794006348,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9677000045776367,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9574000239372253,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7404629588127136},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7345333099365234},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6454822421073914},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5949404239654541},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5495348572731018},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5229535698890686},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.48843255639076233},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4750535488128662},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.46928203105926514},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.46017375588417053},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.4467926621437073},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44498446583747864},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.44371718168258667},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4359789192676544},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.12634223699569702},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12513163685798645},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.12189200520515442}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7404629588127136},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7345333099365234},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6454822421073914},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5949404239654541},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5495348572731018},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5229535698890686},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.48843255639076233},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4750535488128662},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.46928203105926514},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.46017375588417053},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.4467926621437073},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44498446583747864},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.44371718168258667},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4359789192676544},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.12634223699569702},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12513163685798645},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.12189200520515442},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:16378","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.37","pdf_url":null,"source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:arXiv.org:2205.14978","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2205.14978","pdf_url":"https://arxiv.org/pdf/2205.14978","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:HAL:hal-04044666v1","is_oa":true,"landing_page_url":"https://hal.science/hal-04044666","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), Jul 2022, Paris, France. ⟨10.4230/LIPIcs.ICALP.2022.37⟩","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:aaltodoc.aalto.fi:123456789/117240","is_oa":true,"landing_page_url":"https://research.aalto.fi/en/publications/813b0cce-da7f-46c8-9d8d-3e2f70b98a19","pdf_url":null,"source":{"id":"https://openalex.org/S4306401663","display_name":"Aaltodoc (Aalto University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I9927081","host_organization_name":"Aalto University","host_organization_lineage":["https://openalex.org/I9927081"],"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":"info:eu-repo/semantics/article"},{"id":"doi:10.48550/arxiv.2205.14978","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2205.14978","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.4230/lipics.icalp.2022.37","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2022.37","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":"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:16378","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.37","pdf_url":null,"source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W2044443696","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W2803918337","https://openalex.org/W2045430818"],"abstract_inverted_index":{"In":[0],"the":[1,34,50,57,77,85,141,172,176,181],"k-edge-connected":[2,43],"spanning":[3,44,52],"subgraph":[4],"(kECSS)":[5],"problem,":[6],"our":[7,36],"goal":[8,37],"is":[9,16,38,56,101,136],"to":[10,20,39,186],"compute":[11,40],"a":[12,30,41,61,92,123,156,187],"minimum-cost":[13,42],"sub-network":[14],"that":[15,139,160],"resilient":[17],"against":[18],"up":[19],"k":[21],"link":[22],"failures:":[23],"Given":[24],"an":[25,137],"n-node":[26],"m-edge":[27],"graph":[28],"with":[29,122],"cost":[31],"function":[32],"on":[33],"edges,":[35],"subgraph.":[45],"This":[46],"NP-hard":[47],"problem":[48,54],"generalizes":[49],"minimum":[51],"tree":[53],"and":[55],"\"uniform":[58],"case\"":[59],"of":[60,65,73,88,95,116,127,149,175,189],"much":[62],"broader":[63],"class":[64,87],"survival":[66],"network":[67],"design":[68],"problems":[69],"(SNDP).":[70],"A":[71,112],"factor":[72,188],"two":[74],"has":[75],"remained":[76],"best":[78],"approximation":[79,125,158,182],"ratio":[80,183],"for":[81,84,91,167],"polynomial-time":[82],"algorithms":[83],"whole":[86],"SNDP,":[89],"even":[90],"special":[93],"case":[94],"2ECSS.":[96],"The":[97],"fastest":[98],"2-approximation":[99],"algorithm":[100,138,159],"however":[102],"rather":[103],"slow,":[104],"taking":[105],"O(mn":[106],"k)":[107],"time":[108,114,147,163,174],"[Khuller,":[109],"Vishkin,":[110],"STOC'92].":[111],"faster":[113],"complexity":[115],"O(n\u00b2)":[117],"can":[118,152],"be":[119,153],"obtained,":[120],"but":[121],"higher":[124],"guarantee":[126],"(2k-1)":[128],"[Gabow,":[129],"Goemans,":[130],"Williamson,":[131],"IPCO'93].":[132],"Our":[133],"main":[134],"contribution":[135],"(1+\u03b5)-approximates":[140],"optimal":[142],"fractional":[143],"solution":[144],"in":[145,162],"\u00d5(m/\u03b5\u00b2)":[146],"(independent":[148],"k),":[150],"which":[151],"turned":[154],"into":[155],"(2+\u03b5)":[157],"runs":[161],"\u00d5(m/(\u03b5\u00b2)":[164],"+":[165],"{k\u00b2n^{1.5}}/\u03b5\u00b2)":[166],"(integral)":[168],"kECSS;":[169],"this":[170],"improves":[171],"running":[173],"aforementioned":[177],"results":[178],"while":[179],"keeping":[180],"arbitrarily":[184],"close":[185],"two.":[190]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2022-06-13T00:00:00"}