Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs
| Author | dc.contributor.author | Pilipczuk, Michal | |
| Author | dc.contributor.author | Van Leeuwen, Erik Jan | |
| Author | dc.contributor.author | Wiese, Andreas | |
| Admission date | dc.date.accessioned | 2020-05-27T17:24:04Z | |
| Available date | dc.date.available | 2020-05-27T17:24:04Z | |
| Publication date | dc.date.issued | 2020 | |
| Cita de ítem | dc.identifier.citation | Algorithmica (2020) 82:1703–1739 | es_ES |
| Identifier | dc.identifier.other | 10.1007/s00453-019-00670-w | |
| Identifier | dc.identifier.uri | https://repositorio.uchile.cl/handle/2250/175033 | |
| Lenguage | dc.language.iso | en | es_ES |
| Publisher | dc.publisher | Springer | es_ES |
| Type of license | dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Chile | * |
| Link to License | dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/cl/ | * |
| Source | dc.source | Algorithmica | es_ES |
| Keywords | dc.subject | Approximation schemes | es_ES |
| Keywords | dc.subject | Planar graphs | es_ES |
| Keywords | dc.subject | Independent set of objects | es_ES |
| Keywords | dc.subject | Geometric set cover | es_ES |
| Título | dc.title | Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs | es_ES |
| Document type | dc.type | Artículo de revista | es_ES |
| dcterms.accessRights | dcterms.accessRights | Acceso Abierto | |
| Cataloguer | uchile.catalogador | rvh | es_ES |
| Indexation | uchile.index | Artículo de publicación ISI | |
| Indexation | uchile.index | Artículo de publicación SCOPUS |
Files in this item
This item appears in the following Collection(s)
-
Artículos de revistas
Artículos de revistas
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 Chile