Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
Coordination complexity of parallel price-directive decomposition
Mathematics of Operations Research
Randomized rounding without solving the linear program
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Approximate Max-Min Resource Sharing for Structured Concave Optimization
SIAM Journal on Optimization
Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential Function
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Approximating a Finite Metric by a Small Number of Tree Metrics
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
An efficient approximation scheme for the one-dimensional bin-packing problem
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Implementation of approximation algorithms for the multicast congestion problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Approximation algorithms for min-max and max-min resource sharing problems, and applications
Efficient Approximation and Online Algorithms
Faster and simpler approximation algorithms for mixed packing and covering problems
Theoretical Computer Science
An approximation algorithm for the general mixed packing and covering problem
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Hi-index | 0.00 |
We implement the algorithm for the max-min resource sharing problem described in [7], using a new line search technique for determining a suitable step length. Our line search technique uses a modified potential function that is less costly to evaluate, thus heuristically simplifying the computation. Observations concerning the quality of the dual solution and oscillating behavior of the algorithm are made. First numerical observations are briefly discussed. In particular we study a certain class of linear programs, namely the computational bottleneck of an algorithm from [8] for solving strip packing with an approach from [10, 13]. For these, we obtain practical running times. Our implementation is able to solve instances for small accuracy parameters ε for which the methods proposed in theory are out of practical interest. More precisely, the technique from improves the known runtime bound of O(M6ln 2(Mn/(at))+M5n/t+ln (Mn/(at))) to the more favourable bound O(M(ε−−3(ε−−2+ln M)+M(ε−−2+ln M))), where n denotes the number of items, M the number of distinct item widths, a the width of the narrowest item and t is a desired additive tolerance. Keywords: Algorithm Engineering, Implementation, Testing, Evaluation and Fine-tuning, Mathematical Programming.