I agree that this site is using cookies. You can find further informations here.
X
Mömke, Tobias
81  results:
Search for persons X
?
1

A 2-approximation for the bounded treewidth sparsest cut pr..:

Cohen-Addad, Vincent ; Mömke, Tobias ; Verdugo, Victor
Mathematical Programming.  206 (2024)  1-2 - p. 479-495 , 2024
Link: https://doi.org/10.1007/..
 
?
2

Multithread interval scheduling with flexible machine avail..:

Anapolska, Mariia ; Brandt, Tabea ; Büsing, Christina.
Discrete Applied Mathematics.  358 (2024)  - p. 230-253 , 2024
Link: https://doi.org/10.1016/..
 
?
3

Online Knapsack with Removal and Recourse:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,
Böckenhauer, Hans-Joachim ; Klasing, Ralf ; Mömke, Tobias... - p. 123-135 , 2023
Link: https://doi.org/10.1007/..
 
?
4

Approximating Maximum Edge 2-Coloring by Normalizing Graphs:

, In: Approximation and Online Algorithms; Lecture Notes in Computer Science,
Mömke, Tobias ; Popa, Alexandru ; Roshany-Tabrizi, Aida.. - p. 29-44 , 2023
Link: https://doi.org/10.1007/..
 
?
5

Randomized Online Computation with High Probability Guarant..:

Komm, Dennis ; Královič, Rastislav ; Královič, Richard.
Algorithmica.  84 (2022)  5 - p. 1357-1384 , 2022
Link: https://doi.org/10.1007/..
 
?
6

A PTAS for unsplittable flow on a path:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Grandoni, Fabrizio ; Mömke, Tobias ; Wiese, Andreas - p. 289-302 , 2022
Link: https://dl.acm.org/doi/1..
 
?
7

A 2-Approximation for the Bounded Treewidth Sparsest Cut Pr..:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,
Cohen-Addad, Vincent ; Mömke, Tobias ; Verdugo, Victor - p. 112-125 , 2022
Link: https://doi.org/10.1007/..
 
?
8

Robust Reoptimization of Steiner Trees:

Goyal, Keshav ; Mömke, Tobias
Algorithmica.  82 (2020)  7 - p. 1966-1988 , 2020
Link: https://doi.org/10.1007/..
 
?
9

Improved integrality gap upper bounds for traveling salespe..:

Mnich, Matthias ; Mömke, Tobias
European Journal of Operational Research.  266 (2018)  2 - p. 436-457 , 2018
Link: https://doi.org/10.1016/..
 
?
10

A (5/3 + ε)-approximation for unsplittable flow on a path: ..:

, In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing,
Grandoni, Fabrizio ; Mömke, Tobias ; Wiese, Andreas. - p. 607-619 , 2018
Link: https://dl.acm.org/doi/1..
 
?
11

A Modern View on Stability of Approximation:

, In: Adventures Between Lower Bounds and Higher Altitudes; Lecture Notes in Computer Science,
Klasing, Ralf ; Mömke, Tobias - p. 393-408 , 2018
Link: https://doi.org/10.1007/..
 
?
12

Complexity and Approximability of Parameterized MAX-CSPs:

Dell, Holger ; Kim, Eun Jung ; Lampis, Michael..
Algorithmica.  79 (2017)  1 - p. 230-250 , 2017
Link: https://doi.org/10.1007/..
 
?
13

Online algorithms with advice: The tape model:

Böckenhauer, Hans-Joachim ; Komm, Dennis ; Královič, Rastislav..
Information and Computation.  254 (2017)  - p. 59-83 , 2017
Link: https://doi.org/10.1016/..
 
?
14

Maximum scatter TSP in doubling metrics:

, In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms,
Kozma, László ; Mömke, Tobias - p. 143-153 , 2017
Link: https://dl.acm.org/doi/1..
 
?
15

To augment or not to augment : solving unsplittable flow..:

, In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms,
Grandoni, Fabrizio ; Mömke, Tobias ; Wiese, Andreas. - p. 2411-2422 , 2017
Link: https://dl.acm.org/doi/1..
 
1-15