Isbn: 9786208992170 - new problem results: consecutive block minimization (8 resultados)

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

Condición: New.

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

Condición: New.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In this book, we focus on a special property in a binary matrix, known as the '1-consecutive property'. A consecutive block is a sequence of consecutively located 1s. The problem is to find a permutation of the columns so that the number of consecutive blocks in the induced matrix is minimal. We point out that it is NP-complete for general instances, then we present applications to it, variants and a state of the art. Our first contribution consists in proving that CBM is NP-complete even when the binary matrix has only two 1's per row, by polynomially transforming the maximum-weight Hamiltonian chain problem to CBM restricted to the instances in question.A second contribution consisted in solving the question: is CBM approximable with guarantee The answer was found in the form of a polynomial heuristic that constructs permutations leading to a number of consecutive blocks within 50% of the optimum. 52 pp. Englisch.…

Condición: New. Print on Demand.

Condición: New. PRINT ON DEMAND.

Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - In this book, we focus on a special property in a binary matrix, known as the '1-consecutive property'. A consecutive block is a sequence of consecutively located 1s. The problem is to find a permutation of the columns so that the number of consecutive blocks in the induced matrix is minimal. We point out that it is NP-complete for general instances, then we present applications to it, variants and a state of the art. Our first contribution consists in proving that CBM is NP-complete even when the binary matrix has only two 1's per row, by polynomially transforming the maximum-weight Hamiltonian chain problem to CBM restricted to the instances in question.A second contribution consisted in solving the question: is CBM approximable with guarantee The answer was found in the form of a polynomial heuristic that constructs permutations leading to a number of consecutive blocks within 50% of the optimum.…