{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001036556,0.002142058,0.002363517,0.001768296,0.001176099,0.002396724,0.003458879,0.002731028,0.01553743],"category_scores_gemma":[0.004598196,0.0007763695,0.001775282,0.003549754,0.0007013692,0.004861485,0.002734842,0.002493988,0.004199613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002330148,"about_ca_system_score_gemma":0.002517284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006031215,"about_ca_topic_score_gemma":0.006842981,"domain_scores_codex":[0.9984728,0.0002284056,0.0001044159,0.0003759651,0.0004807276,0.0003377359],"domain_scores_gemma":[0.9982273,0.0007850257,0.0001517436,0.0004763796,0.0002255933,0.0001339136],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001687987,0.0008085445,0.001929464,0.000621143,0.0002226668,0.0003531939,0.0004573451,0.2741161,0.01622828,0.03357184,0.04291189,0.6270916],"study_design_scores_gemma":[0.0005065445,0.000199786,0.0005632673,0.00004349734,0.00005974705,0.0003458213,0.0001429009,0.9379404,0.004239595,0.04181945,0.01409396,0.00004504202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0666789,0.002186266,0.9047254,0.001506503,0.0004263005,0.0004877514,0.0008698256,0.007164836,0.01595414],"genre_scores_gemma":[0.1496073,0.0005424767,0.8400101,0.0004753732,0.0001829517,0.0005435061,0.002549712,0.0005663045,0.005522286],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01553743,"threshold_uncertainty_score":0.05197793,"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."}}