Communication Lower Bounds Using Dual Polynomials.
Alexander A. SherstovPublished in: Bull. EATCS (2008)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- communication systems
- lower and upper bounds
- branch and bound
- communication cost
- information sharing
- randomly generated problems
- optimal cost
- upper and lower bounds
- communication overhead
- set of randomly generated instances
- data sets
- polynomial approximation
- lower bounding
- quadratic assignment problem
- information exchange
- computer networks
- data acquisition
- np hard
- multi agent