Abstract
Sometimes we have to find solutions for optimization problems where the problem specification is not completely known from the beginning. These are called online problems, and the parameters become known only little by little. In this chapter the authors are preparing for a skiing holiday, and they must decide whether it is better to buy or rent skis although they don’t yet know whether they will reuse them later. The authors then analyze another online problem, paging – deciding which memory pages should reside in the main memory of a computer and which ones should reside on hard disk only.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Albers, S., Schmelzer, S. (2011). Online Algorithms - What Is It Worth to Know the Future?. In: Vöcking, B., et al. Algorithms Unplugged. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-15328-0_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15327-3
Online ISBN: 978-3-642-15328-0
eBook Packages: Computer ScienceComputer Science (R0)