OpenAlex
PricingAboutJobs
Log inGet started
Work

Polynomial approximation schemes for smoothed and random instances of multidimensional packing problems

HTML

Year: 2007
Type: conference-paper
Source: Symposium on Discrete Algorithms
DOI: 10.5555/1283383.1283513
Authors: David R. Karger, Krzysztof Onak
Institutions: MIT Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology
Language: English

Topic: Optimization and Packing Problems
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Keywords: polynomial-time approximation scheme, smoothed analysis, random instances, oblivious algorithms, rounding technique, hardness of approximation, linear-time algorithms

Open Access status: closed
OpenAlex ID: W2087397656
FWCI: 4.388
Cites: 13
Cited by: 21
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
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security