Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714)
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: Efficient algorithms for the \textsc{max~k-vertex cover problem} |
scientific article; zbMATH DE number 6388491
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} |
scientific article; zbMATH DE number 6388491 |
Statements
Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (English)
0 references
21 January 2015
0 references
maximum \(k\)-vertex problem
0 references
exact exponential algorithms
0 references
measure-and-conquer
0 references
0 references
0.9764388203620912
0 references
0.8283382654190063
0 references
0.8091616034507751
0 references
0.8007371425628662
0 references
