An efficient fully polynomial approximation scheme for the Subset-Sum Problem
暂无分享,去创建一个
[1] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[2] Hans Kellerer,et al. An Efficient Approximation Scheme for the Subset-Sum Problem , 1997, ISAAC.
[3] Eugene Levner,et al. A Fast Approximation Algorithm For The Subset-Sum Problem , 1994 .
[4] Eugene Levner,et al. Fast approximation algorithms for knapsack type problems , 1980 .
[5] Oscar H. Ibarra,et al. Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.
[6] Uri Zwick,et al. Selecting the median , 1995, SODA '95.
[7] David Pisinger,et al. Linear Time Algorithms for Knapsack Problems with Bounded Weights , 1999, J. Algorithms.
[8] Paolo Toth,et al. Worst-case analysis of greedy algorithms for the subset-sum problem , 1984, Math. Program..
[9] Hans Kellerer,et al. Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem , 2004, J. Comb. Optim..
[10] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[11] Eugene L. Lawler,et al. Fast approximation algorithms for knapsack problems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[12] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[13] R. Bellman. Dynamic programming. , 1957, Science.
[14] Vasek Chvátal,et al. Hard Knapsack Problems , 1980, Oper. Res..
[15] Osman Oguz,et al. A fully polynomial approximation algorithm for the 0-1 knapsack problem , 1981 .
[16] Hans Kellerer,et al. A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem , 1999, J. Comb. Optim..
[17] Paolo Toth,et al. Approximation schemes for the subset-sum problem: Survey and experimental analysis , 1985 .