Abstract
Traditionally, combinatorial optimization postulates that an input instance is given with absolute precision and certainty, and it aims at finding an optimum solution for the given instance. In contrast, real world input data are often uncertain, noisy, inaccurate. As a consequence, an optimum solution for a real world instance may not be meaningful or desired. While this unfortunate gap between theory and reality has been recognized for quite some time, it is far from understood, let alone resolved. We advocate to devote more attention to it, in order to develop algorithms that find meaningful solutions for uncertain inputs. We propose an approach towards this goal, and we show that this approach on the one hand creates a wealth of algorithmic problems, while on the other hand it appears to lead to good real world solutions.
This talk is about joint work with Joachim Buhmann, Matus Mihalak, and Rasto Sramek.
Chinese proverb, sometimes also attributed to Goethe.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Widmayer, P. (2013). To Be Uncertain Is Uncomfortable, But to Be Certain Is Ridiculous. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds) Automata, Languages, and Programming. ICALP 2013. Lecture Notes in Computer Science, vol 7966. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39212-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-39212-2_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39211-5
Online ISBN: 978-3-642-39212-2
eBook Packages: Computer ScienceComputer Science (R0)