A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs (Q1273087)
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: A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs |
scientific article; zbMATH DE number 1229528
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs |
scientific article; zbMATH DE number 1229528 |
Statements
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs (English)
0 references
23 September 1999
0 references
combinatorial optimization
0 references
2-approximation algorithms
0 references
feedback vertex set problem
0 references
undirected graphs
0 references
network design
0 references
0.9412691
0 references
0.9208219
0 references
0.9208219
0 references
0 references
0.8892456
0 references
0.8892456
0 references
0.8839178
0 references
