GEOMETRIC OPTIMIZATION PROBLEMS OVER SLIDING WINDOWS

DOI10.1142/S0218195906001975zbMath1090.65068OpenAlexW2099582307MaRDI QIDQ5470168

B. S. Sadjad, Timothy M. Chan

Publication date: 29 May 2006

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195906001975

zbMATH Keywords

widthdiameterapproximation algorithmssliding windowdata stream

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Related Items (3)

Dynamic coresets ⋮ Improved Algorithms for Time Decay Streams ⋮ Unnamed Item

Cites Work

• Farthest neighbors, maximum spanning trees and related problems in higher dimensions
• Computing diameter in the streaming and sliding-window models
• Efficient randomized algorithms for some geometric optimization problems
• Applications of random sampling in computational geometry. II
• Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
• Approximating extent measures of points
• Decomposable searching problems I. Static-to-dynamic transformation
• APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
• An optimal deterministic algorithm for computing the diameter of a three-dimensional point set

This page was built for publication: GEOMETRIC OPTIMIZATION PROBLEMS OVER SLIDING WINDOWS