Items where Subject is "68-XX Computer science > 68Wxx Algorithms > 68W40 Analysis of algorithms"
![]() | Up a level |
- MSC Classification Numbers (11)
- 68-XX Computer science (11)
- 68Wxx Algorithms (11)
- 68W40 Analysis of algorithms (11)
- 68Wxx Algorithms (11)
- 68-XX Computer science (11)
Article
Fuchs, Bernhard and Kern, Walter and Mölle, Daniel and Richter, Stefan and Rossmanith, Peter and Wang, Xinhui
(2007)
Dynamic Programming for Minimum Steiner Trees.
Published in:
Theory of Computing Systems Vol. 41 (3).
pp. 493-500.
Fuchs, Bernhard and Kern, Walter and Wang, Xinhui
(2007)
Speeding up the Dreyfus-Wagner Algorithm for minimum Steiner trees.
Published in:
Mathematical Methods of Operations Research Vol. 66 (1).
pp. 117-125.
Fuchs, Bernhard and Kern, Walter and Wang, Xinhui
(2007)
The number of tree stars is O^*(1.357^k).
Published in:
Algorithmica Vol. 49 (3).
pp. 232-244.
Liers, Frauke and Pardella, Gregor
(2012)
Partitioning planar graphs: a fast combinatorial approach for max-cut.
Published in:
Computational Optimization and Applications.
pp. 323-344.
Mallach, Sven
(2021)
A note on labeling methods to schedule unit execution time tasks in the presence of delayed precedence constraints.
Published in:
Journal of Parallel and Distributed Computing Vol. 156.
pp. 1-6.
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.
Proceedings article
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.
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.
Paper
Müller-Hannemann, Matthias and Schulze, Anna
(2006)
Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles.
Technical Report
, 22 p.
Thesis
Fuchs, Bernhard (2007) On the Approximability of Range Assignment Problems. PhD thesis.