Back to Results
First PageMeta Content
Operations research / Analysis of algorithms / Mathematical optimization / Approximation algorithms / Job shop scheduling / Polynomial-time approximation scheme / Linear programming / Scheduling / Online algorithm / Theoretical computer science / Applied mathematics / Computational complexity theory


A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio Elisabeth G¨ unther∗† Olaf Maurer∗†
Add to Reading List

Document Date: 2012-11-23 03:18:02

Open Document

File Size: 362,10 KB

Share Result on Facebook

City

Berlin / /

Company

M. Queyranne A. S. / W. H. Freeman & Co. / SIAM Journal / L. A. Hall A. S. / C. A.Phillips A. S. / /

Country

Germany / Italy / /

/

Facility

Sapienza University of Rome / /

IndustryTerm

distinct processing times / online single-machine scheduling / to offline algorithms / offline algorithm / given online algorithm / dual approximation algorithms / finite algorithm / online and semi-online variants / framework to analyze and classify algorithms / Online Algorithms In / online problems / uniform processors / approximation algorithms / on-line algorithms / online algorithm schemes / Online Scheduling / offline solution / online settings / given algorithm / deterministic online algorithm / online scheduling algorithms / on-line setting / online algoRule / online optimization / particular algorithms / online algorithm / possible online algorithms / long-time ongoing search / online schedules / online algorithms / randomized online algorithm / On-line scheduling / on-line approximation algorithms / deterministic and randomized algorithms / /

MarketIndex

Ix consists of • the / /

MusicAlbum

This / /

Organization

University of Rome / German Science Foundation / Department of Computer and System Sciences / Department of Mathematics / U.S. Securities and Exchange Commission / German Academic Exchange Service / /

Person

Nicole Megow∗‡ Andreas / Andreas Wiese / /

Position

Prime Minister / General / realistic representative / representative / theP problems Pm / /

PublishedMedium

SIAM Journal on Computing / Theoretical Computer Science / /

Technology

online scheduling algorithms / online algorithm / on-line algorithms / δ-discretized algorithm / deterministic online algorithm / key technologies / scheduling algorithm / on-line approximation algorithms / Improved approximation algorithms / designed algorithm / possible online algorithms / resulting algorithm / online algorithms / deterministic and randomized algorithms / finite algorithm / randomized online algorithm / exactly how online algorithms / One algorithm / derived algorithm / paging / corresponding resulting online algorithm / dual approximation algorithms / When algorithms / one given algorithm / given online algorithm / /

URL

http /

SocialTag