{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003127694,0.00005808064,0.00004091634,0.0000761219,0.0002527877,0.0001557867,0.00004075251,0.00001605204,0.00004209642],"category_scores_gemma":[0.00002195248,0.00004474121,0.00002241259,0.0001150178,0.00001806586,0.0009771772,0.00003136808,0.00002575926,0.0001582276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001426021,"about_ca_system_score_gemma":0.000004604305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006442087,"about_ca_topic_score_gemma":0.000003868505,"domain_scores_codex":[0.9995264,0.000002307273,0.0001864349,0.00004151725,0.0001327982,0.0001105774],"domain_scores_gemma":[0.9997511,0.00002388212,0.00006212936,0.00003964974,0.0001155855,0.00000769188],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002320779,0.00005202174,0.0008550053,0.0002789191,0.00002792958,1.460808e-8,0.0007017355,0.5265694,0.00000477856,0.2811607,0.008929086,0.1813972],"study_design_scores_gemma":[0.0002576959,0.000002589881,0.01510147,0.000003762072,0.00001233661,3.680049e-7,0.0004331674,0.826281,0.000001897798,0.0008294358,0.157015,0.00006122155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03128831,0.00005098397,0.9609381,0.001846332,0.0005115318,0.0006130196,0.000006169095,0.000085502,0.004660035],"genre_scores_gemma":[0.9963989,0.000002824328,0.0009713589,0.002096598,0.0002168764,0.00007771882,0.0002009136,0.000002598592,0.00003220117],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9651106,"threshold_uncertainty_score":0.2033749,"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."}}