Synopsis
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.
"synopsis" may belong to another edition of this title.
Search results for New problem results: Consecutive Block Minimization
Stock Image
New problem results
Print on DemandSeller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L0-9786208992170
Stock Image
New problem results
Print on DemandSeller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L0-9786208992170
Buy New
£ 39.29
£ 3.29 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
New problem results: Consecutive Block Minimization
Published by
Our Knowledge Publishing, 2025
ISBN 10: 6208992176
ISBN 13: 9786208992170
New
Softcover
Seller: California Books, Miami, FL, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # I-9786208992170
Stock Image
New problem results: Consecutive Block Minimization
Published by
Omniscriptum, Our Knowledge Publishing Jun 2025, 2025
ISBN 10: 6208992176
ISBN 13: 9786208992170
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9786208992170
Stock Image
New problem results: Consecutive Block Minimization
Published by
Our Knowledge Publishing, 2025
ISBN 10: 6208992176
ISBN 13: 9786208992170
New
Softcover
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # 26404748370
Stock Image
New problem results: Consecutive Block Minimization
Published by
Our Knowledge Publishing, 2025
ISBN 10: 6208992176
ISBN 13: 9786208992170
New
Softcover
Seller: Majestic Books, Hounslow, United Kingdom
Seller rating 4 out of 5 stars
Condition: New. Print on Demand. Seller Inventory # 409487245
Buy New
£ 68.79
£ 6.50 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 4 available
Stock Image
New problem results (Paperback)
Published by
Our Knowledge Publishing, 2025
ISBN 10: 6208992176
ISBN 13: 9786208992170
New
Paperback
Seller: CitiRetail, Stevenage, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: new. Paperback. 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9786208992170
Buy New
£ 42.99
£ 37 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
New problem results: Consecutive Block Minimization
Published by
Our Knowledge Publishing, 2025
ISBN 10: 6208992176
ISBN 13: 9786208992170
New
Softcover
Seller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 4 out of 5 stars
Condition: New. PRINT ON DEMAND. Seller Inventory # 18404748376
Seller Image
New problem results : Consecutive Block Minimization
Published by
KS Omniscriptum Publishing, 2025
ISBN 10: 6208992176
ISBN 13: 9786208992170
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9786208992170
Seller Image
New problem results | Consecutive Block Minimization
Published by
KS Omniscriptum Publishing, 2025
ISBN 10: 6208992176
ISBN 13: 9786208992170
New
Taschenbuch
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. New problem results | Consecutive Block Minimization | Zoubir Layouni | Taschenbuch | Englisch | 2025 | KS Omniscriptum Publishing | EAN 9786208992170 | Verantwortliche Person für die EU: SIA OmniScriptum Publishing, Brivibas Gatve 197, 1039 RIGA, LETTLAND, customerservice[at]vdm-vsg[dot]de | Anbieter: preigu. Seller Inventory # 133546652