Combinatorial Optimization: Networks and Matroids
De (autor): Eugene Lawler
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.
-10%
transport gratuit
PRP: 154.69 Lei
Acesta este Pretul Recomandat de Producator. Pretul de vanzare al produsului este afisat mai jos.
139.22Lei
139.22Lei
154.69 LeiPrimesti 139 puncte
Primesti puncte de fidelitate dupa fiecare comanda! 100 puncte de fidelitate reprezinta 1 leu. Foloseste-le la viitoarele achizitii!
Livrare in 2-4 saptamani
X
Pentru a putea comanda rapid este nevoie sa introduceti numarul dvs de telefon in formatul 0xxxxxxxxx (10 cifre).Un operator Libris.ro va suna si va cere telefonic restul datelor necesare.
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
De pe acelasi raft
Parerea ta e inspiratie pentru comunitatea Libris!