Fast Approximation Algorithms for Fractional Packing and Covering Problems
Data up to Jan 2025
Total Citations Per Year
Abstract
References (18)
Fibonacci heaps and their uses in improved network optimization algorithms
1987 • 2,623 citations
A Linear Programming Approach to the Cutting-Stock Problem
1961 • 1,976 citations
Randomized rounding: A technique for provably good algorithms and algorithmic proofs
1987 • 1,025 citations
Approximation algorithms for scheduling unrelated parallel machines
1990 • 932 citations
Probabilistic construction of deterministic algorithms: Approximating packing integer programs
1988 • 567 citations
An efficient approximation scheme for the one-dimensional bin-packing problem
1982 • 468 citations
The maximum concurrent flow problem
1990 • 444 citations
Fast Approximation Algorithms for Knapsack Problems
1979 • 413 citations
An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms
1988 • 399 citations
Speeding-up linear programming using fast matrix multiplication
1989 • 306 citations
Fast approximation algorithms for multicommodity flow problems
1991 • 205 citations
A new algorithm for minimizing convex functions over convex sets
1989 • 181 citations
The Trim Problem
1957 • 116 citations
An O(n) algorithm for the multiple-choice knapsack linear program
1984 • 91 citations
Fast algorithms for convex quadratic programming and multicommodity flows
1986 • 90 citations
Probabilistic recurrence relations
1991 • 50 citations
Improved approximation algorithms for shop scheduling problems
1991 • 30 citations
A natural randomization strategy for multicommodity flow and related algorithms
1992 • 29 citations