{"id":"W4379118138","doi":"10.1007/978-3-031-34347-6_8","title":"A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina; Western University","funders":"","keywords":"Knapsack problem; Orienteering; Polynomial-time approximation scheme; Combinatorics; Vertex (graph theory); Approximation algorithm; Mathematics; Directed graph; Discrete mathematics; Time complexity; Mathematical optimization; 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.0009492823,0.001494294,0.002270821,0.001417163,0.001187894,0.003468808,0.00453436,0.001635193,0.0138427],"category_scores_gemma":[0.00363913,0.0008532807,0.001935202,0.004151498,0.001082761,0.005613293,0.003678266,0.00303229,0.002732096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003355245,"about_ca_system_score_gemma":0.002665198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01154071,"about_ca_topic_score_gemma":0.01365933,"domain_scores_codex":[0.9985569,0.0001585441,0.0000950178,0.0003792403,0.0003994333,0.0004108382],"domain_scores_gemma":[0.9973922,0.001032947,0.0001472574,0.001038158,0.0002069198,0.0001825056],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001351017,0.0006517444,0.001068484,0.0007684298,0.0001166774,0.00020327,0.0004752878,0.2296982,0.01858209,0.1102043,0.03716953,0.5997111],"study_design_scores_gemma":[0.0002019636,0.0001536279,0.0003808568,0.00005637761,0.00008029696,0.0001633238,0.0001846243,0.8663737,0.006502966,0.1158303,0.01003069,0.00004122519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07734168,0.0007557601,0.8892789,0.0006882474,0.0001915188,0.0004253685,0.002086809,0.008353089,0.02087859],"genre_scores_gemma":[0.2736352,0.0007061624,0.7048435,0.0003056549,0.0001193011,0.0003087647,0.004771595,0.0008505765,0.01445917],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0138427,"threshold_uncertainty_score":0.04630846,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0156756127671737,"score_gpt":0.2234739703599969,"score_spread":0.2077983575928233,"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."}}