{"id":"W2802493366","doi":"10.1145/3173047","title":"Approximation Algorithms for Minimum-Load <i>k</i> -Facility Location","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Facility location problem; Approximation algorithm; Combinatorics; Line (geometry); Integer (computer science); Mathematics; Set (abstract data type); Steiner tree problem; Tree (set theory); Cover (algebra); Real line; Metric (unit); Algorithm; Computer science; Discrete mathematics; Mathematical optimization; Geometry","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006960593,0.000291419,0.0002237921,0.000280969,0.0006539476,0.0001954548,0.0004658853,0.0001246449,0.0007824439],"category_scores_gemma":[0.0001815931,0.0002990331,0.0001603401,0.0009192551,0.0001463847,0.001072482,0.00001935809,0.0001416721,0.002209577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000161595,"about_ca_system_score_gemma":0.00005652881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006506072,"about_ca_topic_score_gemma":0.0004437073,"domain_scores_codex":[0.9979417,0.00001678823,0.0005056293,0.0006195865,0.0005095134,0.0004067825],"domain_scores_gemma":[0.99798,0.00004827528,0.0001031834,0.0008455868,0.0009893873,0.00003355864],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000236654,0.0009074337,0.00004083723,0.0004579546,0.0001320199,7.034594e-7,0.0003277372,0.003106709,0.0003031379,0.002339701,0.008855997,0.9832911],"study_design_scores_gemma":[0.0030955,0.0002539827,0.001971232,0.00007512303,0.0002922285,0.00000222847,0.001042895,0.541859,0.002730396,0.01023787,0.4372984,0.001141143],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005161272,0.00002737836,0.9837525,0.00398591,0.002052225,0.001233225,0.00005823594,0.0004497686,0.003279526],"genre_scores_gemma":[0.9494028,0.00003497873,0.03749792,0.00539128,0.002009025,0.001132423,0.0003509038,0.00006709548,0.00411358],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.98215,"threshold_uncertainty_score":0.9999462,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0472225791083412,"score_gpt":0.274153093749903,"score_spread":0.2269305146415618,"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."}}