Improved approximation algorithms for hitting 3-vertex paths (Q2191773): Difference between revisions

From MaRDI portal
Merged Item from Q3186506
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Branching Algorithm for Cluster Vertex Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Algorithm for Feedback Vertex Sets in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for cluster vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Dynamic Graph Algorithms for Parameterized Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 7/3-Approximation for Feedback Vertex Sets in Tournaments / 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: Approximate association via dissociation / rank
 
Normal rank

Revision as of 09:03, 12 July 2024

scientific article; zbMATH DE number 6610493
  • Improved Approximation Algorithms for Hitting 3-Vertex Paths
Language Label Description Also known as
English
Improved approximation algorithms for hitting 3-vertex paths
scientific article; zbMATH DE number 6610493
  • Improved Approximation Algorithms for Hitting 3-Vertex Paths

Statements

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references