Approximability results for stable marriage problems with ties
Theoretical Computer Science
Models of greedy algorithms for graph problems
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The greedier the better: an efficient algorithm for approximating maximum independent set
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Using fractional primal-dual to schedule split intervals with demands
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Using fractional primal-dual to schedule split intervals with demands
Discrete Optimization
| Hi-index | 0.00 |