Near-optimal Approximate Discrete and Continuous Submodular Function Minimization

DOI10.1137/1.9781611975994.51MaRDI QIDQ5146821zbMATH OpenOpenAlexFDO

Authors

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1909.00171

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Submodular function minimization and maximization in discrete convex analysis
• Submodular functions: optimization and approximation
• scientific article; zbMATH DE number 7051222
• A note on the implications of approximate submodularity in discrete optimization
• Submodular function minimization and related topics
• On submodular function minimization
• Submodular function minimization
• Submodular function minimization
• Submodular functions: from discrete to continuous domains
• Discrete Newton's algorithm for parametric submodular function minimization

Cited in

(3)

• Discrete Newton's algorithm for parametric submodular function minimization
• scientific article; zbMATH DE number 7051222 (Why is no real title available?)
• Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving

This page was built for publication: Near-optimal Approximate Discrete and Continuous Submodular Function Minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146821)