A local search \(4/3\)-approximation algorithm for the minimum 3-path partition problem (Q2327083)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7116311
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A local search \(4/3\)-approximation algorithm for the minimum 3-path partition problem |
scientific article; zbMATH DE number 7116311 |
Statements
A local search \(4/3\)-approximation algorithm for the minimum 3-path partition problem (English)
0 references
11 October 2019
0 references
\(k\)-path partition
0 references
path cover
0 references
\(k\)-set cover
0 references
approximation algorithms
0 references
local search
0 references
amortized analysis
0 references
0.986064910888672
0 references
0.9306643009185792
0 references
0.8929352760314941
0 references
0.8266756534576416
0 references
0.8243741393089294
0 references
