Suivre
Tobias Mömke
Tobias Mömke
Computer Science, University of Augsburg
Adresse e-mail validée de informatik.uni-augsburg.de - Page d'accueil
Titre
Citée par
Citée par
Année
Removing and adding edges for the traveling salesman problem
T Mömke, O Svensson
Journal of the ACM (JACM) 63 (1), 1-28, 2016
164*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
161*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
1012008
Chromosome-scale, haplotype-resolved assembly of human genomes
S Garg, AA Fungtammasan, A Carroll, M Chou, A Schmitt, X Zhou, S Mac, ...
Nature Biotechnology, 2020
100*2020
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
572008
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
49*2012
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
492011
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
492009
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
442014
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
372012
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
272018
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
25*2012
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), 1-14, 2007
25*2007
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
232010
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
212017
Robust reoptimization of Steiner trees
K Goyal, T Mömke
35th IARCS Annual Conference on Foundations of Software Technology and …, 2015
132015
Maximum scatter TSP in doubling metrics
L Kozma, T Mömke
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
122017
A -Approximation Algorithm for the Storage Allocation Problem
T Mömke, A Wiese
International Colloquium on Automata, Languages, and Programming, 973-984, 2015
122015
Breaking the barrier of 2 for the storage allocation problem
T Mömke, A Wiese
arXiv preprint arXiv:1911.10871, 2019
102019
Semidefinite and linear programming integrality gaps for scheduling identical machines
A Kurpisz, M Mastrolilli, C Mathieu, T Mömke, V Verdugo, A Wiese
Mathematical Programming 172 (1), 231-248, 2018
92018
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20