English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices

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

Link
(Any fulltext)

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. (2014). A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices. In C. Chekuri (Ed.), Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 645-656). Philadelphia, PA: SIAM. doi:10.1137/1.9781611973402.49.


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