{"id":"W1964276725","doi":"10.1007/s00453-011-9526-1","title":"A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Approximation algorithm; Theory of computation; Facility location problem; Mathematics; Linear programming relaxation; Relaxation (psychology); Dual (grammatical number); Exponential function; Integer (computer science); Algorithm; Mathematical optimization; Function (biology); Combinatorics; Linear programming; Computer science","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.000690638,0.0002670158,0.0002302138,0.0001067724,0.0005528424,0.000190219,0.0009933156,0.00008496291,0.00002133302],"category_scores_gemma":[0.00002822983,0.0001807702,0.0001057223,0.000651082,0.0002640274,0.0007632399,0.0002055229,0.0002111821,0.00002560478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005733658,"about_ca_system_score_gemma":0.0001441685,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001496305,"about_ca_topic_score_gemma":0.00002084171,"domain_scores_codex":[0.9980443,0.00008293424,0.0003476155,0.000616629,0.0004469774,0.0004616073],"domain_scores_gemma":[0.9982314,0.0001707017,0.0001835248,0.0008713101,0.0004482163,0.00009489096],"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.00002475733,0.0002131201,0.00003705046,0.0000509795,0.00009751095,0.000004164252,0.003409035,0.00004961311,0.00002505147,0.0433861,0.0002602071,0.9524424],"study_design_scores_gemma":[0.001002374,0.0005497313,0.00198796,0.00003675807,0.00005845368,0.0000929055,0.000399273,0.9365055,0.004818774,0.04891004,0.005110931,0.0005273167],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004401905,0.0001862132,0.9965393,0.0006001898,0.0002172929,0.001249254,0.00003988004,0.000275993,0.0004516738],"genre_scores_gemma":[0.05691547,0.00001065716,0.9419915,0.0001684386,0.0001342151,0.0005571464,0.00003617326,0.00001614118,0.0001702634],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9519151,"threshold_uncertainty_score":0.7371595,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03518398958303515,"score_gpt":0.2237815915891898,"score_spread":0.1885976020061547,"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."}}