{"id":"https://openalex.org/W7128089114","doi":"https://doi.org/10.48550/arxiv.2602.04059","title":"Minimizing Makespan in Sublinear Time via Weighted Random Sampling","display_name":"Minimizing Makespan in Sublinear Time via Weighted Random Sampling","publication_year":2026,"publication_date":"2026-02-03","ids":{"openalex":"https://openalex.org/W7128089114","doi":"https://doi.org/10.48550/arxiv.2602.04059"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.04059","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","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":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5125239214","display_name":"Bin Fu","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Fu, Bin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055734882","display_name":"Yumei Huo","orcid":"https://orcid.org/0000-0003-3550-8843"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Huo, Yumei","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101153880","display_name":"Hairong Zhao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhao, Hairong","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5125239214"],"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.4275999963283539,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.4275999963283539,"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/T12176","display_name":"Optimization and Packing Problems","score":0.27869999408721924,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.03200000151991844,"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/job-shop-scheduling","display_name":"Job shop scheduling","score":0.8263999819755554},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.7053999900817871},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6409000158309937},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6035000085830688},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.3813999891281128},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3068999946117401},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.3050000071525574}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8263999819755554},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.7053999900817871},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6409000158309937},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6035000085830688},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5358999967575073},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5159000158309937},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.414000004529953},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39419999718666077},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3813999891281128},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3124000132083893},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3068999946117401},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.3050000071525574},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2904999852180481},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.2766000032424927},{"id":"https://openalex.org/C2779231336","wikidata":"https://www.wikidata.org/wiki/Q7534724","display_name":"Sketch","level":2,"score":0.27149999141693115},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.2680000066757202},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2680000066757202},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2669000029563904},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.2605000138282776},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.25459998846054077}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.04059","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.04059","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.04059","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":"pmh:doi:10.48550/arxiv.2602.04059","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.42914485931396484,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,160],"consider":[1],"the":[2,31,38,41,55,69,100,108,118,139],"classical":[3],"makespan":[4,57,109],"minimization":[5,110],"scheduling":[6],"problem":[7],"where":[8,33,43,71,96,120],"$n$":[9,34,44,72,121],"jobs":[10],"must":[11],"be":[12],"scheduled":[13],"on":[14],"$m$":[15],"identical":[16],"machines.":[17],"Using":[18],"weighted":[19,83,127,168],"random":[20,84,128,169,175],"sampling,":[21,85,129],"we":[22],"developed":[23],"two":[24],"sublinear":[25,149],"time":[26,89,101,150],"approximation":[27],"schemes:":[28],"one":[29],"for":[30,40,107],"case":[32,42,70,119],"is":[35,45,73,99,122],"known":[36,74],"and":[37,75,146],"other":[39],"unknown.":[46,123],"Both":[47],"algorithms":[48],"not":[49],"only":[50],"give":[51],"a":[52,61,79,87,167],"$(1+3\u03b5)$-approximation":[53],"to":[54],"optimal":[56],"but":[58],"also":[59,161],"generate":[60],"sketch":[62],"schedule.":[63],"Our":[64],"first":[65],"algorithm,":[66],"which":[67],"targets":[68],"draws":[76,133],"samples":[77,134,142],"in":[78,135,148],"single":[80],"round":[81],"under":[82],"has":[86],"running":[88],"of":[90,103,111,141],"$\\tilde{O}(\\tfrac{m^5}{\u03b5^4}":[91],"\\sqrt{n}+A(\\ceiling{m\\over":[92],"\u03b5},":[93,157],"\u03b5":[94,158],"))$,":[95],"$A(\\mathcal{N},":[97],"\u03b1)$":[98],"complexity":[102],"any":[104],"$(1+\u03b1)$-approximation":[105],"scheme":[106],"$\\mathcal{N}$":[112],"jobs.":[113],"The":[114],"second":[115],"algorithm":[116],"addresses":[117],"It":[124],"uses":[125],"adaptive":[126],"%\\textit{that":[130],"is},":[131],"it":[132],"several":[136],"rounds,":[137],"adjusting":[138],"number":[140],"after":[143],"each":[144],"round,":[145],"runs":[147],"$\\tilde{O}\\left(":[151],"\\tfrac{m^5}":[152],"{\u03b5^4}":[153],"\\sqrt{n}":[154],"+":[155],"A(\\ceiling{m\\over":[156],")\\right)$.":[159],"provide":[162],"an":[163],"implementation":[164],"that":[165],"generates":[166],"sample":[170],"using":[171],"$O(\\log":[172],"n)$":[173],"uniform":[174],"samples.":[176]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-07T00:00:00"}