Jannis Blauth

Orcid: 0000-0001-5181-802X

Affiliations:
  • University of Bonn, Germany


According to our database1, Jannis Blauth authored at least 9 papers between 2021 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Toward Optimal Approximations for Resource-Minimization for Fire Containment on Trees and Non-Uniform k-Center.
CoRR, December, 2025

A Constant-Factor Approximation for Directed Latency.
CoRR, December, 2025

2024
Vehicle Routing in Theory and Practice
PhD thesis, 2024

Cost allocation for set covering: The happy nucleolus.
Oper. Res. Lett., 2024

Vehicle routing with time-dependent travel times: Theory, practice, and benchmarks.
Discret. Optim., 2024

A Better-Than-1.6-Approximation for Prize-Collecting TSP.
Proceedings of the Integer Programming and Combinatorial Optimization, 2024

2023
An Improved Approximation Guarantee for Prize-Collecting TSP.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Improved Guarantees for the a Priori TSP.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2021
Improving the Approximation Ratio for Capacitated Vehicle Routing.
Proceedings of the Integer Programming and Combinatorial Optimization, 2021


  Loading...