Multi-dimensional vector assignment problems (Q2339839): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disopt.2014.08.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2106754332
@@ Property / OpenAlex ID: W2106754332 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for multi-dimensional assignment problems with decomposable costs
+Normal rank
@@ Property / cites work @@
+Three-dimensional axial assignment problems with decomposable cost coefficients
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for three-dimensional assignment problems with triangle inequalities
+Normal rank
@@ Property / cites work @@
+Approximating the multi-level bottleneck assignment problem
+Normal rank
@@ Property / cites work @@
+Between a rock and a hard place: the two-to-one assignment problem
+Normal rank
@@ Property / cites work @@
+Geometric three-dimensional assignment problems
@@ Property / cites work: Geometric three-dimensional assignment problems / rank @@
+Normal rank
@@ Property / cites work @@
+Assignment Problems
@@ Property / cites work: Assignment Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4801573
@@ Property / cites work: Q4801573 / rank @@
+Normal rank
@@ Property / cites work @@
+Max-algebra: The linear algebra of combinatorics?
@@ Property / cites work: Max-algebra: The linear algebra of combinatorics? / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for the Wafer to Wafer Integration Problem
+Normal rank
@@ Property / cites work @@
+Multi-dimensional vector assignment problems
@@ Property / cites work: Multi-dimensional vector assignment problems / rank @@
+Normal rank
@@ Property / cites work @@
+Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost
+Normal rank
@@ Property / cites work @@
+Submodular Approximation: Sampling-based Algorithms and Lower Bounds
+Normal rank
@@ Property / cites work @@
+Q3156770
@@ Property / cites work: Q3156770 / rank @@
+Normal rank
@@ Property / cites work @@
+The Design of Approximation Algorithms
@@ Property / cites work: The Design of Approximation Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum bounded 3-dimensional matching is MAX SNP-complete
+Normal rank
@@ Property / cites work @@
+The hardness of approximation: Gap location
@@ Property / cites work: The hardness of approximation: Gap location / rank @@
+Normal rank