Computational complexity analysis of the sensor location flow observability problem
DOI10.1007/S11590-014-0731-0zbMATH Open1308.90089OpenAlexW2021202745MaRDI QIDQ479256FDOQ479256
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
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
Deterministic network models in operations research (90B10) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)
Cites Work
- Reducibility among combinatorial problems
- Geometric algorithms and combinatorial optimization
- Title not available (Why is that?)
- An analysis of approximations for maximizing submodular set functions—I
- Spanning trees with many or few colors in edge-colored graphs
- A Network Based Model for Traffic Sensor Location with Implications on O/D Matrix Estimates
- A linear algorithm for the domination number of a tree
- The minimum labeling spanning trees
- Locating active sensors on traffic networks
- Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem
- Combinatorial aspects of the sensor location problem
- Local search for the minimum label spanning tree problem with bounded color classes.
- Minimizing submodular functions over families of sets
- Some New Matroids on Graphs: Cut Sets and the Max Cut Problem
Cited In (3)
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)
