Approximation Algorithms, Vijay V. Vazirani

Автор: Chandra Chekuri; Klaus Jansen; Jos? D.P. Rolim; Lu
Название: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3540282394 ISBN-13(EAN): 9783540282396
Издательство: Springer
Рейтинг:
Цена: 93160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Contains 41 reviewed papers, selected by the two program committees from a total of 101 submissions. Among the issues addressed are design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, and more.

Автор: Irit Dinur; Klaus Jansen; Seffi Naor; Jos? Rolim
Название: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3642036848 ISBN-13(EAN): 9783642036842
Издательство: Springer
Рейтинг:
Цена: 121110.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 12th International Workshop APPROX 2009 and 13th International Workshop RANDOM 2009 Berkeley CA USA. .

Автор: Ashish Goel; Klaus Jansen; Jos? Rolim; Ronitt Rubi
Название: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3540853626 ISBN-13(EAN): 9783540853626
Издательство: Springer
Рейтинг:
Цена: 97820.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the joint refereed proceedings of the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008 and the 12th International Workshop on Randomization and Computation, RANDOM 2008, held in Boston, MA, USA, in August 2008. This book reviews 20 revised papers of the APPROX 2008 workshop.

Автор: Evripidis Bampis; Klaus Jansen
Название: Approximation and Online Algorithms
ISBN: 3642124496 ISBN-13(EAN): 9783642124495
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the refereed post workshop proceedings of the 7th International Workshop on Approximation and Online Algorithms, WAOA 2009, held in Copenhagen, Denmark, in September 2009 as part of the ALGO 2009 conference event.

Автор: Klaus Jansen; Monaldo Mastrolilli
Название: Approximation and Online Algorithms
ISBN: 3319517406 ISBN-13(EAN): 9783319517407
Издательство: Springer
Рейтинг:
Цена: 51230.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the thoroughly refereed post-workshop proceedings of the 14th International Workshop on Approximation and Online Algorithms, WAOA 2016, held in Aarhus, Denmark, in August 2016 as part of ALGO 2016.

Автор: Evripidis Bampis; Ola Svensson
Название: Approximation and Online Algorithms
ISBN: 3319182625 ISBN-13(EAN): 9783319182629
Издательство: Springer
Рейтинг:
Цена: 44720.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the thoroughly refereed post-workshop proceedings of the 12th International Workshop on Approximation and Online Algorithms, WAOA 2014, held in Wroclaw, Poland, in September 2014 as part of ALGO 2014.

Автор: Laura Sanit?; Martin Skutella
Название: Approximation and Online Algorithms
ISBN: 3319286838 ISBN-13(EAN): 9783319286839
Издательство: Springer
Рейтинг:
Цена: 44720.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the thoroughly refereed post-workshop proceedings of the 13th International Workshop on Approximation and Online Algorithms, WAOA 2015, held in Patras, Greece, in September 2015 as part of ALGO 2015.The 17 revised full papers presented were carefully reviewed and selected from 40 submissions.

Автор: Klaus Jansen; Stefano Leonardi; Vijay Vazirani
Название: Approximation Algorithms for Combinatorial Optimization
ISBN: 3540441867 ISBN-13(EAN): 9783540441861
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Compiled from the proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, this volume contains 20 revised full papers. Coverage includes design and analysis of approximation algorithms, inapproximability results and online problems.

Автор: Michel Goemans; Klaus Jansen; Jose D.P. Rolim; Luc
Название: Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
ISBN: 3540424709 ISBN-13(EAN): 9783540424703
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: These are the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001.

Автор: Dorit Hochbaum; Klaus Jansen; Jose D.P. Rolim; Ali
Название: Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3540663290 ISBN-13(EAN): 9783540663294
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This text presents various new results within the areas covered by the workshop.

Автор: Klaus Jansen; Jose Rolim
Название: Approximation Algorithms for Combinatorial Optimization
ISBN: 3540647368 ISBN-13(EAN): 9783540647362
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: A volume of 17 papers from a workshop on approximation algorithms for combinatorial optimization. They address the design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization techniques, average-case analysis, scheduling problems, and applications.

Автор: Klaus Jansen; Samir Khuller
Название: Approximation Algorithms for Combinatorial Optimization
ISBN: 3540679960 ISBN-13(EAN): 9783540679967
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The topics dealt with include design and analysis of approximation algorithms, inapproximibility results, randomization techniques, average-case analysis, scheduling problems, cuts and connectivity, packing and covering, geometric problems, network design, and various applications.