We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
We discuss the computational complexity of special cases of the 3-dimensional (axial) assignment problem where the elements are points in a Cartesian space and where the cost coefficients are the perimeters of the corresponding triangles measured according to a certain norm. (All our results also carry over to the corresponding special cases of the 3-dimensional matching problem.) The minimization version is NP-hard for every norm, even if the underlying Cartesian space is 2-dimensional. The maximization version is polynomially solvable, if the dimension of the Cartesian space is fixed and if the considered norm has a polyhedral unit ball. If the dimension of the Cartesian space is part of the input, the maximization version is NP-hard for every Lpβ norm; in particular the problem is NP-hard for the Manhattan norm L1β and the Maximum norm Lββ which both have polyhedral unit balls
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.