On the \(k\)-edge-incident subgraph problem and its variants (Q2446891): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:25, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the \(k\)-edge-incident subgraph problem and its variants |
scientific article |
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
