{"id":"W1780992783","doi":"10.1007/978-0-387-35608-2_11","title":"Symmetric Connectivity with Minimum Power Consumption in Radio Networks","year":2002,"lang":"en","type":"book-chapter","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Wireless ad hoc network; Unicast; Computer science; Wireless network; Approximation algorithm; Shortest path problem; Topology (electrical circuits); Graph; Wireless; Network packet; Mathematical optimization; Mathematics; Algorithm; Computer network; Theoretical computer science; Combinatorics; Telecommunications","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000309325,0.0008019728,0.0005034289,0.0003985378,0.0002711533,0.0008447946,0.0008841197,0.0007304428,0.003276016],"category_scores_gemma":[0.001346437,0.0003442729,0.0003107527,0.00122711,0.0007407276,0.001971743,0.0005877572,0.0006428402,0.0007443428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004487611,"about_ca_system_score_gemma":0.0002445124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002633181,"about_ca_topic_score_gemma":0.0002461573,"domain_scores_codex":[0.999686,0.0001070321,0.00001039363,0.00006031059,0.0001064926,0.00002974757],"domain_scores_gemma":[0.9996792,0.0002102636,0.00003056657,0.00003994342,0.00002618742,0.0000138405],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001092983,0.00006088679,0.0002788026,0.0004424211,0.00003276193,0.0002057053,0.0001873695,0.3526988,0.006041496,0.4418585,0.0114651,0.186619],"study_design_scores_gemma":[0.00004222492,0.0001488516,0.000272518,0.00004891617,0.00002346677,0.0004237144,0.00007448568,0.4363093,0.00278847,0.5299082,0.0299438,0.00001606089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03890123,0.003785281,0.9200512,0.0009430548,0.0001747138,0.0000656837,0.000111375,0.0004608616,0.03550662],"genre_scores_gemma":[0.6431066,0.009092066,0.3240751,0.000329169,0.0005148742,0.0002788164,0.0004042547,0.000290041,0.02190893],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003276016,"threshold_uncertainty_score":0.01095939,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01745053382231488,"score_gpt":0.2107557105450149,"score_spread":0.1933051767227,"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."}}