Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (Q266943): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2015.12.004 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2015.12.004 / rank | |||
Normal rank | |||
Revision as of 15:21, 8 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover |
scientific article |
Statements
Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (English)
0 references
7 April 2016
0 references
connected \(k\)-path vertex cover
0 references
weight
0 references
girth
0 references
approximation algorithm
0 references
0 references
