{"id":"W43621356","doi":"10.1007/978-3-319-08783-2_39","title":"Improved Approximation for Time-Dependent Shortest Paths","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Lambda; Combinatorics; Shortest path problem; Approximation algorithm; Binary logarithm; Time complexity; Computation; Dijkstra's algorithm; Mathematics; Path (computing); Piecewise linear function; Node (physics); Function (biology); Algorithm; Discrete mathematics; Computer science; Physics; Mathematical analysis; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002909597,0.003068476,0.00304103,0.002613392,0.001208559,0.002834584,0.006946397,0.002459604,0.01844705],"category_scores_gemma":[0.01756815,0.001156488,0.002515845,0.005599797,0.001450476,0.005751424,0.004449182,0.006597624,0.004096948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004871283,"about_ca_system_score_gemma":0.003571549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008104417,"about_ca_topic_score_gemma":0.01002133,"domain_scores_codex":[0.996052,0.0008272114,0.0001840787,0.0007048682,0.001712375,0.0005196584],"domain_scores_gemma":[0.9914805,0.005037345,0.0002939178,0.001853371,0.00094051,0.0003944071],"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.001392002,0.0006830774,0.0008674079,0.0009337479,0.0001690607,0.0001685173,0.000337196,0.4916939,0.004757203,0.1139275,0.04531804,0.3397523],"study_design_scores_gemma":[0.0001339177,0.0001030313,0.0002323675,0.00005818657,0.00006921943,0.0001184861,0.00005049016,0.9250138,0.001154878,0.06648269,0.006561507,0.00002142613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02122508,0.002485475,0.9524931,0.0009759073,0.0007990116,0.0002373233,0.0009327584,0.002368826,0.01848241],"genre_scores_gemma":[0.1684256,0.002134922,0.8004078,0.0004702815,0.0007019745,0.0007081761,0.00299712,0.001051239,0.02310287],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01844705,"threshold_uncertainty_score":0.06171149,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01275364498860589,"score_gpt":0.2283138038738385,"score_spread":0.2155601588852326,"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."}}