Submodularity in Input Node Selection for Networked Linear Systems: Efficient Algorithms for Performance and Controllability

DOI10.1109/MCS.2017.2743518zbMath1477.93116MaRDI QIDQ5019401

No author found.

Publication date: 10 January 2022

Published in: IEEE Control Systems (Search for Journal in Brave)

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Controllability (93B05) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Decentralized systems (93A14)

Related Items (6)

An overview of structural systems theory ⋮ Leader selection in networks under switching topologies with antagonistic interactions ⋮ Performance guarantees of forward and reverse greedy algorithms for minimizing nonsupermodular nonsubmodular functions on a matroid ⋮ Relative controllability of nonlinear delayed multi-agent systems ⋮ Approximation algorithm of maximizing non-monotone non-submodular functions under knapsack constraint ⋮ Strong structural controllability of networks: comparison of bounds using distances and zero forcing

This page was built for publication: Submodularity in Input Node Selection for Networked Linear Systems: Efficient Algorithms for Performance and Controllability