{"id":"https://openalex.org/W7158745895","doi":"https://doi.org/10.48550/arxiv.2604.26714","title":"On (In)approximability of MaxMin Independent Set Reconfiguration","display_name":"On (In)approximability of MaxMin Independent Set Reconfiguration","publication_year":2026,"publication_date":"2026-04-29","ids":{"openalex":"https://openalex.org/W7158745895","doi":"https://doi.org/10.48550/arxiv.2604.26714"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.26714","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.26714","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.26714","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134894921","display_name":"Hung P. Hoang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hoang, Hung P.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023178570","display_name":"Naoto Ohsaka","orcid":"https://orcid.org/0000-0001-9584-4764"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ohsaka, Naoto","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049817236","display_name":"Rin Saito","orcid":"https://orcid.org/0000-0002-3953-4339"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Saito, Rin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5134897125","display_name":"Yuma Tamura","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tamura, Yuma","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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.6122999787330627,"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.6122999787330627,"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.3010999858379364,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.014100000262260437,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/independent-set","display_name":"Independent set","score":0.7177000045776367},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6111000180244446},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5755000114440918},{"id":"https://openalex.org/keywords/control-reconfiguration","display_name":"Control reconfiguration","score":0.559499979019165},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.5443000197410583},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43070000410079956},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40639999508857727},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.3504999876022339}],"concepts":[{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.7177000045776367},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6111000180244446},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5755000114440918},{"id":"https://openalex.org/C119701452","wikidata":"https://www.wikidata.org/wiki/Q5165881","display_name":"Control reconfiguration","level":2,"score":0.559499979019165},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.5443000197410583},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5019000172615051},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4641000032424927},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43070000410079956},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40639999508857727},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4002000093460083},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.3504999876022339},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34599998593330383},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.34220001101493835},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3294999897480011},{"id":"https://openalex.org/C48145219","wikidata":"https://www.wikidata.org/wiki/Q1335365","display_name":"Security token","level":2,"score":0.3199000060558319},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.30790001153945923},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2976999878883362},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.29660001397132874},{"id":"https://openalex.org/C72319582","wikidata":"https://www.wikidata.org/wiki/Q584304","display_name":"Degenerate energy levels","level":2,"score":0.2791999876499176},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.26089999079704285},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.2606000006198883},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.26030001044273376}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.26714","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.26714","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.26714","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.26714","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":false,"raw_source_name":null,"raw_type":"Preprint"},"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":{"In":[0],"the":[1,7,39,42,58,62,66,71,100,115,156],"Independent":[2,52],"Set":[3,53],"Reconfiguration":[4,54],"problem":[5,75],"under":[6],"Token":[8],"Addition/Removal":[9],"rule,":[10],"given":[11],"a":[12,91,135],"graph":[13,83],"$G$":[14],"and":[15,20,33,108,114,128,150,167],"two":[16],"independent":[17,45,63],"sets":[18,40,64],"$I$":[19,28],"$J$":[21,30],"of":[22,61,73,102,117,164],"$G$,":[23],"we":[24,89,133,154],"want":[25],"to":[26,56,106,121,160],"transform":[27],"into":[29],"by":[31],"adding":[32],"removing":[34],"vertices,":[35],"such":[36],"that":[37],"all":[38],"throughout":[41],"process":[43,67],"are":[44],"sets.":[46],"Its":[47],"approximate":[48],"version":[49],"called":[50],"MaxMin":[51],"aims":[55],"maximise":[57],"minimum":[59],"size":[60],"in":[65],"above.":[68],"We":[69],"study":[70],"(in)approximability":[72],"this":[74],"for":[76,139,147],"general":[77,87],"graphs":[78,141,149,163],"as":[79,81,142,144],"well":[80,143],"restricted":[82],"classes.":[84],"Firstly,":[85],"on":[86],"graphs,":[88,162],"obtain":[90],"polynomial-time":[92,136],"$(n":[93],"/":[94],"\\log":[95],"n)$-factor":[96],"approximation":[97,104,119,137],"algorithm,":[98],"complementing":[99],"$\\mathsf{PSPACE}$-hardness":[101],"$n^{\u03a9(1)}$-factor":[103],"due":[105,120],"Hirahara":[107],"Ohsaka":[109],"[STOC":[110],"2024,":[111],"ICALP":[112],"2024]":[113],"$\\mathsf{NP}$-hardness":[116],"$n^{1-\\varepsilon}$-factor":[118],"Ito,":[122],"Demaine,":[123],"Harvey,":[124],"Papadimitriou,":[125],"Sideri,":[126],"Uehara,":[127],"Uno":[129],"[TCS":[130],"2011].":[131],"Secondly,":[132],"present":[134],"algorithm":[138],"degenerate":[140],"$\\mathsf{FPT}$-approximation":[145],"schemes":[146],"bounded-treewidth":[148],"$H$-minor-free":[151],"graphs.":[152,169],"Lastly,":[153],"extend":[155],"above":[157],"inapproximability":[158],"results":[159],"bounded-degree":[161],"bandwidth":[165],"$n^{\\frac{1}{2}+\u0398(1)}$,":[166],"bipartite":[168]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-01T00:00:00"}