Online algorithms with advice for the k-search problem
In the online search problem, a seller seeks to find the maximum price from a sequence of of prices p1, p2, ... pn that is revealed in a piece-wise manner. The bound for all prices is well known in advance with m less than or equal to pi less than or equal to M. In the online k-search problem, the s...
| Publicado no: | Philippine Journal of Science Vol. 151, no. 4 (Aug. 2022), 1321-1331 |
|---|---|
| Autor principal: | |
| Outros Autores: | , |
| Formato: | Artigo |
| Idioma: | English |
| Publicado em: |
2022
|
| Assuntos: |