Structural identifiability in low-rank matrix factorization
From MaRDI portal
Publication:848955
DOI10.1007/s00453-009-9331-2zbMath1187.68705OpenAlexW1963598624WikidataQ61704601 ScholiaQ61704601MaRDI QIDQ848955
Yasmin A. Rios-Solis, Martin Milanič, Epameinondas Fritzilas, Sven Rahmann
Publication date: 23 February 2010
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-009-9331-2
computational complexityinteger programmingapproximation algorithmbipartite matchinglow-rank matrix factorizationstructural rank
Related Items
On the complexity of the identifiable subgraph problem, revisited ⋮ On the complexity of the identifiable subgraph problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum mechanical algorithms for the nonabelian hidden subgroup problem
- Matching theory
- Submodular functions and electrical networks
- An analysis of the greedy algorithm for the submodular set covering problem
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- Submodular functions and optimization.
- Document clustering using nonnegative matrix factorization
- TWO THEOREMS IN GRAPH THEORY
- Structural Identifiability in Low-Rank Matrix Factorization
- Learning the parts of objects by non-negative matrix factorization
- Projected Gradient Methods for Nonnegative Matrix Factorization
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- The measure of the critical values of differentiable maps
- Matrices and matroids for systems analysis
