Deskripsi Lengkap :: Kembali

Buku Teks :: Kembali

Buku Teks

Parameterized algorithms / Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh, authors

Nomor Panggil 519.544 PAR
Pengarang/kontributor lain
Subjek
Penerbitan Cham: Springer, 2015
Kata Kunci :  
 Info Lainnya
Sumber Pengatalogan LibUI eng rda
ISBN 9783319212746
Tipe Konten text (rdacontent)
Tipe Media unmediated (rdamedia)
Tipe Carrier volume (rdacarrier)
Edisi
Deskripsi Fisik xvii, 613 pages : illustrations (some color) ; 24 cm
Catatan Bibliografi Bibliographies in each chapter
Catatan Seri
Catatan Umum Includes bibliographical references and index
Lembaga Pemilik Universitas Indonesia
Lokasi Perpustakaan UI, Lantai 2 (Buku Teks)
  • Ketersediaan
  • File Digital: 0
  • Ulasan
  • Sampul
  • Abstrak
Nomor Panggil No. Barkod Ketersediaan
519.544 PAR 01-18-08295 TERSEDIA
Ulasan:
Tidak ada ulasan pada koleksi ini: 20498671
This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers many of the recent developments of the field, including application of important separators, branching based on linear programming, Cut &​ Count to obtain faster algorithms on tree decompositions, algorithms based on representative families of matroids, and use of the Strong Exponential Time Hypothesis. A number of older results are revisited and explained in a modern and didactic way. The book provides a toolbox of algorithmic techniques. Part I is an overview of basic techniques, each chapter discussing a certain algorithmic paradigm. The material covered in this part can be used for an introductory course on fixed-parameter tractability. Part II discusses more advanced and specialized algorithmic ideas, bringing the reader to the cutting edge of current research. Part III presents complexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds. All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work.