Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Largest differencing method
open-in-new
<p>In <a href="/facts/Computer_science/lN3pEyPz">computer science</a>, the largest differencing method is an algorithm for solving the <a href="/facts/Partition_problem/LcSBAcmu">partition problem</a> and the <a href="/facts/Multiway_number_partitioning/6dUsX2HI">multiway number partitioning</a>. It is also called the Karmarkar–Karp algorithm after its inventors, <a href="/facts/Narendra_Karmarkar/NVB6kg95">Narendra Karmarkar</a> and <a href="/facts/Richard_M._Karp/XtYCL0nA">Richard M. Karp</a>. It is often abbreviated as LDM. </p>