
Combinatorial Optimization
Networks and Matroids
Versandkostenfrei!
Versandfertig in über 4 Wochen
18,99 €
inkl. MwSt.
PAYBACK Punkte
9 °P sammeln!
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.