From approximate balls to approximate ellipses

DOI10.1007/s10898-012-9932-1zbMath1272.90062OpenAlexW2147578409MaRDI QIDQ1955552

Tom Switzer, Eugene Greene, Animesh Sarker, Asish Kumar Mukhopadhyay

Publication date: 14 June 2013

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-012-9932-1

zbMATH Keywords

approximation schemescomputational geometrystreaming algorithmsapproximate ellipses

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Cites Work

• Computing diameter in the streaming and sliding-window models
• Adaptive sampling for geometric problems over data streams
• Lectures on Modern Convex Optimization
• Deterministic sampling and range counting in geometric data streams
• Data Streams: Algorithms and Applications
• Minimum Covering Ellipses
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: From approximate balls to approximate ellipses