Minimum weight \((T,d)\)-joins and multi-joins

DOI10.1016/S0012-365X(97)00045-9zbMath0898.05035MaRDI QIDQ1381848

Alexander V. Karzanov, Michel Burlet

Publication date: 1 November 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

dominant

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (2)

Multiflows and disjoint paths of minimum total cost ⋮ Approximating the Generalized Terminal Backup Problem via Half-Integral Multiflow Relaxation

Cites Work

• Matching theory
• Geometric algorithms and combinatorial optimization
• Über die Maximalzahl kantendisjunkter A-Wege
• Multiflows and disjoint paths of minimum total cost
• On Odd Cuts and Plane Multicommodity Flows
• On some connectivity properties of Eulerian graphs
• Dominants and submissives of matching polyhedra
• Matching, Euler tours and the Chinese postman
• Maximum matching and a polyhedron with 0,1-vertices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum weight \((T,d)\)-joins and multi-joins