Optimal online algorithms for the multi-objective time series search problem

DOI10.1016/j.tcs.2017.01.008zbMath1390.68770arXiv1506.04474OpenAlexW2572097387MaRDI QIDQ1705779

Shun Hasegawa, Toshiya Itoh

Publication date: 16 March 2018

Published in: Theoretical Computer Science, WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.04474

zbMATH Keywords

arithmetic mean component competitive ratiobest component competitive ratiogeometric mean component competitive ratiomulti-objective time series search problemworst component competitive ratiomulti-objective online algorithms

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Online algorithms; streaming algorithms (68W27)

Related Items (2)

An online trading problem with an increasing number of available products ⋮ Optimal online algorithms for the multi-objective time series search problem

Cites Work

• Unnamed Item
• The \(k\)-server problem
• Optimal online algorithms for the multi-objective time series search problem
• Competitive Analysis for Multi-objective Online Algorithms
• Multicriteria Optimization
• Optimal search and one-way trading online algorithms

This page was built for publication: Optimal online algorithms for the multi-objective time series search problem