Slide 1 Prize Collecting Cuts Daniel Golovin Carnegie Mellon University Lamps of ALADDIN 2005 Joint work with Mohit Singh & Viswanath Nagarajan Slide 2 2 The Problem…
Classification of Scheduling Problems 1 Combinatorial Algorithms Parametric Pruning 2 Metric k-center Given a complete undirected graph G = (V, E) with nonnegative edge costs…
Strong LP Formulations & Primal-Dual Approximation Algorithms David Shmoys (joint work Tim Carnes & Maurice Cheung) TexPoint fonts used in EMF. Read the TexPoint…
Prize Collecting Cuts Daniel Golovin Carnegie Mellon University Lamps of ALADDIN 2005 Joint work with Mohit Singh & Viswanath Nagarajan The Problem Input: Undirected…