Network reinforcement
From MaRDI portal
Publication:2583121
DOI10.1007/s10107-005-0648-6zbMath1085.90005OpenAlexW3190326073MaRDI QIDQ2583121
Publication date: 13 January 2006
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-005-0648-6
Related Items
Graphic Submodular Function Minimization: A Graphic Approach and Applications, A linear programming approach to increasing the weight of all minimum spanning trees, A new algorithm for the intersection of a line with the independent set polytope of a matroid, On some algorithmic aspects of hypergraphic matroids
Cites Work
- Unnamed Item
- Separating from the dominant of the spanning tree polytope
- Geometric algorithms and combinatorial optimization.
- A faster algorithm for computing the strength of a network
- Connectivity and edge-disjoint spanning trees
- New primal and dual matching heuristics
- Separation of Partition Inequalities
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Trees and Cuts
- Minimum cuts, modular functions, and matroid polyhedra
- A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
- Optimal attack and reinforcement of a network
- A new approach to the maximum-flow problem
- Selected Applications of Minimum Cuts in Networks
- Computing the Strength of a Graph
- Improved Algorithms for Bipartite Network Flow
- A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
- Algorithms for Graphic Polymatroids and Parametrics-Sets
- Optimal cooperation and submodularity for computing Potts partition functions with a large number of states
- A Fast Parametric Maximum Flow Algorithm and Applications
