A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Seller-Focused Algorithms for Online Auctioning
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Job Shop Scheduling Problems with Controllable Processing Times
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Combining Arithmetic and Geometric Rounding Techniques for Knapsack Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Approximated consistency for the automatic recording constraint
Computers and Operations Research
The practice of approximated consistency for Knapsack constraints
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Investigations of continual computation
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Minimization of ordered, symmetric half-products
Discrete Applied Mathematics
Hybrid rounding techniques for knapsack problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
Integrality gaps of linear and semi-definite programming relaxations for Knapsack
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Prompt mechanism for ad placement over time
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Further reflections on a theory for basic algorithms
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Dynamically selecting composition algorithms for economical composition as a service
ICSOC'11 Proceedings of the 9th international conference on Service-Oriented Computing
Approximate formulations for 0-1 knapsack sets
Operations Research Letters
A total-value greedy heuristic for the integer knapsack problem
Operations Research Letters
Constant-Time approximation algorithms for the knapsack problem
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
A scheduling problem with one producer and the bargaining counterpart with two producers
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
On the admission of dependent flows in powerful sensor networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Fully polynomial approximation algorithms for knapsack problems are presented. These algorithms are based on ideas of Ibarra and Kim, with modifications which yield better time and space bounds, and also tend to improve the practicality of the procedures. Among the principal improvements are the introduction of a more efficient method of scaling and the use of a median-finding routine to eliminate sorting. The 0-1 knapsack problem, for n items and accuracy ε 0, is solved in (n log(1/ε) + 1/ε4) time and 0(n + 1/ε3) space. The time bound is reduced to 0(n + 1/ε3) for the "unbounded" knapsack problem. For the "subset-sum" problem, 0(n + 1/ε3) time and 0(n + 1/ε2) space, or 0(n + 1/ε2 log (1/ε)) time and space, are achieved. The "multiple choice" problem, with m equivalence classes, is solved in 0(nm2/ε) time and space.