English

On Mergable Coresets for Polytope Distance

Computational Geometry 2023-11-13 v1 Data Structures and Algorithms Machine Learning

Abstract

We show that a constant-size constant-error coreset for polytope distance is simple to maintain under merges of coresets. However, increasing the size cannot improve the error bound significantly beyond that constant.

Cite

@article{arxiv.2311.05651,
  title  = {On Mergable Coresets for Polytope Distance},
  author = {Benwei Shi and Aditya Bhaskara and Wai Ming Tai and Jeff M. Phillips},
  journal= {arXiv preprint arXiv:2311.05651},
  year   = {2023}
}

Comments

Presented in SoCG'19 Young Researchers Forum (CG:YRF)

R2 v1 2026-06-28T13:16:43.148Z