Our focus is on the problem of reconstructing a binary matrix M from its vertical and horizontal projections when timetabling constraints have to be satisfied. We furnish a polynomial time algorithm for reconstructing M by reducing this problem to that of finding a path of given weight in a weighted directed acyclic graph.
Brunetti, S., Frosini, A., Picouleau, C. (2005). Reconstructing a binary matrix under timetabling constraints. In Proceedings of the Workshop on Discrete Tomography and its Applications (pp.99-112).
Reconstructing a binary matrix under timetabling constraints
BRUNETTI, SARA;
2005-01-01
Abstract
Our focus is on the problem of reconstructing a binary matrix M from its vertical and horizontal projections when timetabling constraints have to be satisfied. We furnish a polynomial time algorithm for reconstructing M by reducing this problem to that of finding a path of given weight in a weighted directed acyclic graph.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
PBFENDM05.pdf
non disponibili
Tipologia:
Post-print
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
278.55 kB
Formato
Adobe PDF
|
278.55 kB | 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/6129
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo