Sciweavers

CIAC
2013
Springer
38views Algorithms» more  CIAC 2013»
8 years 7 months ago
Approximation Algorithms for Disjoint st-Paths with Minimum Activation Cost
In network activation problems we are given a directed or undirected graph G = (V, E) with a family {fuv (xu, xv) : (u, v) ∈ E} of monotone non-decreasing activation functions fr...
Hasna Mohsen Alqahtani, Thomas Erlebach