English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

A Quasi-PTAS for the Two-dimensional Geometric Knapsack Problem

MPS-Authors
/persons/resource/persons79160

Adamaszek,  Anna
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45742

Wiese,  Andreas
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Adamaszek, A., & Wiese, A. (2015). A Quasi-PTAS for the Two-dimensional Geometric Knapsack Problem. In P. Indyk (Ed.), Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1491-1505). Philadelphia, PA: SIAM. doi:10.1137/1.9781611973730.98.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0024-4A1D-A
Abstract
There is no abstract available