Approximation algorithms for minimum weight connected 3-path vertex cover (Q2008557)
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 7136563
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for minimum weight connected 3-path vertex cover |
scientific article; zbMATH DE number 7136563 |
Statements
Approximation algorithms for minimum weight connected 3-path vertex cover (English)
0 references
26 November 2019
0 references
connected \(k\)-path vertex cover
0 references
weight
0 references
approximation algorithm
0 references
non-submodular potential function
0 references
0 references
0 references
0 references
0 references
0 references
0.98249745
0 references
0.9563152
0 references
0.93980646
0 references
0.92761004
0 references
0.91752255
0 references
0.91691685
0 references
0.9148741
0 references
0.9146474
0 references
0.9105092
0 references
