CIAC   2013 Italian Conference on Algorithms and Complexity
Wall of Fame | Most Viewed CIAC-2013 Paper
38views Algorithms» more  CIAC 2013»
2 years 9 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
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source38