The differencing algorithm LDM for partitioning: A proof of a conjecture of Karmarkar and Karp

Benjamin Yakir*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

30 Scopus citations

Abstract

The algorithm LDM (largest differencing method) divides a list of n random items into two blocks. The parameter of interest is the expected difference between the two block sums. It is shown that if the items are i.i.d. and uniform then the rate of convergence of this parameter to zero is n-Θ(log n). An algorithm for balanced partitioning is constructed, with the same rate of convergence to zero.

Original languageAmerican English
Pages (from-to)85-99
Number of pages15
JournalMathematics of Operations Research
Volume21
Issue number1
DOIs
StatePublished - Feb 1996

Keywords

  • Differencing method
  • Makespan
  • Partitioning
  • Probabilistic analysis of algorithms
  • Scheduling

Fingerprint

Dive into the research topics of 'The differencing algorithm LDM for partitioning: A proof of a conjecture of Karmarkar and Karp'. Together they form a unique fingerprint.

Cite this