scientific article; zbMATH DE number 1086924

zbMath0878.90037MaRDI QIDQ4363183

Jorge Villavicencio, Michael D. Grigoriadis

Publication date: 5 January 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

fast approximation schememodified Karmarkar logarithmic potentialresource sharing problemsunrestricted Lagrangian decomposition

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (5)

Faster and simpler approximation algorithms for mixed packing and covering problems ⋮ Approximation algorithms for general packing problems and their application to the multicast congestion problem ⋮ On routing in VLSI design and communication networks ⋮ An approximation algorithm for the general max-min resource sharing problem ⋮ Packing trees in communication networks

This page was built for publication: