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

Revision as of 00:46, 29 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

instance of

scholarly article

0 references

title

Improved approximation algorithms for hitting 3-vertex paths (English)

0 references

Improved Approximation Algorithms for Hitting 3-Vertex Paths (English)

0 references

0 references

0 references

0 references

Mathematical Programming. Series A. Series B

0 references

Integer Programming and Combinatorial Optimization

0 references

publication date

26 June 2020

0 references

10 August 2016

0 references

full work available at URL

https://arxiv.org/abs/1808.10370

0 references

zbMATH Keywords

cluster vertex deletion

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Distance-hereditary graphs

0 references

A Fast Branching Algorithm for Cluster Vertex Deletion

0 references

An Approximation Algorithm for Feedback Vertex Sets in Tournaments

0 references

A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs

0 references

Q3577833

0 references

Fixed-parameter algorithms for cluster vertex deletion

0 references

Fast Dynamic Graph Algorithms for Parameterized Problems

0 references

A 7/3-Approximation for Feedback Vertex Sets in Tournaments

0 references

A primal-dual approximation algorithm for the vertex cover $P^3$ problem

0 references

Approximate association via dissociation

0 references

Improved approximation algorithms for hitting 3-vertex paths

0 references

Inapproximability of $H$-Transversal/Packing

0 references

Identifiers

zbMATH Open document ID

1442.05222

0 references

1419.90111

0 references

DOI

10.1007/s10107-019-01395-y

0 references

10.1007/978-3-319-33461-5_20

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2191773

@@ Property / cites work @@
+Distance-hereditary graphs
@@ Property / cites work: Distance-hereditary graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast Branching Algorithm for Cluster Vertex Deletion
+Normal rank
@@ Property / cites work @@
+An Approximation Algorithm for Feedback Vertex Sets in Tournaments
+Normal rank
@@ Property / cites work @@
+A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
+Normal rank
@@ Property / cites work @@
+Q3577833
@@ Property / cites work: Q3577833 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for cluster vertex deletion
+Normal rank
@@ Property / cites work @@
+Fast Dynamic Graph Algorithms for Parameterized Problems
+Normal rank
@@ Property / cites work @@
+A 7/3-Approximation for Feedback Vertex Sets in Tournaments
+Normal rank
@@ Property / cites work @@
+A primal-dual approximation algorithm for the vertex cover \(P^3\) problem
+Normal rank
@@ Property / cites work @@
+Approximate association via dissociation
@@ Property / cites work: Approximate association via dissociation / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for hitting 3-vertex paths
+Normal rank
@@ Property / cites work @@
+Inapproximability of $H$-Transversal/Packing
@@ Property / cites work: Inapproximability of $H$-Transversal/Packing / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q128007423
@@ Property / Wikidata QID: Q128007423 / rank @@
+Normal rank