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 Moses Charikar (Editor); Klaus Jansen (Editor); Omer Reingold (Editor)

Add to wish list
  • New
New

Description

Springer , pp. 642 . Papeback. New.
Ask the seller a question Add to wish list
A$125.02
A$5.82 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 Moses Charikar (Editor); Klaus Jansen (Editor); Omer Reingold (Editor)
  • Binding Papeback
  • Edition Us Edition
  • Condition New
  • Pages 628
  • Volumes 1
  • Language ENG
  • Publisher Springer , Berlin, Germany
  • Publication date pp. 642
  • Features Bibliography, Index, Table of Contents
  • Bookseller's Inventory # 6306259
  • ISBN 9783540742074 / 3540742077
  • Weight 1.95 lbs (0.88 kg)
  • Dimensions 9.18 x 6.24 x 0.91 in (23.32 x 15.85 x 2.31 cm)
  • Category Computers - General Information
  • Dewey Decimal Code 004
  • Quantity available 1

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 volume presents the refereed proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and the 11th International Workshop on Randomization and Computation. The papers cover 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 much more.

tracking-