Anke van Zuylen

J. ACM, 2019

2018

Layers and matroids for the traveling salesman's paths.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2018

Improved approximations for cubic bipartite and cubic TSP.

[BibT_eX]

[DOI]

Alberto Marchetti-Spaccamela

Math. Program., 2018

2017

Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds.

[BibT_eX]

[DOI]

SIAM J. Comput., 2017

Minimizing worst-case and average-case makespan over scenarios.

[BibT_eX]

[DOI]

Esteban Feuerstein

J. Sched., 2017

2016

A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

The Salesman's Improved Paths: 3/2+1/34 Integrality Gap and Approximation Ratio.

[BibT_eX]

[DOI]

András Sebö

CoRR, 2016

A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest.

[BibT_eX]

[DOI]

Suzanne van der Ster

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

The Salesman's Improved Paths: A 3/2+1/34 Approximation.

[BibT_eX]

[DOI]

András Sebö

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015

Split scheduling with uniform setup times.

[BibT_eX]

[DOI]

J. Sched., 2015

On the integrality gap of the subtour LP for the 1, 2-TSP.

[BibT_eX]

[DOI]

Math. Program., 2015

Improved Approximations for Cubic and Cubic Bipartite TSP.

[BibT_eX]

[DOI]

CoRR, 2015

2014

2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture.

[BibT_eX]

[DOI]

Math. Oper. Res., 2014

Popular ranking.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

An Upper Bound on the Number of Circular Transpositions to Sort a Permutation.

[BibT_eX]

[DOI]

CoRR, 2014

On Some Recent Approximation Algorithms for MAX SAT.

[BibT_eX]

[DOI]

Matthias Poloczek

Alberto Marchetti-Spaccamela

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Scheduling over Scenarios on Two Machines.

[BibT_eX]

[DOI]

Esteban Feuerstein

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2013

Clustering with or without the approximation.

[BibT_eX]

[DOI]

Michael Yu

J. Comb. Optim., 2013

Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

On Some Recent MAX SAT Approximation Algorithms.

[BibT_eX]

[DOI]

Matthias Poloczek

CoRR, 2013

Toward a precise integrality gap for triangle-free 2-matchings.

[BibT_eX]

Philipp Klodt

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012

Improved Approximation Algorithms for Bipartite Correlation Clustering.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem.

[BibT_eX]

[DOI]

Katarzyna E. Paluch

Khaled M. Elbassioni

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

A proof of the Boyd-Carr conjecture.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011

Linear programming based approximation algorithms for feedback set problems in bipartite tournaments.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

An improved monotone algorithm for scheduling related machines with precedence constraints.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2011

On the Integrality Gap of the Subtour LP for the 1,2-TSP

[BibT_eX]

[DOI]

CoRR, 2011

Deterministic Sampling Algorithms for Network Design.

[BibT_eX]

[DOI]

Algorithmica, 2011

Simpler 3/4-Approximation Algorithms for MAX SAT.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

2010

Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle Packing.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009

Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems.

[BibT_eX]

[DOI]

Math. Oper. Res., 2009

Rank Aggregation: Together We're Strong.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009

2007

A simpler and better derandomization of an approximation algorithm for single source rent-or-buy.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2007

Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

Deterministic pivoting algorithms for constrained ranking and clustering problems.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Maximizing influence in a competitive social network: a follower's perspective.

[BibT_eX]

[DOI]

Tim Carnes

Chandrashekhar Nagarajan

Stefan M. Wild