An approximation algorithm for \(K\)-best enumeration of minimal connected edge dominating sets with cardinality constraints (Q6562874)
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: An approximation algorithm for \(K\)-best enumeration of minimal connected edge dominating sets with cardinality constraints |
scientific article; zbMATH DE number 7872193
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for \(K\)-best enumeration of minimal connected edge dominating sets with cardinality constraints |
scientific article; zbMATH DE number 7872193 |
Statements
An approximation algorithm for \(K\)-best enumeration of minimal connected edge dominating sets with cardinality constraints (English)
0 references
27 June 2024
0 references
output-sensitive enumeration
0 references
\(K\)-best enumeration
0 references
approximate algorithm
0 references
connected edge dominating set
0 references
0 references
