An improved algorithm for online rectangle filling

DOI10.1016/J.TCS.2011.12.067zbMath1248.68123OpenAlexW2104427366MaRDI QIDQ418006

Rob van Stee

Publication date: 14 May 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.067

zbMATH Keywords

resource allocationtransmission capacityonline algorithmwireless networks

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Online algorithms; streaming algorithms (68W27)

Cites Work

• New algorithms for online rectangle filling with \(k\)-lookahead
• Online rectangle filling
• Scheduling resource allocation with timeslot penalty for changeover
• Exploiting Wireless Channel State Information for Throughput Maximization
• Flow-level performance and user mobility in wireless data networks

This page was built for publication: An improved algorithm for online rectangle filling