1 option
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011, Proceedings / edited by Leslie Ann Goldberg, Klaus Jansen, R. Ravi, José D.P. Rolim.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 6845
- Theoretical Computer Science and General Issues, 2512-2029 ; 6845
- Language:
- English
- Subjects (All):
- Algorithms.
- Computer science-Mathematics.
- Discrete mathematics.
- Artificial intelligence-Data processing.
- Computer science.
- Computer graphics.
- Computer networks.
- Discrete Mathematics in Computer Science.
- Data Science.
- Theory of Computation.
- Computer Graphics.
- Computer Communication Networks.
- Local Subjects:
- Algorithms.
- Discrete Mathematics in Computer Science.
- Data Science.
- Theory of Computation.
- Computer Graphics.
- Computer Communication Networks.
- Physical Description:
- 1 online resource (XV, 702 pages)
- Edition:
- 1st ed. 2011.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2011.
- System Details:
- text file PDF
- Summary:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-642-22935-0
- 9783642229350
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.