Approximating disjoint-path problems using packing integer programs

A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

Herman Chernoff · The Annals of Mathematical Statistics · 1952 · 3.6K citations · Full text

Asymptotic Efficiency, Convenient Test, Engineering +9

Clique is hard to approximate within n1−ε

Johan Håstad · Acta Mathematica · 1999 · 1.4K citations · Full text

On the ratio of optimal integral and fractional covers

László Lovász · Discrete Mathematics · 1975 · 1.1K citations

Mathematical Programming, Fractional Covers, Engineering +4

Randomized rounding: A technique for provably good algorithms and algorithmic proofs

Prabhakar Raghavan, Clark D. Tompson · COMBINATORICA · 1987 · 1K citations

Secure Multi-party Computation, Cryptographic Primitive, Engineering +12

On the Computational Complexity of Combinatorial Problems

Richard M. Karp · Networks · 1975 · 706 citations

Computational Graph Theory, Engineering, Network Analysis +21