Bodo Manthey
Title
Cited by
Cited by
Year
Smoothed analysis of the k-means method
D Arthur, B Manthey, H Röglin
Journal of the ACM (JACM) 58 (5), 1-31, 2011
942011
k-Means has Polynomial Smoothed Complexity
D Arthur, B Manthey, H Röglin
Foundations of Computer Science, 2009. FOCS'09. 50th Annual IEEE Symposium …, 2009
702009
Smoothed analysis of binary search trees
B Manthey, R Reischuk
Theoretical Computer Science 378 (3), 292-315, 2007
412007
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
M Bläser, B Manthey, J Sgall
Journal of Discrete Algorithms 4 (4), 623-632, 2006
392006
Computing cycle covers without short cycles
M Bläser, B Siebert
Algorithms—ESA 2001, 368-379, 2001
382001
Average-case approximation ratio of the 2-opt algorithm for the TSP
C Engels, B Manthey
Operations Research Letters 37 (2), 83-84, 2009
352009
Approximating maximum weight cycle covers in directed graphs with weights zero and one
M Bläser, B Manthey
Algorithmica 42 (2), 121-139, 2005
342005
Smoothed analysis of the successive shortest path algorithm
T Brunsch, K Cornelissen, B Manthey, H Röglin
24th ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 1180-1189, 2013
332013
Worst-case and smoothed analysis of k-means clustering with Bregman divergences
B Manthey, H Röglin
International Symposium on Algorithms and Computation, 1024-1033, 2009
32*2009
Improved Smoothed Analysis of the k-Means Method
B Manthey, H Röglin
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
322009
Private computation: k-connected versus 1-connected networks
M Bläser, A Jakoby, M Liskiewicz, B Manthey
Journal of cryptology 19 (3), 341-357, 2006
31*2006
Approximation algorithms for multi-criteria traveling salesman problems
B Manthey, L Shankar Ram
Algorithmica 53 (1), 69-88, 2009
272009
On approximating restricted cycle covers
B Manthey
SIAM Journal on Computing 38 (1), 181-206, 2008
252008
On approximating multicriteria TSP
B Manthey
ACM Transactions on Algorithms (TALG) 8 (2), 1-18, 2012
242012
Smoothed analysis: analysis of algorithms beyond worst case
B Manthey, H Röglin
IT-Information Technology 53 (6), 280, 2011
232011
Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions
E Boros, K Elbassioni, M Fouz, V Gurvich, K Makino, B Manthey
Algorithmica 80 (11), 3132-3157, 2018
22*2018
Smoothed analysis of the 2-Opt heuristic for the TSP: Polynomial bounds for Gaussian noise
B Manthey, R Veenstra
International Symposium on Algorithms and Computation, 579-589, 2013
212013
Two approximation algorithms for 3-cycle covers
M Bläser, B Manthey
International Workshop on Approximation Algorithms for Combinatorial …, 2002
212002
Minimum-weight cycle covers and their approximability
B Manthey
Discrete Applied Mathematics 157 (7), 1470-1480, 2009
182009
Smoothed analysis of partitioning algorithms for Euclidean functionals
M Bläser, B Manthey, BVR Rao
Algorithmica 66 (2), 397-418, 2013
172013
The system can't perform the operation now. Try again later.
Articles 1–20