{"id":"https://openalex.org/W7117015888","doi":"https://doi.org/10.48550/arxiv.2512.17904","title":"Plane Strong Connectivity Augmentation","display_name":"Plane Strong Connectivity Augmentation","publication_year":2025,"publication_date":"2025-12-19","ids":{"openalex":"https://openalex.org/W7117015888","doi":"https://doi.org/10.48550/arxiv.2512.17904"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2512.17904","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.17904","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2512.17904","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5121075430","display_name":"St\u00e9phane Bessy","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bessy, St\u00e9phane","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5121029365","display_name":"Daniel Gon\u00e7alves","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gon\u00e7alves, Daniel","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087895424","display_name":"Amadeus Reinald","orcid":"https://orcid.org/0000-0002-8108-4036"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Reinald, Amadeus","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5121051947","display_name":"Dimitrios M. Thilikos","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thilikos, Dimitrios M.","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5121075430"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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.8755000233650208,"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.8755000233650208,"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.026799999177455902,"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.02070000022649765,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.6643999814987183},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.656000018119812},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5397999882698059},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.5102999806404114},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5037000179290771},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.39309999346733093},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.33169999718666077},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.3131999969482422}],"concepts":[{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.6643999814987183},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.656000018119812},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5719000101089478},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5397999882698059},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.5102999806404114},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5037000179290771},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4065000116825104},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.39309999346733093},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.33169999718666077},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3165999948978424},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3131999969482422},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2939000129699707},{"id":"https://openalex.org/C2779304628","wikidata":"https://www.wikidata.org/wiki/Q3503480","display_name":"Face (sociological concept)","level":2,"score":0.290800005197525},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.2856999933719635},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.2849999964237213},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2786000072956085},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.27649998664855957},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.272599995136261},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.26919999718666077},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.26669999957084656},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25699999928474426},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.25619998574256897}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2512.17904","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.17904","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2512.17904","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.17904","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,12],"investigate":[1],"the":[2,155,164,171],"problem":[3,180],"of":[4,84,117,136,166],"strong":[5],"connectivity":[6,53,178],"augmentation":[7,54,179],"within":[8,48],"plane":[9,18,39,49,70,97],"oriented":[10,19,71],"graphs.":[11],"show":[13],"that":[14,32,90],"deciding":[15],"whether":[16],"a":[17,57,69,104,121,133,151,176],"graph":[20,72],"$D$":[21,73],"can":[22],"be":[23],"augmented":[24],"with":[25,75,150],"(any":[26],"number":[27,135],"of)":[28],"arcs":[29],"$X$":[30,83],"such":[31],"$D+X$":[33,91],"is":[34,42,92,103,120,170],"strongly":[35,93],"connected,":[36,94],"but":[37],"still":[38],"and":[40,79,98],"oriented,":[41],"NP-hard.":[43],"This":[44],"question":[45],"becomes":[46],"trivial":[47],"digraphs,":[50],"like":[51],"most":[52,87],"problems":[55],"without":[56],"budget":[58],"constraint.":[59],"The":[60,115],"budgeted":[61],"version,":[62],"Plane":[63],"Strong":[64],"Connectivity":[65],"Augmentation":[66],"(PSCA)":[67],"considers":[68],"along":[74],"some":[76],"integer":[77],"$k$,":[78,129],"asks":[80],"for":[81,108,126,145,175],"an":[82],"size":[85],"at":[86],"$k$":[88],"ensuring":[89],"while":[95],"remaining":[96],"oriented.":[99],"Our":[100],"main":[101],"result":[102,123],"fixed-parameter":[105],"tractable":[106],"algorithm":[107,144,174],"PSCA,":[109],"running":[110],"in":[111],"time":[112],"$2^{O(k)}":[113],"n^{O(1)}$.":[114],"cornerstone":[116],"our":[118,143,167],"procedure":[119],"structural":[122],"showing":[124],"that,":[125],"any":[127],"fixed":[128],"each":[130],"face":[131],"admits":[132],"bounded":[134],"partial":[137],"solutions":[138],"\"dominating\"":[139],"all":[140],"others.":[141],"Then,":[142],"PSCA":[146],"combines":[147],"face-wise":[148],"branching":[149],"Monte-Carlo":[152],"reduction":[153],"to":[154],"polynomial":[156],"Minimum":[157],"Dijoin":[158],"problem,":[159],"which":[160],"we":[161],"derandomize.":[162],"To":[163],"best":[165],"knowledge,":[168],"this":[169],"first":[172],"FPT":[173],"(hard)":[177],"constrained":[181],"by":[182],"planarity.":[183]},"counts_by_year":[],"updated_date":"2025-12-23T23:15:37.779995","created_date":"2025-12-23T00:00:00"}