A 21/16-Approximation for the Minimum 3-Path Partition Problem (Q5875609): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
(2 intermediate revisions by 2 users not shown) | |||
label / en | label / en | ||
A 21/16-Approximation for the Minimum 3-Path Partition Problem | |||
Property / DOI | |||
Property / DOI: 10.4230/LIPIcs.ISAAC.2019.46 / rank | |||
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 | |||
Property / DOI | |||
Property / DOI: 10.4230/LIPICS.ISAAC.2019.46 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 17:42, 30 December 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