• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs.

Zhao ZhangJoonglyul LeeWeili WuDing-Zhu Du
Published in: Optim. Lett. (2016)
Keyphrases
  • strongly connected
  • directed graph
  • minimum cost
  • linear constraints
  • support vector
  • upper bound
  • undirected graph