{"id":"https://openalex.org/W4399520746","doi":"https://doi.org/10.1145/3618260.3649715","title":"Ghost Value Augmentation for k-Edge-Connectivity","display_name":"Ghost Value Augmentation for k-Edge-Connectivity","publication_year":2024,"publication_date":"2024-06-10","ids":{"openalex":"https://openalex.org/W4399520746","doi":"https://doi.org/10.1145/3618260.3649715"},"language":"en","primary_location":{"id":"doi:10.1145/3618260.3649715","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649715","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649715","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649715","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021573603","display_name":"D Ellis Hershkowitz","orcid":"https://orcid.org/0000-0003-0862-3715"},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Ellis Hershkowitz","raw_affiliation_strings":["Brown University, Providence, USA"],"raw_orcid":"https://orcid.org/0000-0003-0862-3715","affiliations":[{"raw_affiliation_string":"Brown University, Providence, USA","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014157604","display_name":"Nathan Klein","orcid":"https://orcid.org/0009-0003-4052-5864"},"institutions":[{"id":"https://openalex.org/I40036882","display_name":"Institute for Advanced Study","ror":"https://ror.org/00f809463","country_code":"US","type":"facility","lineage":["https://openalex.org/I40036882"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nathan Klein","raw_affiliation_strings":["Institute for Advanced Study, Princeton, USA"],"raw_orcid":"https://orcid.org/0009-0003-4052-5864","affiliations":[{"raw_affiliation_string":"Institute for Advanced Study, Princeton, USA","institution_ids":["https://openalex.org/I40036882"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033406324","display_name":"Rico Zenklusen","orcid":"https://orcid.org/0000-0002-7148-9304"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Rico Zenklusen","raw_affiliation_strings":["ETH Zurich, Zurich, Switzerland"],"raw_orcid":"https://orcid.org/0000-0002-7148-9304","affiliations":[{"raw_affiliation_string":"ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.638,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.70208776,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1853","last_page":"1864"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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/T12288","display_name":"Optimization and Search Problems","score":0.9993000030517578,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6764456033706665},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.668060839176178},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6248047351837158},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6086469888687134},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4716562330722809},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4497600793838501},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43049055337905884},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.42328760027885437},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19023814797401428}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6764456033706665},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.668060839176178},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6248047351837158},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6086469888687134},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4716562330722809},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4497600793838501},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43049055337905884},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.42328760027885437},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19023814797401428},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3618260.3649715","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649715","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649715","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:www.research-collection.ethz.ch:20.500.11850/680547","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11850/680547","pdf_url":null,"source":{"id":"https://openalex.org/S4306402302","display_name":"Repository for Publications and Research Data (ETH Zurich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I35440088","host_organization_name":"ETH Zurich","host_organization_lineage":["https://openalex.org/I35440088"],"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":"STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"doi:10.3929/ethz-b-000680547","is_oa":true,"landing_page_url":"https://doi.org/10.3929/ethz-b-000680547","pdf_url":null,"source":{"id":"https://openalex.org/S7407051236","display_name":"ETH Z\u00fcrich Research Collection","issn_l":null,"issn":[],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.1145/3618260.3649715","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649715","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649715","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1567561438","display_name":null,"funder_award_id":"1926686","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G2473015519","display_name":null,"funder_award_id":"1926686","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3113807307","display_name":"Fundamental Problems at the Interface of Combinatorial Optimization with Integer Programming and Online Optimization","funder_award_id":"817750","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G4453603538","display_name":null,"funder_award_id":"817750","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G4509680172","display_name":null,"funder_award_id":"1762114","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5349147518","display_name":null,"funder_award_id":"-1762114","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5712563980","display_name":null,"funder_award_id":"1813135","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6684323344","display_name":null,"funder_award_id":"DMS-1926686","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G83575632","display_name":null,"funder_award_id":"200021_184622","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G8497923736","display_name":null,"funder_award_id":"DGE-1762114","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4399520746.pdf","grobid_xml":"https://content.openalex.org/works/W4399520746.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W1752817158","https://openalex.org/W1965398738","https://openalex.org/W1984289304","https://openalex.org/W1990865893","https://openalex.org/W1999799345","https://openalex.org/W2004163233","https://openalex.org/W2012329067","https://openalex.org/W2033691165","https://openalex.org/W2038858023","https://openalex.org/W2042706982","https://openalex.org/W2051699458","https://openalex.org/W2078501279","https://openalex.org/W2083162966","https://openalex.org/W2092113566","https://openalex.org/W2112594285","https://openalex.org/W2117754372","https://openalex.org/W2131926707","https://openalex.org/W2134875769","https://openalex.org/W2150516767","https://openalex.org/W2159115597","https://openalex.org/W2159448554","https://openalex.org/W2172955861","https://openalex.org/W2176322034","https://openalex.org/W2178196238","https://openalex.org/W2300052872","https://openalex.org/W2551585134","https://openalex.org/W2552451242","https://openalex.org/W2571094786","https://openalex.org/W2803918337","https://openalex.org/W2963428578","https://openalex.org/W3122114375","https://openalex.org/W3163298847","https://openalex.org/W3164510497","https://openalex.org/W3166580633","https://openalex.org/W3167350281","https://openalex.org/W3182381989","https://openalex.org/W3189164058","https://openalex.org/W4210415448","https://openalex.org/W4309876880","https://openalex.org/W6847105711"],"related_works":["https://openalex.org/W4300899577","https://openalex.org/W3194471551","https://openalex.org/W4375956809","https://openalex.org/W1581373162","https://openalex.org/W1973978937","https://openalex.org/W121594594","https://openalex.org/W2784911598","https://openalex.org/W4287023968","https://openalex.org/W4297950433","https://openalex.org/W4286909116"],"abstract_inverted_index":{"We":[0],"give":[1],"a":[2,14,36,78,108,112,119,126,140],"poly-time":[3],"algorithm":[4,114,129],"for":[5,46,62,82,115,144],"the":[6,21,25,31,56,65,83,104,155],"k-edge-connected":[7,87],"spanning":[8,88],"subgraph":[9],"(k-ECSS)":[10],"problem":[11,86],"that":[12,44,73,80,147],"returns":[13],"solution":[15],"of":[16,60,68,74,121,130],"cost":[17],"no":[18],"greater":[19],"than":[20],"cheapest":[22],"(k+10)-ECSS":[23,69],"on":[24],"same":[26,105],"graph.":[27],"Our":[28,52],"approach":[29],"enhances":[30],"iterative":[32],"relaxation":[33],"framework":[34],"with":[35],"new":[37],"ingredient,":[38],"which":[39,91,117],"we":[40,110,138],"call":[41],"ghost":[42],"values,":[43],"allows":[45],"high":[47],"sparsity":[48],"in":[49,158],"intermediate":[50],"problems.":[51],"guarantees":[53],"improve":[54],"upon":[55,125],"best-known":[57],"approximation":[58,149],"factor":[59,157],"2":[61],"k-ECSS":[63,95],"whenever":[64],"optimal":[66],"value":[67],"is":[70,77,92,151],"close":[71],"to":[72,94,154],"k-ECSS.":[75],"This":[76],"property":[79],"holds":[81],"closely":[84],"related":[85],"multi-subgraph":[89],"(k-ECSM),":[90],"identical":[93],"except":[96],"edges":[97],"can":[98],"be":[99],"selected":[100],"multiple":[101],"times":[102],"at":[103],"cost.":[106],"As":[107],"consequence,":[109],"obtain":[111],"1+O(1/k)-approximation":[113],"k-ECSM,":[116,145],"resolves":[118],"conjecture":[120],"Pritchard":[122],"and":[123,135],"improves":[124],"recent":[127],"1+O(1/\u221ak)-approximation":[128],"Karlin,":[131],"Klein,":[132],"Oveis":[133],"Gharan,":[134],"Zhang.":[136],"Moreover,":[137],"present":[139],"matching":[141],"lower":[142],"bound":[143],"showing":[146],"our":[148],"ratio":[150],"tight":[152],"up":[153],"constant":[156],"O(1/k),":[159],"unless":[160],"P=NP.":[161]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-06-14T07:44:22.658603","created_date":"2025-10-10T00:00:00"}