A Survey on Covering Supermodular Functions
From MaRDI portal
Publication:2971606
DOI10.1007/978-3-540-76796-1_6zbMath1359.05088OpenAlexW183295127MaRDI QIDQ2971606
Publication date: 7 April 2017
Published in: Research Trends in Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-76796-1_6
Related Items
Base polyhedra and the linking property, The Generalized Terminal Backup Problem, On reachability mixed arborescence packing, Characterizing and recognizing generalized polymatroids, A \(4+\epsilon\) approximation for \(k\)-connected subgraphs, Covering skew-supermodular functions by hypergraphs of minimum total size, Decreasing minimization on M-convex sets: algorithms and applications, Testing the supermodular-cut condition
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Covering symmetric supermodular functions by uniform hypergraphs
- Survivable networks, linear programming relaxations and the parsimonious property
- A minimax theorem on intervals
- The parity problem of polymatroids without double circuits
- Rooted \(k\)-connections in digraphs
- Covering skew-supermodular functions by hypergraphs of minimum total size
- Generalized polymatroids and submodular flows
- An application of submodular flows
- On the orientation of graphs
- Short proofs on multicommodity flows and cuts
- Covering the edge set of a directed graph with trees
- Hypergraph connectivity augmentation
- The parsimonious property of cut covering problems and its applications
- Restricted \(t\)-matchings in bipartite graphs
- On decomposing a hypergraph into \(k\) connected sub-hypergraphs
- On the orientation of graphs and hypergraphs
- Combined connectivity augmentation and orientation problems
- Edge splitting and connectivity augmentation in directed hypergraphs.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Minimal edge-coverings of pairs of sets
- Submodular functions and optimization.
- On Integer Multiflow Maximization
- Structures of polyhedra determined by submodular functions on crossing families
- Variations for Lovász’ Submodular Ideas
- A new characterization of the maximum genus of a graph
- Arc‐disjoint arborescences of digraphs
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- On some connectivity properties of Eulerian graphs
- Augmentation Problems
- A Minimax Theorem for Directed Graphs
- Discrete Convex Analysis
- An Algorithm for Submodular Functions on Graphs
- Directed Network Design with Orientation Constraints
- Matching Problems in Polymatroids Without Double Circuits
- A generalization of Kónig's theorem
- Decomposition of Finite Graphs Into Forests
- A THEOREM ON INDEPENDENCE RELATIONS
- Combinatorial optimization. Theory and algorithms.
- On covering intersecting set-systems by digraphs
- An orientation theorem with parity conditions
