search
Get Started
search

Best Approximation

Updated Daily
Filter by Tags

Rankings use category fit, feature coverage, pricing signals, public reception, and recency. Affiliate relationships do not affect scores.

0.0 - 10.0
Best 1 Sanjeev Arora

Sanjeev Arora is an American theoretical computer scientist and a professor at Princeton University. He is best known for his co-discovery of the PCP theorem in 1998, a landmark result in computational complexity theory that established the hardness of approximating many NP-hard problems. His resear...

2 Lloyd Trefethen

Lloyd N. Trefethen is a British numerical analyst and professor at the University of Oxford. He is known for his work in numerical analysis, spectral methods for differential equations, and matrix computations. He authored influential textbooks including 'Numerical Linear Algebra' and 'Spectral Meth...

3 Ravi Kannan

Ravi Kannan is an Indian computer scientist known for his contributions to theoretical computer science and applied mathematics. He is affiliated with Microsoft Research India and has held academic positions including at Carnegie Mellon University and Yale University. His work includes foundational...

4 Vijay Vazirani

Vijay Vazirani is a computer scientist who works on approximation algorithms, matching theory, and algorithmic game theory. He co-developed algorithms for finding maximum matchings in graphs and wrote the textbook "Approximation Algorithms." Vazirani's work has helped establish approximation algorit...

5 Satish Rao
Satish Rao

Satish Rao is an American computer scientist and professor at UC Berkeley. He is known for foundational contributions to approximation algorithms for graph partitioning and multicommodity flow problems, including work with Tom Leighton on flow-based graph decomposition. His research has influenced a...

6 Prasad Raghavendra

Prasad Raghavendra is a theoretical computer scientist and professor at UC Berkeley. He is best known for proving that semidefinite programming relaxations, combined with rounding schemes, achieve the best possible approximation ratios for all constraint satisfaction problems assuming the Unique Gam...

7 David Shmoys

David Shmoys is an American computer scientist and professor at Cornell University. He is known for foundational contributions to the design and analysis of approximation algorithms for combinatorial optimization problems, with applications to scheduling, network design, and facility location. He co...

Computer Scientist American Algorithms Cornell Approximation Combinatorial Optimization
You've reached the end — 7 items

Save to your list

Save your favorites and follow how their scores change over time.

Save favorites
Get updates
Compare scores

Already have an account? Sign in

Compare Items

See how they stack up against each other

Comparing
VS
Select 1 more item to compare