you're reading...

SACT Talk: Longest Wait First for Broadcast Scheduling

Time: 11am Friday, 20th April, 2012
Location: SIT 124 Boardroom
Speaker: Giampaolo Ferraro, University of Sydney

I will be giving an overview of how the paper ¬† “Longest Wait First (LWF) for Broadcast Scheduling” by Chandra Chekuri, Sungjim Im, Benjamin Moseley proves the upper speed bound of LWF to be O(1)-competitive.



No comments yet.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Enter your email address to subscribe to receive notifications of new announcements by email.

Join 68 other followers

%d bloggers like this: