{"id":"https://openalex.org/W7167613555","doi":"https://doi.org/10.48550/arxiv.2607.03281","title":"Optimality-Preserving Data Reduction for Maximum k-Cut (Full Version)","display_name":"Optimality-Preserving Data Reduction for Maximum k-Cut (Full Version)","publication_year":2026,"publication_date":"2026-07-03","ids":{"openalex":"https://openalex.org/W7167613555","doi":"https://doi.org/10.48550/arxiv.2607.03281"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.03281","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.03281","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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.2607.03281","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114534499","display_name":"Michael Kaibel","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kaibel, Michael","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5012801992","display_name":"Petra Mutzel","orcid":"https://orcid.org/0000-0001-7621-971X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mutzel, Petra","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.4690999984741211,"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.4690999984741211,"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.1378999948501587,"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.09650000184774399,"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/preprocessor","display_name":"Preprocessor","score":0.8497999906539917},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.7609999775886536},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.652400016784668},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6123999953269958},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.5679000020027161},{"id":"https://openalex.org/keywords/data-reduction","display_name":"Data reduction","score":0.4000000059604645},{"id":"https://openalex.org/keywords/data-pre-processing","display_name":"Data pre-processing","score":0.3862999975681305}],"concepts":[{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.8497999906539917},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.7609999775886536},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.652400016784668},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6123999953269958},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5770000219345093},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.5679000020027161},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4869000017642975},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4203999936580658},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41780000925064087},{"id":"https://openalex.org/C153914771","wikidata":"https://www.wikidata.org/wiki/Q5227343","display_name":"Data reduction","level":2,"score":0.4000000059604645},{"id":"https://openalex.org/C10551718","wikidata":"https://www.wikidata.org/wiki/Q5227332","display_name":"Data pre-processing","level":2,"score":0.3862999975681305},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.3449999988079071},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.287200003862381},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.2849000096321106},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2694999873638153},{"id":"https://openalex.org/C169272836","wikidata":"https://www.wikidata.org/wiki/Q5668307","display_name":"Variable elimination","level":3,"score":0.25839999318122864},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2526000142097473},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.2513999938964844}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.03281","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.03281","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.03281","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.03281","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"score":0.44717836380004883,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Preprocessing":[0],"has":[1],"become":[2],"an":[3,103,174],"increasingly":[4],"important":[5],"part":[6],"of":[7,43,139],"solving":[8,182],"Maximum":[9,30,73,117,120,153],"Cut":[10,118],"to":[11,16,40,119,185],"optimality,":[12],"enabling":[13],"exact":[14,24,175],"solvers":[15,25],"tackle":[17],"significantly":[18,168],"larger":[19],"instances.":[20],"This":[21],"suggests":[22],"that":[23,49,91,124],"for":[26,52,72,106,152],"the":[27,41,107,137],"more":[28,183],"general":[29],"k-Cut":[31,154],"problem":[32],"could":[33],"also":[34],"benefit":[35],"from":[36,116],"sophisticated":[37],"preprocessing.":[38],"However,":[39],"best":[42],"our":[44,125,144,171],"knowledge,":[45],"no":[46],"preprocessing":[47,114,150,172],"techniques":[48,115],"are":[50,127,166],"effective":[51],"k":[53],">":[54],"2":[55],"have":[56],"been":[57],"published.":[58],"In":[59],"this":[60],"paper,":[61],"we":[62,111,129],"introduce":[63],"structured":[64],"cut":[65,81],"sets,":[66],"a":[67,86,131,149,160],"novel":[68],"data":[69],"reduction":[70],"technique":[71],"k-Cut.":[74,121],"We":[75,142],"provide":[76],"criteria":[77],"under":[78],"which":[79],"deleting":[80],"sets":[82],"is":[83],"optimality-preserving,":[84,128],"yielding":[85],"decomposition":[87],"into":[88,102,173],"connected":[89],"components":[90],"can":[92,99],"be":[93,100],"solved":[94],"independently":[95],"and":[96,155,180],"whose":[97],"solutions":[98],"combined":[101],"optimal":[104],"solution":[105],"original":[108],"graph.":[109],"Furthermore,":[110],"extend":[112],"several":[113],"To":[122],"show":[123,156],"rules":[126],"develop":[130],"new":[132],"proof":[133],"framework":[134,151],"based":[135],"on":[136],"addition":[138],"weighted":[140],"graphs.":[141],"complement":[143],"theoretical":[145],"results":[146],"by":[147],"engineering":[148],"its":[157],"effectiveness":[158],"in":[159],"computational":[161],"study.":[162],"The":[163],"preprocessed":[164],"instances":[165,184],"typically":[167],"smaller.":[169],"Integrating":[170],"solver":[176],"yields":[177],"significant":[178],"speed-ups":[179],"enables":[181],"optimality.":[186]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-08T00:00:00"}