Abstract
In the previous chapters we have introduced a variety of algorithm design techniques and algorithmic concepts in order to attack hard problems. A lot of specific algorithms were presented in order to illustrate the power and possible success of their applications. Nevertheless, we did not consider the question
“What needs to be done when one is asked to solve a hard problem?”
up till now. We only listed a number of possible approaches and discussed what they can do and what they probably cannot do. The aim of this chapter is to discuss the search for a suitable method for solving a given problem depending on the requirements and constraints prescribed by the user. We present this discussion in a systematic way as follows.
“Discuss, commit errors, make mistakes, but for God’s sake think — even if you should be wrong — but think your own thoughts.”
Gotthold Ephrain Lessing
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hromkovič, J. (2004). A Guide to Solving Hard Problems. In: Algorithmics for Hard Problems. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-05269-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-05269-3_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07909-2
Online ISBN: 978-3-662-05269-3
eBook Packages: Springer Book Archive