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 - - 2009th Edition

by Irit Dinur (Editor); Klaus Jansen (Editor); Seffi Naor (Editor)

Add to wish list
  • New
New

Description

Springer , pp. 756 . Papeback. New.
Ask the seller a question Add to wish list
A$266.25
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 Irit Dinur (Editor); Klaus Jansen (Editor); Seffi Naor (Editor)
  • Binding Papeback
  • Edition number 2009th
  • Edition 2009
  • Condition New
  • Pages 742
  • Volumes 1
  • Language ENG
  • Publisher Springer
  • Publication date pp. 756
  • Illustrated Yes
  • Features Bibliography, Illustrated, Index, Table of Contents
  • Bookseller's Inventory # 61362840
  • ISBN 9783642036842 / 3642036848
  • Weight 2.25 lbs (1.02 kg)
  • Dimensions 9.3 x 6.1 x 1 in (23.62 x 15.49 x 2.54 cm)
  • Category Computers - General Information
  • Dewey Decimal Code 004
  • 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 volume contains the papers presented at the 12th International Wo- shop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2009) and the 13th International Workshop on Randomization and Computation (RANDOM 2009), which took place concurrently at the HP - ditorium in UC Berkeley, USA, during August 21-23, 2009. APPROX focuses on algorithmic and complexity issues surrounding the development of e?cient approximate solutions to computationally di?cult problems, and was the 12th in the series after Aalborg (1998), Berkeley (1999), Saarbru ]cken (2000), Ber- ley (2001), Rome (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), Princeton (2007), and Boston (2008). RANDOM is concerned with applications of randomness to computational and combinatorial problems, and was the 13th workshop in the series following Bologna (1997), Barcelona (1998), Berkeley(1999), Geneva(2000), Berkeley(2001), Harvard(2002), Prin- ton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), Princeton (2007), and Boston (2008). Topics of interest for APPROX and RANDOM are: design and analysis of approximation algorithms, hardness of approximation, small space algorithms, sub-linear time algorithms, streaming algorithms, embeddings and metric space methods, mathematicalprogrammingmethods, combinatorialproblemsingraphs andnetworks, gametheory, markets, andeconomicapplications, geometricpr- lems, packing, covering, scheduling, approximate learning, design and analysis of online algorithms, randomized complexity theory, pseudorandomness and - randomization, randomcombinatorialstructures, randomwalks/Markovchains, expander graphs and randomness extractors, probabilistic proof systems, err- correctingcodes, average-caseanalysis, propertytesting, computationallearning theory, and other applications of approximation and randomness. The volume contains 25 contributed papers, selected by the APPROX Program Committee out of 56 submissions, and 28 contributed papers, selected by the RANDOM Program Committee out of 57 submissions.
tracking-