Computing a (1+ε)-Approximate Geometric Minimum-Diameter Spanning Tree
Spriggs, Michael J. ; Keil, J. Mark ; Bespamyatnikh, Sergei ; Segal, Michael ; Snoeyink, Jack
- Link zu diesem Datensatz
- https://d-nb.info/1290509212
- Titel
- Computing a (1+ε)-Approximate Geometric Minimum-Diameter Spanning Tree
- Art des Inhalts
- Teil eines Werks
- Verfassangaben
- by Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink
- Autor(en)
-
- Spriggs, Michael J.
- Keil, J. Mark
- Bespamyatnikh, Sergei
- Segal, Michael
- Snoeyink, Jack
- Organisation(en)
-
- SpringerLink (Online service)
- Zeitliche Einordnung
- Erscheinungsdatum: 2003
- Umfang/Format
- Online-Ressource
- DOI
- 10.1007/s00453-003-1056-z
- Online
- https://doi.org/10.1007/s00453-003-1056-z
- Sprache
- eng
- Schlagwörter
-
- (lcsh)Algorithms.
- (lcsh)Computer science.
- (lcsh)Computer science—Mathematics.
- (lcsh)Computer engineering.
- (lcsh)Computer networks .
- (lcsh)Data structures (Computer science).
- (lcsh)Information theory.
- Design and Analysis of Algorithms.
- Theory of Computation.
- Mathematics of Computing.
- Algorithms.
- Computer Engineering and Networks.
- Data Structures and Information Theory.
- Frühere/spätere Titel
-
- Enthalten in: Algorithmica
- Enthalten in: Algorithmica
- Enthalten in: Algorithmica
- Stand
- 25.05.2023 08:15
- Im Katalog seit
- 07.03.2026