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, December 11, 2018, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Miloš Stojaković (University of Novi Sad)

Bottleneck bichromatic non-crossing matchings using orbits

Given a set of n red and n blue points in the plane, we want to match red points with blue points by straight line segments so that the segments do not cross. Bottleneck matching is such a matching that minimizes the length of the longest segment. We develop a range of tools for dealing with non-crossing matchings of points in convex position, which enable us to solve the problem of finding bottleneck matchings of points in convex position in O(n2) time. Combining the same set of tools with a geometric analysis, we design an O(n)-time algorithm for the case where the given points lie on a circle. Joint work with Marko Savić.

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