{"id":"W2404357874","doi":"","title":"A Faster 4-Approximation Algorithm for the Unit Disk Cover Problem","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia; Carleton University","funders":"","keywords":"Approximation algorithm; Set cover problem; Cover (algebra); Plane (geometry); Simple (philosophy); Set (abstract data type); Unit (ring theory); Unit disk; Unit disk graph; Algorithm; Computer science; Computational geometry; Running time; Mathematics; Combinatorics; Mathematical optimization; Geometry","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.0005527287,0.0002072351,0.0001584238,0.0004285492,0.0003598483,0.000471219,0.0006744813,0.00008762506,0.0001001782],"category_scores_gemma":[0.0001146575,0.0001747182,0.00007602723,0.001073011,0.00006392346,0.0004673042,0.00007711109,0.0001629643,0.0003498598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002163238,"about_ca_system_score_gemma":0.001622298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009097823,"about_ca_topic_score_gemma":0.0009206042,"domain_scores_codex":[0.9982666,0.00007578091,0.0002928766,0.0004448071,0.0005442256,0.0003757016],"domain_scores_gemma":[0.9978541,0.0004575487,0.0001230323,0.0003090583,0.0007963518,0.0004599362],"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.000008881554,0.00004224957,0.00008469028,0.000008012109,0.00004276837,0.000004112037,0.0003001669,0.3038698,0.000003446953,0.3036698,0.0208359,0.3711302],"study_design_scores_gemma":[0.0005540722,0.0001306639,0.001271189,0.00001289966,0.000009142154,0.00001628879,0.00004045095,0.8858624,0.00002195077,0.07473604,0.03712663,0.0002182517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007137588,0.00006347144,0.9863892,0.006389597,0.0005673072,0.0006434972,0.00008821809,0.0000654504,0.005079523],"genre_scores_gemma":[0.6780989,0.000004260186,0.3138973,0.004563015,0.000359959,0.0002298417,0.0003945054,0.0000240532,0.002428221],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6773851,"threshold_uncertainty_score":0.71248,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0630496311394427,"score_gpt":0.2724424684038645,"score_spread":0.2093928372644218,"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."}}