{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001315154,0.0003181001,0.0002345366,0.0003505256,0.0003888613,0.000419798,0.0007753986,0.0001410117,0.0001784014],"category_scores_gemma":[0.00009596298,0.0002438741,0.00008072116,0.0005873073,0.0002050851,0.001032118,0.0002555888,0.0002479814,0.0002068195],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001711176,"about_ca_system_score_gemma":0.0001119236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009153018,"about_ca_topic_score_gemma":0.0006598117,"domain_scores_codex":[0.9980052,0.000005551694,0.0004380073,0.0006425174,0.0004753098,0.0004334094],"domain_scores_gemma":[0.9986392,0.00009260123,0.0001803549,0.0006028961,0.0004589371,0.00002604223],"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.00001110539,0.00002369479,0.00004496461,0.0003842084,0.00001671384,1.940729e-7,0.0002688299,0.1055276,0.00001551818,0.02462122,0.0005520275,0.868534],"study_design_scores_gemma":[0.000291441,0.00001371889,0.0003057126,0.000109084,0.00005600547,6.839969e-7,0.000002396987,0.8078587,0.00005210124,0.101669,0.08919498,0.0004461538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000225493,0.0003832128,0.9923289,0.002045409,0.001320558,0.001493029,0.000006720861,0.0001106363,0.002288962],"genre_scores_gemma":[0.4206732,0.0002370696,0.5319691,0.013984,0.01228857,0.000719274,0.001355467,0.0002101095,0.01856311],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8680878,"threshold_uncertainty_score":0.9944898,"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."}}