| Publication | Date of Publication | Type |
|---|
| On the integrality ratio for asymmetric TSP | 2026-05-29 | Paper |
| Approximating the stochastic knapsack problem: the benefit of adaptivity | 2026-05-29 | Paper |
| Minimum bounded degree spanning trees | 2026-05-29 | Paper |
| On the single-source unsplittable flow problem | 2025-10-29 | Paper |
| Shrunk subspaces via operator Sinkhorn iteration | 2024-05-14 | Paper |
Improved bounds for on-line load balancing
Lecture Notes in Computer Science | 2024-01-29 | Paper |
Polynomiality for Bin Packing with a Constant Number of Item Types
Journal of the ACM | 2022-12-08 | Paper |
| Approximating incremental combinatorial optimization problems | 2021-07-28 | Paper |
Polynomiality for bin packing with a constant number of item types
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Polynomiality for bin packing with a constant number of item types
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Improved algorithms for vertex cover with hard capacities on multigraphs and hypergraphs
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
| scientific article; zbMATH DE number 7051222 (Why is no real title available?) | 2019-05-06 | Paper |
The strongest facets of the acyclic subgraph polytope are unknown
Integer Programming and Combinatorial Optimization | 2019-01-11 | Paper |
A supermodular relaxation for scheduling with release dates
Integer Programming and Combinatorial Optimization | 2019-01-11 | Paper |
Primal-dual approximation algorithms for feedback problems in planar graphs
Integer Programming and Combinatorial Optimization | 2019-01-11 | Paper |
Congestion games viewed from M-convexity
Operations Research Letters | 2018-09-28 | Paper |
| Stochastic Block Model for Hypergraphs: Statistical limits and a semidefinite programming approach | 2018-07-08 | Paper |
An \(O(\log n/\log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem
Operations Research | 2017-09-26 | Paper |
Matroids are immune to Braess' paradox
Mathematics of Operations Research | 2017-09-22 | Paper |
Matroids are immune to Braess' paradox
Mathematics of Operations Research | 2017-09-22 | Paper |
| Discrete Newton's algorithm for parametric submodular function minimization | 2017-08-31 | Paper |
.878-approximation algorithms for MAX CUT and MAX 2SAT
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Smallest compact formulation for the permutahedron
Mathematical Programming. Series A. Series B | 2015-10-14 | Paper |
| scientific article; zbMATH DE number 6472636 (Why is no real title available?) | 2015-08-14 | Paper |
| Covering minimum spanning trees of random subgraphs | 2015-08-03 | Paper |
| Trade-offs on the location of the core node in a network | 2015-08-03 | Paper |
A primal-dual approximation algorithm for generalized Steiner network problems
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
| Adaptivity and approximation for stochastic packing problems | 2014-10-13 | Paper |
| Approximating the smallest k-edge connected spanning subgraph by LP-rounding | 2014-10-13 | Paper |
| An \(O(\log n/ \log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem | 2014-05-22 | Paper |
Matroids and integrality gaps for hypergraphic Steiner tree relaxations
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Matroids and integrality gaps for hypergraphic Steiner tree relaxations
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Algorithms for symmetric submodular function minimization under hereditary constraints and generalizations
SIAM Journal on Discrete Mathematics | 2013-09-26 | Paper |
Algorithms for symmetric submodular function minimization under hereditary constraints and generalizations
SIAM Journal on Discrete Mathematics | 2013-09-26 | Paper |
A flow model based on polylinking system
Mathematical Programming. Series A. Series B | 2012-10-15 | Paper |
Tight approximation algorithms for maximum separable assignment problems
Mathematics of Operations Research | 2012-05-24 | Paper |
| scientific article; zbMATH DE number 5983877 (Why is no real title available?) | 2011-12-01 | Paper |
Approximating the stochastic Knapsack problem: the benefit of adaptivity
Mathematics of Operations Research | 2011-04-27 | Paper |
Approximating the smallest \(k\)-edge connected spanning subgraph by LP-rounding
Networks | 2010-11-24 | Paper |
Tight approximation algorithms for maximum general assignment problems
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
An approximate König's theorem for edge-coloring weighted bipartite graphs
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Deformable Polygon Representation and Near-Mincuts
Bolyai Society Mathematical Studies | 2009-02-12 | Paper |
Stochastic Covering and Adaptivity
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Improved Bounds on Nonblocking 3-Stage Clos Networks
SIAM Journal on Computing | 2008-06-19 | Paper |
On the Integrality Ratio for the Asymmetric Traveling Salesman Problem
Mathematics of Operations Research | 2008-05-27 | Paper |
Finite Termination of “Augmenting Path” Algorithms in the Presence of Irrational Problem Data
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Covering minimum spanning trees of random subgraphs
Random Structures & Algorithms | 2007-02-07 | Paper |
When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
Mathematics of Operations Research | 2005-11-11 | Paper |
Trade-offs on the location of the core node in a network
Networks | 2005-02-23 | Paper |
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
Journal of Computer and System Sciences | 2004-11-22 | Paper |
Cooperative facility location games
Journal of Algorithms | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 2038780 (Why is no real title available?) | 2004-02-08 | Paper |
Wide partitions, Latin tableaux, and Rota's basis conjecture
Advances in Applied Mathematics | 2003-12-03 | Paper |
| scientific article; zbMATH DE number 1833395 (Why is no real title available?) | 2002-11-21 | Paper |
Single machine scheduling with release dates
SIAM Journal on Discrete Mathematics | 2002-04-23 | Paper |
Approximate edge splitting
SIAM Journal on Discrete Mathematics | 2001-03-19 | Paper |
| scientific article; zbMATH DE number 1534298 (Why is no real title available?) | 2000-11-23 | Paper |
| scientific article; zbMATH DE number 1305426 (Why is no real title available?) | 2000-09-26 | Paper |
A 1. 47-approximation for a preemptive single-machine scheduling problem
Operations Research Letters | 2000-09-04 | Paper |
Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler
SIAM Journal on Discrete Mathematics | 2000-07-20 | Paper |
Semidefinite programs and association schemes
Computing | 2000-06-22 | Paper |
| scientific article; zbMATH DE number 1445290 (Why is no real title available?) | 2000-05-10 | Paper |
On the single-source unsplittable flow problem
Combinatorica | 1999-12-08 | Paper |
Primal-dual approximation algorithms for feedback problems in planar graphs
Combinatorica | 1999-10-31 | Paper |
| scientific article; zbMATH DE number 1263260 (Why is no real title available?) | 1999-10-28 | Paper |
An efficient approximation algorithm for the survivable network design problem
Mathematical Programming. Series A. Series B | 1999-10-18 | Paper |
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
Operations Research Letters | 1999-09-23 | Paper |
An improved approximation ratio for the minimum latency problem
Mathematical Programming. Series A. Series B | 1999-09-15 | Paper |
| scientific article; zbMATH DE number 1263278 (Why is no real title available?) | 1999-03-16 | Paper |
Semidefinite programming and combinatorial optimization
Documenta Mathematica | 1998-08-06 | Paper |
Semidefinite programming and combinatorial optimization
Documenta Mathematica | 1998-08-06 | Paper |
| scientific article; zbMATH DE number 1175950 (Why is no real title available?) | 1998-07-19 | Paper |
Semidefinite programming in combinatorial optimization
Mathematical Programming. Series A. Series B | 1998-05-25 | Paper |
The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover
SIAM Journal on Discrete Mathematics | 1998-05-11 | Paper |
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Journal of the ACM | 1998-01-28 | Paper |
| scientific article; zbMATH DE number 1047729 (Why is no real title available?) | 1997-08-11 | Paper |
| scientific article; zbMATH DE number 1003267 (Why is no real title available?) | 1997-08-04 | Paper |
| scientific article; zbMATH DE number 1003253 (Why is no real title available?) | 1997-04-23 | Paper |
Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances
INFORMS Journal on Computing | 1996-10-28 | Paper |
| scientific article; zbMATH DE number 871910 (Why is no real title available?) | 1996-09-16 | Paper |
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing | 1996-03-18 | Paper |
Worst-case comparison of valid inequalities for the TSP
Mathematical Programming. Series A. Series B | 1996-02-28 | Paper |
Minimizing submodular functions over families of sets
Combinatorica | 1996-01-24 | Paper |
A primal-dual approximation algorithm for generalized Steiner network problems
Combinatorica | 1995-10-17 | Paper |
An approximation algorithm for scheduling on three dedicated machines
Discrete Applied Mathematics | 1995-08-27 | Paper |
Approximating minimum-cost graph problems with spanning tree edges
Operations Research Letters | 1995-07-06 | Paper |
| scientific article; zbMATH DE number 742977 (Why is no real title available?) | 1995-04-11 | Paper |
On the Maximum Number of Triangles in Wheel-Free Graphs
Combinatorics, Probability and Computing | 1995-03-09 | Paper |
New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
SIAM Journal on Discrete Mathematics | 1994-12-20 | Paper |
Arborescence polytopes for series-parallel graphs
Discrete Applied Mathematics | 1994-12-01 | Paper |
| scientific article; zbMATH DE number 432785 (Why is no real title available?) | 1994-09-19 | Paper |
A note on the prize collecting traveling salesman problem
Mathematical Programming. Series A. Series B | 1994-08-16 | Paper |
The Steiner tree polytope and related polyhedra
Mathematical Programming. Series A. Series B | 1994-05-05 | Paper |
Survivable networks, linear programming relaxations and the parsimonious property
Mathematical Programming. Series A. Series B | 1993-12-06 | Paper |
A Lower Bound on the Expected Cost of an Optimal Assignment
Mathematics of Operations Research | 1993-08-05 | Paper |
A catalog of steiner tree formulations
Networks | 1993-06-29 | Paper |
A generalization of Petersen's theorem
Discrete Mathematics | 1993-06-20 | Paper |
Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem
Mathematics of Operations Research | 1991-01-01 | Paper |
2-change for k-connected networks
Operations Research Letters | 1991-01-01 | Paper |
Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
Operations Research Letters | 1989-01-01 | Paper |
Number of faults a system can withstand without repairs
(available as arXiv preprint) | N/A | Paper |
