Online rectangle filling

Authors:
Haitao Wang;Amitabh Chaudhary;Danny Z. Chen
Affiliations:
Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN;Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN;Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN
Venue:
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Year:
2007

Citing 7
Cited 4

Online computation and competitive analysis

Online computation and competitive analysis
Wireless Communications and Networks

Wireless Communications and Networks
Scheduling Over a Time-Varying User-Dependent Channel with Applications to High Speed Wireless Data

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
The Effects of the Sub-Carrier Grouping on Multi-Carrier Channel Aware Scheduling

BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Throughput analysis in wireless networks with multiple users and multiple channels

Acta Informatica
Scheduling resource allocation with timeslot penalty for changeover

Theoretical Computer Science
Adaptive modulation and MIMO coding for broadband wireless data networks

IEEE Communications Magazine

SIGACT news online algorithms column 13: 2007 - an offine perspective

ACM SIGACT News
New Algorithms for Online Rectangle Filling with k-Lookahead

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
New algorithms for online rectangle filling with k-lookahead

Journal of Combinatorial Optimization
An improved algorithm for online rectangle filling

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study an online geometric problem arising in channel-aware scheduling of wireless networks, which we call online rectangle filling. We present an online algorithm for this problem with a competitive ratio of 1.848. We also prove a lower bound of 1.6358 for the competitive ratio of the problem. In addition, we give an O(n2)-time optimal offline algorithm, where n is the size of the input. All three results are significant improvements on the previous results. Our techniques are based on new observations of the combinatorial structures of the problem.