~/talk

An Efficient Semi-Streaming PTAS for Tournament Feedback Arc Set with Few Passes

Talkat ITCS 2022 · 2022-01-31..02-03
links:none on file
slides:none on file

Claims a one plus epsilon PTAS for tournament Feedback Arc Set running in semi‑streaming memory using sampling and local moves. Algorithm approximates single‑vertex move gains with Ostar(n) stored samples, executes strong single vertex moves in parallel via an ApproxLocalImprove routine, and recurses like randomized Quicksort on pivots. Uses Ostar(n) space with O(log n) passes (tradeoff to Ostar(n^{1+1/p}) space in p passes), and handles small subproblems by brute force or additive approximations.

AI-written summary · about

  1. 0:00Problem Definition
  2. 1:31Motivation and Applications
  3. 2:51Previous Work
  4. 4:47Single Vertex Moves
  5. 7:45Algorithm Overview
  6. 10:56Cost Breakdown
  7. 14:03Terminating Condition
  8. 17:57Additional Results
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.