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.
Prečo nakupovať na Enbooku?
VEĽKÝ VÝBER
Ponúkame milióny kníh v angličtine. Od beletrie až po tie najodbornejšie odborné.
POŠTOVNÉ ZADARMO
Poštovné už od 2,99 € a pri objednávke nad 60 € doprava na pobočku Zásielkovne zadarmo
SKVELÉ CENY
Ceny kníh sa snažíme držať pri zemi a vždy pod cenou odporúčanou vydavateľom, aby si ich mohol kúpiť naozaj každý.
OVERENÉ ZÁKAZNÍKMI
Získali sme certifikát "Overené zákazníkmi" na Heureka.sk. Prezrite si naše recenzie
ONLINE PODPORA
Môžete využiť online chat, email alebo nám zatelefonovať.