Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network

Amy Babay
Amy Babay
Zeyu Zhang
Zeyu Zhang

FSTTCS, 2018.

Cited by: 3|Bibtex|Views2|Links
EI

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),cdots,(s_p,t_p)$, the objective is to find a minimum-cost subgraph $Gu0027$ such that $s_i$ and $t_i$ have distance at most $L$ $Gu0027$ (for every $i in [p]$). Our main r...More

Code:

Data:

Your rating :
0

 

Tags
Comments