{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005756101,0.0001343149,0.0001256353,0.0003017157,0.0001970761,0.0001417352,0.0003184761,0.00005341143,0.00001646549],"category_scores_gemma":[0.0001194024,0.00008646442,0.00004255364,0.0007817731,0.00006321666,0.0005695742,0.0001378407,0.00006750447,0.00002763755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004690492,"about_ca_system_score_gemma":0.00009538756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004987409,"about_ca_topic_score_gemma":0.000002213661,"domain_scores_codex":[0.998751,0.00005550574,0.0002918695,0.0003666805,0.0003245107,0.0002104415],"domain_scores_gemma":[0.9978256,0.001636982,0.0001076898,0.0001759092,0.0001953389,0.000058534],"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.00002379989,0.0001015841,0.001913094,0.00003856135,0.00003596586,0.000001652641,0.0002495635,0.2207657,0.0001459455,0.1885352,0.0009729422,0.587216],"study_design_scores_gemma":[0.001059968,0.00006905502,0.04338996,0.00003050294,0.000006825057,0.00001758393,0.00001309652,0.8541802,0.00009142508,0.09419864,0.006764076,0.0001787169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01420026,0.0003280697,0.9814801,0.003052945,0.0002261585,0.0004740986,0.00001957353,0.00005471997,0.0001641016],"genre_scores_gemma":[0.7060456,0.00002918375,0.2926302,0.0004340282,0.0001660084,0.0001321169,0.00004159333,0.00001086647,0.0005103906],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6918453,"threshold_uncertainty_score":0.3525917,"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."}}