Anke van Zuylen

50 papers A* 4A 4B 5C 4Misc 3Journal 30

Year	Rank	Type	Title / Venue / Authors
2023	J	`jnl`	A duality based 2-approximation algorithm for maximum agreement forest. Math. Program. Neil Olver, Frans Schalekamp, Suzanne van der Ster, Leen Stougie, Anke van Zuylen
2019	J	`jnl`	The Salesman's Improved Paths through Forests. J. ACM András Sebö, Anke van Zuylen
2018	J	`jnl`	A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest. CoRR Neil Olver, Frans Schalekamp, Suzanne van der Ster, Leen Stougie, Anke van Zuylen
2018	J	`jnl`	Improved approximations for cubic bipartite and cubic TSP. Math. Program. Anke van Zuylen
2018	J	`jnl`	Layers and matroids for the traveling salesman's paths. Oper. Res. Lett. Frans Schalekamp, András Sebö, Vera Traub, Anke van Zuylen
2017	J	`jnl`	Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds. SIAM J. Comput. Matthias Poloczek, Georg Schnitger, David P. Williamson, Anke van Zuylen
2017	J	`jnl`	Layers and Matroids for the Traveling Salesman's Paths. CoRR Frans Schalekamp, András Sebö, Vera Traub, Anke van Zuylen
2017	J	`jnl`	Minimizing worst-case and average-case makespan over scenarios. J. Sched. Esteban Feuerstein, Alberto Marchetti-Spaccamela, Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, Anke van Zuylen
2016	A*	`conf`	A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest. ICALP Frans Schalekamp, Anke van Zuylen, Suzanne van der Ster
2016	J	`jnl`	A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation. Inf. Process. Lett. Anke van Zuylen, James C. Bieron, Frans Schalekamp, Gexin Yu
2016	B	`conf`	Improved Approximations for Cubic Bipartite and Cubic TSP. IPCO Anke van Zuylen
2016	J	`jnl`	The Salesman's Improved Paths: 3/2+1/34 Integrality Gap and Approximation Ratio. CoRR András Sebö, Anke van Zuylen
2016	A*	`conf`	The Salesman's Improved Paths: A 3/2+1/34 Approximation. FOCS András Sebö, Anke van Zuylen
2015	J	`jnl`	A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest. CoRR Frans Schalekamp, Anke van Zuylen, Suzanne van der Ster
2015	J	`jnl`	Improved Approximations for Cubic and Cubic Bipartite TSP. CoRR Anke van Zuylen
2015	J	`jnl`	On the integrality gap of the subtour LP for the 1, 2-TSP. Math. Program. Jiawei Qian, Frans Schalekamp, David P. Williamson, Anke van Zuylen
2015	J	`jnl`	Split scheduling with uniform setup times. J. Sched. Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, Víctor Verdugo, Anke van Zuylen
2014	J	`jnl`	2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture. Math. Oper. Res. Frans Schalekamp, David P. Williamson, Anke van Zuylen
2014	J	`jnl`	An Upper Bound on the Number of Circular Transpositions to Sort a Permutation. CoRR Anke van Zuylen, James C. Bieron, Frans Schalekamp, Gexin Yu
2014	B	`conf`	On Some Recent Approximation Algorithms for MAX SAT. LATIN Matthias Poloczek, David P. Williamson, Anke van Zuylen
2014	J	`jnl`	Popular ranking. Discret. Appl. Math. Anke van Zuylen, Frans Schalekamp, David P. Williamson
2014	Misc	`conf`	Scheduling over Scenarios on Two Machines. COCOON Esteban Feuerstein, Alberto Marchetti-Spaccamela, Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, Anke van Zuylen
2014	J	`jnl`	Scheduling over Scenarios on Two Machines. CoRR Esteban Feuerstein, Alberto Marchetti-Spaccamela, Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, Anke van Zuylen
2013	J	`jnl`	Clustering with or without the approximation. J. Comb. Optim. Frans Schalekamp, Michael Yu, Anke van Zuylen
2013	J	`jnl`	Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems. Discret. Appl. Math. Anke van Zuylen
2013	J	`jnl`	On Some Recent MAX SAT Approximation Algorithms. CoRR Matthias Poloczek, David P. Williamson, Anke van Zuylen
2013	C	`conf`	Toward a precise integrality gap for triangle-free 2-matchings. CTW Philipp Klodt, Anke van Zuylen
2012	A*	`conf`	A proof of the Boyd-Carr conjecture. SODA Frans Schalekamp, David P. Williamson, Anke van Zuylen
2012	J	`jnl`	Improved Approximation Algorithms for Bipartite Correlation Clustering. SIAM J. Comput. Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke van Zuylen
2012	B	`conf`	On the Integrality Gap of the Subtour LP for the 1, 2-TSP. LATIN Jiawei Qian, Frans Schalekamp, David P. Williamson, Anke van Zuylen
2012	A	`conf`	Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem. STACS Katarzyna E. Paluch, Khaled M. Elbassioni, Anke van Zuylen
2012	J	`jnl`	Split Scheduling with Uniform Setup Times CoRR Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, Victor Verdugo, Anke van Zuylen
2011	J	`jnl`	A Proof of the Boyd-Carr Conjecture CoRR Frans Schalekamp, David P. Williamson, Anke van Zuylen
2011	J	`jnl`	An improved monotone algorithm for scheduling related machines with precedence constraints. Oper. Res. Lett. Anke van Zuylen
2011	J	`jnl`	Deterministic Sampling Algorithms for Network Design. Algorithmica Anke van Zuylen
2011	A	`conf`	Improved Approximation Algorithms for Bipartite Correlation Clustering. ESA Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke van Zuylen
2011	J	`jnl`	Linear programming based approximation algorithms for feedback set problems in bipartite tournaments. Theor. Comput. Sci. Anke van Zuylen
2011	J	`jnl`	On the Integrality Gap of the Subtour LP for the 1,2-TSP CoRR Jiawei Qian, Frans Schalekamp, David P. Williamson, Anke van Zuylen
2011	C	`conf`	Popular Ranking. CTW Anke van Zuylen, Frans Schalekamp, David P. Williamson
2011	B	`conf`	Simpler 3/4-Approximation Algorithms for MAX SAT. WAOA Anke van Zuylen
2010	Misc	`conf`	Clustering with or without the Approximation. COCOON Frans Schalekamp, Michael Yu, Anke van Zuylen
2010	Misc	`conf`	Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle Packing. COCOON Anke van Zuylen
2009	J	`jnl`	Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems. Math. Oper. Res. Anke van Zuylen, David P. Williamson
2009	C	`conf`	Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments. TAMC Anke van Zuylen
2009	A	`conf`	Rank Aggregation: Together We're Strong. ALENEX Frans Schalekamp, Anke van Zuylen
2008	A	`conf`	Deterministic Sampling Algorithms for Network Design. ESA Anke van Zuylen
2007	J	`jnl`	A simpler and better derandomization of an approximation algorithm for single source rent-or-buy. Oper. Res. Lett. David P. Williamson, Anke van Zuylen
2007	B	`conf`	Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems. WAOA Anke van Zuylen, David P. Williamson
2007	A*	`conf`	Deterministic pivoting algorithms for constrained ranking and clustering problems. SODA Anke van Zuylen, Rajneesh Hegde, Kamal Jain, David P. Williamson
2007	C	`conf`	Maximizing influence in a competitive social network: a follower's perspective. ICEC Tim Carnes, Chandrashekhar Nagarajan, Stefan M. Wild, Anke van Zuylen