{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001606779,0.0008165897,0.0009041741,0.001223814,0.0004558853,0.000731619,0.003654265,0.0006263304,0.000001980334],"category_scores_gemma":[0.00006580783,0.0006485094,0.000205984,0.002086278,0.0008349201,0.0004568487,0.001164744,0.001112742,0.000001525261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003664203,"about_ca_system_score_gemma":0.0003371986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001200766,"about_ca_topic_score_gemma":0.0006158108,"domain_scores_codex":[0.9946439,0.0001044581,0.000764752,0.002258471,0.0009302769,0.001298099],"domain_scores_gemma":[0.9937069,0.003875058,0.0004457056,0.001495955,0.0002697522,0.0002066078],"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.000005143499,0.00003360531,0.000009037762,0.00000960577,0.000009701667,0.00002368173,0.0001006441,0.3043934,0.000005529553,0.03050393,0.00001129016,0.6648944],"study_design_scores_gemma":[0.0005516986,0.0002253301,0.0001071647,0.0003598101,0.00001289243,0.00007514569,1.508469e-7,0.9551592,0.0001469791,0.04165548,0.0009727481,0.0007334161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00005923661,0.002543424,0.993252,0.0009797355,0.001536754,0.0007634287,0.000004284851,0.0001651562,0.000695983],"genre_scores_gemma":[0.5696856,0.001000788,0.4228211,0.004128225,0.001602171,0.0001303882,0.00001263866,0.0001201076,0.0004989552],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.664161,"threshold_uncertainty_score":0.9995966,"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."}}