On-Line Difference Maximization

DOI10.1137/S0895480196307445zbMATH Open0916.68062OpenAlexW2568549484MaRDI QIDQ4255809FDOQ4255809

Ming-Yang Kao, Stephen R. Tate

Publication date: 27 June 1999

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480196307445

Recommendations

• scientific article; zbMATH DE number 1256669
• Optimal search and one-way trading online algorithms
• scientific article
• A multiple-choice secretary algorithm with applications to online auctions

zbMATH Keywords

analysis of algorithmson-line algorithmssecretary problemfinancial games

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Cited In (3)

• Optimal online \(k\)-min search
• Optimal online two-way trading with bounded number of transactions
• Online BP functions maximization

This page was built for publication: On-Line Difference Maximization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4255809)