Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric
type: Item
instance of: scholarly article
title: Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric
zbMATH Open document ID: 1225.05077
author: Victor Alvarez
author: Raimund Seidel
published in: Computational Geometry
publication date: 2009-11-16T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 5633793
zbMATH Keywords: coresets
zbMATH Keywords: approximation algorithms
zbMATH Keywords: Hausdorff metric
zbMATH Keywords: minimum weight spanning tree
MaRDI profile type: Publication
full work available at URL: j.comgeo.2009.04.005
OpenAlex ID: W2011577667
cites work: Euclidean minimum spanning trees and bichromatic closest pairs
cites work: Approximating extent measures of points
cites work: Q4945503
cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
cites work: Q4948733
cites work: Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
cites work: Two-Dimensional Voronoi Diagrams in the L p -Metric
DOI: 10.1016/J.COMGEO.2009.04.005
description: scientific article; zbMATH DE number 5633793