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.
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.
Schools and school systems are increasingly impacted by global disruptions and rapid changes that create unprecedented challenges and opportunities for their leaders and educators. School leaders...
Discover your next great read at BookLoop, Australiand online bookstore offering a vast selection of titles across various genres and interests. Whether you're curious about what's trending or searching for graphic novels that captivate, thrilling crime and mystery fiction, or exhilarating action and adventure stories, our curated collections have something for every reader. Delve into imaginative fantasy worlds or explore the realms of science fiction that challenge the boundaries of reality. Fans of contemporary narratives will find compelling stories in our contemporary fiction section. Embark on epic journeys with our fantasy and science fiction titles,
Shop Trending Books and New Releases
Explore our new releases for the most recent additions in romance books, fantasy books, graphic novels, crime and mystery books, science fiction books as well as biographies, cookbooks, self help books, tarot cards, fortunetelling and much more. With titles covering current trends, booktok and bookstagram recommendations, and emerging authors, BookLoop remains your go-to local australian bookstore for buying books online across all book genres.
Shop Best Books By Collection
Stay updated with the literary world by browsing our trending books, featuring the latest bestsellers and critically acclaimed works. Explore titles from popular brands like Minecraft, Pokemon, Star Wars, Bluey, Lonely Planet, ABIA award winners, Peppa Pig, and our specialised collection of ADHD books. At BookLoop, we are committed to providing a diverse and enriching reading experience for all.
Sign In
your cart
Your cart is empty
Menu
Search
PRE-SALES
If you have any questions before making a purchase chat with our online operators to get more information.
