A tight lower bound for parity in noisy communication networks.
Chinmoy DuttaYashodhan KanoriaD. ManjunathJaikumar RadhakrishnanPublished in: SODA (2008)
Keyphrases
- communication networks
- lower bound
- upper bound
- branch and bound algorithm
- wireless communication
- network design
- np hard
- distributed databases
- network structure
- lower and upper bounds
- worst case
- objective function
- optimal solution
- smart grid
- ip networks
- information systems
- internet protocol
- communication infrastructure
- databases
- smart card
- end to end
- data management
- web services