An FPT 2-approximation for tree-cut decomposition (Q1702123): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Merged Item from Q2788989
(4 intermediate revisions by 4 users not shown)
aliases / en / 0aliases / en / 0
 
An FPT 2-Approximation for Tree-cut Decomposition
description / endescription / en
scientific article
scientific article; zbMATH DE number 6545964
Property / title
 
An FPT 2-Approximation for Tree-cut Decomposition (English)
Property / title: An FPT 2-Approximation for Tree-cut Decomposition (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1386.68222 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-28684-6_4 / rank
 
Normal rank
Property / published in
 
Property / published in: Approximation and Online Algorithms / rank
 
Normal rank
Property / publication date
 
26 February 2016
Timestamp+2016-02-26T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 26 February 2016 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6545964 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2761665840 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2257535006 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1509.04880 / rank
 
Normal rank

Revision as of 09:26, 6 May 2024

scientific article; zbMATH DE number 6545964
  • An FPT 2-Approximation for Tree-cut Decomposition
Language Label Description Also known as
English
An FPT 2-approximation for tree-cut decomposition
scientific article; zbMATH DE number 6545964
  • An FPT 2-Approximation for Tree-cut Decomposition

Statements

An FPT 2-approximation for tree-cut decomposition (English)
0 references
An FPT 2-Approximation for Tree-cut Decomposition (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
28 February 2018
0 references
26 February 2016
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
fixed-parameter tractable algorithm
0 references
tree-cut width
0 references
approximation algorithm
0 references
0 references
0 references
0 references