The following pages link to David P. Williamson (Q324760):
Displaying 19 items.
- The Online Connected Facility Location Problem (Q5405074) (← links)
- On Some Recent Approximation Algorithms for MAX SAT (Q5405076) (← links)
- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems (Q5443388) (← links)
- Pricing Problems Under the Nested Logit Model with a Quality Consistency Constraint (Q5739129) (← links)
- (Q5743492) (← links)
- A simple GAP-canceling algorithm for the generalized maximum flow problem (Q5901126) (← links)
- A simple GAP-canceling algorithm for the generalized maximum flow problem (Q5901710) (← links)
- A combinatorial cut-toggling algorithm for solving Laplacian linear systems (Q6066766) (← links)
- A 4/3-approximation algorithm for half-integral cycle cut instances of the TSP (Q6086003) (← links)
- Erratum to “Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems” (Q6122585) (← links)
- The Circlet Inequalities: A New, Circulant-Based, Facet-Defining Inequality for the TSP (Q6199246) (← links)
- Subtour Elimination Constraints Imply a Matrix-Tree Theorem SDP Constraint for the TSP (Q6322741) (← links)
- Easy Capacitated Facility Location Problems, with Connections to Lot-Sizing (Q6332538) (← links)
- Recursive random contraction revisited (Q6538744) (← links)
- Revisiting Garg's 2-approximation algorithm for the \(k\)-MST problem in graphs (Q6539113) (← links)
- Max cut and semidefinite rank (Q6564284) (← links)
- An experimental evaluation of semidefinite programming and spectral algorithms for max cut (Q6579779) (← links)
- Graph coloring and semidefinite rank (Q6589762) (← links)
- A combinatorial cut-toggling algorithm for solving Laplacian linear systems (Q6610339) (← links)
