New Algorithms for Online Rectangle Filling with k-Lookahead

DOI10.1007/978-3-540-69733-6_38MaRDI QIDQ3511350zbMATH OpenOpenAlexFDO

Authors Haitao Wang, Amitabh Chaudhary, Danny Z. Chen

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)

Recommendations

• New algorithms for online rectangle filling with k-lookahead
• Online rectangle filling
• Online Rectangle Filling
• An improved algorithm for online rectangle filling
• scientific article; zbMATH DE number 910900

Cites work

• Exploiting Wireless Channel State Information for Throughput Maximization
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• New Algorithms for Online Rectangle Filling with k-Lookahead
• Online Rectangle Filling
• Scheduling resource allocation with timeslot penalty for changeover
• Throughput analysis in wireless networks with multiple users and multiple channels

Cited in

(6)

• An Improved Algorithm for Online Rectangle Filling
• 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
• Online rectangle filling

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

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