{"id":"W1948783854","doi":"10.48550/arxiv.1004.3320","title":"Approximation Algorithms for Dominating Set in Disk Graphs","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Dominating set; Mathematics; Euclidean geometry; Set (abstract data type); Graph; Upper and lower bounds; Approximation algorithm; Unit disk graph; Unit disk; Running time; Discrete mathematics; Algorithm; Computer science; Vertex (graph theory); 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.002238229,0.00178869,0.002368943,0.001715375,0.0012662,0.002630527,0.004349046,0.002095815,0.003801629],"category_scores_gemma":[0.01182828,0.0008046807,0.001140172,0.003560451,0.001136658,0.004480426,0.00252386,0.002162421,0.001133426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002923839,"about_ca_system_score_gemma":0.001360484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002536935,"about_ca_topic_score_gemma":0.002703459,"domain_scores_codex":[0.9979195,0.000689748,0.00009907022,0.0004878277,0.0005185386,0.000285337],"domain_scores_gemma":[0.9951589,0.00308203,0.0003916888,0.0007965712,0.0002997065,0.0002711271],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000738812,0.0003367372,0.001315981,0.0006933755,0.0002055814,0.0001534137,0.0004292252,0.7334518,0.004255066,0.1195191,0.01193254,0.1269684],"study_design_scores_gemma":[0.00007902439,0.00006638256,0.0001570272,0.00002321129,0.00003318576,0.0001021251,0.00006080827,0.8947271,0.001202921,0.1000143,0.003522508,0.0000114278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04274577,0.001737691,0.9458108,0.001214573,0.0001259899,0.000200222,0.0005741683,0.001378697,0.006212113],"genre_scores_gemma":[0.4573593,0.00177697,0.529855,0.0004977272,0.0002410996,0.0004678064,0.001973698,0.0004844808,0.007344064],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004349046,"threshold_uncertainty_score":0.02121407,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09476514679204252,"score_gpt":0.2512652688231497,"score_spread":0.1565001220311072,"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."}}