{"id":"W2085731892","doi":"10.1016/j.ic.2012.08.003","title":"Efficient algorithms for the conditional covering problem","year":2012,"lang":"en","type":"article","venue":"Information and Computation","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University; University of Lethbridge","funders":"","keywords":"Vertex cover; Algorithm; Vertex (graph theory); Time complexity; Upper and lower bounds; Computer science; Combinatorics; Facility location problem; 1-center problem; Cover (algebra); Stars; Point (geometry); Efficient algorithm; Mathematics; Graph; Mathematical optimization","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.002423907,0.00147456,0.002183515,0.001452926,0.00129565,0.003024207,0.003850773,0.002122511,0.01345283],"category_scores_gemma":[0.01295461,0.001229278,0.001680264,0.003123046,0.001582848,0.005352791,0.003826519,0.003245007,0.001450899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003081926,"about_ca_system_score_gemma":0.00367441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008859284,"about_ca_topic_score_gemma":0.009638831,"domain_scores_codex":[0.9980932,0.0007314635,0.00007490307,0.0003927329,0.0003469936,0.0003606432],"domain_scores_gemma":[0.9895453,0.008261658,0.0003686581,0.001072657,0.0004529009,0.0002988951],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004100928,0.0003373225,0.001178961,0.0003043041,0.0001119311,0.0001182874,0.0002272378,0.6014547,0.0008831321,0.2087124,0.02057738,0.1656843],"study_design_scores_gemma":[0.00005421371,0.00002008218,0.0001573514,0.00001698755,0.00001712278,0.00003125285,0.00003011051,0.868771,0.0002523094,0.1291737,0.00146602,0.000009841773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01957986,0.000533359,0.9702876,0.00101625,0.00009286128,0.00009611165,0.000517252,0.001036192,0.006840488],"genre_scores_gemma":[0.3383272,0.0006655552,0.6486728,0.0003337146,0.0002332315,0.0004404807,0.002725899,0.0005844334,0.008016789],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01345283,"threshold_uncertainty_score":0.04500419,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02781450298328289,"score_gpt":0.2503437078543291,"score_spread":0.2225292048710462,"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."}}