Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Theory of Combinatorial Algorithms
Prof. Emo Welzl and Prof. Bernd Gärtner
Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
| Mittagsseminar Talk Information |
Date and Time: Tuesday, November 04, 2003, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Udo Adamy
Motivated by call admission control problems in networks with
advance reservations Lewin-Eytan, Naor, Orda obtain a
(4c)-approximation algorithm for finding a maximum weight
independent set of axis-parallel rectangles in the plane,
where c is the maximum number of rectangles that simultaneously
cover a point in the plane.
We will outline the connection between a two-dimensional
call admission control problem in line networks and the
independent set problem for rectangle intersection graphs.
Then we will present their algorithm based on the local ratio
technique and prove the approximation ratio of 4c.
(Liane Lewin-Eytan, Joseph Naor, Ariel Orda: Routing and Admission Control in Networks with Advance Reservations. In Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), LNCS 2462, pages 215-228, Springer-Verlag, 2002)
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
