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)
Automatic MiSe System Software Version 1.4803M | admin login