Florian Diedrich

According to our database, Florian Diedrich authored at least 13 papers between 2006 and 2015.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2015

Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows.

Niklas Paulsen, Florian Diedrich, Klaus Jansen

Proceedings of the 15th Workshop on Algorithmic Approaches for Transportation Modelling, 2015

2012

Tight approximation algorithms for scheduling with fixed jobs and nonavailability.

Florian Diedrich, Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Ola Svensson

ACM Trans. Algorithms, 2012

2010

Approximation Algorithms for Scheduling with Reservations.

Florian Diedrich, Klaus Jansen, Fanny Pascual, Denis Trystram

Algorithmica, 2010

2009

Approximation algorithms for linear programs and geometrically constrained packing roblems (Algorithmes d'approximation pour des programmes linéaires et les problèmes de Packing avec des contraintes géometriques)

Florian Diedrich

PhD thesis, 2009

Improved approximation algorithms for scheduling with fixed jobs.

Florian Diedrich, Klaus Jansen

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

A Survey on Approximation Algorithms for Scheduling with Machine Unavailability.

Florian Diedrich, Klaus Jansen, Ulrich M. Schwarz, Denis Trystram

Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

2008

Approximation Algorithms for 3D Orthogonal Knapsack.

Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas

J. Comput. Sci. Technol., 2008

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

Florian Diedrich, Frank Neumann

Proceedings of the IEEE Congress on Evolutionary Computation, 2008

Multi-objective Problems in Terms of Relational Algebra.

Florian Diedrich, Britta Kehden, Frank Neumann

Proceedings of the Relations and Kleene Algebra in Computer Science, 2008

2007

Faster and simpler approximation algorithms for mixed packing and covering problems.

Florian Diedrich, Klaus Jansen

Theor. Comput. Sci., 2007

A Framework for Scheduling with Online Availability.

Florian Diedrich, Ulrich M. Schwarz

Proceedings of the Euro-Par 2007, 2007

An Approximation Algorithm for the General Mixed Packing and Covering Problem.

Florian Diedrich, Klaus Jansen

Proceedings of the Combinatorics, 2007

2006

Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem.

Mihhail Aizatulin, Florian Diedrich, Klaus Jansen

Proceedings of the Experimental Algorithms, 5th International Workshop, 2006