Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations

DOI10.1007/978-3-319-22177-9_15zbMath1433.90077arXiv1506.03282OpenAlexW2156789973MaRDI QIDQ2947879

Marin Bougeret, Rodolphe Giroudeau, Guillerme Duvillié, Rémi Watrigant

Publication date: 29 September 2015

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.03282

zbMATH Keywords

kernelparameterized complexitymultidimensional binary vector assignmentwafer-to-wafer integrationabove guarantee parameterizationAND-cross compositionlocally encoded multidimensional matching

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80) Boolean programming (90C09)

Related Items (2)

Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations ⋮ Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Fundamentals of parameterized complexity
• Parameterizing above or below guaranteed values
• Which problems have strongly exponential complexity?
• Multi-dimensional vector assignment problems
• Approximation Algorithms for the Wafer to Wafer Integration Problem
• On Multiway Cut Parameterized above Lower Bounds
• Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey
• On the Complexity of Wafer-to-Wafer Integration
• Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations
• The Linear Arrangement Problem Parameterized Above Guaranteed Value
• Parameterizing above Guaranteed Values: MaxSat and MaxCut
• Faster Parameterized Algorithms Using Linear Programming
• Kernelization Lower Bounds by Cross-Composition

This page was built for publication: Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations