J
Jan Hackfeld
Researcher at Technical University of Berlin
Publications - 8
Citations - 118
Jan Hackfeld is an academic researcher from Technical University of Berlin. The author has contributed to research in topics: Competitive analysis & Vertex (geometry). The author has an hindex of 5, co-authored 7 publications receiving 92 citations. Previous affiliations of Jan Hackfeld include Humboldt University of Berlin.
Papers
More filters
Proceedings ArticleDOI
Tight bounds for online TSP on the line
Antje Bjelde,Yann Disser,Jan Hackfeld,Christoph Hansknecht,Maarten Lipmann,Julie Meißner,Kevin Schewior,Miriam Schlöter,Leen Stougie +8 more
TL;DR: This work considers the online traveling salesperson problem (TSP), where requests appear online over time on the real line and need to be visited by a server initially located at the origin, and gives an algorithm with running time O(n2) for closed offline TSP on the line with release dates and shows that both variants of offline D ial -A-R ide on the lines are NP-hard for any capacity c ≥ 2 of the server.
Proceedings ArticleDOI
Undirected graph exploration with Θ(log log n) pebbles
TL;DR: This work considers the fundamental problem of exploring an undirected and initially unknown graph by an agent with little memory and shows that for an agent O(log log n) distinguishable pebbles and bits of memory are sufficient to explore any bounded-degree graph with at most n vertices.
Proceedings ArticleDOI
Energy-Efficient Delivery by Heterogeneous Mobile Agents
Andreas Bärtschi,Jérémie Chalopin,Shantanu Das,Yann Disser,Daniel Graf,Jan Hackfeld,Paolo Penna +6 more
TL;DR: In this paper, the authors considered the problem of delivering m messages between specified source-target pairs in an undirected graph, by k mobile agents initially located at distinct nodes of the graph.
Journal ArticleDOI
Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents
TL;DR: An algorithm for a single agent with constant memory that explores any n-vertex graph using O(log log n) pebbles, even when n is not known a priori, and can be realized with additional constant-memory agents rather than pebbling.
Posted ContentDOI
Energy-efficient Delivery by Heterogeneous Mobile Agents
Andreas Bärtschi,Jérémie Chalopin,Shantanu Das,Yann Disser,Daniel Graf,Jan Hackfeld,Paolo Penna +6 more
TL;DR: In this paper, the authors considered the problem of delivering messages between specified source-target pairs in a weighted undirected graph, by mobile agents initially located at distinct nodes of the graph.