A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts.
Alexander A. AgeevRefael HassinMaxim SviridenkoPublished in: SIAM J. Discret. Math. (2001)
Keyphrases
- improved algorithm
- high accuracy
- dynamic programming
- computational complexity
- cost function
- matching algorithm
- computational cost
- k means
- np hard
- optimization algorithm
- search space
- selection algorithm
- significant improvement
- preprocessing
- learning algorithm
- objective function
- linear programming
- expectation maximization
- detection algorithm
- convergence rate
- approximation ratio
- probabilistic model
- segmentation algorithm
- theoretical analysis
- computationally efficient
- simulated annealing
- experimental evaluation
- special case
- similarity measure
- clustering algorithm