A 21/16-Approximation for the Minimum 3-Path Partition Problem (Q5875609): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| label / en | label / en | ||
A 21/16-Approximation for the Minimum 3-Path Partition Problem | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/11542/pdf/LIPIcs-ISAAC-2019-46.pdf/ / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2990814010 / rank | |||
Normal rank | |||
| Property / title | |||
A 21/16-Approximation for the Minimum 3-Path Partition Problem (English) | |||
| Property / title: A 21/16-Approximation for the Minimum 3-Path Partition Problem (English) / rank | |||
Normal rank | |||
Revision as of 08:34, 30 July 2024
scientific article; zbMATH DE number 7650279
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A 21/16-Approximation for the Minimum 3-Path Partition Problem |
scientific article; zbMATH DE number 7650279 |
Statements
3 February 2023
0 references
\(3\)-path partition
0 references
exact set cover
0 references
approximation algorithm
0 references
local search
0 references
amortized analysis
0 references
A 21/16-Approximation for the Minimum 3-Path Partition Problem (English)
0 references
