| Publication | Date of Publication | Type |
|---|
| Improved approximation algorithms for the joint replenishment problem with outliers, and with fairness constraints | 2024-11-28 | Paper |
| Hitting sets when the shallow cell complexity is small | 2024-07-19 | Paper |
| From Switch Scheduling to Datacenter Scheduling | 2024-03-26 | Paper |
| Erratum to “Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems” | 2024-03-01 | Paper |
| Scheduling appointments online: the power of deferred decision-making | 2023-07-25 | Paper |
| A min-max theorem for the minimum fleet-size problem | 2023-07-03 | Paper |
| SPT optimality (mostly) via linear programming | 2023-06-27 | Paper |
| Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems | 2022-12-01 | Paper |
| Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem | 2022-02-22 | Paper |
| On the power of static assignment policies for robust facility location problems | 2021-12-21 | Paper |
| Data-Driven Rebalancing Methods for Bike-Share Systems | 2021-10-05 | Paper |
| Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems | 2020-09-01 | Paper |
| Prize-Collecting TSP with a Budget Constraint | 2020-05-27 | Paper |
| Aggregating courier deliveries | 2018-11-06 | Paper |
| Fault-tolerant facility location | 2018-11-05 | Paper |
| Improving Christofides' Algorithm for the s-t Path TSP | 2018-08-02 | Paper |
| A bicriteria approximation algorithm for the \(k\)-center and \(k\)-median problems | 2018-06-22 | Paper |
| Minimizing multimodular functions and allocating capacity in bike-sharing systems | 2017-08-31 | Paper |
| A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems | 2017-05-24 | Paper |
| In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation | 2016-12-29 | Paper |
| A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract) | 2016-09-29 | Paper |
| The submodular joint replenishment problem | 2016-08-25 | Paper |
| An approximation scheme for stochastic linear programming and its application to stochastic integer programs | 2015-12-04 | Paper |
| Primal-dual schema for capacitated covering problems | 2015-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501837 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501373 | 2015-08-03 | Paper |
| Approximation algorithms for fragmenting a graph against a stochastically-located threat | 2015-05-12 | Paper |
| Provably near-optimal sampling-based algorithms for Stochastic inventory control models | 2014-11-25 | Paper |
| A constant approximation algorithm for the one-warehouse multi-retailer problem | 2014-10-13 | Paper |
| Improving christofides' algorithm for the s-t path TSP | 2014-05-13 | Paper |
| Sampling-Based Approximation Algorithms for Multistage Stochastic Optimization | 2012-11-29 | Paper |
| Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat | 2012-07-16 | Paper |
| A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem | 2012-02-29 | Paper |
| LP-based approximation algorithms for capacitated facility location | 2012-02-22 | Paper |
| Approximation algorithms for supply chain planning and logistics problems with market choice | 2011-11-23 | Paper |
| Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint | 2011-11-17 | Paper |
| Primal-Dual Schema and Lagrangian Relaxation for the k-Location-Routing Problem | 2011-08-17 | Paper |
| A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems | 2011-08-17 | Paper |
| The Design of Approximation Algorithms | 2011-07-01 | Paper |
| Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem | 2010-09-10 | Paper |
| Improved Lower Bounds for the Universal and a priori TSP | 2010-09-10 | Paper |
| Primal-dual algorithms for deterministic inventory problems | 2010-08-15 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| A PTAS for capacitated sum-of-ratios optimization | 2009-08-14 | Paper |
| Approximation Algorithms for Capacitated Stochastic Inventory Control Models | 2009-08-13 | Paper |
| Primal-Dual Schema for Capacitated Covering Problems | 2008-06-10 | Paper |
| A Constant Approximation Algorithm for the a priori Traveling Salesman Problem | 2008-06-10 | Paper |
| Algorithms for the universal and a priori TSP | 2008-05-29 | Paper |
| Primal-Dual Algorithms for Deterministic Inventory Problems | 2008-05-27 | Paper |
| Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models | 2008-05-27 | Paper |
| Approximation Algorithms for Stochastic Inventory Control Models | 2008-05-27 | Paper |
| Approximation Algorithms for 2-Stage Stochastic Optimization Problems | 2008-04-17 | Paper |
| Approximation Algorithms for 2-Stage Stochastic Scheduling Problems | 2007-11-29 | Paper |
| Approximation Algorithms for Stochastic Inventory Control Models | 2007-08-30 | Paper |
| Inventory and Facility Location Models with Market Selection | 2007-08-30 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5710226 | 2005-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4667217 | 2005-04-19 | Paper |
| An improved approximation algorithm for the partial Latin square extension problem. | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818873 | 2004-09-24 | Paper |
| Approximations and randomization to boost CSP techniques | 2004-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471365 | 2004-07-28 | Paper |
| Improved Approximation Algorithms for the Uncapacitated Facility Location Problem | 2004-01-08 | Paper |
| A constant-factor approximation algorithm for the \(k\)-median problem | 2003-05-04 | Paper |
| A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem | 2002-07-25 | Paper |
| Karp and Smale receive National Medals of Science. | 2002-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753723 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526991 | 2001-02-28 | Paper |
| Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds | 1999-10-17 | Paper |
| Improved bounds on relaxations of a parallel machine scheduling problem | 1999-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252386 | 1999-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400841 | 1998-08-02 | Paper |
| Short Shop Schedules | 1998-07-06 | Paper |
| Approximation algorithms | 1998-04-03 | Paper |
| Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms | 1997-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128880 | 1997-04-23 | Paper |
| Scheduling Parallel Machines On-Line | 1996-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871777 | 1996-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875178 | 1996-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871788 | 1996-04-08 | Paper |
| Fast Approximation Algorithms for Fractional Packing and Covering Problems | 1995-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4840777 | 1995-07-31 | Paper |
| An approximation algorithm for the generalized assignment problem | 1995-01-19 | Paper |
| Improved Approximation Algorithms for Shop Scheduling Problems | 1994-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140449 | 1993-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138949 | 1993-10-20 | Paper |
| Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010317 | 1992-09-27 | Paper |
| Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems | 1992-06-28 | Paper |
| Permutation vs. non-permutation flow shop schedules | 1992-06-27 | Paper |
| Approximation algorithms for scheduling unrelated parallel machines | 1990-01-01 | Paper |
| Analyzing the Held-Karp TSP bound: A monotonicity property with application | 1990-01-01 | Paper |
| Flipping Persuasively in Constant Time | 1990-01-01 | Paper |
| Simple constant-time consensus protocols in realistic failure models | 1989-01-01 | Paper |
| The parallel complexity of TSP heuristics | 1989-01-01 | Paper |
| A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3815886 | 1988-01-01 | Paper |
| Efficient parallel algorithms for edge coloring problems | 1987-01-01 | Paper |
| A better than “best possible” algorithm to edge color multigraphs | 1986-01-01 | Paper |
| Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3761689 | 1986-01-01 | Paper |
| A Packing Problem You Can Almost Solve by Sitting on Your Suitcase | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3768703 | 1985-01-01 | Paper |
| A Best Possible Heuristic for the k-Center Problem | 1985-01-01 | Paper |
| An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut Problem | 1985-01-01 | Paper |
| Recognizing graphs with fixed interval number is NP-complete | 1984-01-01 | Paper |
