The complexity of computing the Muirhead-Dalton distance

Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger. The complexity of computing the Muirhead-Dalton distance. Mathematical Social Sciences, 57(2):282-284, 2009. [doi]

@article{DeinekoKW09,
  title = {The complexity of computing the Muirhead-Dalton distance},
  author = {Vladimir G. Deineko and Bettina Klinz and Gerhard J. Woeginger},
  year = {2009},
  doi = {10.1016/j.mathsocsci.2008.11.005},
  url = {http://dx.doi.org/10.1016/j.mathsocsci.2008.11.005},
  researchr = {https://researchr.org/publication/DeinekoKW09},
  cites = {0},
  citedby = {0},
  journal = {Mathematical Social Sciences},
  volume = {57},
  number = {2},
  pages = {282-284},
}