Online Algorithms with Advice for the -search Problem

• المؤلفون الرئيسيون: Clemente, Jhoirene B, Adorna, Henry N, Fernandez, Proceso L, Jr
• التنسيق: text
• منشور في: Archīum Ateneo 2022
• الموضوعات: advice complexity; competitive analysis; online algorithms; online search; Applied Mathematics; Mathematics; Physical Sciences and Mathematics
• الوصول للمادة أونلاين: https://archium.ateneo.edu/discs-faculty-pubs/343; https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1343&context=discs-faculty-pubs
• المؤسسة: Ateneo De Manila University

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...