Please use this identifier to cite or link to this item:
Title: Multidimensional binary vector assignment problem : standard, structural and above guarantee parameterizations
Authors: Bougeret, M
Duvillié, G
Giroudeau, R
Watrigant, R 
Keywords: Above guarantee parameterization
AND-cross composition
Locally encoded multidimensional matching
Multidimensional binary vector assignment
Parameterized complexity
Wafer-to-wafer integration
Issue Date: 2017
Publisher: Chapman & Hall
Source: Discrete mathematics and theoretical computer science, 2017, v. 19, no. 43 How to cite?
Journal: Discrete mathematics and theoretical computer science 
Abstract: 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 (ET H-based results, W2-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.
ISSN: 1462-7264
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

Last Week
Last month
Citations as of May 6, 2020

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.