BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Approximation, Randomization, and Combinatorial Optimization. Algorithms and
Stock photo: cover may vary

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques Papeback -

by Prasad Raghavendra (Editor); Sofya Raskhodnikova (Editor); Klaus Jansen (Editor)

Add to wish list
  • New
New

Description

Springer , pp. 732 . Papeback. New.
Ask the seller a question Add to wish list
NZ$185.78
NZ$7.16 Delivery within USA
Standard delivery: 9 to 14 days
More delivery options
Ships from Cold Books (New York, United States)

Details

  • Title Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
  • Author Prasad Raghavendra (Editor); Sofya Raskhodnikova (Editor); Klaus Jansen (Editor)
  • Binding Papeback
  • Condition New
  • Pages 716
  • Volumes 1
  • Language ENG
  • Publisher Springer
  • Publication date pp. 732
  • Illustrated Yes
  • Features Illustrated
  • Bookseller's Inventory # 698186337
  • ISBN 9783642403279 / 3642403271
  • Weight 2.22 lbs (1.01 kg)
  • Dimensions 9.21 x 6.14 x 1.46 in (23.39 x 15.60 x 3.71 cm)
  • Themes
    • Aspects (Academic): Science/Technology Aspects
  • Category Computers - Languages / Programming
  • Dewey Decimal Code 004.015
  • Quantity available 4

About Cold Books New York, United States

Biblio member since 2012

Terms of Sale: 30 day return guarantee, with full refund including shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Cold Books

Reader reviews for Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

From the publisher

This book constitutes the proceedings of the 16th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2013, and the 17th International Workshop on Randomization and Computation, RANDOM 2013, held in August 2013 in the USA. The total of 48 carefully reviewed and selected papers presented in this volume consist of 23 APPROX papers selected out of 46 submissions, and 25 RANDOM papers selected out of 52 submissions. APPROX 2013 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems, while RANDOM 2013 focuses on applications of randomness to computational and combinatorial problems.
tracking-