Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set (Q5131722)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set |
scientific article; zbMATH DE number 7271635
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set |
scientific article; zbMATH DE number 7271635 |
Statements
Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set (English)
0 references
9 November 2020
0 references
connected dominating set
0 references
weight
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
