{"id":"W1545491710","doi":"10.1007/978-3-642-02026-1_47","title":"A Branch-and-Cut Algorithm for the Minimum Energy Symmetric Connectivity Problem in Wireless Networks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Wireless sensor network; Computer science; Digraph; Algorithm; Node (physics); Wireless network; Path (computing); Wireless; Strongly connected component; Integer programming; Transmission (telecommunications); Computer network; Mathematics; Discrete mathematics; Telecommunications","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.001346446,0.001486119,0.002162325,0.00133919,0.001026867,0.00159974,0.002704541,0.002180801,0.01099163],"category_scores_gemma":[0.004171059,0.0008712,0.001099827,0.002683862,0.0008818501,0.002803633,0.001898373,0.002613445,0.001372165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001282617,"about_ca_system_score_gemma":0.002073082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004024833,"about_ca_topic_score_gemma":0.00449743,"domain_scores_codex":[0.9993464,0.0002030668,0.00003231023,0.0001211709,0.0002109129,0.00008616159],"domain_scores_gemma":[0.9983494,0.001174389,0.00007861343,0.0001138497,0.0001834747,0.0001001523],"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.0004205715,0.0004344219,0.0004219577,0.0003172054,0.0001003119,0.0001181244,0.0001467852,0.5134928,0.002302051,0.05425432,0.02273279,0.4052587],"study_design_scores_gemma":[0.0001279408,0.00006605898,0.0001023579,0.00002174405,0.00002287363,0.00005221182,0.00003404046,0.9534947,0.0005351995,0.04319296,0.002340693,0.00000929386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01190022,0.0005274256,0.9784402,0.000581024,0.0001449259,0.0002322294,0.0002290124,0.0006737555,0.007271256],"genre_scores_gemma":[0.08049835,0.000520922,0.9113632,0.0001859897,0.0001511641,0.0004259068,0.0006307228,0.0002882778,0.005935584],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01099163,"threshold_uncertainty_score":0.0367707,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01022437108726866,"score_gpt":0.2176706564112874,"score_spread":0.2074462853240187,"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."}}