Cantitate/Preț
Produs

Combinatorial Optimization: Networks and Matroids: Dover Books on Mathematics

Autor Eugene S. Lawler, Mathematics
en Limba Engleză Paperback – noi 2011
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.
Citește tot Restrânge

Din seria Dover Books on Mathematics

Preț: 10012 lei

Preț vechi: 14268 lei
-30%

Puncte Express: 150

Preț estimativ în valută:
1918 2089$ 1638£

Cartea nu mai face parte din oferta noastră

Doresc să fiu notificat când acest titlu va fi disponibil:

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780486414539
ISBN-10: 0486414531
Pagini: 384
Dimensiuni: 136 x 215 x 19 mm
Greutate: 0.4 kg
Editura: Dover Publications
Seria Dover Books on Mathematics


Descriere

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.