{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001367465,0.0004899216,0.0004693158,0.0006136306,0.0002440319,0.001045316,0.003952049,0.00022337,0.00001650066],"category_scores_gemma":[0.00008657085,0.00044635,0.0001363777,0.000307072,0.0002583582,0.0008105131,0.001564526,0.0003671927,0.00008355722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001754672,"about_ca_system_score_gemma":0.0001962727,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006732291,"about_ca_topic_score_gemma":0.00001477087,"domain_scores_codex":[0.9964508,0.00002094665,0.0004975967,0.001640046,0.0007535201,0.0006371351],"domain_scores_gemma":[0.9974185,0.0003410636,0.0003133474,0.001580039,0.0002118354,0.0001352164],"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.000003225204,0.0000202919,0.000002342232,0.00004268632,0.00001042571,0.000007566044,0.0001011912,0.002852966,0.0002404206,0.0199849,0.0001216607,0.9766123],"study_design_scores_gemma":[0.0002944344,0.0001936779,0.000006586304,0.0001074402,0.00001108623,0.000008963339,4.350334e-8,0.9244419,0.0008255822,0.0686345,0.004937103,0.0005386433],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000003081494,0.00007398755,0.9940969,0.0005373024,0.001559742,0.0009718869,0.00001951381,0.0002334798,0.002504078],"genre_scores_gemma":[0.007630731,0.00001874234,0.9854786,0.001529735,0.001056312,0.00006570719,0.0000965156,0.00005886108,0.004064798],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9760737,"threshold_uncertainty_score":0.9999917,"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."}}