On the Complexity of Wafer-to-Wafer Integration

DOI10.1007/978-3-319-18173-8_15zbMath1387.68124OpenAlexW979299603MaRDI QIDQ2947021

Rodolphe Giroudeau, Marin Bougeret, Trivikram Dokka, Guillerme Duvillié, Vincent Boudet

Publication date: 21 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/76944/1/CIAC2015.pdf

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (5)

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 ⋮ On the complexity of wafer-to-wafer integration ⋮ Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment Problem

Cites Work

• Unnamed Item
• Multi-dimensional vector assignment problems
• Approximation Algorithms for the Wafer to Wafer Integration Problem
• On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility
• Linear degree extractors and the inapproximability of max clique and chromatic number
• On the Complexity of Wafer-to-Wafer Integration
• The Design of Approximation Algorithms
• Integer Programming with a Fixed Number of Variables
• Structure in Approximation Classes
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

This page was built for publication: On the Complexity of Wafer-to-Wafer Integration