{"id":"W2127945324","doi":"10.1016/j.jda.2009.05.001","title":"Approximation algorithms for shortest descending paths in terrains","year":2009,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"","keywords":"Shortest path problem; K shortest path routing; Yen's algorithm; Terrain; Algorithm; Path (computing); Computer science; Constrained Shortest Path First; Shortest Path Faster Algorithm; Generalization; Euclidean shortest path; Approximation algorithm; Point (geometry); Mathematical optimization; Mathematics; Dijkstra's algorithm; Geometry; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008623328,0.0001394525,0.0002462534,0.0004276933,0.00009460871,0.0001710144,0.0004084049,0.00006294846,0.000002980802],"category_scores_gemma":[0.0001171448,0.0001225634,0.000145582,0.0005537171,0.00001523584,0.001150036,0.00003230631,0.0001706545,0.000001688045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001057473,"about_ca_system_score_gemma":0.0001142964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002121627,"about_ca_topic_score_gemma":0.00000218434,"domain_scores_codex":[0.998493,0.00005464198,0.0006128204,0.000206016,0.0003868703,0.0002466715],"domain_scores_gemma":[0.9990505,0.0001126924,0.000346949,0.0001559387,0.0002261931,0.000107709],"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.00003387981,0.0002574108,0.0002009984,0.00001584202,0.00003157972,0.00004656876,0.001338506,0.01683497,0.004543186,0.01396432,0.0008069496,0.9619258],"study_design_scores_gemma":[0.001312226,0.000829789,0.0105521,0.00009486664,0.00001558977,0.0001873154,0.0001000792,0.948279,0.00297667,0.03430701,0.001094347,0.0002510413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009773082,0.000278126,0.9870496,0.001947403,0.0005469098,0.0002072233,0.000005112663,0.00002171397,0.0001708788],"genre_scores_gemma":[0.5746015,0.0000306696,0.4246355,0.000206834,0.0004604847,0.000004963273,0.0000111213,0.000006087585,0.00004285378],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9616747,"threshold_uncertainty_score":0.4997992,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03003635432018853,"score_gpt":0.3028809910076843,"score_spread":0.2728446366874958,"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."}}