An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A reliable multicast framework for light-weight sessions and application level framing
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Receiver-driven layered multicast
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Scheduling multicasts on unit-capacity trees and meshes
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Online througput-competitive algorithm for multicast routing and admission control
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Distributed admission control, scheduling, and routing with stale information
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
DCW '00 Proceedings of the Third International Workshop on Distributed Communities on the Web
Reducing truth-telling online mechanisms to online optimization
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Scheduling multicasts on unit-capacity trees and meshes
Journal of Computer and System Sciences
An online throughput-competitive algorithm for multicast routing and admission control
Journal of Algorithms
Embedding paths into trees: VM placement to minimize congestion
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.00 |