Submodular cost allocation problem and applications
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
The entropy rounding method in approximation algorithms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximating rooted Steiner networks
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On the approximability and hardness of minimum topic connected overlay and its special instances
Theoretical Computer Science
Semidefinite programming and approximation algorithms: a survey
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Optimizing index for taxonomy keyword search
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Geometric packing under non-uniform constraints
Proceedings of the twenty-eighth annual symposium on Computational geometry
Parameterized approximation via fidelity preserving transformations
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
The 2-valued case of makespan minimization with assignment constraints
Information Processing Letters
Primal-dual approximation algorithms for Node-Weighted Steiner Forest on planar graphs
Information and Computation
Partitioned EDF scheduling on a few types of unrelated multiprocessors
Real-Time Systems
Approximation Algorithms for Capacitated Location Routing
Transportation Science
The power of deferral: maintaining a constant-competitive steiner tree online
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
No-Wait flowshop scheduling is as hard as asymmetric traveling salesman problem
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Multireference alignment using semidefinite programming
Proceedings of the 5th conference on Innovations in theoretical computer science
On the k-edge-incident subgraph problem and its variants
Discrete Applied Mathematics
Hi-index | 0.00 |
Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design; to computer science problems in databases; to advertising issues in viral marketing. Yet most such problems are NP-hard. Thus unless P = NP, there are no efficient algorithms to find optimal solutions to such problems. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Each chapter in the first part of the book is devoted to a single algorithmic technique, which is then applied to several different problems. The second part revisits the techniques but offers more sophisticated treatments of them. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithms courses, the book will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems.