{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002498561,0.001240834,0.002545571,0.001134152,0.000734841,0.002166141,0.002821775,0.00247305,0.007043283],"category_scores_gemma":[0.003863865,0.001089204,0.001210575,0.001564206,0.001026486,0.001795809,0.002420954,0.002953732,0.001088337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001933293,"about_ca_system_score_gemma":0.003111957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004774579,"about_ca_topic_score_gemma":0.004415151,"domain_scores_codex":[0.9987566,0.0005637291,0.00004275751,0.0001783334,0.0002538001,0.00020471],"domain_scores_gemma":[0.9982949,0.001087911,0.0001115302,0.0001264478,0.000217402,0.0001618298],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003677429,0.0003983939,0.0006502852,0.0002705736,0.0001036551,0.0001284923,0.00008141458,0.8721743,0.001181729,0.05322865,0.009274467,0.0621403],"study_design_scores_gemma":[0.00004409802,0.00002816055,0.00005501995,0.000009350382,0.000008775239,0.00002360915,0.00001081419,0.991729,0.0001106214,0.007474241,0.000501427,0.000004956597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01002468,0.0003369411,0.9846649,0.0004659058,0.0001082055,0.00009299645,0.0001169827,0.000265485,0.003923846],"genre_scores_gemma":[0.2685544,0.0003450046,0.7233692,0.0004343038,0.0001582025,0.0004575117,0.0005082664,0.0002060915,0.005967001],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007043283,"threshold_uncertainty_score":0.02356207,"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."}}