Computational complexity analysis of the sensor location flow observability problem

DOI10.1007/S11590-014-0731-0MaRDI QIDQ479256zbMATH OpenOpenAlexFDO

Authors Monica Gentili, Pitu B. Mirchandani

Publication date 5 December 2014

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-014-0731-0

zbMATH Keywords

computational complexitysensor locationtraffic network

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Discrete location and assignment (90B80) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Combinatorial aspects of the sensor location problem
• Complexity of constrained sensor placement problems for optimal observability
• Characteristics of optimal solutions to the sensor location problem
• Locating sensors to observe network arc flows: exact and heuristic approaches
• Algorithmic Aspects of Wireless Sensor Networks

Cites work

• A linear algorithm for the domination number of a tree
• A Network Based Model for Traffic Sensor Location with Implications on O/D Matrix Estimates
• An analysis of approximations for maximizing submodular set functions—I
• Combinatorial aspects of the sensor location problem
• Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem
• Geometric algorithms and combinatorial optimization
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• Local search for the minimum label spanning tree problem with bounded color classes.
• Locating active sensors on traffic networks
• Minimizing submodular functions over families of sets
• Reducibility among combinatorial problems
• Some New Matroids on Graphs: Cut Sets and the Max Cut Problem
• Spanning trees with many or few colors in edge-colored graphs
• The minimum labeling spanning trees

Cited in

(3)

• Complexity of constrained sensor placement problems for optimal observability
• An iterative multiparametric approach for determining the location of AVI sensors for robust route flow estimation
• Combinatorial aspects of the sensor location problem

This page was built for publication: Computational complexity analysis of the sensor location flow observability problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q479256)