Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="R{\"o}glin, Heiko"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Solving totally unimodular LPs with the shadow vertex algorithm
Tobias Brunsch
,
Anna Großwendt
,
Heiko Röglin
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 171-183
Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP
Matthias Englert
,
Heiko Röglin
,
Berthold Vöcking
Algorithmica
68
(1), 2014, pp. 190-264
Finding short paths on polytopes by the shadow vertex algorithm
Tobias Brunsch
,
Heiko Röglin
Lecture Notes in Computer Science
7965
, 2013, pp. 279-290
A bad instance for
k
-means++
Tobias Brunsch
,
Heiko Röglin
Theoretical Computer Science
505
, 2013, pp. 19-26
Computing approximate Nash equilibria in network congestion games
Andreas Emil Feldmann
,
Heiko Röglin
,
Berthold Vöcking
Networks
59
(4), 2012, pp. 380-386
Uncoordinated two-sided matching markets
Heiner Ackermann
,
Paul W. Goldberg
,
Vahab S. Mirrokni
,
Heiko Röglin
,
Berthold Vöcking
SIAM Journal on Computing
40
(1), 2011, pp. 92-106
Smoothed performance guarantees for local search
Tobias Brunsch
,
Heiko Röglin
,
Cyriel Rutten
,
Tjark Vredeveld
Lecture Notes in Computer Science
6942
, 2011, pp. 772-783
Competitive routing over time
Martin Hoefer
,
Vahab S. Mirrokni
,
Heiko Röglin
,
Shang-Hua Teng
Theoretical Computer Science
412
(39), 2011, pp. 5420-5432
Economical caching
Matthias Englert
,
Heiko Röglin
,
Jacob Spönemann
,
Berthold Vöcking
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 385-396
Worst-case and smoothed analysis of
k
-means clustering with Bregman divergences
Bodo Manthey
,
Heiko Röglin
Lecture Notes in Computer Science
5878
, 2009, pp. 1024-1033
Decision-making based on approximate and smoothed Pareto curves
Heiner Ackermann
,
Alantha Newman
,
Heiko Röglin
,
Berthold Vöcking
Theoretical Computer Science
378
(3), 2007, pp. 253-270
The smoothed number of Pareto optimal solutions in bicriteria integer optimization
Rene Beier
,
Heiko Röglin
,
Berthold Vöcking
Lecture Notes in Computer Science
4513
, 2007, pp. 53-67
Decision making based on approximate and smoothed Pareto curves
Heiner Ackermann
,
Alantha Newman
,
Heiko Röglin
,
Berthold Vöcking
Lecture Notes in Computer Science
3827
, 2005, pp. 675-684
Smoothed analysis of integer programming
Heiko Röglin
,
Berthold Vöcking
Lecture Notes in Computer Science
3509
, 2005, pp. 276-290