Cited By
View all- Cherapanamjeri Y(2024)Computing Approximate Centerpoints in Polynomial Time2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS61266.2024.00104(1654-1668)Online publication date: 27-Oct-2024
We present fast and efficient parallel algorithms for finding the connected components of an undirected graph. These algorithms run on the exclusive-read, exclusive-write (EREW) PRAM. On a graph with n vertices and m edges, our randomized algorithm ...
Given a planar subdivision whose coordinates are integers bounded by $U\leq2^w$, we present a linear-space data structure that can answer point-location queries in $O(\min\{\lg n/\lg\lg n,$ $\sqrt{\lg U/\lg\lg U}\})$ time on the unit-cost random access ...
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. The algorithm is a derandomization of the Iterated-Radon algorithm of Clarkson ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inView or Download as a PDF file.
PDFView online with eReader.
eReaderView this article in HTML Format.
HTML Format