{"id":"W2031332034","doi":"10.1109/jcn.2008.6389840","title":"Minimum energy cooperative path routing in all-wireless networks: NP-completeness and heuristic algorithms","year":2008,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Dijkstra's algorithm; Algorithm; Shortest path problem; Constrained Shortest Path First; Heuristic; Routing (electronic design automation); Link-state routing protocol; Private Network-to-Network Interface; Scalability; Mathematical optimization; Destination-Sequenced Distance Vector routing; K shortest path routing; Routing protocol; Computer network; Mathematics; Theoretical computer science; Graph","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":[],"consensus_categories":[],"category_scores_codex":[0.000890815,0.0002049251,0.0004437178,0.0001783292,0.0006273963,0.0001671143,0.001491029,0.00009982893,0.00000325268],"category_scores_gemma":[0.00004525313,0.0001831594,0.00006338172,0.0006290984,0.0002886013,0.0005088869,0.001034406,0.0006254145,3.083893e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005259424,"about_ca_system_score_gemma":0.00008538205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002445713,"about_ca_topic_score_gemma":0.0001084908,"domain_scores_codex":[0.9978377,0.0006960342,0.0007891063,0.0002090447,0.0001737019,0.0002943894],"domain_scores_gemma":[0.9970809,0.0009444762,0.0004485796,0.0009817049,0.0003769559,0.000167407],"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.0001213752,0.001036788,0.01771807,0.00001816583,0.0003873808,0.0001941277,0.01071538,0.02858932,0.0003157935,0.2665061,0.004523051,0.6698745],"study_design_scores_gemma":[0.000735197,0.0001337972,0.004742329,0.0001586841,0.00001328455,0.0004736348,0.0001138842,0.9876091,0.000004395396,0.0002180804,0.005579403,0.0002182153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02581264,0.0298619,0.9407778,0.002713199,0.0002062955,0.0001305064,0.00000110498,0.00003259875,0.0004639053],"genre_scores_gemma":[0.8644776,0.1253514,0.00937402,0.0006392876,0.00009804095,0.00001008914,0.000004858028,0.00001220101,0.00003254608],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9590198,"threshold_uncertainty_score":0.7469023,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05751421122980483,"score_gpt":0.2881687901388061,"score_spread":0.2306545789090013,"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."}}