Approximation algorithms for data placement in arbitrary networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A data tracking scheme for general networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Budget Constrained Minimum Cost Connected Medians
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Simpler and better approximation algorithms for network design
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Competitive on-line paging strategies for mobile users under delay constraints
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
On-line generalized Steiner problem
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Compositional competitiveness for distributed algorithms
Journal of Algorithms
Approximation via cost sharing: Simpler and better approximation algorithms for network design
Journal of the ACM (JACM)
Controller and estimator for dynamic networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Optimal algorithms for page migration in dynamic networks
Journal of Discrete Algorithms
Compositional competitiveness for distributed algorithms
Journal of Algorithms
On the competitive ratio for online facility location
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the competitiveness of the online asymmetric and euclidean steiner tree problems
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Hi-index | 0.00 |