Items where Subject is "68-XX Computer science > 68Wxx Algorithms > 68W25 Approximation algorithms"
![]() | Up a level |
- MSC Classification Numbers (12)
- 68-XX Computer science (12)
- 68Wxx Algorithms (12)
- 68W25 Approximation algorithms (12)
- 68Wxx Algorithms (12)
- 68-XX Computer science (12)
E
Engels, Birgit and Schrader, Rainer
(2015)
Freight car dispatching with generalized flows.
Published in:
Networks Vol. 66 (1).
pp. 33-39.
ISSN 1097-0037
F
Fuchs, Bernhard
(2006)
On the Hardness of Range Assignment Problems.
Published In:
Algorithms and Complexity : 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006. Proceedings, Lecture notes in computer science. 3998 Springer 2006, pp. 127-138.
Fuchs, Bernhard
(2003)
A note on the terminal Steiner tree problem.
Published in:
Information Processing Letters Vol. 87 (4).
pp. 219-220.
Fuchs, Bernhard and Schulze, Anna
(2009)
A Fast 2-Approximation of Minimum Manhattan Networks.
Technical Report
, 27 p.
Fuchs, Bernhard and Schulze, Anna
(2008)
A Simple 3-Approximation of Minimum Manhattan Networks.
Technical Report
, 16 p.
G
Groß, Martin and Gupta, Anupam and Kumar, Amit and Matuschke, Jannik and Schmidt, Daniel R. and Schmidt, Melanie and Verschae, José
(2018)
A Local-Search Algorithm for Steiner Forest.
Published In:
9th Innovations in Theoretical Computer Science Conference (ITCS 2018), Leibniz International Proceedings in Informatics (LIPIcs). 94 Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik 2018, 31:1-31:17.
H
Hachul, Stefan and Jünger, Michael
(2004)
Drawing Large Graphs with a Potential -Field-Based Multilevel Algorithm.
Published In:
Graph drawing: 12th international symposium, GD 2004, New York, NY, USA, September 29 - October 2, 2004; revised selected papers, Lecture Notes in Computer Science. 3383 Springer 2004, pp. 285-295.
L
Lohmann, Matthias and Ullrich, Oliver and Molina Madrid, Manuel and Lückerath, Daniel and Speckenmeyer, Ewald
(2014)
The team priority assignment problem.
Technical Report
, 12 p.
M
Müller-Hannemann, Matthias and Schulze, Anna
(2006)
Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles.
Technical Report
, 22 p.
Müller-Hannemann, Matthias and Schulze, Anna
(2006)
Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles.
Published In:
Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6 - 8, 2006 ; proceedings, Lecture Notes in Computer Science. 4059 Springer 2006, pp. 242-254.
Müller-Hannemann, Matthias and Schulze, Anna
(2005)
Hardness and Approximation of Octilinear Steiner Trees.
Published In:
Algorithms and computation 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005 ; proceedings, Lecture Notes in Computer Science. 3827 Springer 2005, pp. 256-265.
Müller-Hannemann, Matthias and Schulze, Anna
(2007)
Hardness and Approximation of Octilinear Steiner Trees.
Published in:
International Journal of Computational Geometry and Applications (IJCGA) Vol. 17 (3).
pp. 231-260.