On the complexity of barrier resilience for fat regions

Matias Korman, Maarten Löffler, Rodrigo I. Silveira, Darren Strash

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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 regions are arbitrarily fat regions (even when they are axis-aligned rectangles of aspect ratio 1: (1 + ε)). We also show that the problem is fixed-parameter tractable (FPT) for such regions. Using our FPT algorithm, we show that if the regions are β -fat and their arrangement has bounded ply Δ, there is a (1 + ε) -approximation that runs in O (2f(Δ,ε,β) n7) time, where f ∈ O (Δ2 β64 log (β Δ/ε)).

Original languageEnglish
Title of host publicationAlgorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013, Revised Selected Papers
PublisherSpringer-Verlag
Pages201-216
Number of pages16
ISBN (Print)9783642453458
DOIs
Publication statusPublished - 2013 Jan 1
Externally publishedYes
Event9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013 - Sophia Antipolis, France
Duration: 2013 Sep 52013 Sep 6

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8243 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013
CountryFrance
CitySophia Antipolis
Period13/9/513/9/6

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'On the complexity of barrier resilience for fat regions'. Together they form a unique fingerprint.

Cite this