English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  An Improved Algorithm for Online Rectangle Filling

van Stee, R. (2011). An Improved Algorithm for Online Rectangle Filling. In K. Jansen, & R. Solis-Oba (Eds.), Approximation and Online Algorithms (pp. 249-260). Berlin: Springer. doi:10.1007/978-3-642-18318-8_22.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0010-11E3-2 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-0673-A
Genre: Conference Paper

Files

show Files
hide Files
:
recfillingJ.pdf (Any fulltext), 178KB
 
File Permalink:
-
Name:
recfillingJ.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
van Stee, Rob1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: We consider the problem of scheduling resource allocation where a change in allocation results in a changeover penalty of one time slot. We assume that we are sending packets over a wireless channel of uncertain and varying capacity. In each time slot, a bandwidth of at most the current capacity can be allocated, but changing the capacity has a cost, which is modeled as an empty time slot. Only the current bandwidth and the bandwidth of the immediately following slot are known. We give an online algorithm with competitive ratio 1.753 for this problem, improving over the previous upper bound of 1.848. The main new idea of our algorithm is that it attempts to avoid cases where a single time slot with a nonzero allocation is immediately followed by an empty time slot. Additionally, we improve the lower bound for this problem to 1.6959. Our results significantly narrow the gap between the best known upper and lower bound.

Details

show
hide
Language(s): eng - English
 Dates: 20112011
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 618648
DOI: 10.1007/978-3-642-18318-8_22
URI: http://dx.doi.org/10.1007/978-3-642-18318-8_22
Other: Local-ID: C1256428004B93B8-2C2ACFEA812FE38AC12577F40051C18E-vanStee2010
 Degree: -

Event

show
hide
Title: 8th International Workshop on Approximation and Online Algorithms
Place of Event: Liverpool, Great Britain
Start-/End Date: 2010-09-09 - 2010-09-10

Legal Case

show

Project information

show

Source 1

show
hide
Title: Approximation and Online Algorithms
  Subtitle : 8th International Workshop, WAOA 2010
  Abbreviation : WAOA 2010
Source Genre: Proceedings
 Creator(s):
Jansen, Klaus1, Editor           
Solis-Oba, Roberto1, Editor           
Affiliations:
1 Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019            
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 249 - 260 Identifier: ISBN: 978-3-642-18317-1

Source 2

show
hide
Title: Lecture Notes in Computer Science
  Abbreviation : LNCS
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 6534 Sequence Number: - Start / End Page: - Identifier: -