Synopsis
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.
"synopsis" may belong to another edition of this title.
Product Description
Rare book
"About this title" may belong to another edition of this title.
Search results for Exponential Time Algorithms: Structures, Measures,...
Stock Image
Exponential Time Algorithms Structures, Measures, and Bounds
Print on DemandSeller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. 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. Seller Inventory # L0-9783639218251
Buy New
£ 63.62
£ 4.16 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Seller Image
Exponential Time Algorithms
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 8498712-n
Stock Image
Exponential Time Algorithms Structures, Measures, and Bounds
Print on DemandSeller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L0-9783639218251
Seller Image
Exponential Time Algorithms
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Seller Inventory # LU-9783639218251
Buy New
£ 70.56
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Exponential Time Algorithms: Structures, Measures, and Bounds
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783639218251_new
Buy New
£ 63.01
£ 11.98 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Exponential Time Algorithms
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
PF. Condition: New. Seller Inventory # 6666-IUK-9783639218251
Buy New
£ 60.61
£ 15.49 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 10 available
Seller Image
Exponential Time Algorithms
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 8498712-n
Buy New
£ 63
£ 15 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Seller Image
Exponential Time Algorithms
Published by
VDM Verlag Dr. Müller, 2010
ISBN 10: 3639218256
ISBN 13: 9783639218251
New
Kartoniert / Broschiert
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Kartoniert / Broschiert. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Gaspers SergeDr Serge Gaspers studied computer science at the universities of Luxembourg (Luxembourg) and Metz (France) and obtained a PhD from the University of Bergen (Norway) in 2008. His areas of expertise are exponential time al. Seller Inventory # 4968152
Buy New
£ 54.04
£ 42.48 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Seller Image
Exponential Time Algorithms | Structures, Measures, and Bounds
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
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. Seller Inventory # 101333979
Seller Image
Exponential Time Algorithms : Structures, Measures, and Bounds
Print on DemandSeller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
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. Seller Inventory # 9783639218251