Using Markov Chains To Design Algorithms For Bounded-Space On-Line Bin Cover

DOI10.1137/1.9781611972863.8zbMath1427.68371OpenAlexW2406247184MaRDI QIDQ5233467

Eyjólfur Ingi Ásgeirsson, Clifford Stein

Publication date: 11 September 2019

Published in: 2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/547f588058447bf47256697a7abd06439af9cffe

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Matching random colored points with rectangles

This page was built for publication: Using Markov Chains To Design Algorithms For Bounded-Space On-Line Bin Cover