Automata, Languages and Programming
From MaRDI portal
Publication:5716761
DOI10.1007/11523468zbMath1081.68746OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716761
Amit Kumar, Yogish Sabharwal, Sandeep Sen
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (5)
Small space representations for metric min-sum \(k\)-clustering and their applications ⋮ Sublinear-time Algorithms ⋮ Approximating global optimum for probabilistic truth discovery ⋮ The Priority k-Median Problem ⋮ Sublinear‐time approximation algorithms for clustering via random sampling
This page was built for publication: Automata, Languages and Programming
