An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
An asymptotic fully polynomial time approximation scheme for bin covering
Theoretical Computer Science
Assign ranges in general ad-hoc networks
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Faster and simpler approximation algorithms for mixed packing and covering problems
Theoretical Computer Science
Multicast Routing and Design of Sparse Connectors
Algorithmics of Large and Complex Networks
Fast approximation of minimum multicast congestion: implementation versus theory
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Implementation of approximation algorithms for the max-min resource sharing problem
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Packing trees in communication networks
WINE'05 Proceedings of the First international conference on Internet and Network Economics
On routing in VLSI design and communication networks
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Assign ranges in general ad-hoc networks
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Approximation algorithms for mixed fractional packing and covering problems
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Implementation of approximation algorithms for the multicast congestion problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Approximation algorithms for min-max and max-min resource sharing problems, and applications
Efficient Approximation and Online Algorithms
An approximation algorithm for the general mixed packing and covering problem
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Hi-index | 0.00 |