Approximation Hardness of the Steiner Tree Problem on Graphs.
Miroslav ChlebíkJanka ChlebíkováPublished in: SWAT (2002)
Keyphrases
- graph matching
- worst case
- computational complexity
- information theoretic
- closed form
- directed graph
- approximation algorithms
- multicast routing
- graph databases
- graph structure
- np complete
- learning theory
- approximation error
- social network analysis
- graph partitioning
- minimum spanning tree
- graph clustering
- random graphs
- relative error
- adjacency matrix
- agnostic learning
- approximation schemes