Topological lower bounds for arithmetic networks.
Andrei GabrielovNicolai N. Vorobjov Jr.Published in: Comput. Complex. (2017)
Keyphrases
- lower bound
- upper bound
- objective function
- np hard
- topological features
- lower and upper bounds
- worst case
- network structure
- branch and bound algorithm
- randomly generated problems
- optimal cost
- lower bounding
- community structure
- upper and lower bounds
- network flow
- branch and bound
- arithmetic operations
- theoretical analysis
- special case
- social networks