Abstract
This is a catalog of algorithmic problems that arise commonly in practice.It describes what is known about them and gives suggestions about how best to proceed if the problem arises in your application.
What is the best way to use this catalog? First, think about your problem. If you recall the name, look up the catalog entry in the index or table of contents and start reading. Read through the entire entry, since it contains pointers to other relevant problems. Leaf through the catalog, looking at the pictures and problem names to see if something strikes a chord. Don’t be afraid to use the index, for every problem in the book is listed there under several possible keywords and applications. If you still don’t find something relevant, your problem is either not suitable for attack by combinatorial algorithms or else you don’t fully understand it. In either case, go back to step one.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer-Verlag London Limited
About this chapter
Cite this chapter
Skiena, S.S. (2012). A Catalog of Algorithmic Problems. In: The Algorithm Design Manual. Springer, London. https://doi.org/10.1007/978-1-84800-070-4_11
Download citation
DOI: https://doi.org/10.1007/978-1-84800-070-4_11
Publisher Name: Springer, London
Print ISBN: 978-1-84800-069-8
Online ISBN: 978-1-84800-070-4
eBook Packages: Computer ScienceComputer Science (R0)