Bi-criteria adaptive algorithms for minimizing supermodular functions with cardinality constraint

DOI10.1007/978-3-030-93176-6_16zbMath1503.90125OpenAlexW4205954824MaRDI QIDQ2151371

Yang Zhou, Xiao-Juan Zhang, Min Li, Qian Liu

Publication date: 1 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-93176-6_16

zbMATH Keywords

adaptive algorithmfuzzy \(C\)-meansbi-criteria analysissupermodular minimization

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• An analysis of approximations for maximizing submodular set functions—I
• Best Algorithms for Approximating the Maximum of a Submodular Set Function
• Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
• Preservation of Supermodularity in Parametric Optimization: Necessary and Sufficient Conditions on Constraint Structures
• The adaptive complexity of maximizing a submodular function
• Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time
• An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation
• Submodular Function Maximization in Parallel via the Multilinear Relaxation
• A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters

This page was built for publication: Bi-criteria adaptive algorithms for minimizing supermodular functions with cardinality constraint