Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, April 16, 2013, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Matias Korman (Universitat Politècnica de Catalunya)

On the Complexity of Barrier Resilience for Fat Regions

In the barrier resilience problem (introduced 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 fat (even when they are axis-aligned rectangles of aspect ratio 1 : (1 + epsilon)). 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 beta-fat and their arrangement has bounded ply P, there is a (1+epsilon)-approximation that runs in O(2^{f(P, epsilon,beta)}n^7) time, for some polynomial function f.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login