Florian Diedrich

15 papers A* 1B 1C 2Misc 1Journal 4Unranked 5
YearRankTypeTitle / Venue / Authors
2015 C conf
Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows.
ATMOS
Niklas Paulsen, Florian Diedrich, Klaus Jansen
2012 J jnl
Tight approximation algorithms for scheduling with fixed jobs and nonavailability.
ACM Trans. Algorithms
Florian Diedrich, Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Ola Svensson
2010 J jnl
Approximation Algorithms for Scheduling with Reservations.
Algorithmica
Florian Diedrich, Klaus Jansen, Fanny Pascual, Denis Trystram
2009 — conf
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability.
Algorithmics of Large and Complex Networks
Florian Diedrich, Klaus Jansen, Ulrich M. Schwarz, Denis Trystram
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
2009 A* conf
Improved approximation algorithms for scheduling with fixed jobs.
SODA
Florian Diedrich, Klaus Jansen
2008 J jnl
Approximation Algorithms for 3D Orthogonal Knapsack.
J. Comput. Sci. Technol.
Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas
2008 — conf
Multi-objective Problems in Terms of Relational Algebra.
RelMiCS
Florian Diedrich, Britta Kehden, Frank Neumann
2008 B conf
Using fast matrix multiplication in bio-inspired computation for complex optimization problems.
IEEE Congress on Evolutionary Computation
Florian Diedrich, Frank Neumann
2007 — conf
A Framework for Scheduling with Online Availability.
Euro-Par
Florian Diedrich, Ulrich M. Schwarz
2007 — conf
An Approximation Algorithm for the General Mixed Packing and Covering Problem.
ESCAPE
Florian Diedrich, Klaus Jansen
2007 C conf
Approximation Algorithms for 3D Orthogonal Knapsack.
TAMC
Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas
2007 Misc conf
Approximation Algorithms for Scheduling with Reservations.
HiPC
Florian Diedrich, Klaus Jansen, Fanny Pascual, Denis Trystram
2007 J jnl
Faster and simpler approximation algorithms for mixed packing and covering problems.
Theor. Comput. Sci.
Florian Diedrich, Klaus Jansen
2006 — conf
Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem.
WEA
Mihhail Aizatulin, Florian Diedrich, Klaus Jansen