
Universität Bonn > Institut für Informatik > Abteilung V  
CSAPXReports 2010  Copyright 2010 Universität Bonn, Institut für Informatik, Abt. V  
89124 07.05.2010 
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems (Revised Version) Piotr Berman, Marek Karpinski and Andrzej Lingas [Download PostScript] [Download PDF]
First, we study geometric variants of the standard set cover motivated by assignment of directional antenna and shipping with deadlines, providing the first known polynomialtime exact solutions. 

Last Change:
11/05/14 at 10:53:46
English 
Universität Bonn > Institut für Informatik > Abteilung V 