Largest differencing method: Difference between revisions

Content deleted Content added
Citation bot (talk | contribs)
Removed proxy/dead URL that duplicated identifier. | Use this bot. Report bugs. | Suggested by Corvus florensis | #UCB_webform 460/2500
Added short description
Tags: Mobile edit Mobile app edit Android app edit
Line 1:
{{Short description|Algorithm for solving the partition problem}}
In [[computer science]], the '''largest differencing method''' is an algorithm for solving the [[partition problem]] and the [[multiway number partitioning]]. It is also called the '''Karmarkar–Karp algorithm''' after its inventors, [[Narendra Karmarkar]] and [[Richard M. Karp]].<ref>[[Narendra Karmarkar]] and [[Richard M. Karp]], "The differencing method of set partitioning", Tech report UCB/CSD 82/113, Computer science division, [[University of California, Berkeley]], 1982</ref> It is often abbreviated as '''LDM.<ref name=":2">{{cite journal|last1=Michiels|first1=Wil|last2=Korst|first2=Jan|last3=Aarts|first3=Emile|year=2003|title=Performance ratios for the Karmarkar–Karp differencing method|journal=Electronic Notes in Discrete Mathematics|volume=13|pages=71–75|citeseerx=10.1.1.107.1332|doi=10.1016/S1571-0653(04)00442-1}}</ref>'''<ref name=":1">{{Cite journal
| last1=Yakir