Combinatorial Optimization - Lawler, Eugene
21,99 €
inkl. MwSt.

Versandfertig in über 4 Wochen
payback
11 °P sammeln
  • Broschiertes Buch

Perceptive text examines shortest paths, network flows, bipartite and nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. Suitable for courses in combinatorial computing and concrete computational complexity.

Andere Kunden interessierten sich auch für
Produktbeschreibung
Perceptive text examines shortest paths, network flows, bipartite and nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. Suitable for courses in combinatorial computing and concrete computational complexity.