{"id":"W2174864496","doi":"10.1007/3-540-45753-4_5","title":"On the Power of Priority Algorithms for Facility Location and Set Cover","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Set cover problem; Greedy algorithm; Facility location problem; Cover (algebra); Computer science; Focus (optics); Class (philosophy); Covering problems; Set (abstract data type); Approximation algorithm; Mathematical optimization; Algorithm; Point (geometry); Time complexity; Theoretical computer science; Mathematics; Artificial intelligence","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.01285953,0.002403477,0.004364899,0.003112159,0.003783025,0.008068122,0.007691111,0.004261641,0.01551776],"category_scores_gemma":[0.06605218,0.0020076,0.003107003,0.006297271,0.007855896,0.02939619,0.007189311,0.009627494,0.002849885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005750358,"about_ca_system_score_gemma":0.004393688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006410156,"about_ca_topic_score_gemma":0.005451829,"domain_scores_codex":[0.9911188,0.003549685,0.0003885645,0.001084266,0.002603536,0.001255002],"domain_scores_gemma":[0.9166059,0.06954191,0.001839446,0.008177366,0.002193084,0.001642284],"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.0007232605,0.0001706846,0.0006398461,0.0003080699,0.00007175623,0.00005760454,0.0003011391,0.05103415,0.0009175866,0.8628406,0.0123742,0.07056122],"study_design_scores_gemma":[0.0001075355,0.00005013145,0.0001046797,0.00003760589,0.00003703409,0.00004813781,0.00004266364,0.1189143,0.0004621047,0.8769563,0.003219516,0.00002003982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03682238,0.006092395,0.8738477,0.007810405,0.001050186,0.0002169997,0.0003684586,0.001489339,0.0723022],"genre_scores_gemma":[0.5940554,0.00711027,0.3585886,0.002788799,0.003850578,0.0004643455,0.0008471902,0.00171665,0.03057801],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01551776,"threshold_uncertainty_score":0.06800848,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03618592476905767,"score_gpt":0.2594295306647766,"score_spread":0.223243605895719,"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."}}