{"id":"W1991566967","doi":"10.1016/j.tcs.2014.09.045","title":"Primal–dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach","year":2014,"lang":"en","type":"article","venue":"Theoretical 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 New Brunswick","funders":"Beijing University of Technology; Beijing Municipal Commission of Education; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Facility location problem; Approximation algorithm; Dual (grammatical number); Oracle; Mathematical optimization; Greedy algorithm; Computer science; Algorithm; Stochastic approximation; Mathematics; Key (lock)","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":[],"consensus_categories":[],"category_scores_codex":[0.0042198,0.000209463,0.0001800002,0.0001541854,0.000802574,0.0005182186,0.0006806579,0.00004202493,0.00006499609],"category_scores_gemma":[0.0001514472,0.0001485787,0.00007175987,0.001006491,0.001252442,0.0009425725,0.0004479492,0.0001278322,0.0001787783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005520027,"about_ca_system_score_gemma":0.00003606836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001233745,"about_ca_topic_score_gemma":0.00001180526,"domain_scores_codex":[0.997752,0.00004287919,0.0003951612,0.0006393321,0.0007082151,0.0004624573],"domain_scores_gemma":[0.998674,0.00009977221,0.00009356355,0.0005525794,0.0005437186,0.0000363512],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001170807,0.0001577147,0.00002093594,0.00009913087,0.000006821697,5.771253e-8,0.0001145937,0.003718714,0.00003018826,0.680443,0.0001159971,0.3152812],"study_design_scores_gemma":[0.0003893386,0.00003880933,0.0009505299,0.000008474177,0.00002747663,0.000001363552,0.00005025691,0.9476771,0.00004714511,0.04912432,0.001482006,0.0002031556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002015126,0.000007060627,0.9913189,0.001681143,0.000449599,0.001107102,0.000004694754,0.0001568804,0.003259473],"genre_scores_gemma":[0.8508541,5.71068e-7,0.1473515,0.001021187,0.0005452671,0.0001397251,0.00004445102,0.000008409575,0.00003474445],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9439584,"threshold_uncertainty_score":0.6172832,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0283460097376509,"score_gpt":0.2431687245296106,"score_spread":0.2148227147919597,"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."}}