A local search 4/3-approximation algorithm for the minimum 3-path partition problem (Q2091113)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A local search 4/3-approximation algorithm for the minimum 3-path partition problem |
scientific article; zbMATH DE number 7610143
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A local search 4/3-approximation algorithm for the minimum 3-path partition problem |
scientific article; zbMATH DE number 7610143 |
Statements
A local search 4/3-approximation algorithm for the minimum 3-path partition problem (English)
0 references
31 October 2022
0 references
path partition
0 references
path cover
0 references
local search
0 references
approximation algorithms
0 references
amortized analysis
0 references
0 references
0 references
