New problem results: Consecutive Block Minimization - Tapa blanda

Layouni, Zoubir

9786208992170: New problem results: Consecutive Block Minimization

Tapa blanda

ISBN 10: 6208992176 ISBN 13: 9786208992170

Editorial: Our Knowledge Publishing, 2025

Ver todas las copias de esta edici�n del ISBN

0 Usado

8 Nuevo

De EUR 49,17

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.

"Sinopsis" puede pertenecer a otra edici�n de este libro.

Editorial: Our Knowledge Publishing
A�o de publicaci�n: 2025
Idioma: Ingl�s
ISBN 10: 6208992176
ISBN 13: 9786208992170
Encuadernaci�n: Tapa blanda
N�mero de p�ginas: 52
Contacto del fabricante: no disponible
Persona responsable: no disponible

Resultados de la b�squeda para New problem results: Consecutive Block Minimization

Imagen de archivo

New problem results

Layouni, Zoubir

Publicado por KS Omniscriptum Publishing, 2025

ISBN 10: 6208992176 ISBN 13: 9786208992170

Nuevo PAP

Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America

Calificaci�n del vendedor: 5 de 5 estrellas

PAP. Condici�n: New. New Book. Shipped from UK. Established seller since 2000. N� de ref. del art�culo: L2-9786208992170

Contactar al vendedor

Comprar nuevo

EUR 49,17

Gastos de env�o gratis
Se env�a dentro de Estados Unidos de America

Cantidad disponible: M�s de 20 disponibles

A�adir al carrito

Imagen de archivo

New problem results: Consecutive Block Minimization

Layouni, Zoubir

Publicado por Our Knowledge Publishing, 2025

ISBN 10: 6208992176 ISBN 13: 9786208992170

Nuevo Tapa blanda

Librería: California Books, Miami, FL, Estados Unidos de America

Calificaci�n del vendedor: 5 de 5 estrellas

Condici�n: New. N� de ref. del art�culo: I-9786208992170

Contactar al vendedor

Comprar nuevo

EUR 51,49

Gastos de env�o gratis
Se env�a dentro de Estados Unidos de America

Cantidad disponible: M�s de 20 disponibles

A�adir al carrito

Imagen de archivo

New problem results: Consecutive Block Minimization

Zoubir Layouni

Publicado por Omniscriptum, Our Knowledge Publishing Jun 2025, 2025

ISBN 10: 6208992176 ISBN 13: 9786208992170

Nuevo Taschenbuch

Impresi�n bajo demanda

Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

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. N� de ref. del art�culo: 9786208992170

Contactar al vendedor

Comprar nuevo

EUR 43,90

Env�o por EUR 23,00
Se env�a de Alemania a Estados Unidos de America

Cantidad disponible: 2 disponibles

A�adir al carrito

Imagen del vendedor

New problem results : Consecutive Block Minimization

Zoubir Layouni

Publicado por KS Omniscriptum Publishing, 2025

ISBN 10: 6208992176 ISBN 13: 9786208992170

Nuevo Taschenbuch

Impresi�n bajo demanda

Librería: AHA-BUCH GmbH, Einbeck, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

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. N� de ref. del art�culo: 9786208992170

Contactar al vendedor