New approximation algorithms for the rooted budgeted cycle cover problem (Q5925709)
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 7676487
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New approximation algorithms for the rooted budgeted cycle cover problem |
scientific article; zbMATH DE number 7676487 |
Statements
New approximation algorithms for the rooted budgeted cycle cover problem (English)
0 references
20 April 2023
0 references
budgeted cycle cover
0 references
wireless sensor network
0 references
graph algorithm
0 references
approximation algorithm
0 references
combinatorial optimization
0 references
0 references
0 references
0.997573733329773
0 references
0.783587634563446
0 references
0.7781603932380676
0 references
0.7642369270324707
0 references
