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 a ...Celý popis
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.
Proč nakupovat na Enbooku?
Velký výběr
Nabízíme miliony knih v angličtině. Od beletrie až po ty nejodborněji odborné.
Poštovné zdarma
Poštovné už od 54 Kč a při objednávce nad 1499 Kč doprava na pobočku Zásilkovny zdarma.
Skvělé ceny
Ceny knih se snažíme držet při zemi a vždy pod cenou doporučovanou vydavatelem, aby si je mohl koupit opravdu každý.
Online podpora
Můžete využít online chatu, emailu nebo nám zatelefonovat.
Osobní přístup
Nejdůležitější je pro nás Vaše spokojenost. Prodáváme knihy, protože je milujeme. Nejsme žádní nadnárodní giganti, ale poctivá česká firma.