Approximability and exact resolution of the multidimensional binary vector assignment problem
APX-hardnessNP-hardnessunique games conjectureapproximation schemeexact resolutionvector assignment problem
Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Abstract computational complexity for mathematical programming problems (90C60) Complexity of computation (including implicit computational complexity) (03D15)
- Approximation algorithms for the wafer to wafer integration problem
- Inapproximability of hypergraph vertex cover and applications to scheduling problems
- Multi-dimensional vector assignment problems
- On the complexity of wafer-to-wafer integration
- Reductions, completeness and the hardness of approximability
- Approximability and exact resolution of the multidimensional binary vector assignment problem
- Multi-dimensional vector assignment problems
- Exploiting hidden structure in selecting dimensions that distinguish vectors
- Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms
This page was built for publication: Approximability and exact resolution of the multidimensional binary vector assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835671)