:: eBooks :: Kembali

eBooks :: Kembali

Combinatorial optimization : theory and algorithms

Bernhard Korte (Springer, 2012)

 Abstrak

This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.

 File Digital: 1

Shelf
 Combinatorial Optimization.pdf :: Unduh

LOGIN required

 Metadata

No. Panggil : e20420307
Entri utama-Nama orang :
Entri tambahan-Nama orang :
Subjek :
Penerbitan : Berlin: Springer, 2012
Sumber Pengatalogan: LibUI eng rda
Tipe Konten: text
Tipe Media: computer
Tipe Pembawa: online resource
Deskripsi Fisik:
Tautan: http://link.springer.com/book/10.1007%2F978-3-642-24488-9
Lembaga Pemilik:
Lokasi:
  • Ketersediaan
  • Ulasan
No. Panggil No. Barkod Ketersediaan
e20420307 TERSEDIA
Ulasan:
Tidak ada ulasan pada koleksi ini: 20420307