Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Brief Announcement: Approximation Schemes for Geometric Coverage Problems.

S. Chaplick, M. De, A. Ravsky, and J. Spoerhase. ICALP, volume 107 of LIPIcs, page 107:1-107:4. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)

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. iR Dr. -Ing. Joachim Speidel University of Stuttgart

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

Other publications of authors with the same name

Approximating the Generalized Minimum Manhattan Network Problem.A. Das, K. Fleszar, S. Kobourov, J. Spoerhase, S. Veeramoni, and A. Wolff. Algorithmica, 80 (4): 1170-1190 (2018)Maximum Betweenness Centrality: Approximability and Tractable CasesM. Fink, and J. Spoerhase. CoRR, (2010)Algorithms for Labeling Focus Regions.M. Fink, J. Haunert, A. Schulz, J. Spoerhase, and A. Wolff. IEEE Trans. Vis. Comput. Graph., 18 (12): 2583-2592 (2012)A Constant-Factor Approximation Algorithm for Uniform Hard Capacitated $k$-Median.J. Byrka, K. Fleszar, B. Rybicki, and J. Spoerhase. CoRR, (2013)Competitive and voting location.J. Spoerhase. Julius Maximilian University of Würzburg, (2010)Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem.M. Knauer, and J. Spoerhase. Algorithmica, 71 (4): 797-811 (2015)An Improved Approximation Algorithm for Knapsack Median Using Sparsification.J. Byrka, T. Pensyl, B. Rybicki, J. Spoerhase, A. Srinivasan, and K. Trinh. Algorithmica, 80 (4): 1093-1114 (2018)Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree.J. Spoerhase, and H. Wirth. J. Discrete Algorithms, 7 (2): 256-266 (2009)Relaxed voting and competitive location under monotonous gain functions on trees.J. Spoerhase, and H. Wirth. Discrete Applied Mathematics, 158 (4): 361-373 (2010)Maximum Betweenness Centrality: Approximability and Tractable Cases.M. Fink, and J. Spoerhase. WALCOM, volume 6552 of Lecture Notes in Computer Science, page 9-20. Springer, (2011)