Author of the publication

Approximating (r,p)-centroid on a path

, and . Proc. 7th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW'08), (2008)

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.

 

Other publications of authors with the same name

Polylogarithmic Approximation for Generalized Minimum Manhattan Networks, , , , , and . Proc. 29th Europ. Workshop Comput. Geom. (EuroCG'13), Braunschweig, (March 2013)Relaxed Voting and Competitive Location on Trees under Monotonuos Gain Functions., and . Technical Report, 401. Department of Computer Science, (March 2007)A Linear Time Algorithm for Absolute Optima under Monotonous Gain Functions on Trees., and . Technical Report, 433. Department of Computer Science, (October 2007)(r,p)-Centroid Problems on Paths and Trees., and . Technical Report, 441. Department of Computer Science, (January 2008)PTAS for Steiner Tree on Map Graphs., , , , and . CoRR, (2019)Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces, , , , , , , , and . Proc. 51st International Colloquium on Automata, Languages and Programming (ICALP'24), (2024)Coloring Mixed and Directional Interval Graphs., , , , , and . GD, volume 13764 of Lecture Notes in Computer Science, page 418-431. Springer, (2022)Relaxed voting and competitive location on trees under monotonous gain functions., and . CTW, page 137-140. University of Twente, (2007)Approximating the Generalized Minimum Manhattan Network Problem, , , , , and . Algorithmica, (March 2017)Improved Approximation Algorithms for Box Contact Representations, , , , , , , and . Algorithmica, (2016)