IRIS

We are concerned with binary matrix reconstruction from their orthogonal projections. To the basic problem we add new kinds of constraints such as adjacency constraints among neighbors, and bounded distance. Complexity results and polynomial time algorithms are given.

Brunetti, S., Costa, M.C., Frosini, A., Jarray, F., Picouleau, C. (2007). Reconstruction of binary matrices under adjacency and timetabling constraints. In Advancesin Discrete Tomography and Its Applications (pp. 125-150). BOSTON : Birkhauser.

Reconstruction of binary matrices under adjacency and timetabling constraints

BRUNETTI, SARA;
2007-01-01

Abstract

We are concerned with binary matrix reconstruction from their orthogonal projections. To the basic problem we add new kinds of constraints such as adjacency constraints among neighbors, and bounded distance. Complexity results and polynomial time algorithms are given.
2007
Brunetti, S., Costa, M.C., Frosini, A., Jarray, F., Picouleau, C. (2007). Reconstruction of binary matrices under adjacency and timetabling constraints. In Advancesin Discrete Tomography and Its Applications (pp. 125-150). BOSTON : Birkhauser.
File in questo prodotto:
File Dimensione Formato  
BCFJP_Birkhauser07.pdf

non disponibili

Tipologia: Post-print
Licenza: NON PUBBLICO - Accesso privato/ristretto
Dimensione 2.93 MB
Formato Adobe PDF
  Visualizza/Apri   Richiedi una copia
2.93 MB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11365/16380
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo