Approximation and Online Algorithms
From MaRDI portal
Publication:5896918
DOI10.1007/b95598zbMath1173.68878OpenAlexW4300520713MaRDI QIDQ5896918
Publication date: 11 August 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95598
Analysis of algorithms (68W40) Network design and communication in computer systems (68M10) Online algorithms; streaming algorithms (68W27)
Related Items (12)
A randomized algorithm for online unit clustering ⋮ An improved algorithm for online coloring of intervals with bandwidth ⋮ A new lower bound for the on-line coloring of intervals with bandwidth ⋮ Improved lower bound on the on-line chain partitioning of semi-orders with representation ⋮ Improved algorithms for scheduling unsplittable flows on paths ⋮ Station assignment with reallocation ⋮ Online interval coloring with packing constraints ⋮ On the max coloring problem ⋮ On the Max Coloring Problem ⋮ Complexity and online algorithms for minimum skyline coloring of intervals ⋮ Variable sized online interval coloring with bandwidth ⋮ Unnamed Item
This page was built for publication: Approximation and Online Algorithms
