{"id":"W3184432724","doi":"10.4230/lipics.icalp.2021.67","title":"Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-Polytime","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Rounding; Approximation algorithm; Combinatorics; Orienteering; Metric space; Path (computing); Constant (computer programming); Mathematics; Travelling salesman problem; Binary logarithm; Randomized rounding; Metric (unit); Point (geometry); Time complexity; Computer science; Discrete mathematics; Mathematical optimization","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.002991665,0.00213689,0.00221846,0.0007486209,0.001305807,0.003022826,0.003312738,0.001890526,0.009164559],"category_scores_gemma":[0.01415027,0.0007441321,0.001850006,0.002196005,0.001485369,0.006333808,0.002124349,0.004213823,0.002169186],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003348345,"about_ca_system_score_gemma":0.00285433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007125604,"about_ca_topic_score_gemma":0.008726786,"domain_scores_codex":[0.9974942,0.0006468127,0.0001313244,0.0006262383,0.0005653361,0.0005362054],"domain_scores_gemma":[0.9934012,0.003974328,0.0005557872,0.001250171,0.0003840178,0.0004344583],"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.00170062,0.0006820355,0.002854595,0.001139701,0.0002339554,0.0003289235,0.0005992653,0.6829309,0.005900916,0.1785777,0.03289047,0.0921609],"study_design_scores_gemma":[0.0001908353,0.0001650231,0.0003877639,0.00003784986,0.000039245,0.0001260532,0.00008581842,0.8159744,0.0007250037,0.1757447,0.006505449,0.00001769311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08407509,0.003248662,0.8804384,0.005560395,0.0006156167,0.000227853,0.001410258,0.003908192,0.0205154],"genre_scores_gemma":[0.5656011,0.00191665,0.4133964,0.001805966,0.0005814577,0.0003995054,0.002379697,0.001275478,0.01264377],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009164559,"threshold_uncertainty_score":0.03065854,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01431382594100084,"score_gpt":0.2530143342341167,"score_spread":0.2387005082931158,"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."}}