The following pages link to David P. Williamson (Q324760):
Displaying 50 items.
- The Design of Approximation Algorithms (Q3010438) (← links)
- An O(logn)-Competitive Algorithm for Online Constrained Forest Problems (Q3012790) (← links)
- Approximating the smallest <i>k</i> -edge connected spanning subgraph by LP-rounding (Q3057092) (← links)
- (Q3128880) (← links)
- (Q3128895) (← links)
- Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems (Q3169053) (← links)
- Offline and Online Facility Leasing (Q3503855) (← links)
- A Faster, Better Approximation Algorithm for the Minimum Latency Problem (Q3532573) (← links)
- A general approach for incremental approximation and hierarchical clustering (Q3583429) (← links)
- Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements (Q3602838) (← links)
- (Q4010317) (← links)
- Adversarial queueing theory (Q4228491) (← links)
- (Q4228514) (← links)
- (Q4234132) (← links)
- (Q4234151) (← links)
- (Q4252309) (← links)
- (Q4263705) (← links)
- New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem (Q4317711) (← links)
- (Q4331300) (← links)
- Short Shop Schedules (Q4367253) (← links)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming (Q4369893) (← links)
- Approximation algorithms (Q4374975) (← links)
- (Q4471278) (← links)
- Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler (Q4490785) (← links)
- Gadgets, Approximation, and Linear Programming (Q4507337) (← links)
- A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction (Q4526965) (← links)
- (Q4537735) (← links)
- The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem (Q4577740) (← links)
- An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem (Q4577945) (← links)
- Primal-dual approximation algorithms for feedback problems in planar graphs (Q4645920) (← links)
- (Q4763416) (← links)
- (Q4829040) (← links)
- A General Approximation Technique for Constrained Forest Problems (Q4834382) (← links)
- Scheduling Parallel Machines On-Line (Q4862799) (← links)
- (Q4886063) (← links)
- Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances (Q4888174) (← links)
- Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout (Q4943873) (← links)
- (Q4952605) (← links)
- Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps (Q5076689) (← links)
- Tight Bounds for Online Weighted Tree Augmentation (Q5091248) (← links)
- Prize-Collecting TSP with a Budget Constraint (Q5111751) (← links)
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems (Q5119847) (← links)
- 2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture (Q5169706) (← links)
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q5176000) (← links)
- Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem (Q5206234) (← links)
- A primal-dual approximation algorithm for generalized Steiner network problems (Q5248542) (← links)
- An Experimental Evaluation of Incremental and Hierarchical <i>k</i> -Median Algorithms (Q5266539) (← links)
- Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds (Q5269825) (← links)
- Network Flow Algorithms (Q5377010) (← links)
- A General Approach for Incremental Approximation and Hierarchical Clustering (Q5390609) (← links)
