Computing Minimum k-Connected m-Fold Dominating Set in General Graphs (Q5131721): Difference between revisions

@@ Property / author @@
+Xiao-hui Huang
@@ Property / author: Xiao-hui Huang / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1287/ijoc.2017.0776
+Normal rank
@@ Property / OpenAlex ID @@
+W2791998335
@@ Property / OpenAlex ID: W2791998335 / rank @@
+Normal rank
@@ Property / cites work @@
+Dual-Based Local Search for the Connected Facility Location and Related Problems
+Normal rank
@@ Property / cites work @@
+A sequential algorithm for generating random graphs
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+$k$-Blocks: A Connectivity Invariant for Graphs
@@ Property / cites work: $k$-Blocks: A Connectivity Invariant for Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Connectivity and tree structure in finite graphs
@@ Property / cites work: Connectivity and tree structure in finite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
+Normal rank
@@ Property / cites work @@
+On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
+Normal rank
@@ Property / cites work @@
+Solving connected dominating set faster than \(2^n\)
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for connected dominating sets
+Normal rank
@@ Property / cites work @@
+Spanning Trees with Many Leaves
@@ Property / cites work: Spanning Trees with Many Leaves / rank @@
+Normal rank
@@ Property / cites work @@
+Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
+Normal rank
@@ Property / cites work @@
+Über n-fach zusammenhängende Eckenmengen in Graphen
+Normal rank
@@ Property / cites work @@
+Graph minors. X: Obstructions to tree-decomposition
+Normal rank
@@ Property / cites work @@
+A greedy approximation for minimum connected dominating sets
+Normal rank
@@ Property / cites work @@
+On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs
+Normal rank
@@ Property / cites work @@
+A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem
+Normal rank
@@ Property / cites work @@
+Minimum connected dominating sets and maximal independent sets in unit disk graphs
+Normal rank
@@ Property / cites work @@
+A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks
+Normal rank
@@ Property / cites work @@
+TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET
+Normal rank
@@ Property / cites work @@
+A greedy algorithm for the fault-tolerant connected dominating set in a general graph
+Normal rank

Computing Minimum <i>k</i>-Connected <i>m</i>-Fold Dominating Set in General Graphs (Q5131721): Difference between revisions

Latest revision as of 00:58, 24 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)