Tree metrics and edge-disjoint \(S\)-paths
From MaRDI portal
Publication:463719
DOI10.1007/s10107-013-0713-5zbMath1297.90136OpenAlexW2045083520MaRDI QIDQ463719
Publication date: 17 October 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-013-0713-5
Related Items (4)
Finding Maximum Edge-Disjoint Paths Between Multiple Terminals ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Shortest \((A+B)\)-path packing via hafnian
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Packing non-zero \(A\)-paths via matroid matching
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Packing non-zero \(A\)-paths in group-labelled graphs
- An algorithm for packing non-zero \(A\)-paths in group-labelled graphs
- Tight spans of distances and the dual fractionality of undirected multiflow problems
- Polyhedra related to undirected multicommodity flows
- Matroid matching and some applications
- Geometric algorithms and combinatorial optimization
- Über die Maximalzahl kantendisjunkter A-Wege
- Über die Maximalzahl kreuzungsfreier H-Wege
- A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizatons
- How to tidy up a symmetric set-system by use of uncrossing operations
- Multiflows and disjoint paths of minimum total cost
- Lower bounds on the distortion of embedding finite metric spaces in graphs
- A short proof of Mader's \(\mathcal S\)-paths theorem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- The geometry of graphs and some of its algorithmic applications
- Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees
- A polyhedral approach to an integer multicommodity flow problem
- Packing non-returning A-paths
- Packing non-returning \(A\)-paths algorithmically
- Characterization of the distance between subtrees of a tree by the associated tight span
- Combinatorial optimization. Theory and applications.
- A linear programming formulation of Mader's edge-disjoint paths problem
- The maximum multiflow problems with bounded fractionality
- On Integer Multiflow Maximization
- Folder Complexes and Multiflow Combinatorial Dualities
- On Odd Cuts and Plane Multicommodity Flows
- Odd Minimum Cut-Sets and b-Matchings
- On some connectivity properties of Eulerian graphs
- On the Complexity of Timetable and Multicommodity Flow Problems
- Matching, Euler tours and the Chinese postman
- On Two Commodity Network Flows
- Multi-Commodity Network Flows
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
This page was built for publication: Tree metrics and edge-disjoint \(S\)-paths
