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 / Leslie Ann Goldberg, Klaus Jansen, R. Ravi, José D.P. Rolim (eds.).
| Author/creator | International Workshop on Approximation Algorithms for Combinatorial Optimization Problems |
| Other author | Goldberg, Leslie Ann. |
| Other author | International Workshop on Randomization and Computation 2011 : Princeton University), |
| Format | Electronic |
| Publication Info | Heidelberg ; New York : Springer, [2011] |
| Description | xv, 702 pages : illustrations ; 24 cm. |
| Supplemental Content | Full text available from Springer Books |
| Supplemental Content | Full text available from Springer Nature - Springer Computer Science eBooks 2011 English International |
| Supplemental Content | Full text available from SpringerLINK Lecture Notes in Computer Science Contemporary (1997-present) |
| Subjects |
| Variant title | APPROX 2011 |
| Variant title | RANDOM 2011 |
| Series | Lecture notes in computer science, 0302-9743 ; 6845 LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Partial contents | New tools for graph coloring / Sanjeev Arora and Rong Ge -- Inapproximability of NP-complete variants of Nash equilibrium / Per Austrin, Mark Braverman, and Eden Chlamtáč. |
| Bibliography note | Includes bibliographical references and index. |
| Access restriction | Available only to authorized users. |
| Technical details | Mode of access: World Wide Web |
| Genre/form | Electronic books. |
| LCCN | 2011933808 |
| ISBN | 9783642229343 (paperback) |
| ISBN | (ebook) |
Availability
| Library | Location | Call Number | Status | Item Actions |
|---|---|---|---|---|
| Electronic Resources | ✔ Available |