On the weighted \(k\)-path vertex cover problem (Q406316): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Boštjan Brešar / rank
Normal rank
 
Property / author
 
Property / author: Rastislav Krivoš-Belluš / rank
Normal rank
 
Property / author
 
Property / author: Gabriel Semanisin / rank
Normal rank
 
Property / author
 
Property / author: Petra Šparl / rank
Normal rank
 
Property / author
 
Property / author: Boštjan Brešar / rank
 
Normal rank
Property / author
 
Property / author: Rastislav Krivoš-Belluš / rank
 
Normal rank
Property / author
 
Property / author: Gabriel Semanisin / rank
 
Normal rank
Property / author
 
Property / author: Petra Šparl / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2014.05.042 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038294264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the vertex \(k\)-path cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum \(k\)-path vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: On F-independence in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(k\)-path vertex cover of some graph products / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the minimum 3-path vertex cover and dissociation number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: PTAS for the minimum \(k\)-path connected vertex cover problem in unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual approximation algorithm for the vertex cover \(P^3\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank

Latest revision as of 00:08, 9 July 2024

scientific article
Language Label Description Also known as
English
On the weighted \(k\)-path vertex cover problem
scientific article

    Statements

    Identifiers