Online Algorithms with Advice for the -search Problem
In the online search problem, a seller seeks to find the maximum price from a sequence 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 ≤ pί ≤ M. In the online k-search problem, the seller seeks to find the k maximum out of the...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | text |
| Published: |
Archīum Ateneo
2022
|
| Subjects: | |
| Online Access: | https://archium.ateneo.edu/discs-faculty-pubs/343 https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1343&context=discs-faculty-pubs |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Ateneo De Manila University |