Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems (Q1799605): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2595035909 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1703.04230 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:10, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems |
scientific article |
Statements
Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems (English)
0 references
19 October 2018
0 references
\(k\)-connected graph
0 references
\(m\)-dominating set
0 references
approximation algorithm
0 references
