Analysis of the Karmarkar-Karp Differencing Algorithm

Details Analysis of the Karmarkar-Karp Differencing Algorithm Analysis of the Karmarkar-Karp Differencing Algorithm

2008-02-27

arxiv.org/abs/0802.4040v2

European Physics Journal B 65, 131-140 (2008)

Computer Science

Numerical Analysis

9 pages, 8 figures; minor changes

Scientific paper

10.1140/epjb/e2008-00320-9

The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and statistical physics. We analyze the performance of the differencing algorithm on random instances by mapping it to a nonlinear rate equation. Our analysis reveals strong finite size effects that explain why the precise asymptotics of the differencing solution is hard to establish by simulations. The asymptotic series emerging from the rate equation satisfies all known bounds on the Karmarkar-Karp algorithm and projects a scaling $n^{-c\ln n}$, where $c=1/(2\ln2)=0.7213...$. Our calculations reveal subtle relations between the algorithm and Fibonacci-like sequences, and we establish an explicit identity to that effect.

Affiliated with

Also associated with

No associations

Rating

Analysis of the Karmarkar-Karp Differencing Algorithm 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 Analysis of the Karmarkar-Karp Differencing Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Analysis of the Karmarkar-Karp Differencing Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-26037