Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

STACS
2004
Springer

favoriteEmaildiscussreport

76views Theoretical Computer Science» more STACS 2004»

Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs

13 years 10 months ago

Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs

Download www.cs.ucr.edu

Yair Bartal, Francis Y. L. Chin, Marek Chrobak, St

Real-time Traffic

STACS 2004 | Theoretical Computer Science |

claim paper

Related Content

» Online scheduling of weighted equallength jobs with hard deadlines on parallel machines

» The Power of Preemption in Economic Online Markets

» Mechanism Design for Decentralized Online Machine Scheduling

» Mixed Criteria Packet Scheduling

» Online timeconstrained scheduling in linear networks

» Improved OnLine Broadcast Scheduling with Deadlines

» Improved Randomized Results for That Interval Selection Problem

» Online Scheduling to Minimize the Maximum Delay Factor

» Buffer management for colored packets with deadlines

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	STACS
Authors	Yair Bartal, Francis Y. L. Chin, Marek Chrobak, Stanley P. Y. Fung, Wojciech Jawor, Ron Lavi, Jiri Sgall, Tomás Tichý

Comments (0)