Name
Title | ||
|---|---|---|
A Flow-Network-Based Polynomial-Time Approximation Algorithm for the Minimum Constrained Input Structural Controllability Problem. |
Abstract | ||
|---|---|---|
This paper deals with minimum cost constrained input selection (minCCIS) for state-space structured systems. Our goal is to optimally select an input set from the given inputs such that the system is structurally controllable when the set of states that each input can influence is prespecified and each input has a cost associated with it. This problem is known to be NP-hard. First, we give a flow-... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TAC.2018.2797210 | IEEE Transactions on Automatic Control |
Keywords | Field | DocType |
Controllability,Approximation algorithms,Bipartite graph,NP-hard problem,Optimization,Power grids | Flow network,Approximation algorithm,Mathematical optimization,Vertex (geometry),Controllability,Bipartite graph,Minimum weight,Maximum flow problem,Mathematics,Polynomial-time reduction | Journal |
Volume | Issue | ISSN |
63 | 9 | 0018-9286 |
Citations | PageRank | References |
2 | 0.37 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shana Moothedath | 1 | 2 | 1.05 |
| Prasanna Chaporkar | 2 | 219 | 25.60 |
| Madhu N. Belur | 3 | 37 | 13.87 |