Lower Bounds for Approximating Graph Parameters via Communication Complexity.
Talya EdenWill RosenbaumPublished in: CoRR (2017)
Keyphrases
- lower bound
- worst case
- upper bound
- average case complexity
- objective function
- maximum likelihood
- random walk
- upper and lower bounds
- graph theory
- bipartite graph
- parameter values
- graph matching
- branch and bound algorithm
- structured data
- parameter space
- branch and bound
- connected components
- information sharing
- vc dimension
- parameter estimation
- average case
- special case