{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001080169,0.001577992,0.002177966,0.001799362,0.001269896,0.002868344,0.004304931,0.001827086,0.01442066],"category_scores_gemma":[0.00536738,0.0009569807,0.001601593,0.004331887,0.00109163,0.005011901,0.002751359,0.002876869,0.00390689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002243714,"about_ca_system_score_gemma":0.002782058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005283047,"about_ca_topic_score_gemma":0.007656764,"domain_scores_codex":[0.9984241,0.0002873551,0.0001249401,0.0005070432,0.0004527259,0.0002038446],"domain_scores_gemma":[0.9984087,0.000710569,0.00009267717,0.0004693115,0.0002281353,0.00009055034],"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.001247387,0.0003889213,0.0007938182,0.0005945826,0.0001169278,0.00009686663,0.000285053,0.2258711,0.008106372,0.06718172,0.02075882,0.6745583],"study_design_scores_gemma":[0.0001574997,0.0001956175,0.000425617,0.00006723145,0.00005473609,0.0002217182,0.0001621073,0.9088005,0.003529491,0.07656936,0.009777166,0.00003891098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02359635,0.0008375545,0.961495,0.0003494118,0.0002104207,0.0001650386,0.000561521,0.003487997,0.009296737],"genre_scores_gemma":[0.08830837,0.0003120242,0.9038512,0.000119021,0.0000667682,0.0002138345,0.001205002,0.0003885156,0.005535133],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01442066,"threshold_uncertainty_score":0.04824191,"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."}}