Login / Signup
Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs.
Zhao Zhang
Joonglyul Lee
Weili Wu
Ding-Zhu Du
Published in:
Optim. Lett. (2016)
Keyphrases
</>
strongly connected
directed graph
minimum cost
linear constraints
support vector
upper bound
undirected graph