7 citations · 18 across the 10 of their papers we have counts for
10 papers
GILP: An Interactive Tool for Visualizing the Simplex Algorithm
Henry W. Robbins, Samuel C. Gutekunst, David B. Shmoys +1
The Simplex algorithm for solving linear programs-one of Computing in Science & Engineering's top 10 most influential algorithms of the 20th century-is an important topic in many a…
A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest
Neil Olver, Frans Schalekamp, Suzanne van der Ster +2
We give a 2-approximation algorithm for the Maximum Agreement Forest problem on two rooted binary trees. This NP-hard problem has been studied extensively in the past two decades,…
Layers and Matroids for the Traveling Salesman's Paths
Frans Schalekamp, András Sebő, Vera Traub +1
Gottschalk and Vygen proved that every solution of the subtour elimination linear program for traveling salesman paths is a convex combination of more and more restrictive "general…
A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest
Frans Schalekamp, Anke van Zuylen, Suzanne van der Ster
We give a 2-approximation algorithm for the Maximum Agreement Forest problem on two rooted binary trees. This NP-hard problem has been studied extensively in the past two decades,…
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…
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…