SOFSEM2014FinalAuthorVersion.pdf (315.01 kB)
Download file

Minimum activation cost node-disjoint paths in graphs with bounded treewidth

Download (315.01 kB)
conference contribution
posted on 30.01.2015, 12:01 by Hasna Mohsen Alqahtani, Thomas Erlebach
In activation network problems we are given a directed or undirected graph G = (V,E) with a family {f uv : (u,v) ∈ E} of monotone non-decreasing activation functions from D2 to {0,1}, where D is a constant-size subset of the non-negative real numbers, and the goal is to find activation values xv for all v ∈ V of minimum total cost ∑  v ∈ V x v such that the activated set of edges satisfies some connectivity requirements. We propose algorithms that optimally solve the minimum activation cost of k node-disjoint st-paths (st-MANDP) problem in O(tw ((5 + tw)|D|)2tw + 2|V|3) time and the minimum activation cost of node-disjoint paths (MANDP) problem for k disjoint terminal pairs (s 1,t 1),…,(s k ,t k ) in O(tw ((4 + 3tw)|D|)2tw + 2|V|) time for graphs with treewidth bounded by tw.

History

Citation

40th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 26-29, 2014, Proceedings, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8327 LNCS, pp. 65-76

Author affiliation

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

Source

40th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 26-29, 2014.

Version

AM (Accepted Manuscript)

Published in

40th International Conference on Current Trends in Theory and Practice of Computer Science

Publisher

Springer International Publishing

issn

0302-9743

eissn

1611-3349

Copyright date

2014

Available date

30/01/2015

Publisher version

http://link.springer.com/chapter/10.1007/978-3-319-04298-5_7

Language

en

Usage metrics

Categories

Keywords

Exports