{"id":"W2025143052","doi":"10.1016/j.tcs.2012.11.037","title":"A combinatorial 2.375-approximation algorithm for the facility location problem with submodular penalties","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Facility location problem; Greedy algorithm; Approximation algorithm; Combinatorial algorithms; Mathematics; Dual (grammatical number); Scheme (mathematics); Combinatorial method; Mathematical optimization; Combinatorial optimization; Algorithm; Computer science; Combinatorics","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.001929602,0.002290978,0.002957626,0.001452863,0.001258283,0.003223696,0.004834349,0.003716412,0.02066733],"category_scores_gemma":[0.00588436,0.00113795,0.001961139,0.003130476,0.0009585803,0.003696967,0.002734381,0.00337209,0.003592867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004157829,"about_ca_system_score_gemma":0.005713246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01067095,"about_ca_topic_score_gemma":0.01409653,"domain_scores_codex":[0.9981186,0.0005474359,0.00008455972,0.0004317371,0.000371922,0.0004457002],"domain_scores_gemma":[0.9977691,0.001293521,0.0001494219,0.0003456153,0.0002186151,0.0002237476],"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.001840714,0.001523708,0.001498039,0.0005413152,0.0001545553,0.0001966047,0.0002175774,0.557074,0.003630699,0.04643682,0.04686648,0.3400196],"study_design_scores_gemma":[0.0003933787,0.0001417517,0.0003239216,0.0000324105,0.00004134766,0.00009790654,0.00008258548,0.964843,0.000721494,0.02997274,0.003327321,0.00002214164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06823514,0.001756391,0.8814495,0.003254686,0.0005102988,0.000631023,0.001630267,0.004612259,0.03792036],"genre_scores_gemma":[0.2147681,0.0004030591,0.7689229,0.0008826738,0.0001848119,0.0006723124,0.002296894,0.0006646252,0.01120468],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02066733,"threshold_uncertainty_score":0.06913918,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01596619557701328,"score_gpt":0.2262193664990013,"score_spread":0.2102531709219881,"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."}}