Improved Bounds on Nonblocking 3-Stage Clos Networks

DOI10.1137/060656413zbMath1144.68055OpenAlexW2064810366WikidataQ65553919 ScholiaQ65553919MaRDI QIDQ3507524

José R. Correa, Michel X. Goemans

Publication date: 19 June 2008

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10533/178309

zbMATH Keywords

bin packingbipartite edge coloringrearrangeability of 3-stage clos networks

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (4)

Equitable factorizations of edge-connected graphs ⋮ Edge Coloring and Decompositions of Weighted Graphs ⋮ The number of rearrangements for Clos networks -- new results ⋮ A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions

This page was built for publication: Improved Bounds on Nonblocking 3-Stage Clos Networks