Multi-dimensional vector assignment problems

DOI10.1016/j.disopt.2014.08.005zbMath1308.90088OpenAlexW2106754332MaRDI QIDQ2339839

Trivikram Dokka, Frits C. R. Spieksma, Yves Cramer

Publication date: 9 April 2015

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2014.08.005

zbMATH Keywords

submodularityworst-case analysisapproximabilitymulti-dimensional assignmentwafer-to-wafer integration

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (9)

Approximability and exact resolution of the multidimensional binary vector assignment problem ⋮ On the Complexity of Wafer-to-Wafer Integration ⋮ Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations ⋮ Balanced Optimization with Vector Costs ⋮ Robust balanced optimization ⋮ On the complexity of wafer-to-wafer integration ⋮ Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm ⋮ Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment Problem ⋮ Multi-dimensional vector assignment problems

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for three-dimensional assignment problems with triangle inequalities
• Approximating the multi-level bottleneck assignment problem
• Maximum bounded 3-dimensional matching is MAX SNP-complete
• Geometric three-dimensional assignment problems
• Approximation algorithms for multi-dimensional assignment problems with decomposable costs
• The hardness of approximation: Gap location
• Max-algebra: The linear algebra of combinatorics?
• Three-dimensional axial assignment problems with decomposable cost coefficients
• Between a rock and a hard place: the two-to-one assignment problem
• Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost
• Multi-dimensional vector assignment problems
• Approximation Algorithms for the Wafer to Wafer Integration Problem
• The Design of Approximation Algorithms
• Submodular Approximation: Sampling-based Algorithms and Lower Bounds
• Assignment Problems

This page was built for publication: Multi-dimensional vector assignment problems