de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Faster Approximation Schemes for the Two-dimensional Knapsack Problem

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons79285

Heydrich,  Sandy
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Heydrich, S., & Wiese, A. (2017). Faster Approximation Schemes for the Two-dimensional Knapsack Problem. In P. N. Klein (Ed.), Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 79-98). Philadelphia, PA: SIAM. doi:10.1137/1.9781611974782.6.


Cite as: http://hdl.handle.net/11858/00-001M-0000-002C-54AD-3
Abstract
There is no abstract available