Anke van Zuylen

From MaRDI portal
Person:408427

Available identifiers

zbMath Open van-zuylen.ankeMaRDI QIDQ408427

List of research outcomes





PublicationDate of PublicationType
A duality based 2-approximation algorithm for maximum agreement forest2023-03-01Paper
The Salesman’s Improved Paths through Forests2020-02-11Paper
Rank Aggregation: Together We're Strong2019-09-11Paper
Layers and matroids for the traveling salesman's paths2019-06-11Paper
https://portal.mardi4nfdi.de/entity/Q57434922019-05-10Paper
Improved approximations for cubic bipartite and cubic TSP2018-10-26Paper
Minimizing worst-case and average-case makespan over scenarios2018-02-28Paper
A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest2017-12-19Paper
Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds2017-06-28Paper
Layers and Matroids for the Traveling Salesman's Paths2017-03-21Paper
Improved Approximations for Cubic Bipartite and Cubic TSP2016-08-10Paper
A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation2016-07-27Paper
The Salesman's Improved Paths: 3/2+1/34 Integrality Gap and Approximation Ratio2016-04-08Paper
Split scheduling with uniform setup times2015-04-24Paper
On the integrality gap of the subtour LP for the 1,2-TSP2015-04-16Paper
Scheduling over Scenarios on Two Machines2014-09-26Paper
2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture2014-07-11Paper
Popular ranking2014-05-05Paper
Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems2014-04-22Paper
On Some Recent Approximation Algorithms for MAX SAT2014-03-31Paper
Clustering with or without the approximation2013-06-28Paper
Improved Approximation Algorithms for Bipartite Correlation Clustering2013-02-04Paper
Simpler approximation of the maximum asymmetric traveling salesman problem2012-08-23Paper
Simpler 3/4-Approximation Algorithms for MAX SAT2012-07-16Paper
On the Integrality Gap of the Subtour LP for the 1,2-TSP2012-06-29Paper
An improved monotone algorithm for scheduling related machines with precedence constraints2012-04-05Paper
Improved Approximation Algorithms for Bipartite Correlation Clustering2011-09-16Paper
Deterministic sampling algorithms for network design2011-07-01Paper
Linear programming based approximation algorithms for feedback set problems in bipartite tournaments2011-05-18Paper
Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems2011-04-27Paper
Clustering with or without the Approximation2010-07-20Paper
Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle Packing2010-07-20Paper
Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments2009-06-03Paper
Deterministic Sampling Algorithms for Network Design2008-11-25Paper
Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems2008-02-20Paper
A simpler and better derandomization of an approximation algorithm for single source rent-or-buy2008-01-21Paper
THE ACHILLES' HEEL OF THE GSR SHUFFLE: A NOTE ON NEW AGE SOLITAIRE2005-03-21Paper

Research outcomes over time

This page was built for person: Anke van Zuylen