| Publication | Date of Publication | Type |
|---|
| Stochastic optimization is (almost) as easy as deterministic optimization | 2026-05-29 | Paper |
| Optimal power-down strategies | 2026-05-29 | Paper |
| The effectiveness of Lloyd-type methods for the k-means problem | 2026-05-29 | Paper |
| Constant-factor approximation to deadline TSP and related problems in (almost) quasi-polytime | 2026-05-12 | Paper |
| Minimum-norm load balancing Is (almost) as easy as minimizing makespan | 2026-05-12 | Paper |
| Budget-feasible mechanism design: simpler, better mechanisms and general payment constraints | 2025-11-04 | Paper |
| Approximation algorithms for correlated knapsack orienteering | 2025-10-06 | Paper |
| Approximation algorithms for stochastic minimum-norm combinatorial optimization | 2025-08-12 | Paper |
| Achieving target equilibria in network routing games without knowing the latency functions | 2025-08-05 | Paper |
| A simple approximation algorithm for vector scheduling and applications to stochastic min-norm load balancing | 2024-05-14 | Paper |
A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time
(available as arXiv preprint) | 2023-02-07 | Paper |
Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems
(available as arXiv preprint) | 2022-08-16 | Paper |
Simpler and Better Algorithms for Minimum-Norm Load Balancing
(available as arXiv preprint) | 2022-05-11 | Paper |
A constant-factor approximation for directed latency in quasi-polynomial time
Journal of Computer and System Sciences | 2022-03-29 | Paper |
A constant-factor approximation for directed latency in quasi-polynomial time
Journal of Computer and System Sciences | 2022-03-29 | Paper |
| scientific article; zbMATH DE number 7378671 (Why is no real title available?) | 2021-08-04 | Paper |
On the integrality gap of the prize-collecting Steiner forest LP
(available as arXiv preprint) | 2021-07-28 | Paper |
Interpolating between \(k\)-median and \(k\)-center: approximation algorithms for ordered \(k\)-median
(available as arXiv preprint) | 2021-07-28 | Paper |
Approximate multi-matroid intersection via iterative refinement
Mathematical Programming. Series A. Series B | 2020-08-28 | Paper |
Improved Algorithms for MST and Metric-TSP Interdiction
(available as arXiv preprint) | 2020-05-27 | Paper |
Approximate multi-matroid intersection via iterative refinement
Integer Programming and Combinatorial Optimization | 2020-02-06 | Paper |
Approximate multi-matroid intersection via iterative refinement
Integer Programming and Combinatorial Optimization | 2020-02-06 | Paper |
Approximation algorithms for minimum norm and ordered optimization problems
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Approximation algorithms for distributionally-robust stochastic optimization with black-box distributions
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Achieving target equilibria in network routing games without knowing the latency functions
Games and Economic Behavior | 2019-12-12 | Paper |
Local-search based approximation algorithms for mobile facility location problems (extended abstract)
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Black-box reductions for cost-sharing mechanism design | 2019-05-10 | Paper |
Black-box reductions for cost-sharing mechanism design
Games and Economic Behavior | 2019-03-29 | Paper |
Approximation algorithms for minimum-load \(k\)-facility location
ACM Transactions on Algorithms | 2018-11-13 | Paper |
Fault-tolerant facility location
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Improved approximation algorithms for matroid and knapsack median problems and applications
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Approximating MIN-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
Approximation algorithms for clustering problems with lower bounds and outliers
(available as arXiv preprint) | 2017-12-19 | Paper |
Linear programming-based approximation algorithms for multi-vehicle minimum latency problems (extended abstract)
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Improved region-growing and combinatorial algorithms for k-route cut problems (extended abstract)
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
| Risk-averse stochastic optimization: probabilistically-constrained models and algorithms for black-box distributions (extended abstract) | 2017-09-29 | Paper |
Compact, provably-good LPs for orienteering and regret-bounded vehicle routing
(available as arXiv preprint) | 2017-08-31 | Paper |
MIN-MAX theorems for packing and covering odd \((u,v)\)-trails
(available as arXiv preprint) | 2017-08-31 | Paper |
Welfare maximization and truthfulness in mechanism design with ordinal preferences
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
Learning mixtures of arbitrary distributions over large discrete domains
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
Improved approximation algorithms for matroid and knapsack median problems and applications
(available as arXiv preprint) | 2017-03-22 | Paper |
| Approximation algorithms for minimum-load k-facility location | 2017-03-22 | Paper |
Approximating min-cost chain-constrained spanning-trees: a reduction from weighted to unweighted problems
Lecture Notes in Computer Science | 2016-08-10 | Paper |
Facility location with client latencies: LP-based techniques for minimum-latency problems
Mathematics of Operations Research | 2016-08-10 | Paper |
An approximation scheme for stochastic linear programming and its application to stochastic integer programs
Journal of the ACM | 2015-12-04 | Paper |
Learning Arbitrary Statistical Mixtures of Discrete Distributions
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Learning Arbitrary Statistical Mixtures of Discrete Distributions
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
| Correlation clustering, maximizing agreements via semidefinite programming | 2015-08-03 | Paper |
| Facility location with service installation costs | 2015-08-03 | Paper |
Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Near-optimal and robust mechanism design for covering problems with correlated players
Web and Internet Economics | 2015-01-12 | Paper |
| Approximation algorithms for prize collecting forest problems with submodular penalty functions | 2014-12-18 | Paper |
| The effectiveness of Stackelberg strategies and tolls for network congestion games | 2014-12-18 | Paper |
| Network design for information networks | 2014-10-13 | Paper |
The effectiveness of Stackelberg strategies and tolls for network congestion games
ACM Transactions on Algorithms | 2014-09-09 | Paper |
The effectiveness of Lloyd-type methods for the \(k\)-means problem
Journal of the ACM | 2014-02-17 | Paper |
Truthful and Near-Optimal Mechanism Design via Linear Programming
Journal of the ACM | 2014-02-17 | Paper |
Improved approximation guarantees for lower-bounded facility location
Approximation and Online Algorithms | 2013-09-13 | Paper |
Sampling-based approximation algorithms for multistage stochastic optimization
SIAM Journal on Computing | 2012-11-29 | Paper |
Approximability of the firefighter problem. Computing cuts over time
Algorithmica | 2012-04-26 | Paper |
LP-based approximation algorithms for capacitated facility location
Mathematical Programming. Series A. Series B | 2012-02-22 | Paper |
Facility location with client latencies: linear programming based techniques for minimum latency problems
Lecture Notes in Computer Science | 2011-06-24 | Paper |
| scientific article; zbMATH DE number 5764788 (Why is no real title available?) | 2010-08-06 | Paper |
Fault-tolerant facility location: a randomized dependent LP-rounding algorithm
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Approximation algorithms for the firefighter problem: cuts over time and submodularity
Algorithms and Computation | 2009-12-17 | Paper |
Truthful mechanism design for multidimensional scheduling via cycle monotonicity
Games and Economic Behavior | 2009-08-27 | Paper |
Approximation Algorithms for Data Placement Problems
SIAM Journal on Computing | 2009-08-20 | Paper |
Optimal Power-Down Strategies
SIAM Journal on Computing | 2008-10-28 | Paper |
Approximation Algorithms for 2-Stage Stochastic Optimization Problems
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science | 2008-04-17 | Paper |
Approximation Algorithms for Graph Homomorphism Problems
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Primal-dual algorithms for connected facility location problems
Algorithmica | 2004-11-05 | Paper |
| scientific article; zbMATH DE number 2079405 (Why is no real title available?) | 2004-07-28 | Paper |
| scientific article; zbMATH DE number 1947062 (Why is no real title available?) | 2003-07-07 | Paper |
| scientific article; zbMATH DE number 1500651 (Why is no real title available?) | 2000-09-04 | Paper |
