The Steiner tree problem on graphs: Inapproximability results.
Miroslav ChlebíkJanka ChlebíkováPublished in: Theor. Comput. Sci. (2008)
Keyphrases
- graph structure
- approximation algorithms
- graph mining
- multicast routing
- structured objects
- graph clustering
- directed graph
- graph partitioning
- database
- data sets
- steiner tree
- series parallel
- neural network
- minimum spanning tree
- graph theoretic
- graph representation
- pattern mining
- undirected graph
- graph databases
- graph model
- clustering algorithm
- search algorithm
- pattern recognition
- graph matching
- shortest path