{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001574772,0.001316402,0.001842571,0.00227885,0.001045986,0.002324783,0.00304571,0.001528885,0.005602495],"category_scores_gemma":[0.01109617,0.0009414868,0.001139519,0.003910522,0.001160196,0.003266982,0.002807585,0.002897313,0.000929157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00206283,"about_ca_system_score_gemma":0.001431026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009816318,"about_ca_topic_score_gemma":0.01074835,"domain_scores_codex":[0.9991548,0.0001954806,0.00006165354,0.0001579028,0.0002965543,0.0001335612],"domain_scores_gemma":[0.9959721,0.002885462,0.0001953681,0.0003860289,0.0003665026,0.0001945534],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003048631,0.0001450113,0.001376239,0.0002621707,0.00006121712,0.00005808587,0.0003296082,0.7854208,0.001163739,0.06389819,0.005862846,0.1411171],"study_design_scores_gemma":[0.00003256099,0.00002438978,0.00008918229,0.00001722761,0.00001224012,0.00002508789,0.00005965865,0.9656509,0.0002864331,0.03256192,0.001234254,0.000006270508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02317221,0.0007077422,0.9724337,0.0002673186,0.00007059622,0.0000818252,0.0002702338,0.0004957673,0.002500599],"genre_scores_gemma":[0.2640486,0.001053183,0.7272694,0.0001098759,0.00009207109,0.0002398377,0.001505188,0.0003438085,0.005338233],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009816318,"threshold_uncertainty_score":0.01951838,"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."}}