{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023969,0.0001362324,0.0001112043,0.00009236085,0.0006658019,0.0003432886,0.000505364,0.00002581596,0.00007134741],"category_scores_gemma":[0.00008149086,0.0000845294,0.00003524634,0.0007557893,0.001040008,0.001387964,0.0002132123,0.0000778211,0.0001034581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004421385,"about_ca_system_score_gemma":0.00002822361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005860272,"about_ca_topic_score_gemma":0.000004682194,"domain_scores_codex":[0.9985539,0.00001732795,0.000209854,0.000284656,0.000529098,0.0004051155],"domain_scores_gemma":[0.9990523,0.00005896983,0.00005586617,0.0003439578,0.0004601102,0.00002880476],"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.00002035595,0.00009648414,0.0002209258,0.00006696749,0.000006735166,4.63244e-8,0.00015475,0.000705284,0.000008487364,0.9354169,0.0001171926,0.06318581],"study_design_scores_gemma":[0.0003909512,0.00003651241,0.003142311,0.0000135002,0.00003396043,7.471864e-7,0.00009787956,0.9483747,0.00009133673,0.04261363,0.005022178,0.0001823217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01503612,0.0000255804,0.9803131,0.001651037,0.0009150398,0.000867828,0.00000201551,0.0001014646,0.001087762],"genre_scores_gemma":[0.9866224,0.00000111779,0.01217848,0.0004816019,0.000578727,0.0001071911,0.00001410467,0.000005388347,0.00001097183],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9715863,"threshold_uncertainty_score":0.5120877,"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."}}