Florian Diedrich

Approximation algorithms for linear programs and geometrically constrained packing roblems

F. Diedrich, Premiere DE Couverture, Florian Diedrich, 2009 .

Using fast matrix multiplication in bio-inspired computation for complex optimization problems

Frank Neumann, Florian Diedrich, F. Neumann, 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

Approximation Algorithms for 3D Orthogonal Knapsack

K. Jansen, F. Diedrich, H. Thomas, 2007, Journal of Computer Science and Technology.

Faster and simpler approximation algorithms for mixed packing and covering problems

Klaus Jansen, Florian Diedrich, K. Jansen, 2007, Theor. Comput. Sci..

An Approximation Algorithm for the General Mixed Packing and Covering Problem

Klaus Jansen, Florian Diedrich, K. Jansen, 2007, ESCAPE.

Experimental Results in Approximation of Max-Min Resource Sharing ?

Klaus Jansen, Florian Diedrich, Mihhail Aizatulin, 2006 .

A Survey on Approximation Algorithms for Scheduling with Machine Unavailability

Klaus Jansen, Denis Trystram, Florian Diedrich, 2009, Algorithmics of Large and Complex Networks.

Approximation Algorithms for Scheduling with Reservations

Klaus Jansen, Denis Trystram, Florian Diedrich, 2007, Algorithmica.