42 search results - page 1 / 9 » On optimality of a polynomial algorithm for random linear mu... |
OL
2011
12 years 11 months ago
2011
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
STOC
2002
ACM
14 years 4 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
OL
2010
13 years 2 months ago
2010
In this note we consider the properties of the Hamming distance in combinatorial optimization problems on hypergraph matchings, also known as multidimensional assignment problems....
MP
2007
13 years 3 months ago
2007
The Multidimensional Assignment Problem (MAP) is a higher-dimensional version of the Linear Assignment Problem that arises in the areas of data association, target tracking, resou...
JCO
2007
13 years 4 months ago
2007
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...