Computational complexity analysis of the sensor location flow observability problem
type: Item
instance of: scholarly article
title: Computational complexity analysis of the sensor location flow observability problem
zbMATH Open document ID: 1308.90089
author: Monica Gentili
author: Pitu B. Mirchandani
published in: Optimization Letters
publication date: 2014-12-05T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 6377214
zbMATH Keywords: computational complexity
zbMATH Keywords: sensor location
zbMATH Keywords: traffic network
MaRDI profile type: Publication
full work available at URL: s11590-014-0731-0
OpenAlex ID: W2021202745
cites work: A Network Based Model for Traffic Sensor Location with Implications on O/D Matrix Estimates
cites work: Combinatorial aspects of the sensor location problem
cites work: Spanning trees with many or few colors in edge-colored graphs
cites work: Local search for the minimum label spanning tree problem with bounded color classes.
cites work: The minimum labeling spanning trees
cites work: A linear algorithm for the domination number of a tree
cites work: Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem
cites work: Some New Matroids on Graphs: Cut Sets and the Max Cut Problem
cites work: Locating active sensors on traffic networks
cites work: Minimizing submodular functions over families of sets
cites work: Geometric algorithms and combinatorial optimization
cites work: Reducibility among Combinatorial Problems
cites work: An analysis of approximations for maximizing submodular set functions—I
cites work: Q4040221
DOI: 10.1007/S11590-014-0731-0
description: scientific article; zbMATH DE number 6377214