Offline List Update is NP-Hard
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Topology matters: smoothed competitiveness of metrical task systems
Theoretical Computer Science
Scheduling resource allocation with timeslot penalty for changeover
Theoretical Computer Science
On the power of lookahead in on-line server routing problems
Theoretical Computer Science
Online Computation with Advice
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
On the power of lookahead in on-line vehicle routing problems
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On-Line algorithms, real time, the virtue of laziness, and the power of clairvoyance
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
ViNEYard: virtual network embedding algorithms with coordinated node and link mapping
IEEE/ACM Transactions on Networking (TON)
On the power of lookahead in online lot-sizing
Operations Research Letters
How much is it worth to know the future in online conversion problems?
Discrete Applied Mathematics
| Hi-index | 5.23 |