Artículo: AMZ-B00EYVP9M0

Combinatorial Optimization: Networks and Matroids (Dover Books on Mathematics)

Format:

Kindle

Hardcover

Kindle

Paperback

Detalles del producto
Disponibilidad
Sin stock
Peso con empaque
0.20 kg
Devolución
No
Condición
Nuevo
Producto de
Amazon
Viaja desde
USA

Sobre este producto
  • 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.

Producto prohibido

Este producto no está disponible

Este producto viaja de USA a tus manos en

Conoce más detalles

Highlight, take notes, and search in the book