Testing metric properties

DOI10.1145/380752.380811zbMath1323.68319OpenAlexW2086041184MaRDI QIDQ5175980

Dana Ron, Michal Parnas

Publication date: 27 February 2015

Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/380752.380811

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Metric spaces, metrizability (54E35) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Randomized algorithms (68W20)

Related Items (3)

Testing metric properties ⋮ Testing hypergraph colorability ⋮ Functions that have read-once branching programs of quadratic size are not necessarily testable

Cites Work

• A constant-factor approximation algorithm for the k -median problem (extended abstract)

This page was built for publication: Testing metric properties