Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-Polytime

Zachary Friggstad, Chaitanya Swamy. Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-Polytime. In Nikhil Bansal, Emanuela Merelli, James Worrell 0001, editors, 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference). Volume 198 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]

Abstract

Abstract is missing.