Tobias Mömke

According to our database1, Tobias Mömke authored at least 45 papers between 2007 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
A 4-Approximation Algorithm for Maximum Independent Set of Rectangles.
CoRR, 2021

Faster (1+ε)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020
Managing Fleets of LEO Satellites: Nonlinear, Optimal, Efficient, Scalable, Usable, and Robust.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2020

Robust Reoptimization of Steiner Trees.
Algorithmica, 2020

Breaking the Barrier of 2 for the Storage Allocation Problem.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2018
Semidefinite and linear programming integrality gaps for scheduling identical machines.
Math. Program., 2018

Improved integrality gap upper bounds for traveling salesperson problems with distances one and two.
Eur. J. Oper. Res., 2018

A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Approximating Airports and Railways.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

A QPTAS for Gapless MEC.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

A Modern View on Stability of Approximation.
Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2017
Improved analysis of the online set cover problem with advice.
Theor. Comput. Sci., 2017

Online algorithms with advice: The tape model.
Inf. Comput., 2017

Complexity and Approximability of Parameterized MAX-CSPs.
Algorithmica, 2017

To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Maximum Scatter TSP in Doubling Metrics.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
Removing and Adding Edges for the Traveling Salesman Problem.
J. ACM, 2016

Airports and Railways: Facility Location Meets Network Design.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

The Complexity of Paging Against a Probabilistic Adversary.
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

2015
An improved approximation algorithm for the traveling salesman problem with relaxed triangle inequality.
Inf. Process. Lett., 2015

A PTAS for Euclidean Maximum Scatter TSP.
CoRR, 2015

New Approximation Schemes for Unsplittable Flow on a Path.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

A (2+\epsilon ) ( 2 + ϵ ) -Approximation Algorithm for the Storage Allocation Problem.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
Randomized Online Algorithms with High Probability Guarantees.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

2013
Improved approximations for TSP with simple precedence constraints.
J. Discrete Algorithms, 2013

A Competitive Ratio Approximation Scheme for the k-Server Problem in Fixed Finite Metrics
CoRR, 2013

Randomized online computation with high probability guarantees
CoRR, 2013

Improved integrality gap upper bounds for TSP with distances one and two.
CoRR, 2013

2012
Steiner tree reoptimization in graphs with sharpened triangle inequality.
J. Discrete Algorithms, 2012

Size complexity of rotating and sweeping automata.
J. Comput. Syst. Sci., 2012

On the Advice Complexity of the Set Cover Problem.
Proceedings of the Computer Science - Theory and Applications, 2012

2011
Reoptimization of the Shortest Common Superstring Problem.
Algorithmica, 2011

Structural Properties of Hard Metric TSP Inputs - (Extended Abstract).
Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

Approximating Graphic TSP by Matchings.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Improved Approximations for Hard Optimization Problems via Problem Instance Classification.
Proceedings of the Rainbow of Computer Science, 2011

2010
Improved Approximations for TSP with Simple Precedence Constraints.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009
Reoptimization of Steiner trees: Changing the terminal set.
Theor. Comput. Sci., 2009

On the power of randomization for job shop scheduling with k-units length tasks.
RAIRO Theor. Informatics Appl., 2009

On the Advice Complexity of Online Problems.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
Reoptimization of Steiner Trees.
Proceedings of the Algorithm Theory, 2008

On the Hardness of Reoptimization.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

2007
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms.
Algorithmic Oper. Res., 2007

An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata.
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2007

Efficient Algorithms for the Spoonerism Problem.
Proceedings of the Fun with Algorithms, 4th International Conference, 2007


  Loading...