| Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey | Annals of Discrete Mathematics | 1979 | 3.5K |
| Maximizing the spread of influence through a social network | | 2003 | 3.3K |
| Greed is good: algorithmic results for sparse approximation | IEEE Transactions on Information Theory | 2004 | 1.9K |
| Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming | Journal of the ACM | 1995 | 1.8K |
| A threshold of ln n for approximating set cover | Journal of the ACM | 1998 | 1.7K |
| Approximation algorithms for combinatorial problems | Journal of Computer and System Sciences | 1974 | 1.3K |
| Branch-and-Price: Column Generation for Solving Huge Integer Programs | Operations Research | 1998 | 1.3K |
| Stable recovery of sparse overcomplete representations in the presence of noise | IEEE Transactions on Information Theory | 2006 | 1.2K |
| The computational complexity of probabilistic inference using bayesian belief networks | Artificial Intelligence | 1990 | 1.1K |
| Optimization, approximation, and complexity classes | Journal of Computer and System Sciences | 1991 | 1K |
| Model-Based Compressive Sensing | IEEE Transactions on Information Theory | 2010 | 956 |
| Clustering to minimize the maximum intercluster distance | Theoretical Computer Science | 1985 | 857 |
| FemtoCaching: Wireless Content Delivery Through Distributed Caching Helpers | IEEE Transactions on Information Theory | 2013 | 854 |
| An iterative procedure for the polygonal approximation of plane curves | Computer Graphics and Image Processing | 1972 | 782 |
| New Constructive Aspects of the Lovász Local Lemma | Journal of the ACM | 2011 | 765 |
| Approximation Algorithms for Connected Dominating Sets | Algorithmica | 1998 | 750 |
| Efficient algorithms for Web services selection with end-to-end QoS constraints | ACM Transactions on the Web | 2007 | 693 |
| Complexity of vehicle routing and scheduling problems | Networks | 1981 | 691 |
| Scheduling with batching: A review | European Journal of Operational Research | 2000 | 688 |
| Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems | Journal of the ACM | 1998 | 649 |
| The design and analysis of the Generalized Finite Element Method | Computer Methods in Applied Mechanics and Engineering | 2000 | 624 |
| Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems | Journal of the ACM | 1975 | 619 |
| Mining data streams | SIGMOD Record | 2005 | 595 |
| Approximation algorithms for scheduling unrelated parallel machines | Mathematical Programming | 1990 | 581 |
| Methods for task allocation via agent coalition formation | Artificial Intelligence | 1998 | 577 |
