Order Total (1 Item Items):
Shipping Destination:
Algorithmics Hard Problems Introduction by Hromkovic Juraj (20 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (20)
- 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 (9)
- As New, Fine or Near Fine (7)
- Very Good or Good (3)
- Fair or Poor (1)
- As Described (No further results match this refinement)
Binding
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 (10)
- Not Print on Demand (20)
Language (2)
Free Shipping
Seller Location
Seller Rating
-
Hardcover. Condition: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.
-
Condition: New. Page block firm and clean, binding unblemished, boards straight, no markings of any kind. Fine, like new condition. Well packaged and promptly shipped from California. Partnered with Friends of the Library since 2010.
-
-
Algorithmics for Hard Problems. Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics.
Seller: Antiquariat Renner OHG, Albstadt, Germany
Association Member: BOEV
Seller rating 5 out of 5 stars
Hardcover. Condition: Wie neu. Bln., Springer (2001). gr.8°. 64 figs. XI, 492 p. Hardbound. Texts in Theoretical Computer Sciences. An EATCS Series.- Incl. bibliography.- Like new.
-
Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics (Texts in Theoretical Computer Science)
Seller: Phatpocket Limited, Waltham Abbey, HERTS, United Kingdom
Seller rating 5 out of 5 stars
Condition: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.
-
Condition: As New. Unread book in perfect condition.
-
Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
Published by Springer, Bath, 2003
ISBN 10: 3540441344 ISBN 13: 9783540441342
Seller: Attic Books (ABAC, ILAB), London, ON, Canada
Seller rating 5 out of 5 stars
Hardcover. Condition: Good. Second Edition. xiii, 544 p. 24 cm. 71 figures. Stain on front cover. Ink signature on front free endpaper. A little dust on text block edge. A few wrinkles to some front pages.
-
Condition: Poor. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In poor condition, suitable as a reading copy. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,950grams, ISBN:9783540668602.
-
Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics (Texts in Theoretical Computer Science. An EATCS Series)
Book 11 of 45: Texts in Theoretical Computer Science. An EATCSSeller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 60.59
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics (Texts in Theoretical Computer Science. An EATCS Series)
Book 11 of 45: Texts in Theoretical Computer Science. An EATCSLanguage: English
Published by Springer Berlin Heidelberg 2010-02-19, 2010
ISBN 10: 3642079091 ISBN 13: 9783642079092
Paperback. Condition: New.
-
Algorithmics for Hard Problems : Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
Book 11 of 45: Texts in Theoretical Computer Science. An EATCSSeller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New.
-
Algorithmics for Hard Problems : Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
Book 11 of 45: Texts in Theoretical Computer Science. An EATCSSeller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition.
-
-
Algorithmics for Hard Problems : Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
Book 11 of 45: Texts in Theoretical Computer Science. An EATCSSeller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New.
-
Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
Book 11 of 45: Texts in Theoretical Computer Science. An EATCSSeller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 85.99
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Algorithmics for Hard Problems : Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
Language: English
Published by Springer-Verlag GmbH & Co. KG, 2001
ISBN 10: 3540668608 ISBN 13: 9783540668602
Condition: Sehr gut. Zustand: Sehr gut | Seiten: 505 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.
-
Algorithmics for Hard Problems : Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
Book 11 of 45: Texts in Theoretical Computer Science. An EATCSSeller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
£ 150.99
£ 15 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Hardcover. Condition: Like New. Like New. book.
-
Algorithmics for Hard Problems : Introduction to Combinatorial Optimization
Book 11 of 45: Texts in Theoretical Computer Science. An EATCSLanguage: English
Published by Springer, Berlin, Springer, 2002
ISBN 10: 3540441344 ISBN 13: 9783540441342
Buch. Condition: Neu. Neuware - Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech nologies. Because of this, the design of algorithms for solving hard problems is the core of current algorithmic research from the theoretical point of view as well as from the practical point of view. There are many general text books on algorithmics, and several specialized books devoted to particular approaches such as local search, randomization, approximation algorithms, or heuristics. But there is no textbook that focuses on the design of algorithms for hard computing tasks, and that systematically explains, combines, and compares the main possibilities for attacking hard algorithmic problems. As this topic is fundamental for computer science, this book tries to close this gap. Another motivation, and probably the main reason for writing this book, is connected to education. The considered area has developed very dynami cally in recent years and the research on this topic discovered several profound results, new concepts, and new methods. Some of the achieved contributions are so fundamental that one can speak about paradigms which should be in cluded in the education of every computer science student. Unfortunately, this is very far from reality. This is because these paradigms are not sufficiently known in the computer science community, and so they are insufficiently com municated to students and practitioners.
-
Condition: As New. Unread book in perfect condition.
