Approximation algorithms for a \(k\)-line center
From MaRDI portal
Publication:818652
DOI10.1007/s00453-005-1166-xzbMath1086.68135MaRDI QIDQ818652
Pankaj K. Agarwal, Cecilia M. Procopiuc, Kasturi R. Varadarajan
Publication date: 21 March 2006
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-005-1166-x
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
68W25: Approximation algorithms
68W20: Randomized algorithms
Related Items
Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model, Approximation algorithms for orthogonal line centers, Efficient approximation algorithms for clustering point-sets, Approximation algorithms for orthogonal line centers, Practical methods for shape fitting and kinetic data structures using coresets, A linear time approximation scheme for computing geometric maximum \(k\)-star