The following pages link to David B. Shmoys (Q304237):
Displaying 50 items.
- An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut Problem (Q3689216) (← links)
- A Packing Problem You Can Almost Solve by Sitting on Your Suitcase (Q3718472) (← links)
- A better than “best possible” algorithm to edge color multigraphs (Q3725544) (← links)
- (Q3761689) (← links)
- (Q3768703) (← links)
- Efficient parallel algorithms for edge coloring problems (Q3783599) (← links)
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach (Q3792237) (← links)
- (Q3815886) (← links)
- Simple constant-time consensus protocols in realistic failure models (Q3830798) (← links)
- Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems (Q3990106) (← links)
- (Q4010317) (← links)
- Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better (Q4016707) (← links)
- Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds (Q4238532) (← links)
- (Q4252386) (← links)
- Improved Approximation Algorithms for Shop Scheduling Problems (Q4302287) (← links)
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms (Q4361782) (← links)
- Short Shop Schedules (Q4367253) (← links)
- Approximation algorithms (Q4374975) (← links)
- (Q4400841) (← links)
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem (Q4441898) (← links)
- (Q4471365) (← links)
- (Q4526991) (← links)
- (Q4667217) (← links)
- The parallel complexity of TSP heuristics (Q4729351) (← links)
- (Q4818873) (← links)
- (Q4840777) (← links)
- Fast Approximation Algorithms for Fractional Packing and Covering Problems (Q4848416) (← links)
- Scheduling Parallel Machines On-Line (Q4862799) (← links)
- (Q4871777) (← links)
- (Q4871788) (← links)
- (Q4875178) (← links)
- Fault-tolerant facility location (Q4962756) (← links)
- Aggregating courier deliveries (Q4963126) (← links)
- Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem (Q5035879) (← links)
- Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems (Q5058035) (← links)
- Prize-Collecting TSP with a Budget Constraint (Q5111751) (← links)
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems (Q5119847) (← links)
- Data-Driven Rebalancing Methods for Bike-Share Systems (Q5154459) (← links)
- A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems (Q5346558) (← links)
- Approximation Algorithms for 2-Stage Stochastic Optimization Problems (Q5385968) (← links)
- Primal-Dual Algorithms for Deterministic Inventory Problems (Q5387979) (← links)
- Approximation Algorithms for Stochastic Inventory Control Models (Q5388030) (← links)
- Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models (Q5388063) (← links)
- Improving christofides' algorithm for the s-t path TSP (Q5415521) (← links)
- Approximation Algorithms for 2-Stage Stochastic Scheduling Problems (Q5429264) (← links)
- (Q5501373) (← links)
- (Q5501837) (← links)
- (Q5710226) (← links)
- Integer Programming and Combinatorial Optimization (Q5712454) (← links)
- Algorithms - ESA 2003 (Q5897232) (← links)
