Electronic Notes in Discrete Mathematics · 2007 · 29 citations · 10 references
ComputingComputer ScienceMathematicsAlgorithmsComputational GeometryTheory Of ComputationApproximation AlgorithmsComputational ComplexityDimension ReductionDimensionality ReductionMatroid TheoryMetric GeometryApproximation HardnessHardness AssumptionsSubmodularity In Matroids
10
On the ratio of optimal integral and fractional covers
László Lovász · Discrete Mathematics · 1975 · 1.1K citations
A Decomposition Theorem for Partially Ordered Sets
R. P. Dilworth · Annals of Mathematics · 1950 · 987 citations
Ben Dushnik, E. W. Miller · American Journal of Mathematics · 1941 · 943 citations
On the hardness of approximating minimization problems
Carsten Lund, Mihalis Yannakakis · Journal of the ACM · 1994 · 890 citations · Full text