EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Open problems on Steiner trees and maximal distance minimizers

Yana Teplitskaya

Journal of Convex Analysis · 2027 · 34 (1) · 573-581

DOI: 10.68381/jca34038 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Convex Analysis, 2027. Verfasst von Yana Teplitskaya. Die Arbeit nennt 34 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In this work, I collect and discuss a series of open questions in one-dimensional geometric optimization in Euclidean spaces. The focus is on two classes of problems: maximal distance minimizers and Steiner trees. Maximal distance minimizers concern finding a connected set of minimal length whose closed r r -neighborhood covers a given compact set, whereas Steiner trees aim to find a minimum-length set connecting a prescribed set of points. For both problems, I briefly summarize known results and highlight the remaining open questions. While some questions can be approached with elementary methods, others remain highly challenging.

Zitieren

APA

Teplitskaya, Y. (2027). Open problems on Steiner trees and maximal distance minimizers. Journal of Convex Analysis, 34(1), 573-581. https://doi.org/10.68381/jca34038

Vancouver

Teplitskaya Y. Open problems on Steiner trees and maximal distance minimizers. Journal of Convex Analysis. 2027;34(1):573-581. doi:10.68381/jca34038

BibTeX
@article{Teplitskaya2027,
  author = {Teplitskaya, Yana},
  title = {Open problems on Steiner trees and maximal distance minimizers},
  journal = {Journal of Convex Analysis},
  year = {2027},
  volume = {34},
  number = {1},
  pages = {573--581},
  doi = {10.68381/jca34038}
}
Kostenlos starten →