Multi-Terminal Network Flows
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Highly connected Steiner subgraph: parameterized algorithms and applications to hitting set problems
- Solving the prize-collecting rural postman problem
- Optimizing over the subtour polytope of the travelling salesman problem
- Faster algorithms for shortest path and network flow based on graph decomposition
- On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic
- On spaces extremal for the Gomory-Hu inequality
- Distributional limits of graph cuts on discretized grids
- Minimum cut in \(O(m \log^2 n)\) time
- Minimum spanning paths and Hausdorff distance in finite ultrametric spaces
- Improved bounds for large scale capacitated arc routing problem
- Ancestor tree for arbitrary multi-terminal cut functions
- Uniformly k-edge-connected graphs
- Multiterminal flows and cuts
- A note on two source location problems
- Nearly-tight bounds for flow sparsifiers in quasi-bipartite graphs
- The structure of minimum vertex cuts
- Minimum cut in O(m^2 n time
- Multiterminal network flows and applications
- Location and layout planning. A survey
- Space complexity of vertex connectivity oracles
- Impact of a varying capacity on the all pairs 2-route network flows
- Computing area-optimal simple polygonizations
- The most vital edges in the minimum spanning tree problem
- Network design and dynamic routing under queueing demand
- Multi-terminal multipath flows: synthesis
- Polyhedral approach to weighted connected matchings in general graphs
- The network synthesis problem in a cycle
- Dynamic programming and graph optimization problems
- Integer version of the multipath flow network synthesis problem
- Multigraph augmentation under biconnectivity and general edge-connectivity requirements
- Generalizing the all-pairs min cut problem
- Survivable network design with demand uncertainty
- Decomposition algorithms for locating minimal cuts in a network
- Properties of Gomory-Hu co-cycle bases
- Finding minimum 3-way cuts in hypergraphs
- Mincut sensitivity data structures for the insertion of an edge
- Efficient Algorithms for the k Smallest Cuts Enumeration
- Edge-connectivity matrices and their spectra
- A note on bounding \(k\)-terminal reliability
- Ultrametric preserving functions and weak similarities of ultrametric spaces
- Sink location to find optimal shelters in evacuation planning
- Efficient pattern matching on big uncertain graphs
- On ultrametric-preserving functions
- On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms
- A computational comparison of flow formulations for the capacitated location-routing problem
- On the collaboration uncapacitated arc routing problem
- An efficient algorithm for the minimum capacity cut problem
- Vertex-weighted realizations of graphs
- Hereditary properties of finite ultrametric spaces
- On spanning tree problems with multiple objectives
- scientific article; zbMATH DE number 7651198 (Why is no real title available?)
- On a Special Co-cycle Basis of Graphs
- Co-density and fractional edge cover packing
- Solution of large-scale symmetric travelling salesman problems
- Vital edges for (s,t)-mincut: efficient algorithms, compact structures, \& optimal sensitivity oracles
- On minimum 3-cuts and approximating k-cuts using cut trees
- Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty
- Two-commodity opposite direction network flow formulations for the travelling salesman problem
- Fast augmenting paths by random sampling from residual graphs
- New algorithms and lower bounds for all-pairs max-flow in undirected graphs
- Empirical study on sufficient numbers of minimum cuts in strongly connected directed random graphs
- Flows over edge-disjoint mixed multipaths and applications
- Simulated annealing heuristics for the dynamic facility layout problem
- A clustering algorithm based on graph connectivity
- A parameterized lower bounding method for the open capacitated arc routing problem
- Flow equivalent trees in undirected node-edge-capacitated planar graphs
- Delhomme-Laflamme-Pouzet-Sauer space as groupoid
- A graph b-coloring framework for data clustering
- Multiroute flows: cut-trees and realizability
- Parametric min-cuts analysis in a network.
- Branch and cut methods for network optimization
- A tabu search algorithm for self-healing ring network design.
- Branch-and-cut algorithms for the traveling salesman problem with job times
- A set-theoretical approach to the problem of hierarchical clustering
- Optimization in telecommunication networks
- On the relationship between the cut-tree and the fundamental cut-set of multi-terminal flow networks
- Static and dynamic source locations in undirected networks
- Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
- Finite ultrametric balls
- Valid inequalities for the -edge disruptor problem
- Solving combinatorial optimization problems using Karmarkar's algorithm
- Dynamic Graph Clustering Using Minimum-Cut Trees
- Graph clustering
- Solving the linear matroid parity problem as a sequence of matroid intersection problems
- Maximum concurrent flows and minimum cuts
- Design of survivable networks with low connectivity requirements
- Tight conditional lower bounds for vertex connectivity problems
- An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem
- Connectivity of submodular functions
- An algorithm for computing maximum solution bases
- Undirected postman problems with zigzagging option: a cutting-plane approach
- Temporal graph realization from fastest paths
- Flow in planar graphs with vertex capacities
- Cut problems in graphs with a budget constraint
- A branch-and-cut algorithm for the k-edge connected subgraph problem
- Analyse und Synthese zuverlässiger Netze
- The precedence-constrained asymmetric traveling salesman polytope
- Deterministic minimum cut in poly-logarithmic maximum flows
- Parametric analysis on cut-trees and its application on a protein clustering problem
- Symmetric submodular system: contractions and Gomory-Hu tree
This page was built for publication: Multi-Terminal Network Flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3849459)
