The sensor location flow observability problem is studied from the computational complexity point of view. Although the general problem is shown to be NP-complete, by studying the special cases of input matrix structures and data where the corresponding problems are polynomially solvable, the boundary between NP-complete and polynomial solvable problems is delineated.

Computational Complexity Analysis of the Sensor Location Flow Observability Problem

GENTILI, Monica
;
2014-01-01

Abstract

The sensor location flow observability problem is studied from the computational complexity point of view. Although the general problem is shown to be NP-complete, by studying the special cases of input matrix structures and data where the corresponding problems are polynomially solvable, the boundary between NP-complete and polynomial solvable problems is delineated.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

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/11386/4287654
 Attenzione

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

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? 4
social impact