Greed is good: approximating independent sets in sparse and bounded-degree graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
Approximating discrete collections via local improvements
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Approximating maximum independent set in bounded degree graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The importance of being biased
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
An Inherently Parallel Method for Heuristic Problem-Solving: Part II-Example Applications
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 0.00 |