Superlinear lower bounds for multipass graph processing.
Venkatesan GuruswamiKrzysztof OnakPublished in: Electron. Colloquium Comput. Complex. (2013)
Keyphrases
- lower bound
- upper bound
- objective function
- data processing
- real time
- graph representation
- lower and upper bounds
- np hard
- graph theory
- branch and bound algorithm
- min sum
- optimal solution
- structured data
- optimal cost
- information processing
- bipartite graph
- directed acyclic graph
- upper and lower bounds
- quadratic assignment problem
- directed graph
- branch and bound
- random walk
- np complete
- graph structure
- special case
- vc dimension
- data structure
- online algorithms