The entropy rounding method in approximation algorithms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Degree-Constrained node-connectivity
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Constrained matching problems in bipartite graphs
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Network bargaining: using approximate blocking sets to stabilize unstable instances
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
On some network design problems with degree constraints
Journal of Computer and System Sciences
Approximating minimum cost source location problems with local vertex-connectivity demands
Journal of Discrete Algorithms
Upper and lower degree bounded graph orientation with minimum penalty
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Hi-index | 0.00 |
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 iterative in essence, and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids, and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.