Anke van Zuylen

Cornell University — United States

Computer Science · Physical Sciences

14h-index973citations52works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(30), Optimization and Search Problems(19), Advanced Graph Theory Research(17), Vehicle Routing Optimization Methods(10), Game Theory and Voting Systems(9)

Publications52 total

A duality based 2-approximation algorithm for maximum agreement forest
Mathematical Programming·2022· 10 citedOpen Access
The Salesman’s Improved Paths through Forests
Journal of the ACM·2019· 14 cited
A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest
arXiv (Cornell University)·2018Open Access
Improved approximations for cubic bipartite and cubic TSP
Mathematical Programming·2017· 4 cited
Layers and matroids for the traveling salesman’s paths
Operations Research Letters·2017· 3 cited
Layers and Matroids for the Traveling Salesman's Paths
arXiv (Cornell University)·2017· 6 citedOpen Access
Layers and Matroids for the Traveling Salesman's Paths
arXiv (Cornell University)·2017Open Access
Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds
SIAM Journal on Computing·2017· 33 cited
The Salesman's Improved Paths: A 3/2+1/34 Approximation
2016· 24 cited
A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation
Information Processing Letters·2016· 3 cited
Minimizing worst-case and average-case makespan over scenarios
Journal of Scheduling·2016· 24 citedOpen Access
The Salesman's Improved Paths: 3/2+1/34 Integrality Gap and\n Approximation Ratio
arXiv (Cornell University)·2016· 1 citedOpen Access
The Salesman's Improved Paths: 3/2+1/34 Integrality Gap and Approximation Ratio
arXiv (Cornell University)·2016Open Access
Travelling Salesman Paths
HAL (Le Centre pour la Communication Scientifique Directe)·2016
Improved Approximations for Cubic Bipartite and Cubic TSP
Lecture notes in computer science·2016· 8 cited
A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest
arXiv (Cornell University)·2015· 1 citedOpen Access
Improved Approximations for Cubic and Cubic Bipartite TSP
arXiv (Cornell University)·2015· 2 citedOpen Access
On the integrality gap of the subtour LP for the 1,2-TSP
Mathematical Programming·2014· 9 cited
Scheduling over Scenarios on Two Machines
arXiv (Cornell University)·2014Open Access
An Upper Bound on the Number of Circular Transpositions to Sort a Permutation
arXiv (Cornell University)·2014· 2 citedOpen Access
page 1 of 3Next →

Frequent Co-authors

Frans Schalekamp(21), David P. Williamson(14), Suzanne van der Ster(6), Leen Stougie(5), René Sitters(4), András Sebő(4), Matthias Poloczek(3), Esteban Feuerstein(3), Alberto Marchetti-Spaccamela(3), Jiawei Qian(3), Nir Ailon(2), Noa Avigdor-Elgrabli(2), Edo Liberty(2), András Sebö(2), Michael Yu(2), Vera Traub(2), James C. Bieron(2), Gexin Yu(2), Tim Carnes(1), Chandrashekhar Nagarajan(1)