Doesn't suit? No problem! You can return within 30 days
You won't go wrong with a gift voucher. The gift recipient can choose anything from our offer.
30-day return policy
This book shows how runtime behavior can be analyzed in a rigorous way and for combinatorial optimization in particular. It presents well-known problems such as minimum spanning trees, shortest paths, maximum matching, and covering and scheduling problems.