The Library
The complexity of computing the Muirhead-Dalton distance
Tools
Tools
Tools
Deineko, Vladimir G., Klinz, Bettina and Woeginger, Gerhard J. (2009) The complexity of computing the Muirhead-Dalton distance. Mathematical Social Sciences, Vol.57 (No.2). pp. 282-284. doi:10.1016/j.mathsocsci.2008.11.005
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1016/j.mathsocsci.2008.11.005
Abstract
We show that the following problem is NP-hard, and hence computationally intractable: "Given a vectory that Lorenz-dominates a vector x, what is the smallest number of Muirhead-Dalton transfers that transform x into y?" (C) 2008 Elsevier B.V. All rights reserved.
| Item Type: | Journal Article | ||||
|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics H Social Sciences |
||||
| Divisions: | Faculty of Social Sciences > Warwick Business School > Operational Research & Management Sciences Faculty of Social Sciences > Warwick Business School |
||||
| Journal or Publication Title: | Mathematical Social Sciences | ||||
| Publisher: | Elsevier BV | ||||
| ISSN: | 0165-4896 | ||||
| Official Date: | March 2009 | ||||
| Dates: |
|
||||
| Volume: | Vol.57 | ||||
| Number: | No.2 | ||||
| Number of Pages: | 3 | ||||
| Page Range: | pp. 282-284 | ||||
| DOI: | 10.1016/j.mathsocsci.2008.11.005 | ||||
| Status: | Peer Reviewed | ||||
| Publication Status: | Published | ||||
| Access rights to Published version: | Restricted or Subscription Access | ||||
| Funder: | Netherlands Organisation for Scientific Research (NWO), BSIK | ||||
| Grant number: | 639.033.403, 03018 |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
