{"id":"https://openalex.org/W7225463556","doi":"https://doi.org/10.5281/zenodo.24027503","title":"The worst case of the Karmarkar-Karp differencing method is 7/6 for three parts and 11/9 for four","display_name":"The worst case of the Karmarkar-Karp differencing method is 7/6 for three parts and 11/9 for four","publication_year":2026,"publication_date":"2026-11-07","ids":{"openalex":"https://openalex.org/W7225463556","doi":"https://doi.org/10.5281/zenodo.24027503"},"language":"en","primary_location":{"id":"doi:10.5281/zenodo.24027503","doi":"https://doi.org/10.5281/zenodo.24027503","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24027503","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.5281/zenodo.24027503","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5119746719","display_name":"Kundan Baliga","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Baliga, Kundan","raw_affiliation_strings":["University of Illinois Urbana-Champaign"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois Urbana-Champaign","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5160685850","display_name":"Aiden Xie","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xie, Aiden","raw_affiliation_strings":["Georgia Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5160585827","display_name":"Aditya Byju","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Byju, Aditya","raw_affiliation_strings":["Georgia Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"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/T12176","display_name":"Optimization and Packing Problems","score":0.7167999744415283,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.7167999744415283,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.18880000710487366,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.011599999852478504,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/worst-case-ratio","display_name":"worst-case ratio","score":0.8140000104904175},{"id":"https://openalex.org/keywords/tie-breaking-rules","display_name":"tie-breaking rules","score":0.8550000190734863},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.6309999823570251}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5551000237464905},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5460000038146973},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.47620001435279846},{"id":"https://openalex.org/C96865113","wikidata":"https://www.wikidata.org/wiki/Q2946816","display_name":"Certificate","level":2,"score":0.4674000144004822},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4616999924182892},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43799999356269836},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43389999866485596},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4163999855518341},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36010000109672546},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2865000069141388},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.272599995136261},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.27160000801086426},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.27090001106262207},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2522999942302704}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.5281/zenodo.24027503","doi":"https://doi.org/10.5281/zenodo.24027503","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24027503","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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"}],"best_oa_location":{"id":"doi:10.5281/zenodo.24027503","doi":"https://doi.org/10.5281/zenodo.24027503","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24027503","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1517687623","https://openalex.org/W2016357237","https://openalex.org/W2156172303","https://openalex.org/W2398806436","https://openalex.org/W2040513782","https://openalex.org/W1649222193","https://openalex.org/W1909318870","https://openalex.org/W2018838693","https://openalex.org/W2204911212","https://openalex.org/W1580817551"],"abstract_inverted_index":{"Multiway":[0],"number":[1],"partitioning":[2],"splits":[3],"numbers":[4,116,137],"into":[5,246],"m":[6,39,155,159,198,235,264],"parts,":[7],"minimising":[8],"the":[9,31,61,80,98,104,122,127,135,141,177,180,188,191,206,230,234,247,254,258,262,293],"largest":[10,99,108],"part":[11,100],"sum.":[12],"The":[13,110],"Karmarkar-Karp":[14],"differencing":[15,18],"method":[16],"(largest":[17],"method,":[19],"LDM)":[20],"is":[21,82,101,113,251],"a":[22,65,132,163,173,183,215,222,226,289],"classical":[23],"heuristic":[24],"for":[25,28,69,84,89,95,154,298],"it,":[26],"used":[27],"example":[29],"by":[30,162],"RL":[32],"framework":[33],"veRL":[34],"to":[35,58,144,203,221],"balance":[36],"micro-batches.":[37],"For":[38],"\u2265":[40],"3":[41,157],"parts":[42,86],"its":[43],"worst-case":[44],"ratio":[45,81,143],"has":[46],"been":[47],"open":[48],"since":[49],"at":[50,92,147],"least":[51],"2002,":[52],"between":[53],"4/3-1/(3(m-1))":[54],"and":[55,57,87,91,158,170,197,214,250,288],"4/3-1/(3m),":[56],"our":[59],"knowledge":[60],"upper":[62,295],"bound":[63,296],"had":[64],"complete":[66,290],"proof":[67,267,291],"only":[68],"one":[70,107],"tie-breaking":[71,78],"rule.":[72,301],"We":[73],"prove":[74],"that,":[75],"under":[76],"every":[77,96,218,299],"rule,":[79],"7/6":[83],"three":[85],"11/9":[88,284],"four,":[90],"most":[93,148],"4/3-1/(3m)":[94,294],"m;":[97],"also":[102],"below":[103],"average":[105],"plus":[106],"number.":[109],"key":[111],"idea":[112],"that":[114,130,292],"small":[115],"cannot":[117],"hurt:":[118],"either":[119],"they":[120],"keep":[121],"final":[123],"imbalance":[124],"small,":[125],"or":[126],"result":[128],"equals":[129],"of":[131,233],"run":[133],"on":[134],"large":[136],"alone.":[138],"This":[139],"reduces":[140],"exact":[142],"instances":[145],"with":[146,187,201,239,253],"3m":[149],"numbers,":[150],"which":[151,244],"we":[152],"settle":[153],"=":[156,160,195,199,236,265,283],"4":[161,200,237,266],"computer":[164],"search":[165,189,238],"whose":[166],"certificates":[167,193],"are":[168],"archived":[169,192],"re-checked":[171],"without":[172],"linear-programming":[174],"solver.":[175],"Files:":[176],"paper":[178],"(PDF);":[179],"arXiv":[181],"source;":[182],"supplement":[184],"(MIT":[185],"license)":[186],"code,":[190],"(m":[194],"3,":[196],"up":[202],"ten":[204],"items),":[205],"solver-free":[207],"checker,":[208],"separately":[209],"written":[210],"re-checking":[211],"programs,":[212],"logs,":[213],"README":[216],"mapping":[217],"computational":[219],"claim":[220],"command;":[223],"and,":[224],"as":[225],"separate":[227],"file,":[228],"ldm-ratio-v1.1-m4n11-certificates.zip,":[229],"certificate":[231],"archive":[232],"eleven":[240],"items":[241],"(20":[242],"files),":[243],"unzips":[245],"supplement's":[248],"results/m4/dump/u/":[249],"checked":[252,270],"command":[255],"given":[256],"in":[257],"README.":[259],"With":[260],"it":[261],"whole":[263],"can":[268],"be":[269],"from":[271],"stored":[272],"data.":[273],"SHA256SUMS":[274],"lists":[275],"all":[276],"four":[277],"files.":[278],"Version":[279],"1.1:":[280],"adds":[281],"R(4)":[282],"(every":[285],"tie":[286,300],"rule)":[287],"holds":[297]},"counts_by_year":[],"updated_date":"2026-11-09T13:22:03.289127","created_date":"2026-11-08T00:00:00"}