Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing

From MaRDI portal
Publication:2780629
Jump to:navigation, search

DOI10.1137/S0036144501395423zbMath0999.68260MaRDI QIDQ2780629

Michael R. Garey, Peter W. Shor, Costas Courcoubetis, Edward G. jun. Coffman, David S. Johnson

Publication date: 15 April 2002

Published in: SIAM Review (Search for Journal in Brave)


zbMATH Keywords

approximation algorithmsaverage-case analysisonlinebin packing


Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation algorithms (68W25)


Related Items

On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2780629&oldid=15667717"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 16:15.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki