{"id":"W7110209134","doi":"10.4230/lipics.approx/random.2025.1","title":"Approximation Schemes for Orienteering and Deadline TSP in Doubling Metrics","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orienteering; Bounded function; Travelling salesman problem; Hamiltonian path; Treewidth; Dimension (graph theory); Path (computing); Graph","routes":{"ca_aff":true,"ca_fund":true,"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.002195707,0.001885909,0.001729309,0.001390886,0.001065598,0.00302661,0.003944106,0.001756827,0.007522751],"category_scores_gemma":[0.01169903,0.0004529439,0.001673528,0.003142289,0.0009945296,0.008677852,0.003221741,0.002913545,0.001500791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003918816,"about_ca_system_score_gemma":0.001962394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005457936,"about_ca_topic_score_gemma":0.00562431,"domain_scores_codex":[0.9972737,0.0006331006,0.0001747978,0.0005036627,0.0008500374,0.0005646885],"domain_scores_gemma":[0.9957229,0.001909744,0.000349567,0.001255948,0.0003742022,0.0003875688],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001581269,0.0004462847,0.003585084,0.0009211077,0.0002161447,0.0003623777,0.0008885305,0.3551548,0.007076728,0.3007238,0.02585971,0.3031842],"study_design_scores_gemma":[0.0001255855,0.0002274672,0.0007464135,0.00008190005,0.00009790969,0.0003733502,0.0002617756,0.7831485,0.002127484,0.1981645,0.01460327,0.00004191651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1556314,0.006005253,0.8050879,0.00277159,0.0004311172,0.0002901893,0.001488636,0.002985994,0.02530793],"genre_scores_gemma":[0.5668187,0.002549388,0.4148314,0.0008842612,0.000277203,0.0003108063,0.00306715,0.0005374938,0.0107237],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007522751,"threshold_uncertainty_score":0.02843308,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01875167200096725,"score_gpt":0.2838451202113926,"score_spread":0.2650934482104254,"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."}}