Brief announcement: a shorter and stronger proof of an Ω(d log(n/d)) lower bound for broadcast in radio networks.
Calvin C. NewportPublished in: PODC (2013)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- worst case
- branch and bound
- lower and upper bounds
- upper and lower bounds
- objective function
- np hard
- network design
- polynomial approximation
- lower bounding
- data dissemination
- sample complexity
- complex networks
- linear programming relaxation
- network structure
- linear logic
- optimal solution