Lower bounds on the performance of online algorithms for relaxed packing problems.

Saved in:
Bibliographic Details
Title: Lower bounds on the performance of online algorithms for relaxed packing problems.
Authors: Balogh, János1, baloghj@inf.u-szeged.hu, Dósa, György2, dosa.gyorgy@mik.uni-pannon.hu, Epstein, Leah1,3, lea@math.haifa.ac.il, Jeż, Łukasz4, lje@cs.uni.wroc.pl
Source: Discrete Optimization; May2026, Vol. 60, pN.PAG-N.PAG, 1p
Database: Applied Science & Technology Source
Be the first to leave a comment!
You must be logged in first