The all-or-nothing flow problem in directed graphs with symmetric demand pairs
type: Item
instance of: scholarly article
title: The all-or-nothing flow problem in directed graphs with symmetric demand pairs
zbMATH Open document ID: 1337.90018
author: Chandra Chekuri
author: Alina Ene
published in: Mathematical Programming. Series A. Series B
publication date: 2015-12-09T00:00:00Z
full work available at URL: WRAP Ene dir-anf-journal (2).pdf
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C21
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6518226
MaRDI profile type: Publication
OpenAlex ID: W2127985326
cites work: Directed tree-width examples
cites work: Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
cites work: Approximation Algorithms for Steiner and Directed Multicuts
cites work: Large-treewidth graph decompositions and applications
cites work: Polynomial bounds for the grid-minor theorem
cites work: Poly-logarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion
cites work: Multicommodity flows and cuts in polymatroidal networks
cites work: The all-or-nothing multicommodity flow problem
cites work: Multicommodity flow, well-linked terminals, and routing problems
cites work: Q3002769
cites work: Multicommodity demand flow in a tree and packing integer programs
cites work: Routing in undirected graphs with constant congestion
cites work: Q3549611
cites work: Polynomial flow-cut gaps and hardness of directed cut problems
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: Improved Approximation Algorithms for Minimum Weight Vertex Separators
cites work: The directed subgraph homeomorphism problem
cites work: Primal-dual approximation algorithms for integral flow and multicut in trees
cites work: Directed tree-width
cites work: Reducibility among Combinatorial Problems
cites work: An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem
cites work: Excluded minors, network decomposition, and multicommodity flow
cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
cites work: The geometry of graphs and some of its algorithmic applications
cites work: Introducing directed tree width
cites work: A lower bound on the integrality gap for minimum multicut in directed networks
DOI: 10.1007/S10107-014-0856-Z
description: scientific article; zbMATH DE number 6518226