- Start
- Combinatorial Optimization
Combinatorial Optimization
Angebote / Angebote:
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.
Folgt in ca. 15 Arbeitstagen