An application of submodular flows
From MaRDI portal
Publication:1119596
DOI10.1016/0024-3795(89)90469-2zbMath0672.05035OpenAlexW2069138465WikidataQ56987212 ScholiaQ56987212MaRDI QIDQ1119596
Publication date: 1989
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(89)90469-2
Extremal problems in graph theory (05C35) Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20)
Related Items
Improved approximation algorithms for single-tiered relay placement, Better algorithms for minimum weight vertex-connectivity problems, Improved approximation algorithms for minimum cost node-connectivity augmentation problems, Approximating subset \(k\)-connectivity problems, Power optimization in ad hoc wireless network topology control with biconnectivity requirements, Generalized polymatroids and submodular flows, Power optimization for connectivity problems, Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design, Approximating node-connectivity augmentation problems, Relay placement for fault tolerance in wireless networks in higher dimensions, A Survey on Covering Supermodular Functions, Packing branchings under cardinality constraints on their root sets, Degree constrained node-connectivity problems, A \(4+\epsilon\) approximation for \(k\)-connected subgraphs, Approximating source location and star survivable network problems, Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems, On minimum power connectivity problems, Power assignment for \(k\)-connectivity in wireless ad hoc networks, Approximation algorithms for graph augmentation, Approximating Survivable Networks with Minimum Number of Steiner Points, Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings, Faster approximation algorithms for weighted triconnectivity augmentation problems, Rooted \(k\)-connections in digraphs, Approximating minimum-power edge-covers and 2,3-connectivity, Approximating Source Location and Star Survivable Network Problems, Relay placement for two-connectivity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding feasible vectors of Edmonds-Giles polyhedra
- Edge-connectivity augmentation problems
- Generalized polymatroids and submodular flows
- How to make a digraph strongly connected
- On matroid intersections
- Minimization on submodular flows
- Covering the edge set of a directed graph with trees
- Matroid Intersection
- Covering directed and odd cuts
- Proving total dual integrality with cross-free families—A general framework
- A Primal-Dual Algorithm for Submodular Flows
- Layered Augmenting Path Algorithms
- Complexity of Matroid Property Algorithms
- Minimum cost flow with set-constraints
- Arc‐disjoint arborescences of digraphs
- Computing Maximal “Polymatroidal” Network Flows
- ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS
- A Minimax Theorem for Directed Graphs
- An Algorithm for Submodular Functions on Graphs
- A generalization of Kónig's theorem
- A THEOREM ON INDEPENDENCE RELATIONS