Lowest Degree k-Spanner: Approximation and Hardness.

Eden Chlamtác Michael Dinitz

Published in: APPROX-RANDOM (2014)

Keyphrases

low degree
error bounds
approximation algorithms
np hard
data mining
graph theory
learning theory
phase transition
np complete
mutual information
approximation error
information theoretic
data sets
worst case
multi agent
image sequences
case study
information systems
neural network
databases