Approximation and Hardness Results for the Max k-Uncut Problem.
Peng ZhangChenchen WuDachuan XuXinghe ZhangPublished in: COCOA (2016)
Keyphrases
- approximation algorithms
- error bounds
- learning theory
- np hard
- np complete
- approximation error
- information systems
- multi agent
- computational complexity
- special case
- worst case
- closed form
- probabilistic model
- np hardness
- efficient computation
- state space
- databases
- multi agent systems
- case study
- genetic algorithm
- data mining