{"id":"https://openalex.org/W7160832824","doi":"https://doi.org/10.48550/arxiv.2605.06899","title":"Polylogarithmic Approximation for Covering and Connecting Multi-Interface Networks","display_name":"Polylogarithmic Approximation for Covering and Connecting Multi-Interface Networks","publication_year":2026,"publication_date":"2026-05-07","ids":{"openalex":"https://openalex.org/W7160832824","doi":"https://doi.org/10.48550/arxiv.2605.06899"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.06899","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.06899","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.2605.06899","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5125990381","display_name":"Micha\u0142 Szyfelbein","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Szyfelbein, Micha\u0142","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5115817675","display_name":"Camille Richer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Richer, Camille","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"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.8044999837875366,"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.8044999837875366,"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.03189999982714653,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.026399999856948853,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6888999938964844},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.6434000134468079},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6365000009536743},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.5800999999046326},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5587000250816345},{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.49390000104904175},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.49219998717308044},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.44670000672340393},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.43230000138282776}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6888999938964844},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.6434000134468079},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6365000009536743},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.5800999999046326},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5634999871253967},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5587000250816345},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.49390000104904175},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.49219998717308044},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.44670000672340393},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.43230000138282776},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41600000858306885},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41350001096725464},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.4058000147342682},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4050999879837036},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3921999931335449},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.3880999982357025},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34599998593330383},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.3409999907016754},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.3301999866962433},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.29319998621940613},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.28439998626708984},{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.2838999927043915},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2815999984741211},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.27410000562667847},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.26919999718666077},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2671999931335449},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.2612999975681305},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.257099986076355},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.25690001249313354},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.25679999589920044},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.2565999925136566}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.06899","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.06899","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.2605.06899","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.06899","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,51,124],"study":[1],"problems":[2,12,54,127],"related":[3],"to":[4,196,252,260,273],"connecting":[5],"multi-interface":[6,57],"networks":[7],"of":[8,81,119,140,143,206],"wireless":[9],"devices.":[10],"These":[11],"are":[13,113,279],"modeled":[14],"using":[15,128],"graphs,":[16],"where":[17,173,201],"vertices":[18,39],"represent":[19,24],"the":[20,63,70,77,85,94,102,117,120,141,144,149,162,169,204,215,220,231,261,264,276],"devices":[21],"and":[22,34,60,130],"edges":[23],"potential":[25],"communication":[26],"links.":[27],"Each":[28],"vertex":[29,100],"can":[30,181,192],"activate":[31],"multiple":[32],"interfaces,":[33],"a":[35,99,137,176,211,244,269],"connection":[36,67],"between":[37],"two":[38,53,121],"is":[40,159,175,203,230,241,258],"established":[41],"if":[42],"they":[43],"share":[44],"at":[45],"least":[46],"one":[47,262],"common":[48],"active":[49],"interface.":[50],"consider":[52],"arising":[55],"in":[56,69,76,84,115],"networks:":[58],"Coverage":[59,64,150,265],"Connectivity.":[61],"In":[62,109],"problem,":[65,79,151,222],"every":[66],"defined":[68],"network":[71],"must":[72],"be":[73,88,182,194],"established,":[74],"while":[75],"Connectivity":[78,221],"groups":[80],"terminals":[82],"specified":[83],"input":[86],"should":[87,92],"connected.":[89],"The":[90,189,239,255],"solution":[91,142],"minimize":[93],"maximum":[95],"cost":[96,104,122,217],"incurred":[97,105],"by":[98,106],"or":[101],"total":[103],"all":[107],"vertices.":[108],"this":[110,152,237],"work":[111],"we":[112,131,223],"interested":[114],"approximating":[116],"former":[118],"criterions.":[123],"model":[125],"both":[126],"ILPs":[129],"design":[132],"approximation":[133,234],"algorithms":[134],"based":[135,242],"on":[136,243],"randomized":[138],"rounding":[139,256],"linear":[145],"programming":[146],"relaxation.":[147],"For":[148,219],"yields":[153],"an":[154,198,225],"$O(\\log":[155],"m)$-approximation":[156,227],"algorithm,":[157,172,200,228],"which":[158,180,229],"tight,":[160],"since":[161],"problem":[163,266],"generalizes":[164,210],"Set-Cover.":[165],"This":[166,209],"improves":[167],"upon":[168],"$O(b\\cdot\\log":[170],"n)$-approximation":[171],"$b$":[174],"certain":[177],"graph":[178],"parameter":[179],"as":[183,185],"large":[184],"$\u03a9(n)$":[186],"[Algorithmica":[187],"'12].":[188],"same":[190],"relaxation":[191,247],"also":[193],"used":[195],"get":[197],"$k$-approximation":[199],"$k$":[202],"number":[205],"different":[207],"interfaces.":[208],"similar":[212,245,259],"result":[213],"for":[214,236,263],"uniform":[216],"case.":[218],"obtain":[224],"$O(\\log^2":[226],"first":[232],"non-trivial":[233],"algorithm":[235,240],"problem.":[238],"LP":[246],"with":[248],"additional":[249],"cut":[250],"constraints":[251,278],"ensure":[253,274],"connectivity.":[254],"procedure":[257],"but":[267],"requires":[268],"more":[270],"careful":[271],"analysis":[272],"that":[275],"connectivity":[277],"satisfied.":[280]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-12T00:00:00"}