article

On submodular function minimization

Author:

William H CunninghamAuthors Info & Claims

Combinatorica, Volume 5, Issue 3

Pages 185 - 192

https://doi.org/10.1007/BF02579361

Published: 15 July 1985 Publication History

Abstract

No abstract available.

Cited By

View all

Sadeghi Ahouei SDe Nobel JNeumann ABäck TNeumann FLi XHandl J(2024)Evolving Reliable Differentiating Constraints for the Chance-constrained Maximum Coverage ProblemProceedings of the Genetic and Evolutionary Computation Conference10.1145/3638529.3654181(1036-1044)Online publication date: 14-Jul-2024
https://dl.acm.org/doi/10.1145/3638529.3654181
Higashikawa YKatoh NTeruyama JTokuni Y(2024)Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edgesJournal of Combinatorial Optimization10.1007/s10878-024-01213-y48:3Online publication date: 7-Oct-2024
https://dl.acm.org/doi/10.1007/s10878-024-01213-y
Fomin FGolovach PKorhonen TLokshtanov DStamoulis G(2023)Shortest Cycles with Monotone Submodular CostsACM Transactions on Algorithms10.1145/362682420:1(1-16)Online publication date: 13-Nov-2023
https://dl.acm.org/doi/10.1145/3626824
Show More Cited By

Index Terms

On submodular function minimization
1. Computing methodologies
  1. Symbolic and algebraic manipulation
    1. Symbolic and algebraic algorithms
      1. Linear algebra algorithms
2. Mathematics of computing
  1. Discrete mathematics
    1. Combinatorics
      1. Combinatorial algorithms
  2. Mathematical analysis
    1. Integral equations
    2. Numerical analysis
      1. Computations on matrices

Recommendations

Efficient minimization of decomposable submodular functions
NIPS'10: Proceedings of the 24th International Conference on Neural Information Processing Systems - Volume 2

Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of convex functions, and can be minimized in strongly polynomial time. ...
Submodular function minimization

Submodular functions often arise in various fields of operations research including discrete optimization, game theory, queueing theory and information theory. In this survey paper, we give overview on the fundamental properties of submodular functions ...
A note on the minimization of symmetric and general submodular functions
Submodularity

In this paper we relate the minimization problems for general submodular functions and symmetric submodular functions. We characterize the contractions and restrictions of symmetric submodular functions. The latter we show to be the same as posimodular ...

Comments

Information & Contributors

Information

Published In

Combinatorica Volume 5, Issue 3

1985

84 pages

ISSN:0209-9683

Editor:
L Lovász
Eo¨tvo¨s Univ.

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 15 July 1985

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

43
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Sadeghi Ahouei SDe Nobel JNeumann ABäck TNeumann FLi XHandl J(2024)Evolving Reliable Differentiating Constraints for the Chance-constrained Maximum Coverage ProblemProceedings of the Genetic and Evolutionary Computation Conference10.1145/3638529.3654181(1036-1044)Online publication date: 14-Jul-2024
https://dl.acm.org/doi/10.1145/3638529.3654181
Higashikawa YKatoh NTeruyama JTokuni Y(2024)Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edgesJournal of Combinatorial Optimization10.1007/s10878-024-01213-y48:3Online publication date: 7-Oct-2024
https://dl.acm.org/doi/10.1007/s10878-024-01213-y
Fomin FGolovach PKorhonen TLokshtanov DStamoulis G(2023)Shortest Cycles with Monotone Submodular CostsACM Transactions on Algorithms10.1145/362682420:1(1-16)Online publication date: 13-Nov-2023
https://dl.acm.org/doi/10.1145/3626824
Avis DHernández-Cuenca S(2023)On the foundations and extremal structure of the holographic entropy coneDiscrete Applied Mathematics10.1016/j.dam.2022.11.016328:C(16-39)Online publication date: 31-Mar-2023
https://dl.acm.org/doi/10.1016/j.dam.2022.11.016
Zhou GLiu BQiang Y(2023)Deletion-Robust Submodular Maximization Under the Cardinality Constraint over the Integer LatticeComputational Data and Social Networks10.1007/978-981-97-0669-3_22(234-242)Online publication date: 11-Dec-2023
https://dl.acm.org/doi/10.1007/978-981-97-0669-3_22
Higashikawa YKatoh NTeruyama JTokuni Y(2023)Faster Algorithms for Evacuation Problems in Networks with a Single Sink of Small Degree and Bounded Capacitated EdgesCombinatorial Optimization and Applications10.1007/978-3-031-49611-0_3(29-42)Online publication date: 15-Dec-2023
https://dl.acm.org/doi/10.1007/978-3-031-49611-0_3
Xiong HLu YRuozzi NKoyejo SMohamed SAgarwal ABelgrave DCho KOh A(2022)Boosting the performance of generic deep neural network frameworks with log-supermodular CRFsProceedings of the 36th International Conference on Neural Information Processing Systems10.5555/3600270.3602492(30651-30664)Online publication date: 28-Nov-2022
https://dl.acm.org/doi/10.5555/3600270.3602492
Püschel MWendler C(2021)Discrete Signal Processing with Set FunctionsIEEE Transactions on Signal Processing10.1109/TSP.2020.304697269(1039-1053)Online publication date: 1-Jan-2021
https://dl.acm.org/doi/10.1109/TSP.2020.3046972
Grigoriev AHartmann TLendl SWoeginger G(2021)Dispersing Obnoxious Facilities on a GraphAlgorithmica10.1007/s00453-021-00800-383:6(1734-1749)Online publication date: 1-Jun-2021
https://dl.acm.org/doi/10.1007/s00453-021-00800-3
Balkanski ESinger YMakarychev KMakarychev YTulsiani MKamath GChuzhoy J(2020)A lower bound for parallel submodular minimizationProceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing10.1145/3357713.3384287(130-139)Online publication date: 22-Jun-2020
https://dl.acm.org/doi/10.1145/3357713.3384287
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Efficient minimization of decomposable submodular functions

Submodular function minimization

A note on the minimization of symmetric and general submodular functions

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations