{"id":"W2065714066","doi":"10.1007/s00778-005-0177-1","title":"Optimization and evaluation of shortest path queries","year":2006,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Constrained Shortest Path First; Shortest path problem; K shortest path routing; Computer science; Yen's algorithm; Dijkstra's algorithm; Shortest Path Faster Algorithm; Euclidean shortest path; Scalability; Pruning; Path (computing); Query optimization; Algorithm; Theoretical computer science; Data mining; Database; Graph; Computer network","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.006121316,0.001390724,0.002382547,0.001817322,0.0009320736,0.002972526,0.002683273,0.001625605,0.004655022],"category_scores_gemma":[0.02688518,0.0006165013,0.0007899499,0.003154302,0.001317867,0.004186526,0.001633395,0.00117886,0.0006676768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003460742,"about_ca_system_score_gemma":0.004201186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01259749,"about_ca_topic_score_gemma":0.01194494,"domain_scores_codex":[0.9900511,0.004032047,0.000537075,0.001052948,0.003371754,0.00095502],"domain_scores_gemma":[0.9805335,0.01482385,0.0006311806,0.00145736,0.002030664,0.0005233619],"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.00374782,0.0007408289,0.005166725,0.0006029709,0.0001584102,0.0001695537,0.0001887199,0.7288913,0.007308987,0.02021152,0.01265479,0.2201584],"study_design_scores_gemma":[0.00007874976,0.0001188591,0.0004863992,0.000006346985,0.0000211749,0.00004067344,0.0000548426,0.9899634,0.001811924,0.006854699,0.0005549653,0.000008072207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5108377,0.006259776,0.4530629,0.003076758,0.0003948516,0.0004570504,0.00218195,0.006253441,0.01747551],"genre_scores_gemma":[0.8432462,0.0006774544,0.1507577,0.0001252694,0.0001171874,0.0001003842,0.001994996,0.0005094907,0.002471229],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.01259749,"threshold_uncertainty_score":0.03237301,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01871367238197218,"score_gpt":0.2452819636881325,"score_spread":0.2265682913061603,"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."}}