Approximating minimum \(k\)-tree cover of a connected graph inspired by the multi-ferry routing in delay tolerant networks (Q6629668)
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: Approximating minimum k-tree cover of a connected graph inspired by the multi-ferry routing in delay tolerant networks |
scientific article; zbMATH DE number 7935901
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating minimum \(k\)-tree cover of a connected graph inspired by the multi-ferry routing in delay tolerant networks |
scientific article; zbMATH DE number 7935901 |
Statements
Approximating minimum \(k\)-tree cover of a connected graph inspired by the multi-ferry routing in delay tolerant networks (English)
0 references
30 October 2024
0 references
minimum \(k\)-tree cover
0 references
approximation algorithm
0 references
Christofides' algorithm
0 references
minimum spanning tree
0 references
bin packing algorithm
0 references
