New Algorithms for Online Rectangle Filling with k-Lookahead

DOI10.1007/978-3-540-69733-6_38zbMath1148.68334OpenAlexW1772565852MaRDI QIDQ3511350

Danny Z. Chen, Haitao Wang, Amitabh Chaudhary

Publication date: 10 July 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_38

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20)

Related Items (1)

New Algorithms for Online Rectangle Filling with k-Lookahead

Cites Work

• Unnamed Item
• Scheduling resource allocation with timeslot penalty for changeover
• Throughput analysis in wireless networks with multiple users and multiple channels
• New Algorithms for Online Rectangle Filling with k-Lookahead
• Exploiting Wireless Channel State Information for Throughput Maximization
• Online Rectangle Filling

This page was built for publication: New Algorithms for Online Rectangle Filling with k-Lookahead