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

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

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

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

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

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45742

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

Locator

Link
(Any fulltext)

Fulltext (public)
There are no public fulltexts available
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: http://hdl.handle.net/11858/00-001M-0000-0024-4385-5
Abstract
There is no abstract available