Optimal tree structure with loyal users and batch updates
From MaRDI portal
Publication:411208
DOI10.1007/S10878-010-9312-ZzbMath1236.90133OpenAlexW1972945010MaRDI QIDQ411208
Yu-Ki Chan, Minming Li, Weiwei Wu
Publication date: 4 April 2012
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-010-9312-z
Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15)
Related Items (3)
Optimal key tree structure for two-user replacement and deletion problems ⋮ Optimal Trees for Minimizing Average Individual Updating Cost ⋮ Optimal trees for minimizing average individual updating cost
Cites Work
- A lower bound for multicast key distribution
- Optimizing deletion cost for secure multicast key management
- Optimal tree structures for group key tree management considering insertion and deletion cost
- Optimal Tree Structures for Group Key Management with Batch Updates
- Optimal Key Tree Structure for Deleting Two or More Leaves
This page was built for publication: Optimal tree structure with loyal users and batch updates
