Approximability and inapproximability of the minimum certificate dispersal problem
From MaRDI portal
Publication:982648
DOI10.1016/j.tcs.2010.03.029zbMath1192.68907MaRDI QIDQ982648
Hirotaka Ono, Taisuke Izumi, Koichi Wada, Tomoko Izumi
Publication date: 7 July 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.03.029
combinatorial optimization; graph theory; approximation algorithms; minimum certificate dispersal problem
Related Items
Parameterized certificate dispersal and its variants, Approximability of minimum certificate dispersal with tree structures, Minimum Certificate Dispersal with Tree Structures
Cites Work
- Unnamed Item
- Unnamed Item
- On the complexity of H-coloring
- An analysis of the greedy algorithm for the submodular set covering problem
- Complexity of approximating bounded variants of optimization problems
- Algorithmic construction of sets for k -restrictions
- Provisioning a virtual private network
- Stabilizing Certificate Dispersal
- Optimal Dispersal of Certificate Chains