An improved algorithm for online rectangle filling

DOI10.1016/J.TCS.2011.12.067MaRDI QIDQ418006zbMATH OpenOpenAlexFDO

Authors 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 allocationonline algorithmwireless networkstransmission capacity

Mathematics Subject Classification ID

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

Recommendations

• An Improved Algorithm for Online Rectangle Filling
• Online rectangle filling
• Online Rectangle Filling
• New Algorithms for Online Rectangle Filling with k-Lookahead
• New algorithms for online rectangle filling with k-lookahead

Cites work

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

Cited in

(6)

• New algorithms for online rectangle filling with k-lookahead
• An Improved Algorithm for Online Rectangle Filling
• Online rectangle filling
• New Algorithms for Online Rectangle Filling with k-Lookahead
• Scheduling resource allocation with timeslot penalty for changeover
• Online Rectangle Filling

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418006)