Original Image
click to view more

Combinatorial Optimization: Networks and Matroids

by Combinatorial Optimization: Networks and Matroids

$16.02

List Price: $24.95
Save: $8.93 (35%)
add to favourite
  • In Stock - Ship in 24 hours with Free Online tracking.
  • FREE DELIVERY by Wednesday, May 28, 2025
  • 24/24 Online
  • Yes High Speed
  • Yes Protection
Tell-A-Friend
Last update:

Description

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.

Last updated on

Product Details

  • Dover Publications Brand
  • Nov 10, 2011 Pub Date:
  • 0486414531 ISBN-10:
  • 9780486414539 ISBN-13:
  • 384.0 pages Paperback
  • English Language
  • 8.48 in * 0.76 in * 5.36 in Dimensions:
  • 1 lb Weight: