{"id":"https://openalex.org/W7140165524","doi":"https://doi.org/10.48550/arxiv.2603.21442","title":"Finding Minimum Distance Preservers: A Parameterized Study","display_name":"Finding Minimum Distance Preservers: A Parameterized Study","publication_year":2026,"publication_date":"2026-03-22","ids":{"openalex":"https://openalex.org/W7140165524","doi":"https://doi.org/10.48550/arxiv.2603.21442"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.21442","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.21442","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":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.2603.21442","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Simonov, Kirill","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Simonov, Kirill","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Soheil, Farehe","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Soheil, Farehe","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Verma, Shaily","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Verma, Shaily","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.6721000075340271,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.6721000075340271,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.25699999928474426,"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.016899999231100082,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.8183000087738037},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.7260000109672546},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5619999766349792},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.5103999972343445},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40610000491142273},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.39640000462532043},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.37049999833106995}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8183000087738037},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7885000109672546},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.73580002784729},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7260000109672546},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5619999766349792},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.5103999972343445},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47850000858306885},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40610000491142273},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.39640000462532043},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.37049999833106995},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.35760000348091125},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.34130001068115234},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.311599999666214},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.29490000009536743},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.29249998927116394},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.26809999346733093},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.2565000057220459},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.2563000023365021}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.21442","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.21442","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":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.21442","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.21442","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":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"For":[0],"a":[1,6,11,15,31,44,64,125],"given":[2,59],"graph":[3,85],"$G$":[4,18],"and":[5,43,73,109,115,143,156,234],"subset":[7],"of":[8,17,26,55,67,79,90,119,137,163,172,180,196,210,232,237],"vertices":[9,25,56],"$S$,":[10,42,58],"\\emph{distance":[12],"preserver}":[13],"is":[14,69,192,202],"subgraph":[16],"that":[19],"preserves":[20,36,49],"shortest":[21],"paths":[22],"between":[23,30,38,52],"the":[24,61,77,87,92,103,117,135,164,170,174,181,207,211,214,219,230,235,238],"$S$.":[27],"We":[28,101,123],"distinguish":[29],"\\emph{subsetwise}":[32],"distance":[33,46,80,94],"preserver,":[34,47],"which":[35,48],"distances":[37,50],"all":[39],"pairs":[40,54],"in":[41,57,60],"\\emph{pairwise}":[45],"only":[51],"specific":[53],"input.":[62],"While":[63],"large":[65],"body":[66],"work":[68],"dedicated":[70],"to":[71,131],"upper":[72],"lower":[74],"bounds":[75],"on":[76,161,178,187,194],"size":[78],"preservers":[81],"and,":[82],"more":[83],"generally,":[84],"spanners,":[86],"computational":[88,121],"complexity":[89,127],"finding":[91],"minimum":[93],"preserver":[95],"has":[96],"received":[97],"comparatively":[98],"little":[99],"attention.":[100],"consider":[102],"respective":[104],"\\scup{Subsetwise":[105],"Distance":[106,111],"Preserver}\\xspace":[107,112],"(\\scup{SDP}\\xspace)":[108],"\\scup{Pairwise":[110],"(\\scup{PDP}\\xspace)":[113],"problems":[114,175,224],"initiate":[116],"study":[118],"their":[120],"complexity.":[122],"provide":[124],"detailed":[126],"landscape":[128],"with":[129],"respect":[130],"natural":[132],"parameters,":[133],"including":[134],"number":[136,171,231],"terminals,":[138,173],"solution":[139],"size,":[140],"vertex":[141,197,208,215],"cover,":[142],"treewidth.":[144],"Our":[145],"main":[146],"contributions":[147],"are":[148,158,176,225],"as":[149],"follows:":[150],"\\begin{itemize}":[151],"\\setlength{\\itemsep}{0.5em}":[152],"\\item":[153,190,222],"Both":[154,223],"\\scup{PDP}\\xspace":[155,191],"\\scup{SDP}\\xspace":[157,201],"\\nph\\":[159,193],"even":[160],"subgraphs":[162,179],"grid.":[165],"Moreover,":[166],"when":[167,204,227],"parameterized":[168,205,228],"by":[169,206,229],"\\wh{1}\\":[177],"grid,":[182],"while":[183,200],"they":[184],"become":[185],"\\textsc{FPT}\\":[186,203,226],"full":[188],"grids.":[189],"graphs":[195],"cover":[198,209,216],"$3$,":[199],"graph.":[212,239],"Thus,":[213],"parameter":[217],"distinguishes":[218],"two":[220],"variants.":[221],"terminals":[233],"treewidth":[236],"\\end{itemize}":[240]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-03-25T00:00:00"}