A5B.4 Constant-Factor Approximation to Deadline TSP and Related Problems in (almost) Quasi-Polytime
About this video
Advanced · Editorial review · 85% confidenceWhole-channel inclusion: ICALP 2021 (title sample: This is a full recording archive of ICALP 2021 academic conference talks presenting original theoretical computer science research, which squarely fits expert technical talks/primary-source proceedings.; 3 of 3 sampled transcripts read as real teaching); this title passed a strict title check.
A 26-minute video from ICALP 2021: “A5B.4 Constant-Factor Approximation to Deadline TSP and Related Problems in (almost) Quasi-Polytime”.
Video by ICALP 2021, played through YouTube's embedded player.