On the List Update Problem with Advice

Joan Boyar, Shahin Kamali, Kim Skak Larsen, Alejandro López-Ortiz

Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Abstract

We study the online list update problem under the advice model of computation. Under this model, an online algorithm receives partial information about the unknown parts of the input in the form of some bits of advice generated by a benevolent offline oracle. We show that advice of linear size is required and sufficient for a deterministic algorithm to achieve an optimal solution or even a competitive ratio better than 15/14. On the other hand, we show that surprisingly two bits of advice is sufficient to break the lower bound of 2 on the competitive ratio of deterministic online algorithms and achieve a deterministic algorithm with a competitive ratio of 1.6¯ . In this upper-bound argument, the bits of advice determine the algorithm with smaller cost among three classical online algorithms.
OriginalsprogEngelsk
TitelLanguage and Automata Theory and Applications : 8th International Conference, LATA 2014, Madrid, Spain, March 10-14, 2014. Proceedings
RedaktørerAdrian-Horia Dediu et al.
ForlagSpringer
Publikationsdato2014
Sider210-221
ISBN (Trykt)978-3-319-04920-5
ISBN (Elektronisk)978-3-319-04921-2
DOI
StatusUdgivet - 2014
Begivenhed8th International Conference on Language and Automata Theory and Applications - Madrid, Spanien
Varighed: 10. mar. 201414. mar. 2014
Konferencens nummer: 8

Konference

Konference8th International Conference on Language and Automata Theory and Applications
Nummer8
Land/OmrådeSpanien
ByMadrid
Periode10/03/201414/03/2014
NavnLecture Notes in Computer Science
Vol/bind8370
ISSN0302-9743

Emneord

  • online algorithms
  • list update problem
  • advice complexity

Fingeraftryk

Dyk ned i forskningsemnerne om 'On the List Update Problem with Advice'. Sammen danner de et unikt fingeraftryk.

Citationsformater