AC-Feasibility on Tree Networks is NP-Hard.
Karsten LehmannAlban GrastienPascal Van HentenryckPublished in: CoRR (2014)
Keyphrases
- np hard
- approximation algorithms
- optimal solution
- special case
- tree structure
- lower bound
- linear programming
- closely related
- network topologies
- minimum cost
- network size
- maximum weight
- neural network
- scheduling problem
- social networks
- np hardness
- greedy heuristic
- tree mining
- tree search
- spanning tree
- network analysis
- network structure
- social network analysis
- multi dimensional