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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Da: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condizione: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Codice articolo L0-9786208992170
Quantità: Più di 20 disponibili
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
PAP. Condizione: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Codice articolo L0-9786208992170
Quantità: Più di 20 disponibili
Da: California Books, Miami, FL, U.S.A.
Condizione: New. Codice articolo I-9786208992170
Quantità: Più di 20 disponibili
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: 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. Codice articolo 9786208992170
Quantità: 2 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Taschenbuch. Condizione: 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. Codice articolo 9786208992170
Quantità: 1 disponibili
Da: Books Puddle, Woodside, NY, U.S.A.
Condizione: New. Codice articolo 26404748370
Quantità: 4 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. Print on Demand. Codice articolo 409487245
Quantità: 4 disponibili
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: New. PRINT ON DEMAND. Codice articolo 18404748376
Quantità: 4 disponibili
Da: preigu, Osnabrück, Germania
Taschenbuch. Condizione: 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. Codice articolo 133546652
Quantità: 5 disponibili