{"id":"W4408128235","doi":"10.1007/978-981-96-1090-7_2","title":"An Optimal Absolute Approximation Algorithm for Computing k Restricted Shortest Paths","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Algorithm; Approximation algorithm; Shortest path problem; Theoretical computer science; 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.001080455,0.0005209092,0.0005305265,0.001174614,0.0005249259,0.001134213,0.003316187,0.0003779562,0.000009688852],"category_scores_gemma":[0.0001007113,0.0005173516,0.0001390513,0.0010513,0.0003567965,0.0009830351,0.0008929003,0.0006872315,0.000007779386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002923096,"about_ca_system_score_gemma":0.0009426321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000011717,"about_ca_topic_score_gemma":0.00001057723,"domain_scores_codex":[0.9957235,0.0000609716,0.0007192689,0.00177346,0.0009066197,0.0008161985],"domain_scores_gemma":[0.9967925,0.0006068314,0.0003222721,0.001315304,0.0007232546,0.0002398351],"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.000003003895,0.00003903149,0.000002316516,0.00002751256,0.000007651571,0.00001078956,0.0003222233,0.1864992,0.00002582103,0.008378274,0.00004329999,0.8046409],"study_design_scores_gemma":[0.0003592766,0.0002817108,0.00002729983,0.0002604479,0.000007398375,0.0000157996,3.290263e-7,0.9816556,0.0002134939,0.01583696,0.00081076,0.000530907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000006908575,0.0001271057,0.9951711,0.0004977893,0.001207253,0.001164729,0.00002345928,0.0003665903,0.001435082],"genre_scores_gemma":[0.00311551,0.00003406574,0.9952505,0.0007867339,0.0003482326,0.00002357255,0.00007586282,0.00003128987,0.0003342466],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.80411,"threshold_uncertainty_score":0.9999027,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01996489278085252,"score_gpt":0.2779470448464305,"score_spread":0.257982152065578,"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."}}