Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [electronic resource] : 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.
Contributor(s): Goldberg, Leslie Ann [editor.]
| Jansen, Klaus [editor.] | Ravi, R [editor.] | Rolim, José D.P [editor.] | SpringerLink (Online service).
Material type: 
BookSeries: Theoretical Computer Science and General Issues: 6845Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2011Edition: 1st ed. 2011.Description: XV, 702 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642229350.Subject(s): Algorithms | Computer science -- Mathematics | Discrete mathematics | Artificial intelligence -- Data processing | Computer science | Computer graphics | Computer networks | Algorithms | Discrete Mathematics in Computer Science | Data Science | Theory of Computation | Computer Graphics | Computer Communication NetworksAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 518.1 Online resources: Click here to access online
In:
Springer Nature eBookSummary: 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.
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.
There are no comments for this item.