Approximation of k-set cover by semi-local optimization
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximating discrete collections via local improvements
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A better differential approximation ratio for symmetric TSP
Theoretical Computer Science
New differential approximation algorithm for k-customer vehicle routing problem
Information Processing Letters
Three-quarter approximation for the number of unused colors in graph coloring
Information Sciences: an International Journal
Linear kernels in linear time, or how to save k colors in O(n2) steps
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
The maximum saving partition problem
Operations Research Letters
Hi-index | 0.89 |