Tobias Mömke
Tobias Mömke
Computer Science, University of Augsburg
Verified email at informatik.uni-augsburg.de - Homepage
Title
Cited by
Cited by
Year
Removing and adding edges for the traveling salesman problem
T Mömke, O Svensson
Journal of the ACM (JACM) 63 (1), 1-28, 2016
137*2016
Online algorithms with advice: the tape model
HJ Böckenhauer, D Komm, R Královič, R Královič, T Mömke
Information and Computation 254, 59-83, 2017
130*2017
On the hardness of reoptimization
HJ Böckenhauer, J Hromkovič, T Mömke, P Widmayer
International Conference on Current Trends in Theory and Practice of …, 2008
952008
Reoptimization of Steiner trees
D Bilō, HJ Böckenhauer, J Hromkovič, R Královič, T Mömke, P Widmayer, ...
Scandinavian Workshop on Algorithm Theory, 258-269, 2008
542008
Reoptimization of Steiner trees: Changing the terminal set
HJ Böckenhauer, J Hromkovič, R Královič, T Mömke, P Rossmanith
Theoretical computer science 410 (36), 3428-3435, 2009
482009
Reoptimization of the shortest common superstring problem
D Bilō, HJ Böckenhauer, D Komm, R Královič, T Mömke, S Seibert, A Zych
Algorithmica 61 (2), 227-251, 2011
462011
Size complexity of rotating and sweeping automata
C Kapoutsis, R Královič, T Mömke
Journal of Computer and System Sciences 78 (2), 537-558, 2012
44*2012
New approximation schemes for unsplittable flow on a path
J Batra, N Garg, A Kumar, T Mömke, A Wiese
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
342014
On the advice complexity of the set cover problem
D Komm, R Královič, T Mömke
International Computer Science Symposium in Russia, 241-252, 2012
342012
Job shop scheduling with unit length tasks: bounds and algorithms
J Hromkovič, T Mömke, K Steinhöfel, P Widmayer
Algorithmic Operations Research 2 (1), 2007
25*2007
Steiner tree reoptimization in graphs with sharpened triangle inequality
HJ Böckenhauer, K Freiermuth, J Hromkovič, T Mömke, A Sprock, ...
Journal of discrete algorithms 11, 73-86, 2012
23*2012
Improved approximations for TSP with simple precedence constraints
HJ Böckenhauer, R Klasing, T Mömke, M Steinová
International Conference on Algorithms and Complexity, 61-72, 2010
162010
To augment or not to augment: Solving unsplittable flow on a path by creating slack
F Grandoni, T Mömke, A Wiese, H Zhou
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
122017
Robust reoptimization of Steiner trees
K Goyal, T Mömke
35th IARCS Annual Conference on Foundations of Software Technology and …, 2015
112015
Maximum scatter TSP in doubling metrics
L Kozma, T Mömke
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
102017
A (5/3+ ε)-approximation for unsplittable flow on a path: placing small tasks into boxes
F Grandoni, T Mömke, A Wiese, H Zhou
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
82018
Improved analysis of the online set cover problem with advice
S Dobrev, J Edmonds, D Komm, R Královič, R Královič, S Krug, T Mömke
Theoretical Computer Science 689, 96-107, 2017
72017
Improved integrality gap upper bounds for traveling salesperson problems with distances one and two
M Mnich, T Mömke
European Journal of Operational Research 266 (2), 436-457, 2018
6*2018
An improved approximation algorithm for the traveling salesman problem with relaxed triangle inequality
T Mömke
Information Processing Letters 115 (11), 866-871, 2015
62015
A -Approximation Algorithm for the Storage Allocation Problem
T Mömke, A Wiese
International Colloquium on Automata, Languages, and Programming, 973-984, 2015
62015
The system can't perform the operation now. Try again later.
Articles 1–20