This book constitutes the joint refereed proceedings of the 14th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2011, and the 15th International Workshop on Randomization and Computation, RANDOM 2011, held in Princeton, New Jer…
Approximation, randomization, and combinatorial optimization: algorithms and techniques ; 14th international wo…
by Ravi, R., Goldberg, Leslie Ann, Rolim, José D. P., International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, Princeton, N.J.), International Workshop on Randomization and Computation, Princeton, N.J.), Jansen, Klaus, APPROX, Princeton, NJ, RANDOM, Princeton, NJ
fromLecture Notes in Computer Science
With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterat…
A simple, powerful method that is iterative and useful in a variety of settings for exact and approximate optimization.