{"id":"W2132274124","doi":"10.1007/s00453-004-1113-2","title":"The Power of Priority Algorithms for Facility Location and Set Cover","year":2004,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Set cover problem; Facility location problem; Greedy algorithm; Theory of computation; Cover (algebra); Focus (optics); Class (philosophy); Algorithm; Approximation algorithm; Set (abstract data type); Covering problems; Computer science; Time complexity; Mathematical optimization; Dominating set; Point (geometry); Vertex cover; Mathematics; Theoretical computer science; Graph","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.0006078284,0.0001601429,0.0001983723,0.00005461107,0.0003927792,0.0001221608,0.0006895355,0.00007791161,0.000003232344],"category_scores_gemma":[0.0001279853,0.0001242506,0.00009117654,0.0003819376,0.0003064519,0.0003248733,0.0002475635,0.0001386533,0.000009574549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004686995,"about_ca_system_score_gemma":0.0001363632,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007896932,"about_ca_topic_score_gemma":0.00001003374,"domain_scores_codex":[0.9986292,0.00004494625,0.0003216964,0.0004035989,0.0002890243,0.0003115169],"domain_scores_gemma":[0.9985217,0.000328979,0.0001303681,0.0006530223,0.0002766805,0.00008922637],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005225726,0.0002991695,0.0001702947,0.000110497,0.0001425888,0.000005082214,0.003488212,0.000265967,0.0003526439,0.3968437,0.001050369,0.5972192],"study_design_scores_gemma":[0.004881042,0.001231443,0.01864505,0.0001043928,0.00005869498,0.0001067284,0.0004882529,0.1316541,0.02165277,0.7393107,0.08070848,0.001158383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008330978,0.0004039631,0.9882885,0.001736914,0.0004750741,0.0004635199,0.00008915509,0.00008201376,0.0001298873],"genre_scores_gemma":[0.7977502,0.00009461364,0.2016108,0.0002286839,0.0000913348,0.00007062107,0.00001710248,0.00001133231,0.0001252776],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7894192,"threshold_uncertainty_score":0.5066794,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02472507854586655,"score_gpt":0.2716010943664571,"score_spread":0.2468760158205906,"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."}}