{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001119939,0.000361552,0.0004027422,0.0003200038,0.000298685,0.0002426109,0.001939561,0.0002072863,0.00002955347],"category_scores_gemma":[0.0002111016,0.0002687657,0.0001171241,0.0004669784,0.001102361,0.0002880412,0.0007029066,0.0005087908,0.00001044497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001022546,"about_ca_system_score_gemma":0.0001704391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001362575,"about_ca_topic_score_gemma":0.000008538748,"domain_scores_codex":[0.9973618,0.00004080764,0.0004148634,0.001060833,0.0007389931,0.0003826906],"domain_scores_gemma":[0.9965401,0.001526398,0.0002574403,0.001248343,0.0003408283,0.00008692201],"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.00001659399,0.00008728087,0.00003505561,0.0001248481,0.00002758343,0.00000775485,0.002475293,0.006085136,0.00002441497,0.3418874,0.0002076146,0.6490211],"study_design_scores_gemma":[0.0002361372,0.0003263391,0.0002642803,0.000182481,0.000006099396,0.00001573468,2.916879e-7,0.5491856,0.0004786343,0.4473532,0.001589676,0.0003614374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002179174,0.000216059,0.9963364,0.0009728235,0.0008365582,0.0006521227,0.00006059189,0.00004975365,0.0006577493],"genre_scores_gemma":[0.6001694,0.0001126557,0.3959274,0.002870787,0.000285839,0.00004396317,0.00001457614,0.00003416814,0.0005412516],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6486596,"threshold_uncertainty_score":0.9999765,"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."}}