activity
20102025
most citedExploring Simple Triangular and Hexagonal Grid Polygons Online

5 citations · 7 across the 8 of their papers we have counts for

collaborators
Showing 2024Show all

1 paper · 1 filter

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…