| Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps | 0 | 0.34 | 2022 |
| The Two-Stripe Symmetric Circulant TSP is in P | 0 | 0.34 | 2022 |
| Tight Bounds for Online Weighted Tree Augmentation | 0 | 0.34 | 2022 |
| Recursive Random Contraction Revisited | 0 | 0.34 | 2021 |
| Improved Analysis of RANKING for Online Vertex-Weighted Bipartite Matching in the Random Order Model | 0 | 0.34 | 2021 |
| Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems | 0 | 0.34 | 2020 |
| Subtour Elimination Constraints Imply a Matrix-Tree Theorem SDP Constraint for the TSP | 0 | 0.34 | 2020 |
| Easy capacitated facility location problems, with connections to lot-sizing | 0 | 0.34 | 2020 |
| Learning to Solve Combinatorial Optimization Problems on Real-World Graphs in Linear Time | 1 | 0.34 | 2020 |
| Tight Bounds for Online Weighted Tree Augmentation | 0 | 0.34 | 2019 |
| Rank Aggregation: New Bounds for MCx. | 1 | 0.35 | 2019 |
| Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem. | 0 | 0.34 | 2019 |
| Tight Bounds for Online Weighted Tree Augmentation. | 0 | 0.34 | 2019 |
| Online Constrained Forest and Prize-Collecting Network Design. | 0 | 0.34 | 2018 |
| Pricing Problems Under The Nested Logit Model With A Quality Consistency Constraint | 0 | 0.34 | 2017 |
| Greedy algorithms for the single-demand facility location problem. | 0 | 0.34 | 2017 |
| Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds. | 6 | 0.45 | 2017 |
| Prize-Collecting TSP with a Budget Constraint. | 0 | 0.34 | 2017 |
| The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem | 0 | 0.34 | 2017 |
| An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem. | 4 | 0.40 | 2017 |
| Simple Approximation Algorithms for Balanced MAX 2SAT | 0 | 0.34 | 2016 |
| A Randomized O(log n)-Competitive Algorithm for the Online Connected Facility Location Problem. | 0 | 0.34 | 2016 |
| MC4, Copeland and restart probabilities. | 0 | 0.34 | 2015 |
| An Experimental Evaluation of the Best-of-Many Christofides' Algorithm for the Traveling Salesman Problem | 3 | 0.48 | 2015 |
| Assortment optimization over time | 0 | 0.34 | 2015 |
| The Online Prize-Collecting Facility Location Problem | 1 | 0.37 | 2015 |
| A 3/2-approximation algorithm for some minimum-cost graph problems | 0 | 0.34 | 2015 |
| 2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture. | 0 | 0.34 | 2014 |
| The Online Connected Facility Location Problem. | 2 | 0.39 | 2014 |
| On Some Recent Approximation Algorithms for MAX SAT. | 3 | 0.39 | 2014 |
| On Some Recent MAX SAT Approximation Algorithms. | 0 | 0.34 | 2013 |
| A proof of the Boyd-Carr conjecture | 4 | 0.41 | 2012 |
| A Dual-Fitting $\frac{3}{2}$ -Approximation Algorithm for Some Minimum-Cost Graph Problems. | 0 | 0.34 | 2012 |
| A note on the generalized min-sum set cover problem. | 2 | 0.39 | 2011 |
| An O(log n)-competitive algorithm for online constrained forest problems | 0 | 0.34 | 2011 |
| Popular ranking. | 0 | 0.34 | 2011 |
| An Experimental Evaluation of Incremental and Hierarchical k-Median Algorithms | 0 | 0.34 | 2011 |
| A General Approach for Incremental Approximation and Hierarchical Clustering | 34 | 1.27 | 2010 |
| A simple GAP-canceling algorithm for the generalized maximum flow problem | 5 | 0.43 | 2009 |
| Stackelberg thresholds in network routing games or the value of altruism | 25 | 1.11 | 2009 |
| Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements | 2 | 0.38 | 2008 |
| A Faster, Better Approximation Algorithm for the Minimum Latency Problem | 20 | 0.98 | 2008 |
| Offline and online facility leasing | 0 | 0.34 | 2008 |
| Approximation algorithms for prize collecting forest problems with submodular penalty functions | 17 | 0.75 | 2007 |
| Deterministic pivoting algorithms for constrained ranking and clustering problems | 27 | 1.57 | 2007 |
| A simpler and better derandomization of an approximation algorithm for single source rent-or-buy | 14 | 0.59 | 2007 |
| Deterministic algorithms for rank aggregation and other ranking and clustering problems | 33 | 1.90 | 2007 |
| Integer Programming and Combinatorial Optimization, 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings | 26 | 2.90 | 2007 |
| Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems | 48 | 1.60 | 2006 |
| An adaptive algorithm for selecting profitable keywords for search-based advertising services | 57 | 6.00 | 2006 |
