Tobias Mömke

Available identifiers

zbMath Open momke.tobiasMaRDI QIDQ396658

List of research outcomes

Publication	Date of Publication	Type
Online knapsack with removal and recourse	2023-12-22	Paper
A PTAS for unsplittable flow on a path	2023-12-08	Paper
Faster (1+µ)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back	2023-09-20	Paper
A Modern View on Stability of Approximation	2023-06-30	Paper
A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} Time	2022-08-16	Paper
Randomized online computation with high probability guarantees	2022-05-03	Paper
https://portal.mardi4nfdi.de/entity/Q5009594	2021-08-04	Paper
Approximating Airports and Railways	2020-08-05	Paper
Robust reoptimization of Steiner trees	2020-05-21	Paper
A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes	2019-08-22	Paper
Semidefinite and linear programming integrality gaps for scheduling identical machines	2018-10-26	Paper
Removing and Adding Edges for the Traveling Salesman Problem	2018-08-02	Paper
Maximum Scatter TSP in Doubling Metrics	2018-07-16	Paper
To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack	2018-07-16	Paper
Improved integrality gap upper bounds for traveling salesperson problems with distances one and two	2018-05-30	Paper
Airports and Railways: Facility Location Meets Network Design	2018-01-24	Paper
Complexity and approximability of parameterized MAX-CSPs	2017-10-10	Paper
New Approximation Schemes for Unsplittable Flow on a Path	2017-10-05	Paper
Complexity and Approximability of Parameterized MAX-CSPs	2017-09-29	Paper
Improved analysis of the online set cover problem with advice	2017-09-07	Paper
Robust Reoptimization of Steiner Trees	2017-07-13	Paper
Online algorithms with advice: the tape model	2017-05-18	Paper
Randomized Online Algorithms with High Probability Guarantees	2017-03-03	Paper
Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines	2016-08-10	Paper
The Complexity of Paging Against a Probabilistic Adversary	2016-03-10	Paper
A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem	2015-10-27	Paper
An improved approximation algorithm for the traveling salesman problem with relaxed triangle inequality	2015-07-15	Paper
Improved approximations for TSP with simple precedence constraints	2014-08-13	Paper
Approximating Graphic TSP by Matchings	2014-07-30	Paper
On the Advice Complexity of the Set Cover Problem	2012-09-10	Paper
Steiner tree reoptimization in graphs with sharpened triangle inequality	2012-05-11	Paper
Size complexity of rotating and sweeping automata	2012-05-11	Paper
Reoptimization of the shortest common superstring problem	2011-09-20	Paper
Improved Approximations for Hard Optimization Problems via Problem Instance Classification	2011-05-27	Paper
Structural Properties of Hard Metric TSP Inputs	2011-02-15	Paper
Improved Approximations for TSP with Simple Precedence Constraints	2010-05-28	Paper
The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality	2010-05-28	Paper
On the Advice Complexity of Online Problems	2009-12-17	Paper
Reoptimization of Steiner trees: changing the terminal set	2009-08-21	Paper
Reoptimization of the Shortest Common Superstring Problem	2009-07-07	Paper
On the power of randomization for job shop scheduling withk-units length tasks	2009-05-06	Paper
An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata	2009-03-05	Paper
On the Size Complexity of Rotating and Sweeping Automata	2008-10-30	Paper
Reoptimization of Steiner Trees	2008-07-15	Paper
On the Hardness of Reoptimization	2008-03-07	Paper
Efficient Algorithms for the Spoonerism Problem	2007-11-15	Paper
https://portal.mardi4nfdi.de/entity/Q5755525	2007-08-13	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Tobias Mömke