Geodesic
The Online Specialization Problem
Discrete mathematics & theoretical computer science, Tome 8 (2006).

Voir la notice de l'article provenant de la source Episciences

We study the online specialization problem, where items arrive in an online fashion for processing by one of n different methods. Each method has two costs: a processing cost (paid once for each item processed), and a set-up cost (paid only once, on the method's first use). There are n possible types of items; an item's type determines the set of methods available to process it. Each method has a different degree of specialization. Highly specialized methods can process few item types while generic methods may process all item types. This is a generalization of ski-rental and closely related to the capital investment problem of Y. Azar, Y. Bartal, E. Feuerstein, A. Fiat, S. Leonardi, and A. Rosen. On capital investment. In Algorithmica, 25(1):22-36, 1999.. We primarily study the case where method i+1 is always more specialized than method i and the set-up cost for a more specialized method is always higher than that of a less specialized method. We describe an algorithm with competitive ratio O(log(n)), and also show an Ω (log(n)) lower bound on the competitive ratio for this problem; this shows our ratio is tight up to constant factors. 
@article{DMTCS_2006_8_a0,
     author = {Hong, Edwin S.},
     title = {The {Online} {Specialization} {Problem}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {8},
     year = {2006},
     doi = {10.46298/dmtcs.359},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.359/}
}
TY  - JOUR
AU  - Hong, Edwin S.
TI  - The Online Specialization Problem
JO  - Discrete mathematics & theoretical computer science
PY  - 2006
VL  - 8
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.359/
DO  - 10.46298/dmtcs.359
LA  - en
ID  - DMTCS_2006_8_a0
ER  - 
%0 Journal Article
%A Hong, Edwin S.
%T The Online Specialization Problem
%J Discrete mathematics & theoretical computer science
%D 2006
%V 8
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.359/
%R 10.46298/dmtcs.359
%G en
%F DMTCS_2006_8_a0
Hong, Edwin S. The Online Specialization Problem. Discrete mathematics & theoretical computer science, Tome 8 (2006). doi : 10.46298/dmtcs.359. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.359/

Cité par Sources :