Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy
DOI10.1007/S10878-022-00914-6zbMATH Open1505.90116OpenAlexW4296630884MaRDI QIDQ2091111FDOQ2091111
Authors: Xiaojuan Zhang, Qian Liu, M. Li, Yang Zhou 
Publication date: 31 October 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-022-00914-6
Recommendations
bi-criteriasupermodularfuzzy \(C\)-means problemgroup sparse linear regression problemnon-supermodular
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Approximation algorithms (68W25) Parallel algorithms in computer science (68W10)
Cites Work
- Numerical methods for solving linear least squares problems
- Trading accuracy for sparsity in optimization problems with sparsity constraints
- Adaptive Sampling for k-Means Clustering
- An analysis of approximations for maximizing submodular set functions—I
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters
- Near-optimal column-based matrix reconstruction
- On the Power of Adaptivity in Sparse Recovery
- An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation
- The adaptive complexity of maximizing a submodular function
- Preservation of supermodularity in parametric optimization: necessary and sufficient conditions on constraint structures
- Greedy minimization of weakly supermodular set functions
- Submodular maximization with nearly optimal approximation, adaptivity and query complexity
Cited In (2)
This page was built for publication: Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2091111)
