On complexity, representation and approximation of integral multicommodity flows
type: Item
instance of: scholarly article
title: On complexity, representation and approximation of integral multicommodity flows
zbMATH Open document ID: 0951.68048
DOI: 10.1016/S0166-218X(99)00133-X
author: Anand Srivastav
author: Peter Stangier
published in: Discrete Applied Mathematics
publication date: 2000-12-18T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 60E15
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1395011
zbMATH Keywords: integral multicommodity flow problems
MaRDI profile type: Publication
cites work: Q4004078
cites work: Fast probabilistic algorithms for Hamiltonian circuits and matchings
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: Primal-dual approximation algorithms for integral flow and multicut in trees
cites work: Geometric algorithms and combinatorial optimization
cites work: Tight integral duality gap in the Chinese postman problem
cites work: A fast algorithm for maximum integral two-commodity flow in planar graphs
cites work: An \(O(IVI^3)\) algorithm for finding maximum flows in networks
cites work: Q3496342
cites work: Multicommodity flows in planar graphs
cites work: Probabilistic construction of deterministic algorithms: approximating packing integer programs
cites work: Randomized rounding: A technique for provably good algorithms and algorithmic proofs
cites work: Q3481743
cites work: Q4868265
cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
cites work: A linear-time algorithm for edge-disjoint paths in planar graphs
Wikidata QID: Q127374488
description: scientific article; zbMATH DE number 1395011