Combinational Optimization

Prijs: € 24,46
Verwachte levertijd: 3 werkdagen

Omschrijving

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 m...
Lees meer

Gerelateerde artikelen

Uitgebreide omschrijving

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.
Uitgever Dover Publications Inc.
Druk 0
ISBN/EAN 9780486414539
Auteur Lawler, Eugene,
Vakken Wiskunde

Anderen bestelden ook: