Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs (Q331973)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs |
scientific article |
Statements
Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs (English)
0 references
27 October 2016
0 references