F1.C — Faster Minimization of Tardy Processing Time on a Single Machine

Saarland Informatics Campus · 187 views · 2020 · 27:03

Open on YouTube

Algorithms & data structuresother

Why the open web links it

Presents new algorithms for minimizing tardy processing time in single-machine scheduling.

Linked by 2 independent sites, 2 of them widely read in the 2026-10 crawl of the open web, including mpg.de, mpi-sws.org.