OpenAlex
PricingAboutJobs
Log inGet started
Work

Near optimal online algorithms and fast approximation algorithms for resource allocation problems

HTML

Year: 2011
Type: conference-paper
Source: ACM Conference on Electronic Commerce (EC)
DOI: 10.1145/1993574.1993581
Authors: Nikhil R. Devanur, Kamal Jain, Balasubramanian Sivan, Christopher A. Wilkens
Institutions: Microsoft (United States), University of Wisconsin–Madison, University of California, Berkeley
Language: English

Topic: Optimization and Search Problems
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Keywords: resource allocation, online algorithms, approximation algorithms, competitive ratio, randomized algorithms

Open Access status: closed
OpenAlex ID: W2070546659
FWCI: 8.972
Cites: 26
Cited by: 204
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