Communication Lower Bounds Using Dual Polynomials.
Alexander A. SherstovPublished in: Electron. Colloquium Comput. Complex. (2008)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- lower and upper bounds
- objective function
- upper and lower bounds
- branch and bound
- communication networks
- communication systems
- communication cost
- set of randomly generated instances
- quadratic assignment problem
- communication overhead
- max sat
- vc dimension
- np hard
- optimal solution