Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Analysis and Design of Algorithms in Combinatorial Optimization > Approximation Algorithms for Bin Packing Problems: A Survey

Analysis and Design of Algorithms in Combinatorial Optimization |
Springer Vienna
Analysis and Design of Algorithms in Combinatorial Optimization

Approximation Algorithms for Bin Packing Problems: A Survey
Authors

ARI Id

1664797203068_3262185

Access

Not Available Free

Pages

147-172

DOI

10.1007/978-3-7091-2748-3_8

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-7091-2748-3_8

Loading...
Table of Contents of Book
Chapters/HeadingsAuthor(s)PagesInfo
Loading...
Chapters/HeadingsAuthor(s)PagesInfo
Similar Books
Loading...
Similar Chapters
Loading...
Similar Thesis
Loading...

Similar News

Loading...
Similar Articles
Loading...
Similar Article Headings
Loading...