Approximability and inapproximability of the minimum certificate dispersal problem (Q982648)
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 5731727
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximability and inapproximability of the minimum certificate dispersal problem |
scientific article; zbMATH DE number 5731727 |
Statements
Approximability and inapproximability of the minimum certificate dispersal problem (English)
0 references
7 July 2010
0 references
minimum certificate dispersal problem
0 references
graph theory
0 references
approximation algorithms
0 references
combinatorial optimization
0 references
0 references
0.963671326637268
0 references
0.9151089191436768
0 references
0.884211003780365
0 references
0.8201290369033813
0 references
0.7200566530227661
0 references
