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

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q128007423, #quickstatements; #temporary_batch_1722209980517
 
(5 intermediate revisions by 3 users not shown)
aliases / en / 0aliases / en / 0
 
Improved Approximation Algorithms for Hitting 3-Vertex Paths
description / endescription / en
scientific article
scientific article; zbMATH DE number 6610493
Property / title
 
Improved Approximation Algorithms for Hitting 3-Vertex Paths (English)
Property / title: Improved Approximation Algorithms for Hitting 3-Vertex Paths (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1419.90111 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-33461-5_20 / rank
 
Normal rank
Property / published in
 
Property / published in: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / publication date
 
10 August 2016
Timestamp+2016-08-10T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 10 August 2016 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6610493 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2461238324 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1808.10370 / rank
 
Normal rank
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
Property / cites work
 
Property / cites work: Improved approximation algorithms for hitting 3-vertex paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of $H$-Transversal/Packing / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128007423 / rank
 
Normal rank

Latest 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

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
26 June 2020
0 references
10 August 2016
0 references
cluster vertex deletion
0 references

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
0 references