Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
A guided tour of Chernoff bounds
Information Processing Letters
Towards a 4/3 approximation for the asymmetric traveling salesman problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for constrained for constrained node weighted steiner tree problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Polynomial time algorithms for network information flow
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
On minimizing the maximum congestion for Weighted Hypergraph Embedding in a Cycle
Information Processing Letters
Characterizing achievable multicast rates in multi-hop wireless networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
A 1.5 Approximation Algorithm for Embedding Hyperedges in a Cycle
IEEE Transactions on Parallel and Distributed Systems
On routing in VLSI design and communication networks
Discrete Applied Mathematics
Multiflows in multihop wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Fast approximation of minimum multicast congestion: implementation versus theory
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
A survey of approximation algorithms for multicast congestion problems
TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
Packing trees in communication networks
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Disjoint cycles: integrality gap, hardness, and approximation
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Implementation of approximation algorithms for the multicast congestion problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Minimum vehicle routing with a common deadline
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Revisiting a secret sharing approach to network codes
ProvSec'12 Proceedings of the 6th international conference on Provable Security
| Hi-index | 0.00 |