4 Treffer

• Handling Proper Minor-Closed Graph Classes in Linear Time Shortest Paths and 2-Approximate Steiner Trees Müller-Hannemann, Matthias ; Tazari, Siamak Halle (Saale) : Martin-Luther-University Halle-Wittenberg, Institute of Computer Science, 2007 ; Halle, Saale : Universitäts- und Landesbibliothek Sachsen-Anhalt, 2007

• A Near Linear Time Approximation Scheme for Steiner Tree among Obstacles in the Plane Müller-Hannemann, Matthias ; Tazari, Siamak Halle (Saale) : Martin-Luther-University Halle-Wittenberg, Institute of Computer Science, 2007 ; Halle, Saale : Universitäts- und Landesbibliothek Sachsen-Anhalt, 2007

• Non-Approximability of Just-in-Time Scheduling Müller-Hannemann, Matthias ; Sonnikow, Alexander Halle (Saale) : Martin-Luther-University Halle-Wittenberg, Institute of Computer Science, 2007 ; Halle, Saale : Universitäts- und Landesbibliothek Sachsen-Anhalt, 2007

• Subpath-Optimality of Multi-Criteria Shortest Paths in Time- and Event-Dependent Networks Berger, Annabell ; Müller-Hannemann, Matthias Halle (Saale) : Martin-Luther-University Halle-Wittenberg, Institute of Computer Science, 2009 ; Halle, Saale : Universitäts- und Landesbibliothek Sachsen-Anhalt, 2009