If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.
Customer service
All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com
Sale & Press
If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com
Help
If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.
Customer service
All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com
Sale & Press
If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com
Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics.
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer,
birth defects, or other reproductive harm.
For MAP (Minimum Advertised Price) violations and Intellectual Property (IP) or Trademark concerns, please contact:
support@ergodebooks.com
⚠️ California Proposition 65 Warning: Some products sold on this website may expose you to chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm. For more information, visit www.P65Warnings.ca.gov.
