A fast approximation algorithm for the multicovering problem
Discrete Applied Mathematics
Integer and combinatorial optimization
Integer and combinatorial optimization
A general approximation technique for constrained forest problems
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
On the hardness of approximating minimization problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A primal-dual approximation algorithm for generalized Steiner network problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On the design of approximation algorithms for a class of graph problems
On the design of approximation algorithms for a class of graph problems
Improved approximation algorithms for network design problems
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On approximation of the submodular set cover problem
Operations Research Letters
| Hi-index | 0.00 |