Minimizing symmetric submodular functions
From MaRDI portal
Publication:1290631
DOI10.1007/BF01585863zbMATH Open0949.90076OpenAlexW2043525538MaRDI QIDQ1290631FDOQ1290631
Authors: Maurice Queyranne 
Publication date: 28 June 1999
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585863
Recommendations
Cites Work
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization
- Minimizing a Submodular Function on a Lattice
- Submodular functions and optimization
- Submodular functions and electrical networks
- Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
- Multi-Terminal Network Flows
- Title not available (Why is that?)
- Canonical decompositions of symmetric submodular systems
- Odd Minimum Cut-Sets and b-Matchings
- On submodular function minimization
- An efficient algorithm for the minimum capacity cut problem
- A simple min-cut algorithm
- Optimal attack and reinforcement of a network
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
- Decomposition of submodular functions
- Title not available (Why is that?)
- Minimizing submodular functions over families of sets
- Title not available (Why is that?)
- Separating from the dominant of the spanning tree polytope
- Implementing an efficient minimum capacity cut algorithm
- Submodular systems and related topics
- On Flows in Pseudosymmetric Networks
- Maximum concurrent flows and minimum cuts
- Title not available (Why is that?)
Cited In (58)
- A polynomial time algorithm for finding a minimum 4-partition of a submodular function
- Slack matrices, \(k\)-products, and 2-level polytopes
- Hypergraphic submodular function minimization
- The expressive power of valued constraints: Hierarchies and collapses
- Greedy splitting algorithms for approximating multiway partition problems
- Submodular function minimization
- Tree-representation of set families and applications to combinatorial decompositions
- Locating tree-shaped facilities using the ordered median objective
- Minimum cuts and sparsification in hypergraphs
- On minimizing symmetric set functions
- A fully combinatorial algorithm for submodular function minimization.
- A simple minimum \(T\)-cut algorithm
- Submodular functions in problems of synthesis of networks
- Recognizing Cartesian products of matrices and polytopes
- Minimizing a sum of submodular functions
- Minimum degree orderings
- Realizing symmetric set functions as hypergraph cut capacity
- Graphic submodular function minimization: a graphic approach and applications
- Title not available (Why is that?)
- A note on submodular function minimization with covering type linear constraints
- A note on minimizing submodular functions
- Finding submodularity hidden in symmetric difference
- Cones of alternating and cut submodular set functions
- A strongly polynomial time algorithm for a constrained submodular optimization problem
- Canonical decompositions of symmetric submodular systems
- Title not available (Why is that?)
- Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions
- Algorithms for symmetric submodular function minimization under hereditary constraints and generalizations
- Graph cuts with interacting edge weights: examples, approximations, and algorithms
- Some results about the contractions and the pendant pairs of a submodular system
- Source location in undirected and directed hypergraphs
- Cuts in undirected graphs. II
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
- Min-max partitioning of hypergraphs and symmetric submodular functions
- Randomized contractions for multiobjective minimum cuts
- Graph connectivity and its augmentation: Applications of MA orderings
- Posimodular function optimization
- Posimodular function optimization
- Faster connectivity in low-rank hypergraphs via expander decomposition
- Augmenting a submodular and posi-modular set function by a multigraph
- Exploiting structure of chance constrained programs via submodularity
- Unifying the representation of symmetric crossing families and weakly partitive families
- Efficient search for informational cores in complex systems: application to brain networks
- On submodular function minimization
- Submodular Cost Allocation Problem and Applications
- Submodular minimization via pathwidth
- Gomory Hu tree and pendant pairs of a symmetric submodular system
- Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms
- Symmetric submodular system: contractions and Gomory-Hu tree
- An efficient algorithm for the symmetric principal minor assignment problem
- The Expressive Power of Valued Constraints: Hierarchies and Collapses
- Shortest cycles with monotone submodular costs
- Minimizing submodular functions over families of sets
- On generalized greedy splitting algorithms for multiway partition problems
- A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint
- A note on the minimization of symmetric and general submodular functions
- On Submodular Search and Machine Scheduling
This page was built for publication: Minimizing symmetric submodular functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290631)
