Könemann, J. (1997). Fast combinatorial algorithms for packing and covering problems. Master Thesis, Universität des Saarlandes, Saarbrücken.