{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001260561,0.001408143,0.001585066,0.0007263965,0.0006775219,0.001555018,0.003132125,0.00128692,0.005850055],"category_scores_gemma":[0.004324973,0.0005039873,0.001321788,0.002417289,0.0009048643,0.002676837,0.001588126,0.002832446,0.0009707948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001425103,"about_ca_system_score_gemma":0.001404372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001184805,"about_ca_topic_score_gemma":0.00134124,"domain_scores_codex":[0.9988648,0.0003734701,0.00006638433,0.0002879734,0.0003319311,0.00007542515],"domain_scores_gemma":[0.9987271,0.0007746085,0.0001087884,0.0001415157,0.0001811742,0.00006673214],"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.0002385781,0.0001167077,0.0002305721,0.001240968,0.0001326781,0.0001690412,0.000187775,0.517748,0.006067972,0.2691133,0.02320324,0.1815512],"study_design_scores_gemma":[0.00002821241,0.0001380844,0.0001078124,0.00005405371,0.00004091067,0.0001980566,0.00003902011,0.841162,0.001257767,0.1473447,0.009610081,0.00001926729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00552276,0.001460234,0.9841569,0.000702936,0.0006053573,0.0001899361,0.000319756,0.0003655725,0.00667666],"genre_scores_gemma":[0.2954335,0.004599074,0.6760424,0.00091443,0.001005419,0.001554955,0.0008637926,0.0005252748,0.01906129],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005850055,"threshold_uncertainty_score":0.01957035,"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."}}