7 citations · 18 across the 10 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2017
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…
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…