- Format
- Bog, paperback
- Engelsk
- 384 sider
Normalpris
kr. 259,95
Medlemspris
kr. 234,95
- Du sparer kr. 25,00
- Fri fragt
-
Leveringstid: 7-12 Hverdage (Sendes fra fjernlager) Forventet levering: 04-03-2026
- Kan pakkes ind og sendes som gave
Beskrivelse
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.
Detaljer
- SprogEngelsk
- Sidetal384
- Udgivelsesdato10-11-2011
- ISBN139780486414539
- Forlag Dover Publications Inc.
- FormatPaperback
- Udgave0
Størrelse og vægt
Anmeldelser
Vær den første!
Log ind for at skrive en anmeldelse.