Online rectangle filling

DOI10.1016/j.tcs.2011.05.033zbMath1225.68055OpenAlexW1986331434MaRDI QIDQ719266

Amitabh Chaudhary, Haitao Wang, Danny Z. Chen

Publication date: 10 October 2011

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

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

zbMATH Keywords

resource allocationwireless networkcompetitive analysiscompetitive ratiolower boundonline algorithmchannel-aware scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Online algorithms; streaming algorithms (68W27)

Related Items

An improved algorithm for online rectangle filling

Cites Work

• Unnamed Item
• New algorithms for online rectangle filling with \(k\)-lookahead
• Scheduling resource allocation with timeslot penalty for changeover
• Throughput analysis in wireless networks with multiple users and multiple channels
• Exploiting Wireless Channel State Information for Throughput Maximization

This page was built for publication: Online rectangle filling