scientific article; zbMATH DE number 1215271
From MaRDI portal
Publication:4215386
zbMath0911.90278MaRDI QIDQ4215386
Jorge Villavicencio, Michael D. Grigoriadis
Publication date: 26 October 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
multicommodity flowfully polynomial time approximation schemestructured optimizationblock-angular convex resource-sharing programsexponential-potential block-coordinate descent method
Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Linear programming (90C05) Deterministic network models in operations research (90B10)
Related Items (4)
Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time ⋮ Approximation algorithms for general packing problems and their application to the multicast congestion problem ⋮ Faster min-max resource sharing in theory and practice ⋮ Packing trees in communication networks
This page was built for publication:
