{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007542692,0.001601353,0.002994078,0.002379243,0.002983182,0.00857376,0.00565678,0.00342313,0.009671121],"category_scores_gemma":[0.04774734,0.001414182,0.002387322,0.004440474,0.00555674,0.02727931,0.005185626,0.007733163,0.001875748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004778096,"about_ca_system_score_gemma":0.003858923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004157521,"about_ca_topic_score_gemma":0.003199164,"domain_scores_codex":[0.9927549,0.002819506,0.0003194463,0.001251738,0.002012967,0.0008415382],"domain_scores_gemma":[0.9462527,0.04135493,0.002137745,0.006694828,0.001831211,0.001728531],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004366575,0.0001106074,0.0007169064,0.000249737,0.00005904193,0.00004017339,0.0002543539,0.03999197,0.0008981093,0.9008102,0.006725672,0.04970654],"study_design_scores_gemma":[0.00004888374,0.00003335276,0.00009795699,0.00001783596,0.0000222634,0.00003956122,0.00003720944,0.09011622,0.0004666811,0.9061219,0.002984122,0.00001400048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03296724,0.0029055,0.9314469,0.005896895,0.0005856607,0.00008409849,0.0002803494,0.0006648575,0.0251685],"genre_scores_gemma":[0.6671596,0.004718523,0.3049464,0.001500198,0.002830292,0.0002619409,0.0007813819,0.0008524929,0.01694922],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009671121,"threshold_uncertainty_score":0.03988999,"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."}}