Computational complexity analysis of the sensor location flow observability problem

Monica Gentili, Pitu Mirchandani

Research output: Contribution to journalArticle

1 Citation (Scopus)

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.

Original languageEnglish (US)
Pages (from-to)2245-2259
Number of pages15
JournalOptimization Letters
Volume8
Issue number8
DOIs
StatePublished - Nov 19 2014

Fingerprint

Complexity Analysis
Computational Analysis
Observability
Computational Complexity
Sensor
NP-complete problem
Polynomial

Keywords

  • Computational complexity
  • Sensor location
  • Traffic network

ASJC Scopus subject areas

  • Control and Optimization

Cite this

Computational complexity analysis of the sensor location flow observability problem. / Gentili, Monica; Mirchandani, Pitu.

In: Optimization Letters, Vol. 8, No. 8, 19.11.2014, p. 2245-2259.

Research output: Contribution to journalArticle

@article{4045f76dfb9b42f9a427e359166a31b1,
title = "Computational complexity analysis of the sensor location flow observability problem",
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.",
keywords = "Computational complexity, Sensor location, Traffic network",
author = "Monica Gentili and Pitu Mirchandani",
year = "2014",
month = "11",
day = "19",
doi = "10.1007/s11590-014-0731-0",
language = "English (US)",
volume = "8",
pages = "2245--2259",
journal = "Optimization Letters",
issn = "1862-4472",
publisher = "Springer Verlag",
number = "8",

}

TY - JOUR

T1 - Computational complexity analysis of the sensor location flow observability problem

AU - Gentili, Monica

AU - Mirchandani, Pitu

PY - 2014/11/19

Y1 - 2014/11/19

N2 - 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.

AB - 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.

KW - Computational complexity

KW - Sensor location

KW - Traffic network

UR - http://www.scopus.com/inward/record.url?scp=84911991154&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84911991154&partnerID=8YFLogxK

U2 - 10.1007/s11590-014-0731-0

DO - 10.1007/s11590-014-0731-0

M3 - Article

VL - 8

SP - 2245

EP - 2259

JO - Optimization Letters

JF - Optimization Letters

SN - 1862-4472

IS - 8

ER -