Approximability of Dense Instances of NEAREST CODEWORD Problem
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
A Polynomial Time Approximation Scheme for Dense MIN 2SAT
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
Random Structures & Algorithms
Improved approximation results for the stable marriage problem
ACM Transactions on Algorithms (TALG)
A 1.875: approximation algorithm for the stable marriage problem
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A (2 - c1/√N)-approximation algorithm for the stable marriage problem
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
| Hi-index | 0.00 |