CIAC2013FinalAuthorVersion.pdf (327.1 kB)
Download file

Approximation algorithms for disjoint st-paths with minimum activation cost

Download (327.1 kB)
conference contribution
posted on 11.02.2015, 13:28 by Hasna Mohsen Alqahtani, Thomas Erlebach
In network activation problems we are given a directed or undirected graph G = (V,E) with a family {f (x, x) : (u,v) ∈ E} of monotone non-decreasing activation functions from D to {0,1}, where D is a constant-size domain. The goal is to find activation values x for all v ∈ V of minimum total cost Σ x such that the activated set of edges satisfies some connectivity requirements. Network activation problems generalize several problems studied in the network literature such as power optimization problems. We devise an approximation algorithm for the fundamental problem of finding the Minimum Activation Cost Pair of Node-Disjoint st-Paths (MA2NDP). The algorithm achieves approximation ratio 1.5 for both directed and undirected graphs. We show that a ρ-approximation algorithm for MA2NDP with fixed activation values for s and t yields a ρ-approximation algorithm for the Minimum Activation Cost Pair of Edge-Disjoint st-Paths (MA2EDP) problem. We also study the MA2NDP and MA2EDP problems for the special case |D| = 2.

History

Citation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013, 7878 LNCS, pp. 1-12

Author affiliation

/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Computer Science

Source

8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013.

Version

AM (Accepted Manuscript)

Published in

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Publisher

Springer Verlag (Germany)

issn

0302-9743

eissn

1611-3349

isbn

978-3-642-38232-1;978-3-642-38233-8

Copyright date

1007

Available date

11/02/2015

Publisher version

http://link.springer.com/chapter/10.1007/978-3-642-38233-8_1

Book series

Lecture Notes in Computer Science;7878

Language

en

Usage metrics

Categories

Keywords

Exports