Conference
Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations
| Τίτλος: | Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations |
|---|---|
| Συγγραφείς: | Bougeret, Marin, Duvillié, Guillerme, Giroudeau, Rodolphe, Watrigant, Rémi |
| Συνεισφορές: | Algorithmes, Graphes et Combinatoire (ALGCO), 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), Methods, Algorithms for Operations REsearch (MAORE) |
| Πηγή: | 20th International Symposium on Fundamentals of Computation Theory FCT: Fundamentals of Computation Theory https://hal-lirmm.ccsd.cnrs.fr/lirmm-01250997 FCT: Fundamentals of Computation Theory, Aug 2015, Gdańsk, Poland. pp.189-201, ⟨10.1007/978-3-319-22177-9_15⟩ |
| Στοιχεία εκδότη: | CCSD |
| Έτος έκδοσης: | 2015 |
| Συλλογή: | Université de Montpellier: HAL |
| Θεματικοί όροι: | locally encoded multidimensional matching, wafer-to-wafer integration, Multidimensional binary vector assignment, AND-cross composition, above guarantee parameterization, kernel, parameterized complexity, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC] |
| Θέμα γεωγραφικό: | Gdańsk, Poland |
| Περιγραφή: | International audience ; In this article we focus on the parameterized complexity of the Multidimensional Binary Vector Assignment problem (called bMVA). An input of this problem is defined by m disjoint sets V1,V2,…,Vm, each composed of n binary vectors of size p. An output is a set of n disjoint m-tuples of vectors, where each m-tuple is obtained by picking one vector from each set Vi. To each m-tuple we associate a p dimensional vector by applying the bit-wise AND operation on the m vectors of the tuple. The objective is to minimize the total number of zeros in these n vectors. bMVA can be seen as a variant of multidimensional matching where hyperedges are implicitly locally encoded via labels attached to vertices, but was originally introduced in the context of integrated circuit manufacturing. We provide for this problem FPT algorithms and negative results (ETH-based results, W[2]-hardness and a kernel lower bound) according to several parameters: the standard parameter k (i.e. the total number of zeros), as well as two parameters above some guaranteed values. |
| Τύπος εγγράφου: | conference object |
| Γλώσσα: | English |
| DOI: | 10.1007/978-3-319-22177-9_15 |
| Διαθεσιμότητα: | https://hal-lirmm.ccsd.cnrs.fr/lirmm-01250997 https://hal-lirmm.ccsd.cnrs.fr/lirmm-01250997v1/document https://hal-lirmm.ccsd.cnrs.fr/lirmm-01250997v1/file/1506.03282.pdf https://doi.org/10.1007/978-3-319-22177-9_15 |
| Rights: | https://creativecommons.org/licenses/by/4.0/ ; info:eu-repo/semantics/OpenAccess |
| Αριθμός Καταχώρησης: | edsbas.A11DCC67 |
| Βάση Δεδομένων: | BASE |
| DOI: | 10.1007/978-3-319-22177-9_15 |
|---|