Tree metrics and edge-disjoint \(S\)-paths
type: Item
instance of: scholarly article
title: Tree metrics and edge-disjoint \(S\)-paths
zbMATH Open document ID: 1297.90136
author: Hiroshi Hirai
author: Gyula Pap
published in: Mathematical Programming. Series A. Series B
publication date: 2014-10-17T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 6357714
MaRDI profile type: Publication
full work available at URL: s10107-013-0713-5
OpenAlex ID: W2045083520
cites work: Q4542533
cites work: Q2934633
cites work: A polyhedral approach to an integer multicommodity flow problem
cites work: Q3002769
cites work: Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs
cites work: An algorithm for packing non-zero \(A\)-paths in group-labelled graphs
cites work: Packing non-zero \(A\)-paths in group-labelled graphs
cites work: Matching, Euler tours and the Chinese postman
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: On Integer Multiflow Maximization
cites work: Primal-dual approximation algorithms for integral flow and multicut in trees
cites work: Geometric algorithms and combinatorial optimization
cites work: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
cites work: Characterization of the distance between subtrees of a tree by the associated tight span
cites work: Tight spans of distances and the dual fractionality of undirected multiflow problems
cites work: Folder Complexes and Multiflow Combinatorial Dualities
cites work: The maximum multiflow problems with bounded fractionality
cites work: Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees
cites work: Multi-Commodity Network Flows
cites work: A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizatons
cites work: Polyhedra related to undirected multicommodity flows
cites work: Q4011256
cites work: How to tidy up a symmetric set-system by use of uncrossing operations
cites work: Multiflows and disjoint paths of minimum total cost
cites work: A linear programming formulation of Mader's edge-disjoint paths problem
cites work: Combinatorial optimization. Theory and applications.
cites work: On some connectivity properties of Eulerian graphs
cites work: Q3896158
cites work: Matroid matching and some applications
cites work: The geometry of graphs and some of its algorithmic applications
cites work: Über die Maximalzahl kantendisjunkter A-Wege
cites work: Über die Maximalzahl kreuzungsfreier H-Wege
cites work: Odd Minimum Cut-Sets and b-Matchings
cites work: Packing non-returning A-paths
cites work: Packing non-returning \(A\)-paths algorithmically
cites work: Lower bounds on the distortion of embedding finite metric spaces in graphs
cites work: On Two Commodity Network Flows
cites work: A short proof of Mader's \(\mathcal S\)-paths theorem
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Q4792088
cites work: On Odd Cuts and Plane Multicommodity Flows
cites work: Packing non-zero \(A\)-paths via matroid matching
cites work: Q4782696
DOI: 10.1007/S10107-013-0713-5
Recommended article: Edge-disjoint spanning trees and forests of graphs
Recommended article: Edge-connectivity and edge-disjoint spanning trees
Recommended article: Tree-Like Structures in Graphs: A Metric Point of View
Recommended article: Q3495379
Recommended article: Q4878283
Recommended article: Finding edge-disjoint paths in partial k-trees
Recommended article: Finding edge-disjoint paths in partial \(k\)-trees
Recommended article: Edge‐disjoint spanning trees: A connectedness theorem
Recommended article: A property on edge-disjoint spanning trees
Recommended article: Edge-disjoint paths revisited
description: scientific article; zbMATH DE number 6357714