OpenAlex
PricingAboutJobs
Log inGet started
Work

A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio

HTML

Year: 2013
Type: conference-paper
Source: ACM-SIAM Symposium on Discrete Algorithms (SODA)
DOI: 10.1137/1.9781611973105.9
Authors: Elisabeth Günther, Olaf Maurer, Nicole Megow, Andreas Wiese
Institutions: Technische Universität Berlin, Sapienza University of Rome
Language: English

Topic: Optimization and Search Problems
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Keywords: online scheduling, competitive ratio, total weighted completion time, parallel machines, related machines, unrelated parallel machines, randomized online algorithms, deterministic online algorithms, makespan minimization

Open Access status: closed
OpenAlex ID: W2950803469
FWCI: 2.83
Cites: 47
Cited by: 29
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security