PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Spoerhase, Joachim"

Author of the publication

copydeleteadd this publication to your clipboard
Specialized Heuristics for the Controller Placement Problem in Large Scale SDN Networks.

, , , , , , and . International Teletraffic Congress, page 210-218. IEEE, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

PD Dr. phil. Joachim Wündisch University of Stuttgart

Dr. Joachim Pfeiffer University of Stuttgart

Hon. -Prof. Dr. -Ing. Joachim Birk University of Stuttgart

Prof. Dr. -Ing. Joachim Speidel University of Stuttgart

Univ. -Prof. Dr. -Ing. Joachim Groß University of Stuttgart

 

Other publications of authors with the same name

A Constant-Factor Approximation Algorithm for Uniform Hard Capacitated $k$-Median., , , and . CoRR, (2013)Algorithms for Labeling Focus Regions., , , , and . IEEE Trans. Vis. Comput. Graph., 18 (12): 2583-2592 (2012)Maximum Betweenness Centrality: Approximability and Tractable Cases, and . CoRR, (2010)Approximating the Generalized Minimum Manhattan Network Problem., , , , , and . Algorithmica, 80 (4): 1170-1190 (2018)Competitive and voting location.. Julius Maximilian University of Würzburg, (2010)Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree., and . J. Discrete Algorithms, 7 (2): 256-266 (2009)Maximum Betweenness Centrality: Approximability and Tractable Cases., and . WALCOM, volume 6552 of Lecture Notes in Computer Science, page 9-20. Springer, (2011)Approximating Minimum Manhattan Networks in Higher Dimensions., , , , , and . ESA, volume 6942 of Lecture Notes in Computer Science, page 49-60. Springer, (2011)Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem., and . Algorithmica, 71 (4): 797-811 (2015)An Improved Approximation Algorithm for Knapsack Median Using Sparsification., , , , , and . Algorithmica, 80 (4): 1093-1114 (2018)