OpenCourser
Learn skills that shape your future
Visit OpenCourser.com
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.
Save
Protected by Amazon A-to-z Guarantee & generous return policies
Every book purchase is protected by the Amazon A-to-z Guarantee. This guarantee covers both the condition of your book and its timely delivery, providing full buyer protection whether you purchase directly from Amazon or from third-party marketplace sellers.
Generous 30-day return policy on physical books. Amazon makes returns effortless with self-service return labels, drop-off at thousands of local locations (Kohl's, Whole Foods, UPS Stores), and free return shipping on eligible book purchases.
Maximize your savings with competitive pricing, deep discounts on new and used marketplace copies, bundled textbook rentals, and exclusive member savings through Amazon Prime with free fast delivery.
Read your way across versatile digital and physical formats: instant delivery via Kindle eBooks, unlimited reading with a Kindle Unlimited subscription, audiobook listening with Audible (often featuring a 30-day free trial), or traditional paperback and hardcover editions.
OpenCourser helps millions of learners each year. People visit us to learn workspace skills, ace their exams, and nurture their curiosity.
Our extensive catalog contains over 50,000 courses and twice as many books. Browse by search, by topic, or even by career interests. We'll match you to the right resources quickly.
Find this site helpful? Tell a friend about us.
We're supported by our community of learners. When you purchase or subscribe to courses and programs or purchase books, we may earn a commission from our partners.
Your purchases help us maintain our catalog and keep our servers humming without ads.
Thank you for supporting OpenCourser.
