Related references
Note: Only part of the references are listed.Robust and Adaptive Sequential Submodular Optimization
Vasileios Tzoumas et al.
IEEE TRANSACTIONS ON AUTOMATIC CONTROL (2022)
A comment on performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid
Orcun Karaca et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2021)
Performance guarantees for greedy maximization of non-submodular controllability metrics
Tyler Summers et al.
2019 18TH EUROPEAN CONTROL CONFERENCE (ECC) (2019)
Structural Cost-Optimal Design of Sensor Networks for Distributed Estimation
Mohammadreza Doostmohammadian et al.
IEEE SIGNAL PROCESSING LETTERS (2018)
Actuator Placement for Symmetric Structural Controllability With Heterogeneous Costs
Orlando Romero et al.
IEEE CONTROL SYSTEMS LETTERS (2018)
Submodularity in Input Node Selection for Networked Linear Systems EFFICIENT ALGORITHMS FOR PERFORMANCE AND CONTROLLABILITY
Andrew Clark et al.
IEEE CONTROL SYSTEMS MAGAZINE (2017)
Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
Maxim Sviridenko et al.
MATHEMATICS OF OPERATIONS RESEARCH (2017)
The robust minimal controllability problem
Sergio Pequito et al.
AUTOMATICA (2017)
A Framework for Structural Input/Output and Control Configuration Selection in Large-Scale Systems
Sergio Pequito et al.
IEEE TRANSACTIONS ON AUTOMATIC CONTROL (2016)
Minimal Actuator Placement With Bounds on Control Effort
V. Tzoumas et al.
IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS (2016)
On Submodularity and Controllability in Complex Dynamical Networks
Tyler H. Summers et al.
IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS (2016)
Minimal Controllability Problems
Alex Olshevsky
IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS (2014)
Controllability Metrics, Limitations and Algorithms for Complex Networks
Fabio Pasqualetti et al.
IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS (2014)
Learning with Submodular Functions: A Convex Optimization Perspective
Francis Bach
FOUNDATIONS AND TRENDS IN MACHINE LEARNING (2013)
Adaptive Forward-Backward Greedy Algorithm for Learning Sparse Representations
Tong Zhang
IEEE TRANSACTIONS ON INFORMATION THEORY (2011)
Few inputs can reprogram biological networks
Franz-Josef Mueller et al.
NATURE (2011)
Controllability of complex networks
Yang-Yu Liu et al.
NATURE (2011)
SUBMODULAR APPROXIMATION: SAMPLING-BASED ALGORITHMS AND LOWER BOUNDS
Zoya Svitkina et al.
SIAM JOURNAL ON COMPUTING (2011)
Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid
V Il'ev et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2006)
The reverse greedy algorithm for the metric k-median problem
M Chrobak et al.
INFORMATION PROCESSING LETTERS (2006)
Greed is good: Algorithmic results for sparse approximation
JA Tropp
IEEE TRANSACTIONS ON INFORMATION THEORY (2004)
Generic properties and control of linear structured systems: a survey
JM Dion et al.
AUTOMATICA (2003)
An approximation guarantee of the greedy descent algorithm for minimizing a supermodular set function
VP Il'ev
DISCRETE APPLIED MATHEMATICS (2001)
A review of methods for input/output selection
M van de Wal et al.
AUTOMATICA (2001)
Share Paper
