Nina Kraus (ed.); Samira Anderson (ed.); Travis White-Schwoch (ed.); Richard R. Fay (ed.); Arthur N. Popper (ed.) Springer (2017) Saatavuus: Tilaustuote Kovakantinen kirja
Nina Kraus (ed.); Samira Anderson (ed.); Travis White-Schwoch (ed.); Richard R. Fay (ed.); Arthur N. Popper (ed.) Springer (2018) Saatavuus: Tilaustuote Pehmeäkantinen kirja
Ravi A. Chandra (ed.); Celine B. Ord (ed.); Shushan Rana (ed.); Eric K. Hansen (ed.); Thomas, Jr., Charles R. (ed.) Springer (2020) Saatavuus: Tilaustuote Pehmeäkantinen kirja
Kasinathan Muthukkumaran (ed.); Ravi Sankar Jakka (ed.); C. R. Parthasarathy (ed.); B. Soundara (ed.) Springer (2022) Saatavuus: Tilaustuote Kovakantinen kirja
Kasinathan Muthukkumaran (ed.); Ravi Sankar Jakka (ed.); C. R. Parthasarathy (ed.); B. Soundara (ed.) Springer (2023) Saatavuus: Tilaustuote Pehmeäkantinen kirja
Goutam Sanyal (ed.); Carlos M. Travieso-González (ed.); Shashank Awasthi (ed.); Carla M. A. Pinto (ed.); B. R. Purushothama Springer (2022) Saatavuus: Tilaustuote Kovakantinen kirja
Springer Sivumäärä: 702 sivua Asu: Pehmeäkantinen kirja Painos: 2011 Julkaisuvuosi: 2011, 05.08.2011 (lisätietoa) Kieli: Englanti
This book constitutes the joint refereed proceedings of the 14th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2011, and the 15th International Workshop on Randomization and Computation, RANDOM 2011, held in Princeton, New Jersey, USA, in August 2011. The volume presents 29 revised full papers of the APPROX 2011 workshop, selected from 66 submissions, and 29 revised full papers of the RANDOM 2011 workshop, selected from 64 submissions. They were carefully reviewed and selected for inclusion in the book. In addition two abstracts of invited talks are included. APPROX focuses on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM is concerned with applications of randomness to computational and combinatorial problems.
