On the \(k\)-edge-incident subgraph problem and its variants (Q2446891)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6287298
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the \(k\)-edge-incident subgraph problem and its variants |
scientific article; zbMATH DE number 6287298 |
Statements
On the \(k\)-edge-incident subgraph problem and its variants (English)
0 references
23 April 2014
0 references
\(k\)-edge-incident subgraph problem
0 references
minimum partial vertex cover problem
0 references
approximation algorithm
0 references
dense graph
0 references
polynomial-time approximation scheme
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8836646
0 references
0.8836646
0 references
0.8793334
0 references
0.87745976
0 references
0 references
0.8727662
0 references
0.8718513
0 references
0.8708351
0 references
0 references
