{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002276038,0.002721448,0.00321469,0.001355773,0.001590052,0.004181356,0.006545987,0.003466527,0.009514667],"category_scores_gemma":[0.01041271,0.001113701,0.002189548,0.003703345,0.001520045,0.007883645,0.003449301,0.00444346,0.002682822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005552928,"about_ca_system_score_gemma":0.003265391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006009651,"about_ca_topic_score_gemma":0.006262099,"domain_scores_codex":[0.9965844,0.0007722102,0.0001956852,0.0009114927,0.0005738726,0.0009623673],"domain_scores_gemma":[0.9940952,0.003044725,0.0006985783,0.0012645,0.0004015437,0.000495506],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001352193,0.0007201344,0.002389339,0.001152174,0.0002274367,0.0002548767,0.0005706312,0.717512,0.004052414,0.102958,0.04244742,0.1263632],"study_design_scores_gemma":[0.0001552833,0.0001343213,0.0002879745,0.00005773237,0.0000511043,0.000227551,0.0001505652,0.8945211,0.00129918,0.09783752,0.005248474,0.00002917189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05413242,0.002170832,0.9141347,0.003750871,0.0002661066,0.0003961375,0.002923772,0.004611059,0.01761402],"genre_scores_gemma":[0.4991557,0.00114257,0.4841374,0.001183534,0.0003750943,0.0005612663,0.004419784,0.000997353,0.008027201],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009514667,"threshold_uncertainty_score":0.04028952,"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."}}