{"id":"W2341114440","doi":"10.1016/j.comgeo.2016.04.002","title":"Approximation algorithms for the unit disk cover problem in 2D and 3D","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cover (algebra); Unit disk; Simple (philosophy); Set cover problem; Unit (ring theory); Plane (geometry); Set (abstract data type); Unit disk graph; Approximation algorithm; Combinatorics; Algorithm; Mathematics; Computer science; Geometry","routes":{"ca_aff":true,"ca_fund":true,"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.001197717,0.001188339,0.001835923,0.001671216,0.0008219449,0.002114276,0.003019194,0.002297374,0.006599981],"category_scores_gemma":[0.008220984,0.000820247,0.001207344,0.002636644,0.0009888413,0.003428014,0.003123935,0.002355102,0.001272611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00168073,"about_ca_system_score_gemma":0.001203354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007162412,"about_ca_topic_score_gemma":0.008259832,"domain_scores_codex":[0.9991523,0.0002197362,0.00004923994,0.000123008,0.0003261408,0.0001296518],"domain_scores_gemma":[0.9966107,0.002332918,0.0001860511,0.0003743692,0.0003109379,0.0001849906],"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.000334052,0.0001880116,0.00116644,0.0003067812,0.00007339379,0.00009830284,0.000270804,0.7345852,0.001466004,0.07509034,0.01209259,0.1743281],"study_design_scores_gemma":[0.00001570208,0.00001116677,0.00005646319,0.000009223949,0.00000535971,0.00002137906,0.00002832322,0.9795243,0.0001998324,0.01923686,0.0008876162,0.000003903949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01923033,0.0009520209,0.9738816,0.0004136776,0.0001116233,0.00006367992,0.0001685746,0.0005956565,0.004582801],"genre_scores_gemma":[0.2730391,0.001079257,0.7169905,0.0002363365,0.0002039529,0.00029357,0.001056358,0.000621123,0.006479834],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007162412,"threshold_uncertainty_score":0.02207917,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02719346927443032,"score_gpt":0.2694651527910792,"score_spread":0.2422716835166489,"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."}}