Approximability and inapproximability of the minimum certificate dispersal problem (Q982648): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2010.03.029 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1982007160 / rank | |||
Normal rank |
Revision as of 23:28, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximability and inapproximability of the minimum certificate dispersal problem |
scientific article |
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