eldorado.tu-dortmund.de/server/api/core/bitstreams/79a559f0-2610-40ea-9fb5-2191dfa9a1ac/content
Load-optimization in Reconfigurable Data-center Networks: Algorithms and Complexity of Flow Routing
: i = 1, 2, 3} and Q = {qi : i = 1, 2, 3}. For static (bidirected) links E, we have six options: {u1,u2} ∈ E, {u1,u3} ∈ E, {q1,q2} ∈ E, {q1,q3} ∈ E, and {u2,q2} ∈ E, {u3,q3} ∈ E. For each i ∈ {1, 2, 3} [...] Yes Yes h = 1 Theorem 4.6 Polynomial-time Yes No h = 1 Theorem 4.6 Polynomial-time No Yes h = 1 Theorem 4.6 Weakly NP-hard No Yes h = 1 Theorem 3.4
star networks, which are summarized in Table 1. Moreover [...] define X = {{u2,q2}} ⊆ E, Y = {{u1,q1}, {u2,q2}} ⊆ E and x = {u3,q3} ∈ E. When τ = SS, SN, we define demands as follows: D (u3,q3) = 3, D (u2,q2) = 3, D (q2,u2) = 3 andD (u1,q1) = 3. When τ = SS, we have Φ(X∪{x …
