Skip to main content

Approximation Algorithms for the Wafer to Wafer Integration Problem

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7846))

Abstract

Motivated by the yield optimization problem in semi-conductor manufacturing, we model the wafer to wafer integration problem as a special multi-dimensional assignment problem (called WWI-m), and study it from an approximation point of view. We give approximation algorithms achieving an approximation factor of \(\frac{3}{2}\) and \(\frac{4}{3}\) for WWI-3, and we show that extensions of these algorithms to the case of arbitrary m do not give constant factor approximations. We argue that a special case of the yield optimization problem can be solved in polynomial time.

This research was supported by OT Grant OT/07/015.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bandelt, H., Crama, Y., Spieksma, F.: Approximation algorithms for multi-dimensional assignment problems with decomposable costs. Discrete Applied Mathematics 49, 25–50 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  2. Burkard, R., Dell’Amico, M., Martello, S.: Assignment Problems. SIAM (2009)

    Google Scholar 

  3. Burkard, R., Rudolf, R., Woeginger, G.J.: Three-dimensional axial assignment problems with decomposable cost coefficients. Dicrete Applied Mathematics 65, 123–139 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  4. Crama, Y., Spieksma, F.: Approximation algorithms for three-dimensional assignment problems with triangle inequalities. European Journal of Operational Research 60, 273–279 (1992)

    Article  MATH  Google Scholar 

  5. Kann, V.: Maximum bounded 3-dimensional matching is max snp complete. Information Processing Letters 37, 27–35 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  6. Reda, S., Smith, L., Smith, G.: Maximizing the functional yield of wafer-to-wafer integration. IEEE Transactions on VLSI Systems 17, 1357–1362 (2009)

    Article  Google Scholar 

  7. Spieksma, F.C.R.: Multi-index assignment problems: complexity, approximation, applications. In: Pitsoulis, L., Pardalos, P. (eds.) Nonlinear Assignment Problems, Algorithms and Applications, pp. 1–12. Kluwer Academic Publishers (2000)

    Google Scholar 

  8. Taouil, M., Hamdioui, S.: Layer redundancy based yield improvement for 3d wafer-to-wafer stacked memories. In: IEEE European Test Symposium, pp. 45–50 (2011)

    Google Scholar 

  9. Verbree, J., Marinissen, E., Roussel, P., Velenis, D.: On the cost-effectiveness of matching repositories of pre-tested wafers for wafer-to-wafer 3d chip stacking. In: IEEE European Test Symposium, pp. 36–41 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dokka, T., Bougeret, M., Boudet, V., Giroudeau, R., Spieksma, F.C.R. (2013). Approximation Algorithms for the Wafer to Wafer Integration Problem. In: Erlebach, T., Persiano, G. (eds) Approximation and Online Algorithms. WAOA 2012. Lecture Notes in Computer Science, vol 7846. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38016-7_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38016-7_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38015-0

  • Online ISBN: 978-3-642-38016-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics