Tractable approximation algorithms for the NP-hard problem of growing linear consensus networks.
Milad SiamiNader MoteePublished in: ACC (2016)
Keyphrases
- approximation algorithms
- np hard
- constant factor approximation
- special case
- directed networks
- np complete
- optimal solution
- minimum cost
- facility location problem
- worst case
- integer programming
- np hardness
- lower bound
- linear programming
- scheduling problem
- approximation ratio
- set cover
- vertex cover
- undirected graph
- constraint satisfaction problems
- branch and bound algorithm
- exact algorithms
- greedy heuristic
- precedence constraints
- computational complexity
- open shop
- randomized algorithms
- computationally tractable
- primal dual
- polynomial time approximation
- complex networks
- network design problem
- constant factor
- knapsack problem
- approximation schemes
- polynomially solvable
- linear program
- disjoint paths
- network design
- lagrangian relaxation
- search algorithm