Order Total (1 Item Items):
Shipping Destination:
Efficient Approximation Online Algorithms (16 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (16)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (12)
- As New, Fine or Near Fine (2)
- Very Good or Good (2)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
- All Bindings
- Hardcover (No further results match this refinement)
- Softcover (16)
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (7)
- Not Print on Demand (14)
Language (1)
Free Shipping
- Free Shipping to U.S.A. (No further results match this refinement)
Seller Location
Seller Rating
-
paperback. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
-
Paperback. Condition: Very Good. We are unable to ship to Canada at this time.Ex-library paperback in very nice condition with the usual markings and attachments.
-
-
-
Condition: As New. Unread book in perfect condition.
-
Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications (Lecture Notes in Computer Science, 3484)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 66.45
US$ 15.73 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications (Lecture Notes in Computer Science)
Published by Springer Berlin Heidelberg 2010-06-02, 2010
ISBN 10: 3540322124 ISBN 13: 9783540322122
Language: English
Paperback. Condition: New.
-
Efficient Approximation And Online Algorithms : Recent Progress on Classical Combinatorial Optimization Problems And New Applications
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 66.44
US$ 19.70 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Condition: New. pp. 364.
-
Condition: New. pp. 364 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
-
Efficient Approximation And Online Algorithms : Recent Progress on Classical Combinatorial Optimization Problems And New Applications
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 75.42
US$ 19.70 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Condition: New. pp. 364.
-
Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications (Lecture Notes in Computer Science)
Published by Springer-Verlag New York Inc, 2006
ISBN 10: 3540322124 ISBN 13: 9783540322122
Language: English
Paperback. Condition: Brand New. 1st edition. 349 pages. 9.25x6.25x0.75 inches. In Stock.
-
Taschenbuch. Condition: Neu. Efficient Approximation and Online Algorithms | Recent Progress on Classical Combinatorial Optimization Problems and New Applications | Evripidis Bampis (u. a.) | Taschenbuch | viii | Englisch | 2006 | Springer | EAN 9783540322122 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
-
Efficient Approximation and Online Algorithms
Published by Springer, Berlin, Springer Berlin Heidelberg, Springer, 2006
ISBN 10: 3540322124 ISBN 13: 9783540322122
Language: English
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book provides a good opportunity for computer science practitioners and researchers to get in sync with current state-of-the-art and future trends in the field of combinatorial optimization and online algorithms. Recent advances in this area are presented focusing on the design of efficient approximation and on-line algorithms. One central idea in the book is to use a linear program relaxation of the problem, randomization and rounding techniques. 348 pp. Englisch.
-
Efficient Approximation and Online Algorithms
Published by Springer Berlin Heidelberg, 2006
ISBN 10: 3540322124 ISBN 13: 9783540322122
Language: English
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Charts recent advances in the fieldContains carefully selected papers that cover some classical problems of scheduling, packing, and graph theoryContains new optimization problem.
