Partitioning under the Lp norm

European Journal of Operational Research

Volumn 123, Issue 3, 2000, Pages 585-592

  Goldberg, Robert R ^a   Shapiro, Jacob ^b  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL PROGRAMMING; PROBLEM SOLVING; SET THEORY;

WORST-CASE ANALYSIS;

OPERATIONS RESEARCH;

EID: 0033737231     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00112-5     Document Type: Article

References (10)

1. N. Alon, Y. Azar, G. Woeginger, T. Yadid, Approximation schemes for scheduling, in: Proceedings of the Eighth ACM/SIAM Symposium on Discrete Algorithms, ACM Press, 1997, 493-500.
2. Chandra A.K., Wong C.K. Worst-case analysis of a placement algorithm related to storage allocation. SIAM Journal on Computing. 4(3):1975;249-263.
3. D. Coffman, E. Luecker, Probabilistic Analysis of Packing and Partitioning Algorithms, Wiley, New York, 1991.
4. M.R. Garey, D.S. Johnson, Computers and Intractability, W.H. Freeman and Company, New York, 1979.
5. P.E. Gill, W. Murray, M.H. Wright, Practical Optimization, Academic Press, New York, 1991.
6. Goldberg R., Shapiro J., Waxman J. Approximation algorithm for the partition problem. Congressus Numerantium. 108:1997;141-151.
7. Graham R.L. Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics. 17:1969;263-269.
8. L.A. Hall, Approximation algorithms for scheduling, in: D.S. Hochbaum (Ed.), Approximation algorithms for NP-hard problems, PWS Publishing, 1997, pp. 1-45.
9. Leung J.Y.T., Wei W.D. Tighter bounds on a heuristic for a partition problem. Information Processing Letters. 56:1995;51-57.
10. A.L. Peressini, F.E. Sullivan, J.J. Uhl, The Mathematics of Nonlinear Programming, Springer, New York, 1988.