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: Thursday, October 02, 2008, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Tobias Christ

NP-Hardness of the Wireless Localization Problem

Given a simple polygon P on n vertices and a number k the Natural Wireless Localization Problem asks to describe P as unions and intersections of k natural guards. A natural guard is either a plane angle defined by a vertex of P or a halfplane defined by an edge of P. As shown in MiSe-talks earlier this year, there is always a natural guarding for P using only n-2 guards and this bound is tight. In this talk we will sketch a polynomial reduction of the Vertex Cover Problem on graphs to a variant of the Natural Localization Problem where we not only consider one polygon but a finite union of polygons.

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