A Lower Bound for Sorting Networks Based on the Shuffle Permutation.
C. Greg PlaxtonTorsten SuelPublished in: SPAA (1992)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- social networks
- np hard
- network structure
- network design
- branch and bound
- sufficiently accurate
- real time
- lower bounding
- linear programming relaxation
- lower and upper bounds
- genetic algorithm
- network model
- worst case
- heterogeneous networks
- cellular networks
- objective function
- data sets