Approximation algorithms for the wafer to wafer integration problem

DOI10.1007/978-3-642-38016-7_23zbMATH Open1394.68438OpenAlexW1760033308MaRDI QIDQ2848932FDOQ2848932

Authors: Trivikram Dokka, Marin Bougeret, Rodolphe Giroudeau, Frits C. R. Spieksma, Vincent Boudet 

Publication date: 13 September 2013

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38016-7_23

Recommendations

• On the complexity of wafer-to-wafer integration
• On the complexity of wafer-to-wafer integration
• Allocation of Chips to Wafers in a Production Problem of Semiconductor Kits
• Multi-dimensional vector assignment problems
• Wafer-Scale Integration of Systolic Arrays

zbMATH Keywords

computational complexityapproximationefficient algorithmwafer-to-wafer integration

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Cited In (9)

• Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm
• Approximability and exact resolution of the multidimensional binary vector assignment problem
• On the complexity of wafer-to-wafer integration
• On the complexity of wafer-to-wafer integration
• Multi-dimensional vector assignment problems
• Approximability and exact resolution of the multidimensional binary vector assignment problem
• The wafer probing scheduling problem (WPSP)
• Title not available (Why is that?)
• Allocation of Chips to Wafers in a Production Problem of Semiconductor Kits

This page was built for publication: Approximation algorithms for the wafer to wafer integration problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848932)