Pages that link to "Item:Q4739952"
From MaRDI portal
The following pages link to An Algorithm for Submodular Functions on Graphs (Q4739952):
Displaying 47 items.
- Duality for balanced submodular flows (Q581206) (← links)
- Polymatroidal flows with lower bounds (Q581209) (← links)
- A cost-scaling algorithm for \(0-1\) submodular flows (Q678855) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Finding feasible vectors of Edmonds-Giles polyhedra (Q796541) (← links)
- An algorithm for minimum cost arc-connectivity orientations (Q848842) (← links)
- Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs (Q958684) (← links)
- Submodular function minimization (Q995782) (← links)
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs (Q1045053) (← links)
- Linear and combinatorial sharing problems (Q1081535) (← links)
- A Mazur-Orlicz type theorem for submodular set functions (Q1084205) (← links)
- On unique extensions of positive additive set functions. II (Q1100576) (← links)
- Sandwich theorems for set functions (Q1114795) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- Directed submodularity, ditroids and directed submodular flows (Q1116891) (← links)
- An application of submodular flows (Q1119596) (← links)
- On orientations and shortest paths (Q1123899) (← links)
- How to make a digraph strongly connected (Q1165251) (← links)
- Minimization on submodular flows (Q1167658) (← links)
- A dual algorithm for submodular flow problems (Q1183393) (← links)
- Fenchel-type duality for matroid valuations (Q1290625) (← links)
- Discrete convex analysis (Q1290668) (← links)
- Optimum partitioning into intersections of ring families (Q1363743) (← links)
- Improved bound for the Carathéodory rank of the bases of a matroid (Q1400967) (← links)
- Inverse problems of submodular functions on digraphs (Q1573989) (← links)
- Increasing digraph arc-connectivity by arc addition, reversal and complement (Q1613410) (← links)
- \(M\)-convex functions and tree metrics (Q1764353) (← links)
- Extension of M-convexity and L-convexity to polyhedral convex functions (Q1841175) (← links)
- Quadratic M-convex and L-convex functions (Q1883382) (← links)
- Principal structure of submodular systems and Hitchcock-type independent flows (Q1906849) (← links)
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
- Fair integral submodular flows (Q2166258) (← links)
- Enumerating \(k\)-arc-connected orientations (Q2211357) (← links)
- Monge properties, discrete convexity and applications (Q2432877) (← links)
- Degree bounded matroids and submodular flows (Q2448960) (← links)
- Tree-compositions and orientations (Q2450662) (← links)
- Critical duality (Q2481108) (← links)
- Agreeable bets with multiple priors (Q2496237) (← links)
- A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows (Q2785397) (← links)
- A Survey on Covering Supermodular Functions (Q2971606) (← links)
- Recent Developments in Discrete Convex Analysis (Q2971611) (← links)
- Proving total dual integrality with cross-free families—A general framework (Q3313630) (← links)
- Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions (Q3322709) (← links)
- Structures of polyhedra determined by submodular functions on crossing families (Q3337243) (← links)
- Eulerian Orientations and Circulations (Q3697049) (← links)
- Convexity and Steinitz's exchange property (Q4645928) (← links)
- Improved Randomized Algorithm for <i>k</i>-Submodular Function Maximization (Q5855531) (← links)