A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem

Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

Óscar H. Ibarra, Chul E. Kim · Journal of the ACM · 1975 · 948 citations · Full text

Approximation Schemes for the Restricted Shortest Path Problem

Refael Hassin · Mathematics of Operations Research · 1992 · 557 citations

Mathematical Programming, Path Planning, Additional Constraint +14

A Combinatorial Proof of the All Minors Matrix Tree Theorem

Seth Chaiken · SIAM Journal on Algebraic and Discrete Methods · 1982 · 341 citations

Graph Minor, Column Sums, Total Unimodularity +14

Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems

A. R. Warburton · Operations Research · 1987 · 323 citations

Mathematical Programming, Pareto Optima, Engineering +15

The dissection of equilateral triangles into equilateral triangles

W. T. Tutte · Mathematical Proceedings of the Cambridge Philosophical Society · 1948 · 261 citations

Duke Math, Engineering, Geometry +17