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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, November 21, 2006, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Jan Remy

Prize-Collecting Point Sets

Given a set of points P in the plane with non-negative profits (or prizes) we want to select a maximum profit subset X of P which maximizes the total profit of the points in X minus some criterion z(X). In this talk we consider four such criteria, namely the perimeter and the area of the smallest axis-parallel rectangle containing X, and the perimeter and the area of the convex hull of X. In particular, we show how to compute a set of maximum profit with respect to perimeter of the smallest enclosing axis-parallel rectangle in O(n^2 log n) time using O(n) space.

Joint work with Stefanie Gerke.


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

Previous talks by year:   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