Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2018.33
URN: urn:nbn:de:0030-drops-99329
URL: https://drops.dagstuhl.de/opus/volltexte/2018/9932/
Babay, Amy ; Dinitz, Michael ; Zhang, Zeyu
Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network
| pdf-format: |
|
Abstract
We consider the Shallow-Light Steiner Network problem from a fixed-parameter perspective. Given a graph G, a distance bound L, and p pairs of vertices (s_1,t_1),...,(s_p,t_p), the objective is to find a minimum-cost subgraph G' such that s_i and t_i have distance at most L in G' (for every i in [p]). Our main result is on the fixed-parameter tractability of this problem for parameter p. We exactly characterize the demand structures that make the problem "easy", and give FPT algorithms for those cases. In all other cases, we show that the problem is W[1]-hard. We also extend our results to handle general edge lengths and costs, precisely characterizing which demands allow for good FPT approximation algorithms and which demands remain W[1]-hard even to approximate.
BibTeX - Entry
@InProceedings{babay_et_al:LIPIcs:2018:9932,
author = {Amy Babay and Michael Dinitz and Zeyu Zhang},
title = {{Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {33:1--33:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Sumit Ganguly and Paritosh Pandya},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9932},
URN = {urn:nbn:de:0030-drops-99329},
doi = {10.4230/LIPIcs.FSTTCS.2018.33},
annote = {Keywords: fixed-parameter tractable, network design, shallow-light steiner network, demand graphs}
}
| Keywords: | fixed-parameter tractable, network design, shallow-light steiner network, demand graphs | |
| Seminar: | 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018) | |
| Issue date: | 2018 | |
| Date of publication: | 05.12.2018 |
