7 citations · 18 across the 10 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DS2014
Scheduling over Scenarios on Two Machines
Esteban Feuerstein, Alberto Marchetti-Spaccamela, Frans Schalekamp +4
We consider scheduling problems over scenarios where the goal is to find a single assignment of the jobs to the machines which performs well over all possible scenarios. Each scena…
cs.DM2014★ 2 cited
An Upper Bound on the Number of Circular Transpositions to Sort a Permutation
Anke van Zuylen, James Bieron, Frans Schalekamp +1
We consider the problem of upper bounding the number of circular transpositions needed to sort a permutation. It is well known that any permutation can be sorted using at most $n(n…