The complexity of computing the Muirhead-Dalton distance

V.G. Deineko, B. Klinz, G.J. Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

2 Citations (Scopus)
1 Downloads (Pure)

Abstract

We show that the following problem is NP-hard, and hence computationally intractable: "Given a vector y that Lorenz-dominates a vector x, what is the smallest number of Muirhead–Dalton transfers that transform x into y?"
Original languageEnglish
Pages (from-to)282-284
JournalMathematical Social Sciences
Volume57
Issue number2
DOIs
Publication statusPublished - 2009

Fingerprint Dive into the research topics of 'The complexity of computing the Muirhead-Dalton distance'. Together they form a unique fingerprint.

  • Cite this