Login / Signup
On Approximating the Minimum Vertex Cover in Sublinear Time and the Connection to Distributed Algorithms
Michal Parnas
Dana Ron
Published in:
Electron. Colloquium Comput. Complex. (2005)
Keyphrases
</>
data structure
computational cost
orders of magnitude
benchmark datasets
mobile agents
optimization problems
peer to peer
computationally efficient
real time
feature selection
clustering algorithm
significant improvement
lightweight
times faster
recently developed