{"id":"W1593594285","doi":"10.1007/978-3-642-17458-2_21","title":"PTAS for Minimum Connected Dominating Set with Routing Cost Constraint in Wireless Sensor Networks","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Computer science; Polynomial-time approximation scheme; Routing (electronic design automation); Approximation algorithm; Constraint (computer-aided design); Shortest path problem; Mathematical optimization; Set (abstract data type); Connected dominating set; Wireless sensor network; Computer network; Algorithm; Mathematics; Theoretical computer science","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":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002010852,0.0008862098,0.001048482,0.000667153,0.0004071807,0.0008352803,0.003297668,0.0008013331,0.00001322799],"category_scores_gemma":[0.0001950736,0.0007958079,0.0001490322,0.0009769095,0.001377741,0.0005196176,0.001108398,0.002338909,0.000005105884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003843157,"about_ca_system_score_gemma":0.0007722385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003620005,"about_ca_topic_score_gemma":0.0009991305,"domain_scores_codex":[0.9941689,0.00008227798,0.0009782566,0.002387903,0.000856633,0.001526003],"domain_scores_gemma":[0.9937822,0.003143819,0.0007311166,0.001572764,0.0004875047,0.0002826575],"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.0000565887,0.00005061619,0.0003119964,0.00007754684,0.00003057589,0.0003589804,0.001360072,0.2619075,0.0004369114,0.02746901,0.0000152916,0.7079249],"study_design_scores_gemma":[0.001207569,0.0002467024,0.00007938564,0.001085432,0.00001247688,0.0002252044,0.000001623023,0.9879884,0.0006909963,0.007188662,0.0002562783,0.001017232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001143814,0.00008965217,0.9935284,0.000403608,0.001858693,0.002140717,0.00001598938,0.000208178,0.0006109553],"genre_scores_gemma":[0.585374,0.000009407177,0.4127909,0.0009067987,0.0006848628,0.00009327313,0.00002139316,0.00007119418,0.00004817239],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.726081,"threshold_uncertainty_score":0.9999627,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0146968459904189,"score_gpt":0.2421347020474083,"score_spread":0.2274378560569894,"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."}}