scientific article; zbMATH DE number 177542

MaRDI QIDQ4037411zbMATH OpenFDO

Authors Pankaj K. Agarwal, Jiří Matoušek, Subhash Suri

Publication date 18 May 1993

zbMATH Keywords

all farthest neighborsapproximation algorithmsbi- chromatic farthest neighborseuclidean maximum spanning treeeuclidean space \({\mathcal E}^ k\)external farthest neighborsminimum-diameter two-partition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Farthest neighbors, maximum spanning trees and related problems in higher dimensions
• scientific article; zbMATH DE number 437554
• Euclidean minimum spanning trees and bichromatic closest pairs
• Minimum spanning trees in d dimensions
• Computing Euclidean maximum spanning trees

Cited in

(9)

• Euclidean minimum spanning trees and bichromatic closest pairs
• Farthest neighbors, maximum spanning trees and related problems in higher dimensions
• Average case analysis of dynamic geometric optimization
• Approximate weighted farthest neighbors and minimum dilation stars
• Net and prune: a linear time algorithm for Euclidean distance problems
• Approximate weighted farthest neighbors and minimum dilation stars
• scientific article; zbMATH DE number 1796963 (Why is no real title available?)
• Approximating all-points furthest pairs and maximum spanning trees in metric spaces
• Computing Euclidean maximum spanning trees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037411)