Approximation algorithms and semidefinite programming
Bernd Gartner (Springer, 2012 )
|
| This book follows the “semidefinite side” of these developments, presenting some of the main ideas behind approximation algorithms based on semidefinite programming. It develops the basic theory of semidefinite programming, presents one of the known efficient algorithms in detail, and describes the principles of some others. It also includes applications, focusing on approximation algorithms. |
 Approximation Algorithms and Semidefinite Programming.pdf :: Unduh
|
| No. Panggil : | e20419221 |
| 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-22015-9 |
| Lembaga Pemilik: | |
| Lokasi: |
| No. Panggil | No. Barkod | Ketersediaan |
|---|---|---|
| e20419221 | TERSEDIA |
| Ulasan: |
| Tidak ada ulasan pada koleksi ini: 20419221 |
