OpenAlex
PricingAboutJobs
Log inGet started
Work

Better approximation algorithms for bin covering

HTML

Year: 2001
Type: conference-paper
Source: Symposium on Discrete Algorithms
DOI: 10.5555/365411.365533
Authors: János Csirik, David S. Johnson, Claire Kenyon
Institutions: University of Szeged, AT&T (United States), Université Paris-Sud, Laboratoire de Recherche en Informatique
Language: English

Topic: Optimization and Packing Problems
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Keywords: approximation algorithms, bin packing, approximation methods, online learning, worst-case analysis, average-case analysis

Open Access status: closed
OpenAlex ID: W1975625792
FWCI: 3.871
Cites: 11
Cited by: 67
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