Minimum Manhattan Network is NP-Complete.
Francis Y. L. ChinZeyu GuoHe SunPublished in: Discret. Comput. Geom. (2011)
Keyphrases
- np complete
- randomly generated
- communication networks
- network model
- np hard
- network structure
- complex networks
- network topologies
- spanning tree
- np complete problems
- neural network
- network design
- minimum cost
- link prediction
- satisfiability problem
- community structure
- peer to peer
- bayesian networks
- case study
- social networks