49 citations · 185 across the 18 of their papers we have counts for
1 paper · 1 filter
Dušan Knop, Martin Koutecký
Scheduling problems are fundamental in combinatorial optimization. Much work has been done on approximation algorithms for NP-hard cases, but relatively little is known about exact…