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

Skip to content

Approximation, Randomization and Combinatorial Optimization

Approximation, Randomization and Combinatorial Optimization

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

Approximation, Randomization and Combinatorial Optimization Papeback - - 2001st Edition

by Michel Goemans (Editor); Klaus Jansen (Editor); Jose D. Rolim (Editor)

Add to wish list
  • New
New

Description

Springer , pp. 312 . Papeback. New.
Ask the seller a question Add to wish list
NZ$164.17
NZ$7.12 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
  • Author Michel Goemans (Editor); Klaus Jansen (Editor); Jose D. Rolim (Editor)
  • Binding Papeback
  • Edition number 2001st
  • Edition 2001
  • Condition New
  • Pages 296
  • Volumes 1
  • Language ENG
  • Publisher Springer , New York
  • Publication date pp. 312
  • Bookseller's Inventory # 63037029
  • ISBN 9783540424703 / 3540424709
  • Weight 0.97 lbs (0.44 kg)
  • Dimensions 9.21 x 6.14 x 0.65 in (23.39 x 15.60 x 1.65 cm)
  • Category Computers - General Information
  • Library of Congress Catalogue Number 2001049298
  • 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

From the publisher

This book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California, USA in August 2001. The 26 revised full papers presented were carefully reviewed and selected from a total of 54 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization, de-randomization, average-case analysis, approximation classes, randomized complexity theory, scheduling, routing, coloring, partitioning, packing, covering, computational geometry, network design, and applications in various fields.
tracking-