On the complexity of edge-colored subgraph partitioning problems in network optimization.
Xiaoyan ZhangZan-Bo ZhangHajo BroersmaXuelian WenPublished in: Discret. Math. Theor. Comput. Sci. (2016)
Keyphrases
- optimization problems
- np complete
- optimization algorithm
- search space
- polynomial hierarchy
- distribution network
- discrete optimization
- network model
- combinatorial optimization
- peer to peer
- np hard
- decision problems
- complex networks
- application domains
- optimization methods
- mathematical programming
- worst case
- data mining