{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005818551,0.0003513035,0.0004803003,0.0003199277,0.0001133183,0.0002060419,0.0002050085,0.0002741968,0.00008420015],"category_scores_gemma":[0.0003349075,0.0003739687,0.00008732294,0.000682065,0.00005161949,0.0007246133,0.000133531,0.0004039504,0.00006278894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001954709,"about_ca_system_score_gemma":0.00006150484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006385709,"about_ca_topic_score_gemma":0.00002042737,"domain_scores_codex":[0.9975601,0.00006238796,0.001269087,0.0002384337,0.0002821436,0.0005877947],"domain_scores_gemma":[0.9988109,0.0001720349,0.0001635415,0.0004100662,0.0002249901,0.0002184186],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002020446,0.001282808,0.08994833,0.009265878,0.0009952569,0.00005844155,0.1051487,0.6634139,0.01074154,0.0117201,0.003090909,0.104132],"study_design_scores_gemma":[0.003178619,0.0001181569,0.001994608,0.0004130814,0.00003216115,0.0001214658,0.001267583,0.9831808,0.003576068,0.0003515431,0.005084555,0.0006813208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.57485,0.000202942,0.4137,0.000375602,0.0007550514,0.001963615,0.0005111177,0.0006737103,0.006967945],"genre_scores_gemma":[0.8211452,0.00008810379,0.1771698,0.0002986728,0.00005275013,0.0001338393,0.0006440945,0.0001187058,0.0003488635],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3197669,"threshold_uncertainty_score":0.9998713,"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."}}