Standard
On the complexity of wafer-to-wafer integration. / Duvillié, Guillerme; Bougeret, Marin ; Boudet, Vincent et al.
Algorithms and Complexity : 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings. ed. / Vangelis Th. Paschos; Peter Widmayer. Cham: Springer, 2015. p. 208-220 (Lecture Notes in Computer Science; Vol. 9079).
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
Harvard
Duvillié, G, Bougeret, M, Boudet, V
, Dokka Venkata Satyanaraya, T & Girodeau, R 2015,
On the complexity of wafer-to-wafer integration. in VT Paschos & P Widmayer (eds),
Algorithms and Complexity : 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings. Lecture Notes in Computer Science, vol. 9079, Springer, Cham, pp. 208-220.
https://doi.org/10.1007/978-3-319-18173-8 15APA
Duvillié, G., Bougeret, M., Boudet, V.
, Dokka Venkata Satyanaraya, T., & Girodeau, R. (2015).
On the complexity of wafer-to-wafer integration. In V. T. Paschos, & P. Widmayer (Eds.),
Algorithms and Complexity : 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings (pp. 208-220). (Lecture Notes in Computer Science; Vol. 9079). Springer.
https://doi.org/10.1007/978-3-319-18173-8 15Vancouver
Duvillié G, Bougeret M, Boudet V
, Dokka Venkata Satyanaraya T, Girodeau R.
On the complexity of wafer-to-wafer integration. In Paschos VT, Widmayer P, editors, Algorithms and Complexity : 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings. Cham: Springer. 2015. p. 208-220. (Lecture Notes in Computer Science). doi: 10.1007/978-3-319-18173-8 15
Author
Duvillié, Guillerme ; Bougeret, Marin ; Boudet, Vincent et al. /
On the complexity of wafer-to-wafer integration. Algorithms and Complexity : 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings. editor / Vangelis Th. Paschos ; Peter Widmayer. Cham : Springer, 2015. pp. 208-220 (Lecture Notes in Computer Science).
Bibtex
@inproceedings{ee238a9279f94b7b944cf65bb1178a9f,
title = "On the complexity of wafer-to-wafer integration",
abstract = "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 pr -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 pr -approximation algorithm.",
author = "Guillerme Duvilli{\'e} and Marin Bougeret and Vincent Boudet and {Dokka Venkata Satyanaraya}, Trivikram and Rodolpe Girodeau",
year = "2015",
month = may,
day = "16",
doi = "10.1007/978-3-319-18173-8 15",
language = "English",
isbn = "9783319181721",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "208--220",
editor = "Paschos, {Vangelis Th.} and Peter Widmayer",
booktitle = "Algorithms and Complexity",
}
RIS
TY - GEN
T1 - On the complexity of wafer-to-wafer integration
AU - Duvillié, Guillerme
AU - Bougeret, Marin
AU - Boudet, Vincent
AU - Dokka Venkata Satyanaraya, Trivikram
AU - Girodeau, Rodolpe
PY - 2015/5/16
Y1 - 2015/5/16
N2 - 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 pr -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 pr -approximation algorithm.
AB - 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 pr -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 pr -approximation algorithm.
U2 - 10.1007/978-3-319-18173-8 15
DO - 10.1007/978-3-319-18173-8 15
M3 - Conference contribution/Paper
SN - 9783319181721
T3 - Lecture Notes in Computer Science
SP - 208
EP - 220
BT - Algorithms and Complexity
A2 - Paschos, Vangelis Th.
A2 - Widmayer, Peter
PB - Springer
CY - Cham
ER -
