Inapproximability and approximability of minimal tree routing and coloring.
Xujin ChenXiaodong HuXiaohua JiaPublished in: J. Discrete Algorithms (2008)
Keyphrases
- approximation algorithms
- tree structure
- np hard
- special case
- routing problem
- routing algorithm
- tree models
- index structure
- tree search
- ad hoc networks
- network topology
- inter domain
- data sets
- spanning tree
- b tree
- mobile ad hoc networks
- routing protocol
- network topologies
- shortest path
- tree nodes
- polynomial time approximation
- learning algorithm