Mostra el registre d'ítem simple
On the complexity of barrier resilience for fat regions and bounded ply
dc.contributor.author | Korman, Matias |
dc.contributor.author | Löffler, Maarten |
dc.contributor.author | Silveira, Rodrigo Ignacio |
dc.contributor.author | Strash, Darren |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
dc.date.accessioned | 2018-10-11T12:01:07Z |
dc.date.available | 2019-06-01T02:31:24Z |
dc.date.issued | 2018-06 |
dc.identifier.citation | Korman, M., Löffler, M., Silveira, R.I., Strash, D. On the complexity of barrier resilience for fat regions and bounded ply. "Computational geometry: theory and applications", Juny 2018, vol. 72, p. 34-51. |
dc.identifier.issn | 0925-7721 |
dc.identifier.uri | http://hdl.handle.net/2117/122214 |
dc.description.abstract | In the barrier resilience problem (introduced by Kumar et al., Wireless Networks 2007), we are given a collection of regions of the plane, acting as obstacles, and we would like to remove the minimum number of regions so that two fixed points can be connected without crossing any region. In this paper, we show that the problem is NP-hard when the collection only contains fat regions with bounded ply ¿ (even when they are axis-aligned rectangles of aspect ratio ). We also show that the problem is fixed-parameter tractable (FPT) for unit disks and for similarly-sized ß-fat regions with bounded ply ¿ and pairwise boundary intersections. We then use our FPT algorithm to construct an -approximation algorithm that runs in time, where . |
dc.format.extent | 18 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Anàlisi numèrica |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica aplicada a les ciències |
dc.subject.lcsh | Number theory |
dc.subject.lcsh | Computer science |
dc.subject.other | Barrier resilience and coverage |
dc.subject.other | Fat regions |
dc.subject.other | Bounded ply |
dc.subject.other | Approximation algorithms |
dc.subject.other | Parameterized complexity and algorithms |
dc.title | On the complexity of barrier resilience for fat regions and bounded ply |
dc.type | Article |
dc.subject.lemac | Nombres, Teoria dels |
dc.subject.lemac | Informàtica |
dc.contributor.group | Universitat Politècnica de Catalunya. CGA - Computational Geometry and Applications |
dc.identifier.doi | 10.1016/j.comgeo.2018.02.006 |
dc.description.peerreviewed | Peer Reviewed |
dc.subject.ams | Classificació AMS::11 Number theory::11Y Computational number theory |
dc.subject.ams | Classificació AMS::68 Computer science::68Q Theory of computing |
dc.relation.publisherversion | https://www.sciencedirect.com/science/article/pii/S0925772118300166 |
dc.rights.access | Open Access |
local.identifier.drac | 22021521 |
dc.description.version | Postprint (author's final draft) |
local.citation.author | Korman, M.; Löffler, M.; Silveira, R.I.; Strash, D. |
local.citation.publicationName | Computational geometry: theory and applications |
local.citation.volume | 72 |
local.citation.startingPage | 34 |
local.citation.endingPage | 51 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [3.268]
-
Articles de revista [31]