Inapproximability and approximability of maximal tree routing and coloring.
Xujin ChenXiaodong HuTianping ShuaiPublished in: J. Comb. Optim. (2006)
Keyphrases
- approximation algorithms
- tree structure
- np hard
- tree search
- worst case
- hierarchical structure
- tree nodes
- network topology
- routing algorithm
- index structure
- neural network
- shortest path
- multi objective
- graph structure
- lower bound
- spanning tree
- routing problem
- classification trees
- computational complexity
- tree models
- social networks