Capacitated domination faster than \(O(2^{n })\) (Q3569880)
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: Capacitated domination faster than O(2ⁿ ) |
scientific article; zbMATH DE number 5724309
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Capacitated domination faster than \(O(2^{n })\) |
scientific article; zbMATH DE number 5724309 |
Statements
Capacitated Domination Faster Than O(2 n ) (English)
0 references
22 June 2010
0 references
0.9956379532814026
0 references
0.8679059743881226
0 references
0.8675675392150879
0 references
0.8569996356964111
0 references
0.8436952829360962
0 references
