{"id":"W3183449483","doi":"10.4230/lipics.icalp.2021.81","title":"Minimum-Norm Load Balancing Is (Almost) as Easy as Minimizing Makespan","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Norm (philosophy); Job shop scheduling; Approximation algorithm; Random variable; Load balancing (electrical power); Mathematics; Monotone polygon; Mathematical optimization; Combinatorics; Discrete mathematics; Minification; Computer science; Statistics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002669202,0.003062492,0.002720799,0.0007807472,0.0009749286,0.002465231,0.0023466,0.001738931,0.004325602],"category_scores_gemma":[0.01019356,0.0009460981,0.001376636,0.001748926,0.001567577,0.004479279,0.001999434,0.002578654,0.001219088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001719371,"about_ca_system_score_gemma":0.002314338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00254573,"about_ca_topic_score_gemma":0.002576201,"domain_scores_codex":[0.9974854,0.0006588753,0.0001150151,0.0007013478,0.0006274765,0.0004118783],"domain_scores_gemma":[0.9968662,0.001748247,0.0003845283,0.0004684817,0.0003274738,0.000204976],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006264113,0.0002231162,0.0006634982,0.0006793949,0.0001179301,0.0001142047,0.0001562394,0.8503946,0.004949934,0.05807022,0.01095052,0.07305384],"study_design_scores_gemma":[0.0000361472,0.0001299321,0.0002347496,0.00003670355,0.00001711227,0.00006582502,0.00004543063,0.9050209,0.001366503,0.09094641,0.002086431,0.00001376574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04238287,0.001319387,0.9401312,0.001649623,0.0003480904,0.0001596471,0.0005392664,0.00134894,0.01212094],"genre_scores_gemma":[0.6002936,0.001503014,0.3833136,0.0009431296,0.0006626245,0.0005667571,0.001563747,0.001531319,0.009622216],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004325602,"threshold_uncertainty_score":0.01447058,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00950825918348574,"score_gpt":0.23621623706637,"score_spread":0.2267079778828843,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}