{"id":"W43978825","doi":"10.1007/978-3-642-31155-0_21","title":"New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Approximation algorithm; Generalization; Facility location problem; Euclidean geometry; Constant (computer programming); Computer science; Hardness of approximation; Reduction (mathematics); Polynomial-time approximation scheme; Time complexity; Function (biology); Packing problems; Euclidean distance; Algorithm; Mathematical optimization; Mathematics; Artificial intelligence; Geometry; Mathematical analysis","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.002605847,0.002660672,0.002614817,0.001722643,0.001241292,0.004005677,0.00663375,0.003105983,0.0111726],"category_scores_gemma":[0.01240882,0.001448177,0.002047196,0.005274377,0.001277914,0.006228174,0.003037535,0.005803148,0.002043202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004128757,"about_ca_system_score_gemma":0.003086922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008924115,"about_ca_topic_score_gemma":0.01104615,"domain_scores_codex":[0.9978505,0.000580808,0.0001092796,0.0004388421,0.0006508924,0.0003696058],"domain_scores_gemma":[0.995156,0.003043521,0.0003102802,0.0005904631,0.0006407717,0.0002590122],"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.0005118168,0.0005323126,0.0006715378,0.0004163113,0.0001120483,0.0001088916,0.0002067783,0.605262,0.001303084,0.1016379,0.02753701,0.2617003],"study_design_scores_gemma":[0.00007196599,0.00003661693,0.00008581569,0.00002724569,0.00002306953,0.00004585553,0.00003193292,0.9561391,0.0002918464,0.03991747,0.003316625,0.00001254878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009384035,0.001595096,0.9773514,0.0007374244,0.0003377073,0.0001240177,0.0003128177,0.0007400212,0.009417533],"genre_scores_gemma":[0.1158259,0.001492434,0.8670183,0.0004063113,0.0004292471,0.0004779919,0.001470051,0.0004964822,0.0123834],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0111726,"threshold_uncertainty_score":0.03737605,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03992794652014285,"score_gpt":0.2411881084348769,"score_spread":0.2012601619147341,"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."}}