A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs.
Tiziana CalamoneriIrene FinocchiYannis ManoussakisRossella PetreschiPublished in: ASIAN (1999)
Keyphrases
- dynamic programming
- np hard
- learning algorithm
- cost function
- computational cost
- max cut
- objective function
- parallel implementation
- scheduling problem
- optimization algorithm
- simulated annealing
- worst case
- k means
- computational complexity
- similarity measure
- probabilistic model
- search space
- maximum likelihood
- preprocessing
- b spline
- closed form
- graph partitioning
- minimum spanning tree
- adjacency graph
- graph isomorphism