Submodular function minimization
From MaRDI portal
Publication:995782
DOI10.1007/S10107-006-0084-2zbMATH Open1135.90038OpenAlexW1989801809MaRDI QIDQ995782FDOQ995782
Authors: Satoru Iwata 
Publication date: 10 September 2007
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0084-2
Recommendations
- Submodular function minimization
- On submodular function minimization
- Submodular function minimization and related topics
- Submodular functions and optimization
- Submodular functions: optimization and approximation
- Minimizing a sum of submodular functions
- Subquadratic submodular function minimization
- Submodular function minimization under a submodular set covering constraint
- Submodular function minimization and maximization in discrete convex analysis
- scientific article; zbMATH DE number 3898611
Cites Work
- Title not available (Why is that?)
- Discrete Convex Analysis
- Geometric algorithms and combinatorial optimization
- Cores of convex games
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems
- The ellipsoid method and its consequences in combinatorial optimization
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Submodular functions and optimization.
- A new approach to the maximum-flow problem
- A Fast Parametric Maximum Flow Algorithm and Applications
- Minimizing symmetric submodular functions
- A push-relabel framework for submodular function minimization and applications to parametric optimization
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Combinatorial Optimization with Rational Objective Functions
- Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
- Topologically sweeping an arrangement
- New algorithms for the intersection problem of submodular systems
- A capacity scaling algorithm for convex cost submodular flows
- A faster capacity scaling algorithm for minimum cost submodular flow
- A note on minimizing submodular functions
- Title not available (Why is that?)
- Characterization and Optimization of Achievable Performance in General Queueing Systems
- Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control
- Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
- On submodular function minimization
- Structure of a simple scheduling polyhedron
- Greedy algorithm and symmetric matroids
- Valuated matroids
- Connected Detachments of Graphs and Generalized Euler Trails
- Noiseless coding of correlated information sources
- Submodular function minimization
- Optimal cooperation and submodularity for computing Potts partition functions with a large number of states
- Matching, matroids, and extensions
- Convexity and Steinitz's exchange property
- Pseudomatroids
- On the Abstract Properties of Linear Dependence
- Bisubmodular Function Minimization
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
- Polymatroidal dependence structure of a set of random variables
- Discrete convex analysis
- Combinatorial optimization. Theory and algorithms
- Some combinatorial properties of discriminants in metric vector spaces
- Optimal flows in networks with multiple sources and sinks
- The quickest transshipment problem
- A fully combinatorial algorithm for submodular function minimization.
- Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
- An Algorithm for Submodular Functions on Graphs
- Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions
- Submodular functions in graph theory
- On minimizing symmetric set functions
- Improved algorithms for submodular function minimization and submodular flow
- A Faster Scaling Algorithm for Minimizing Submodular Functions
- Submodular systems and related topics
- The Partial Order of a Polymatroid Extreme Point
- A strongly polynomial algorithm for line search in submodular polyhedra
- A note on Schrijver's submodular function minimization algorithm.
- Submodular function minimization and related topics
- A Min--Max Theorem for Bisubmodular Polyhedra
- Title not available (Why is that?)
- A Characterization of Waiting Time Performance Realizable by Single-Server Queues
- Detachments Preserving Local Edge-Connectivity of Graphs
- Another proof of a theorem concerning detachments of graphs
- Computational geometric approach to submodular function minimization for multiclass queueing systems
- A proof of the data compression theorem of Slepian and Wolf for ergodic sources (Corresp.)
- A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Detachment of Vertices of Graphs Preserving Edge-Connectivity
- A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow
Cited In (51)
- Submodular function minimization and maximization in discrete convex analysis
- Polymatroids and mean-risk minimization in discrete optimization
- Submodular function minimization and polarity
- Title not available (Why is that?)
- New Query Lower Bounds for Submodular Function Minimization
- The expressive power of valued constraints: Hierarchies and collapses
- Minimizing convex functions with rational minimizers
- Submodular function minimization
- Variations for Lovász’ Submodular Ideas
- The power of linear programming for general-valued CSPs
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
- Submodular functions: learnability, structure, and optimization
- Near-optimal Approximate Discrete and Continuous Submodular Function Minimization
- Nonnegative definite Hermitian matrices with increasing principal minors
- Title not available (Why is that?)
- A note on Schrijver's submodular function minimization algorithm.
- Submodular Maximization With Limited Function Access
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
- The median partition and submodularity
- A faster strongly polynomial time algorithm for submodular function minimization
- The expressive power of binary submodular functions
- Submodular function minimization with submodular set covering constraints and precedence constraints
- SFO: a toolbox for submodular function optimization
- Polynomially computable bounds for the probability of the union of events
- Title not available (Why is that?)
- Submodular functions: optimization and approximation
- Computational geometric approach to submodular function minimization for multiclass queueing systems
- Cuts in undirected graphs. I
- Cuts in undirected graphs. II
- Theory of principal partitions revisited
- Learning submodular functions
- Equivalence of convex minimization problems over base polytopes
- Submodular functions and optimization.
- Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems
- Submodular function minimization and related topics
- Structures of subpartitions related to a submodular function minimization
- The complexity of valued CSPs
- The Expressive Power of Binary Submodular Functions
- Core potentials: the consensus segmentation conjecture
- Title not available (Why is that?)
- Title not available (Why is that?)
- Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity
- Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
- Submodular goal value of Boolean functions
- Classes of submodular constraints expressible by graph cuts
- Recent developments in discrete convex analysis
- On the complexity of submodular function minimisation on diamonds
- Monotone submodular maximization over the bounded integer lattice with cardinality constraints
- Submodular spectral functions of principal submatrices of a Hermitian matrix, extensions and applications
- The Methods for Approximation of Principal Points for Binary Distributions on the Basis of Submodularity
- Discrete Newton's algorithm for parametric submodular function minimization
This page was built for publication: Submodular function minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995782)
