scientific article; zbMATH DE number 1522943

zbMath0973.90086MaRDI QIDQ4511239

Berthold Vöcking, Santosh Vempala

Publication date: 30 October 2000

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

zbMATH Keywords

linear programming relaxationapproximating multicast congestion

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05)

Related Items (9)

Hardness and approximation results for packing Steiner trees ⋮ Approximation algorithms for general packing problems and their application to the multicast congestion problem ⋮ Fast approximation of minimum multicast congestion – Implementation VERSUS Theory ⋮ On routing in VLSI design and communication networks ⋮ On minimizing the maximum congestion for weighted hypergraph embedding in a cycle ⋮ Packing trees in communication networks ⋮ Multicast Routing and Design of Sparse Connectors ⋮ Nash equilibria in all-optical networks ⋮ Bin Packing with Queues

This page was built for publication: