An Algorithm for Submodular Functions on Graphs
From MaRDI portal
Cited in
(50)- Enumerating \(k\)-arc-connected orientations
- \(M\)-convex functions and tree metrics
- Extension of M-convexity and L-convexity to polyhedral convex functions
- Monge properties, discrete convexity and applications
- Agreeable bets with multiple priors
- On unique extensions of positive additive set functions. II
- Submodular function minimization
- Increasing digraph arc-connectivity by arc addition, reversal and complement
- Convexity and Steinitz's exchange property
- An application of submodular flows
- On orientations and shortest paths
- Quadratic M-convex and L-convex functions
- Directed submodularity, ditroids and directed submodular flows
- Fenchel-type duality for matroid valuations
- Duality for balanced submodular flows
- Polymatroidal flows with lower bounds
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
- Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams
- Improved randomized algorithm for k-submodular function maximization
- Critical duality
- Principal structure of submodular systems and Hitchcock-type independent flows
- An algorithm for minimum cost arc-connectivity orientations
- A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows
- Finding feasible vectors of Edmonds-Giles polyhedra
- Linear and combinatorial sharing problems
- How to make a digraph strongly connected
- Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs
- Generalized polymatroids and submodular flows
- A dual algorithm for submodular flow problems
- Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions
- Minimization on submodular flows
- Discrete convex analysis
- Fair integral submodular flows
- A Survey on Covering Supermodular Functions
- Inverse problems of submodular functions on digraphs
- Improved bound for the Carathéodory rank of the bases of a matroid
- Proving total dual integrality with cross-free families—A general framework
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
- On 2-strong connectivity orientations of mixed graphs and related problems
- Recent trends in combinatorial optimization
- The complexity of finding fair many-to-one matchings
- A Mazur-Orlicz type theorem for submodular set functions
- Degree bounded matroids and submodular flows
- Optimum partitioning into intersections of ring families
- Eulerian Orientations and Circulations
- Recent developments in discrete convex analysis
- Structures of polyhedra determined by submodular functions on crossing families
- Sandwich theorems for set functions
- Tree-compositions and orientations
- A cost-scaling algorithm for \(0-1\) submodular flows
This page was built for publication: An Algorithm for Submodular Functions on Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4739952)
