Tobias Mömke

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 37

Top Topics

Linear Programming

Approximation Schemes

Travelling Salesman

Top Venues

Publications

Tobias Mömke, Alexandru Popa, Aida Roshany-Tabrizi, Michael Ruderer, Roland Vincze
Approximating Maximum Edge 2-Coloring by Normalizing Graphs. CoRR (2024)
Mariia Anapolska, Tabea Brandt, Christina Büsing, Tobias Mömke
Multithread interval scheduling with flexible machine availabilities: Complexity and efficient algorithms. Discret. Appl. Math. 358 (2024)
Martin Böhm, Zachary Friggstad, Tobias Mömke, Joachim Spoerhase
Approximating TSP Variants Using a Bridge Lemma. CoRR (2024)
Vincent Cohen-Addad, Tobias Mömke, Victor Verdugo
A 2-approximation for the bounded treewidth sparsest cut problem in sfFPT Time. Math. Program. 206 (1) (2024)
Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Peter Rossmanith, Moritz Stocker, David Wehner
Online Knapsack with Removal and Recourse. IWOCA (2023)
Tobias Mömke, Hang Zhou
Capacitated Vehicle Routing in Graphic Metrics. SOSA (2023)
Tobias Mömke, Alexandru Popa, Aida Roshany-Tabrizi, Michael Ruderer, Roland Vincze
Approximating Maximum Edge 2-Coloring by Normalizing Graphs. WAOA (2023)
Mariia Anapolska, Christina Büsing, Tabea Krabs, Tobias Mömke
Coworking Scheduling with Network Flows. INOC (2022)
Fabrizio Grandoni, Tobias Mömke, Andreas Wiese
Unsplittable Flow on a Path: The Game!. SODA (2022)
Tobias Mömke, Hang Zhou
Capacitated Vehicle Routing in Graphic Metrics. CoRR (2022)
Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke
Randomized Online Computation with High Probability Guarantees. Algorithmica 84 (5) (2022)
Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, Andreas Wiese
A 3-Approximation Algorithm for Maximum Independent Set of Rectangles. SODA (2022)
Fabrizio Grandoni, Tobias Mömke, Andreas Wiese
A PTAS for unsplittable flow on a path. STOC (2022)
Vincent Cohen-Addad, Tobias Mömke, Victor Verdugo
A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time. IPCO (2022)
Vincent Cohen-Addad, Tobias Mömke, Victor Verdugo
A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time. CoRR (2021)
Fabrizio Grandoni, Tobias Mömke, Andreas Wiese
Faster (1+ε)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back. ESA (2021)
Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, Andreas Wiese
A 4-Approximation Algorithm for Maximum Independent Set of Rectangles. CoRR (2021)
Keshav Goyal, Tobias Mömke
Robust Reoptimization of Steiner Trees. Algorithmica 82 (7) (2020)
Gregory Stock, Juan A. Fraire, Tobias Mömke, Holger Hermanns, Fakhri Babayev, Eduardo Cruz
Managing Fleets of LEO Satellites: Nonlinear, Optimal, Efficient, Scalable, Usable, and Robust. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39 (11) (2020)
Tobias Mömke, Andreas Wiese
Breaking the Barrier of 2 for the Storage Allocation Problem. ICALP (2020)
Tobias Mömke, Andreas Wiese
Breaking the Barrier of 2 for the Storage Allocation Problem. CoRR (2019)
Ralf Klasing, Tobias Mömke
A Modern View on Stability of Approximation. Adventures Between Lower Bounds and Higher Altitudes (2018)
Anna Adamaszek, Antonios Antoniadis, Amit Kumar, Tobias Mömke
Approximating Airports and Railways. STACS (2018)
Shilpa Garg, Tobias Mömke
A QPTAS for Gapless MEC. CoRR (2018)
Fabrizio Grandoni, Tobias Mömke, Andreas Wiese, Hang Zhou
A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes. STOC (2018)
Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese
Semidefinite and linear programming integrality gaps for scheduling identical machines. Math. Program. 172 (1-2) (2018)
Shilpa Garg, Tobias Mömke
A QPTAS for Gapless MEC. ESA (2018)
Matthias Mnich, Tobias Mömke
Improved integrality gap upper bounds for traveling salesperson problems with distances one and two. Eur. J. Oper. Res. 266 (2) (2018)
Stefan Dobrev, Jeff Edmonds, Dennis Komm, Rastislav Královic, Richard Královic, Sacha Krug, Tobias Mömke
Improved analysis of the online set cover problem with advice. Theor. Comput. Sci. 689 (2017)
Fabrizio Grandoni, Tobias Mömke, Andreas Wiese, Hang Zhou
To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack. SODA (2017)
Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke
Online algorithms with advice: The tape model. Inf. Comput. 254 (2017)
László Kozma, Tobias Mömke
Maximum Scatter TSP in Doubling Metrics. SODA (2017)
Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke
Complexity and Approximability of Parameterized MAX-CSPs. Algorithmica 79 (1) (2017)
Stefan Dobrev, Juraj Hromkovic, Dennis Komm, Richard Královic, Rastislav Královic, Tobias Mömke
The Complexity of Paging Against a Probabilistic Adversary. SOFSEM (2016)
Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese
Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines. IPCO (2016)
Tobias Mömke, Ola Svensson
Removing and Adding Edges for the Traveling Salesman Problem. J. ACM 63 (1) (2016)
Anna Adamaszek, Antonios Antoniadis, Tobias Mömke
Airports and Railways: Facility Location Meets Network Design. STACS (2016)
Tobias Mömke, Andreas Wiese
A (2+\epsilon ) ( 2 + ϵ ) -Approximation Algorithm for the Storage Allocation Problem. ICALP (1) (2015)
Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke
Complexity and Approximability of Parameterized MAX-CSPs. IPEC (2015)
László Kozma, Tobias Mömke
A PTAS for Euclidean Maximum Scatter TSP. CoRR (2015)
Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke
Complexity and Approximability of Parameterized MAX-CSPs. CoRR (2015)
Jatin Batra, Naveen Garg, Amit Kumar, Tobias Mömke, Andreas Wiese
New Approximation Schemes for Unsplittable Flow on a Path. SODA (2015)
Tobias Mömke
An improved approximation algorithm for the traveling salesman problem with relaxed triangle inequality. Inf. Process. Lett. 115 (11) (2015)
Keshav Goyal, Tobias Mömke
Robust Reoptimization of Steiner Trees. FSTTCS (2015)
Tobias Mömke
An Improved Approximation Algorithm for the Traveling Salesman Problem with Relaxed Triangle Inequality. CoRR (2014)
Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke
Randomized Online Algorithms with High Probability Guarantees. STACS (2014)
Tobias Mömke
A Competitive Ratio Approximation Scheme for the k-Server Problem in Fixed Finite Metrics CoRR (2013)
Matthias Mnich, Tobias Mömke
Improved integrality gap upper bounds for TSP with distances one and two. CoRR (2013)
Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke
Randomized online computation with high probability guarantees CoRR (2013)
Hans-Joachim Böckenhauer, Tobias Mömke, Monika Steinová
Improved approximations for TSP with simple precedence constraints. J. Discrete Algorithms 21 (2013)
Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mömke, Andreas Sprock, Björn Steffen
Steiner tree reoptimization in graphs with sharpened triangle inequality. J. Discrete Algorithms 11 (2012)
Christos A. Kapoutsis, Richard Královic, Tobias Mömke
Size complexity of rotating and sweeping automata. J. Comput. Syst. Sci. 78 (2) (2012)
Dennis Komm, Richard Královic, Tobias Mömke
On the Advice Complexity of the Set Cover Problem. CSR (2012)
Tobias Mömke, Ola Svensson
Approximating Graphic TSP by Matchings CoRR (2011)
Tobias Mömke, Ola Svensson
Approximating Graphic TSP by Matchings. FOCS (2011)
Tobias Mömke
Structural Properties of Hard Metric TSP Inputs - (Extended Abstract). SOFSEM (2011)
Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych
Reoptimization of the Shortest Common Superstring Problem. Algorithmica 61 (2) (2011)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke
Improved Approximations for Hard Optimization Problems via Problem Instance Classification. Rainbow of Computer Science (2011)
Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mömke, Andreas Sprock, Björn Steffen
The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality. CIAC (2010)
Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Monika Steinová
Improved Approximations for TSP with Simple Precedence Constraints. CIAC (2010)
Tobias Mömke
On the power of randomization for job shop scheduling with k-units length tasks. RAIRO Theor. Informatics Appl. 43 (2) (2009)
Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych
Reoptimization of the Shortest Common Superstring Problem. CPM (2009)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Rossmanith
Reoptimization of Steiner trees: Changing the terminal set. Theor. Comput. Sci. 410 (36) (2009)
Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke
On the Advice Complexity of Online Problems. ISAAC (2009)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke, Peter Widmayer
On the Hardness of Reoptimization. SOFSEM (2008)
Christos A. Kapoutsis, Richard Královic, Tobias Mömke
On the Size Complexity of Rotating and Sweeping Automata. Developments in Language Theory (2008)
Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych
Reoptimization of Steiner Trees. SWAT (2008)
Juraj Hromkovic, Tobias Mömke, Kathleen Steinhöfel, Peter Widmayer
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. Algorithmic Oper. Res. 2 (1) (2007)
Christos A. Kapoutsis, Richard Královic, Tobias Mömke
An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata. SAGA (2007)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Kathleen Steinhöfel
Efficient Algorithms for the Spoonerism Problem. FUN (2007)