A Tight Lower Bound on the Size of Planar Permutation Networks.
Maria M. KlaweFrank Thomson LeightonPublished in: SIGAL International Symposium on Algorithms (1990)
Keyphrases
- lower bound
- upper bound
- running times
- network size
- worst case
- branch and bound algorithm
- constant factor
- branch and bound
- lower and upper bounds
- objective function
- np hard
- optimal solution
- network analysis
- lower bounding
- memory requirements
- social networks
- linear programming relaxation
- complex networks
- sample complexity
- vc dimension
- learning algorithm
- network design
- average case
- heterogeneous networks
- computer networks
- competitive ratio