Heiko Röglin
Heiko Röglin
Professor of Computer Science, University of Bonn
Email verificata su cs.uni-bonn.de - Home page
Citata da
Citata da
On the impact of combinatorial structure on congestion games
H Ackermann, H Röglin, B Vöcking
Journal of the ACM (JACM) 55 (6), 1-22, 2008
Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP
M Englert, H Röglin, B Vöcking
Algorithmica 68 (1), 190-264, 2014
Pure Nash equilibria in player-specific and weighted congestion games
H Ackermann, H Röglin, B Vöcking
Theoretical Computer Science 410 (17), 1552-1563, 2009
Uncoordinated two-sided matching markets
H Ackermann, PW Goldberg, VS Mirrokni, H Röglin, B Vöcking
SIAM Journal on Computing 40 (1), 92-106, 2011
Smoothed analysis of the k-means method
D Arthur, B Manthey, H Röglin
Journal of the ACM (JACM) 58 (5), 1-31, 2011
K-means has polynomial smoothed complexity
D Arthur, B Manthey, H Röglin
2009 50th Annual IEEE Symposium on Foundations of Computer Science, 405-414, 2009
Theoretical analysis of two ACO approaches for the traveling salesman problem
T Kötzing, F Neumann, H Röglin, C Witt
Swarm Intelligence 6 (1), 1-21, 2012
Active clustering of biological sequences
K Voevodski, MF Balcan, H Röglin, SH Teng, Y Xia
The Journal of Machine Learning Research 13, 203-225, 2012
Smoothed analysis of integer programming
H Röglin, B Vöcking
Mathematical programming 110 (1), 21-56, 2007
Decision-making based on approximate and smoothed Pareto curves
H Ackermann, A Newman, H Röglin, B Vöcking
Theoretical Computer Science 378 (3), 253-270, 2007
Competitive routing over time
M Hoefer, VS Mirrokni, H Röglin, SH Teng
Theoretical Computer Science 412 (39), 5420-5432, 2011
Smoothed analysis of multiobjective optimization
H Röglin, SH Teng
2009 50th Annual IEEE Symposium on Foundations of Computer Science, 681-690, 2009
Smoothed analysis of the successive shortest path algorithm
T Brunsch, K Cornelissen, B Manthey, H Röglin, C Rösner
SIAM Journal on Computing 44 (6), 1798-1819, 2015
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
Improved Smoothed Analysis of the k-Means Method
B Manthey, H Röglin
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
The smoothed number of Pareto optimal solutions in bicriteria integer optimization
R Beier, H Röglin, B Vöcking
International Conference on Integer Programming and Combinatorial …, 2007
Smoothed analysis of local search for the maximum-cut problem
M Etscheid, H Röglin
ACM Transactions on Algorithms (TALG) 13 (2), 1-12, 2017
Agnostic clustering
MF Balcan, H Röglin, SH Teng
International Conference on Algorithmic Learning Theory, 384-398, 2009
Polynomial kernels for weighted problems
M Etscheid, S Kratsch, M Mnich, H Röglin
Journal of Computer and System Sciences 84, 1-10, 2017
A bad instance for k-means++
T Brunsch, H Röglin
Theoretical Computer Science 505, 19-26, 2013
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20