Report
On the complexity of Wafer-to-Wafer Integration
| Τίτλος: | On the complexity of Wafer-to-Wafer Integration |
|---|---|
| Συγγραφείς: | Duvillié, Guillerme, Bougeret, Marin, Boudet, Vincent, Dokka, Trivikram, Giroudeau, Rodolphe |
| Συνεισφορές: | Methods, Algorithms for Operations REsearch (MAORE), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS), Operations Research and Business Statistics (ORSTAT), Catholic University of Leuven = Katholieke Universiteit Leuven (KU Leuven), LIRMM |
| Πηγή: | https://hal-lirmm.ccsd.cnrs.fr/lirmm-01110027 ; [Research Report] LIRMM. 2015. |
| Στοιχεία εκδότη: | CCSD |
| Έτος έκδοσης: | 2015 |
| Συλλογή: | LIRMM: HAL (Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier) |
| Θεματικοί όροι: | ILP, FPT, Approximability, Wafer-to-Wafer Integration, Operational Research, Complexity & approximation, Complexity, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC] |
| Περιγραφή: | In this paper we consider the Wafer-to-Wafer Integration problem. A wafer is a p-dimensional binary vector. The input of this problem is described by m disjoints sets (called "lots"), where each set contains n wafers. The output of the problem is a set of n disjoint stacks, where a stack is a set of m wafers (one wafer from each lot). To each stack we associate a p-dimensional binary vector corresponding to the bit-wise AND operation of the wafers of the stack. The objective is to maximize the total number of "1" in the n stacks. We provide O(m 1−) and O(p 1−) non-approximability results even for n = 2, as well as a p r -approximation algorithm for any constant r. Finally, we show that the problem is FPT when parameterized by p, and we use this FPT algorithm to improve the running time of the p r -approximation algorithm. |
| Τύπος εγγράφου: | report |
| Γλώσσα: | English |
| Διαθεσιμότητα: | https://hal-lirmm.ccsd.cnrs.fr/lirmm-01110027 https://hal-lirmm.ccsd.cnrs.fr/lirmm-01110027v1/document https://hal-lirmm.ccsd.cnrs.fr/lirmm-01110027v1/file/main.pdf |
| Rights: | https://about.hal.science/hal-authorisation-v1/ ; info:eu-repo/semantics/OpenAccess |
| Αριθμός Καταχώρησης: | edsbas.B223B24F |
| Βάση Δεδομένων: | BASE |
| Η περιγραφή δεν είναι διαθέσιμη |