Combinatorial Optimization: Networks and Matroids
Combinatorial Optimization: Networks and Matroids
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.
PRP: 154.69 Lei
Acesta este Prețul Recomandat de Producător. Prețul de vânzare al produsului este afișat mai jos.
139.22Lei
139.22Lei
154.69 LeiPrimești 139 puncte
Livrare in 2-4 saptamani
Descrierea produsului
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.
Detaliile produsului
