On the complexity of wafer-to-wafer integration

DOI10.1016/j.disopt.2016.07.001zbMath1387.68121OpenAlexW2486400533MaRDI QIDQ1751193

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

Publication date: 24 May 2018

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

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

zbMATH Keywords

FPT algorithmapproximabilitymultidimensional binary vector assignmentwafer-to-wafer integration

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Improved upper bounds for vertex cover
• An application of simultaneous diophantine approximation in combinatorial optimization
• Multi-dimensional vector assignment problems
• Approximation Algorithms for the Wafer to Wafer Integration Problem
• On the Complexity of Wafer-to-Wafer Integration
• The Design of Approximation Algorithms
• 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