Combinatorial Optimization (eBook, ePUB) - Lawler, Eugene
15,95 €
15,95 €
inkl. MwSt.
Sofort per Download lieferbar
15,95 €
15,95 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
Als Download kaufen
Geschenk
Als Download kaufen
15,95 €
inkl. MwSt.
Sofort per Download lieferbar
Jetzt verschenken
15,95 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
  • Format: ePub

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.

  • Geräte: eReader
  • mit Kopierschutz
  • eBook Hilfe
  • Größe: 15.12MB
Produktbeschreibung
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.

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, D ausgeliefert werden.