English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices

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.

Item is

Basic

show hide
Genre: Conference Paper
Latex : A {QPTAS} for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices

Files

show Files

Locators

show
hide
Locator:
Link (Any fulltext)
Description:
-
OA-Status:

Creators

show
hide
 Creators:
Adamaszek, Anna1, Author           
Wiese, Andreas1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20142014
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1137/1.9781611973402.49
BibTex Citekey: DBLP:conf/soda/AdamaszekW14
 Degree: -

Event

show
hide
Title: Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
Place of Event: Portland, OR, USA
Start-/End Date: 2014-01-05 - 2014-01-07

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
  Abbreviation : SODA 2014
Source Genre: Proceedings
 Creator(s):
Chekuri, Chandra1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Philadelphia, PA : SIAM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 645 - 656 Identifier: -