The Incremental Constraint of k-Server
Online algorithms are characterized by operating on an input sequence revealed over time versus a single static input. Instead of generating a single solution, they produce a sequence of incremental solutions corresponding to the input seen so far. An online algorithm's ignorance of future inpu...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/6758 |