5 citations · 9 across the 14 of their papers we have counts for
Showing 2024 · cs.CGShow all
2 papers · 2 filters
cs.CG2024
NP-hardness and a PTAS for the Euclidean Steiner Line Problem
Simon Bartlmae, Paul J. Jünger, Elmar Langetepe
The Euclidean Steiner Tree Problem (EST) seeks a minimum-cost tree interconnecting a given set of terminal points in the Euclidean plane, allowing the use of additional intersectio…
cs.CG2024★ 1 cited
Simple Grid Polygon Online Exploration Revisited
Maximilian Brock, Martin Brückmann, Elmar Langetepe +1
Due to some significantly contradicting research results, we reconsider the problem of the online exploration of a simple grid cell environment. In this model an agent attains loca…