Improved Analysis of a Max Cut Algorithm Based on Spectral Partitioning

Details Improved Analysis of a Max Cut Algorithm Based on Spectral Partitioning Improved Analysis of a Max Cut Algorithm Based on Spectral Partitioning

2009-10-05

arxiv.org/abs/0910.0504v1

Computer Science

Data Structures and Algorithms

8 pages, 2 figures. Preliminary version

Scientific paper

Luca Trevisan presented an approximation algorithm for Max Cut based on
spectral partitioning techniques. He proved that the algorithm has an
approximation ratio of at least 0.531. We improve this bound up to 0.6142. We
also define and extend this result for the more general Maximum Colored Cut
problem.

Affiliated with

Also associated with

No associations

Rating

Improved Analysis of a Max Cut Algorithm Based on Spectral Partitioning does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Improved Analysis of a Max Cut Algorithm Based on Spectral Partitioning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved Analysis of a Max Cut Algorithm Based on Spectral Partitioning will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-9027