A Flow-Network-Based Polynomial-Time Approximation Algorithm for the Minimum Constrained Input Structural Controllability Problem

DOI10.1109/TAC.2018.2797210zbMath1423.93059OpenAlexW2790047024MaRDI QIDQ4682383

Shana Moothedath, Prasanna Chaporkar, Madhu N. Belur

Publication date: 18 September 2018

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tac.2018.2797210

Mathematics Subject Classification ID

Controllability (93B05) Linear systems in control theory (93C05) Approximation algorithms (68W25)

Related Items (3)

An overview of structural systems theory ⋮ On polynomially solvable constrained input selections for fixed and switched linear structured systems ⋮ Optimal selection of essential interconnections for structural controllability in heterogeneous subsystems

This page was built for publication: A Flow-Network-Based Polynomial-Time Approximation Algorithm for the Minimum Constrained Input Structural Controllability Problem