Order Total (1 Item Items):
Shipping Destination:
Exponential Time Algorithms Structures by Gaspers Serge (7 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (7)
- 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 (6)
- As New, Fine or Near Fine (1)
- Very Good or Good (No further results match this refinement)
- 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 (7)
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 (2)
- Not Print on Demand (4)
Language (1)
Price
- Any Price
- Under £ 20 (No further results match this refinement)
- £ 20 to £ 35 (No further results match this refinement)
- Over £ 35
Free Shipping
Seller Location
Seller Rating
-
Exponential Time Algorithms: Structures, Measures, and Bounds
Language: English
Published by VDM Verlag Dr. Müller, 2010
ISBN 10: 3639218256 ISBN 13: 9783639218251
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 63.01
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Exponential Time Algorithms | Structures, Measures, and Bounds
Language: English
Published by VDM Verlag Dr. Müller, 2010
ISBN 10: 3639218256 ISBN 13: 9783639218251
Taschenbuch. Condition: Neu. Exponential Time Algorithms | Structures, Measures, and Bounds | Serge Gaspers | Taschenbuch | Einband - flex.(Paperback) | Englisch | 2010 | VDM Verlag Dr. Müller | EAN 9783639218251 | Verantwortliche Person für die EU: OmniScriptum GmbH & Co. KG, Bahnhofstr. 28, 66111 Saarbrücken, info[at]akademikerverlag[dot]de | Anbieter: preigu.
-
Exponential Time Algorithms: Structures, Measures, and Bounds
Language: English
Published by VDM Verlag Dr. Müller, 2010
ISBN 10: 3639218256 ISBN 13: 9783639218251
Book. Condition: New.
-
Exponential Time Algorithms: Structures, Measures, and Bounds
Language: English
Published by VDM Verlag Dr. Müller, 2010
ISBN 10: 3639218256 ISBN 13: 9783639218251
Paperback. Condition: Like New. Like New. book.
-
Exponential Time Algorithms Structures, Measures, and Bounds
Language: English
Published by VDM Verlag Dr. Müller, 2010
ISBN 10: 3639218256 ISBN 13: 9783639218251
PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
-
Exponential Time Algorithms Structures, Measures, and Bounds
Language: English
Published by VDM Verlag Dr. Müller, 2010
ISBN 10: 3639218256 ISBN 13: 9783639218251
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
£ 63.62
£ 4.16 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketPAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
-
Exponential Time Algorithms : Structures, Measures, and Bounds
Language: English
Published by VDM Verlag Dr. Müller, 2010
ISBN 10: 3639218256 ISBN 13: 9783639218251
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This book studies exponential time algorithms for NP-hard problems. In this modern area, the aim is to design algorithms for combinatorially hard problems that execute provably faster than a brute-force enumeration of all candidate solutions. After an introduction and survey of the field, the text focuses first on the design and especially the analysis of branching algorithms. The analysis of these algorithms heavily relies on measures of the instances, which aim at capturing the structure of the instances, not merely their size. This makes them more appropriate to quantify the progress an algorithm makes in the process of solving a problem. Expanding the methodology to design exponential time algorithms, new techniques are then presented. Two of them combine treewidth based algorithms with branching or enumeration algorithms. Another one is the iterative compression technique, prominent in the design of parameterized algorithms, and adapted here to the design of exponential time algorithms. This book assumes basic knowledge of algorithms and should serve anyone interested in exactly solving hard problems.
