A local search algorithm for the \(k\)-path partition problem (Q6181375)
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 7792593
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A local search algorithm for the \(k\)-path partition problem |
scientific article; zbMATH DE number 7792593 |
Statements
A local search algorithm for the \(k\)-path partition problem (English)
0 references
22 January 2024
0 references
approximation algorithm
0 references
path partition
0 references
set covering
0 references
local search
0 references
0 references
0.8938341736793518
0 references
0.8932753205299377
0 references
0.8929352760314941
0 references
0.8532329201698303
0 references
0.8499308228492737
0 references
