{"id":"W2397880522","doi":"","title":"Local PTAS for independent set and vertex cover in location aware unit disk graphs","year":2009,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Unit disk graph; Vertex cover; Vertex (graph theory); Dominating set; Combinatorics; Bounded function; Approximation algorithm; Embedding; Feedback vertex set; Independent set; Polynomial-time approximation scheme; Unit disk; Constant (computer programming); Edge cover; Graph; Discrete mathematics; Mathematics; Time complexity; Computer science; Wireless network","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.0001536464,0.00007257749,0.0000707888,0.0001016389,0.00004013107,0.0001389125,0.0003110838,0.00002678126,0.000009254326],"category_scores_gemma":[0.000006188096,0.00006296459,0.00001398531,0.0002831705,0.00001625563,0.0007069675,0.0001052581,0.00004184445,0.00001608961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001324783,"about_ca_system_score_gemma":0.00001346139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004784201,"about_ca_topic_score_gemma":0.00006524091,"domain_scores_codex":[0.9993731,0.00001238142,0.0001059946,0.0002340712,0.0001276651,0.0001467266],"domain_scores_gemma":[0.9996666,0.00002242844,0.00002170761,0.0002232729,0.00002651918,0.00003944845],"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.00001492867,0.0001320637,0.002730291,0.00002916021,0.00001342177,0.0000118371,0.0002486727,0.0005488144,0.000009520061,0.3781449,0.01447108,0.6036453],"study_design_scores_gemma":[0.001400855,0.000228945,0.09033098,0.00002643208,0.000008237202,0.000002902397,0.0001624905,0.8459113,0.0001712016,0.0479538,0.01352572,0.0002771984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003931955,0.00003083752,0.9940171,0.0008452731,0.00008658946,0.0002035808,0.000006582401,0.00004760261,0.000830449],"genre_scores_gemma":[0.99475,0.00001781546,0.003781947,0.0007364783,0.000007507166,0.000007543861,0.00004789126,0.000002376062,0.0006483941],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9908181,"threshold_uncertainty_score":0.2567622,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02062249048537513,"score_gpt":0.2637023197410822,"score_spread":0.243079829255707,"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."}}