ϵ-approximations with minimum packing constraint violation

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129722, Issue , 1992, Pages 771-782

  Lin, Jyh Han ^a   Vitter, Jeffrey Scott ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMBINATORIAL OPTIMIZATION; COMPUTATION THEORY; COMPUTER GRAPHICS; IMAGE PROCESSING; INTEGER PROGRAMMING; MULTITASKING; OPTIMIZATION; POLYNOMIAL APPROXIMATION; SCHEDULING; TREES (MATHEMATICS); VECTOR QUANTIZATION; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; LINEAR PROGRAMMING;

APPROXIMATION PROBLEMS; CONSTRAINT VIOLATION; DETERMINISTIC METHODS; DISCRETE OPTIMIZATION PROBLEMS; GENERALIZED ASSIGNMENT PROBLEM; INTEGER LINEAR PROGRAMS; MEMORY-BASED LEARNING; PERFORMANCE GUARANTEES;

APPROXIMATION ALGORITHMS; COMPUTATIONAL METHODS;

DISCRETE OPTIMIZATION PROBLEM; GENERALIZED ASSIGNMENT PROBLEM; OMEGA APPROXIMATIONS; OPTIMAL SOLUTIONS; PACKING CONSTRAINT VIOLATIONS; S-MEDIAN PROBLEM; TREE PRUNING PROBLEM;

EID: 0026993999     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/129712.129787     Document Type: Conference Paper

References (29)

1. S. Ahn, A. Cooper, G. Cornuejols, and A. Frieze, "Probabilistic Analysis of a Relaxation for the A-Median Problem," Mathematics of Operations Research 13 (February 1988), 1-31.
2. L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone, Classification Trees and Regression Trees, Wadsworth, Belmont, CA, 1984.
3. P. A. Chou, T. Lookabaugh, and R. M. Gray, "Optimal Pruning with Applications to Tree-Structured Source Coding and Modeling," IEEE Transactions on Information Theory (1989), 299-315.
4. V. Chvátal, "A Greedy Heuristic for the Set-Covering Problem," Mathematics of Operations Research 4(1979), 233-235.
5. T. Feder and D. Greene, "Optimal Algorithms for Approximate Clustering," in Proceedings of the 20th Annual Symposium on the Theory of Computing, 1988, 434-444.
6. M. L. Fisher and D. S. Hochbaum, "Probabilistic Analysis of the Planar X-Median Problem," Mathematics of Operations Research 5 (February 1980), 27-34.
7. M. R. Garey and D. S. Johnson, Computers and intractability: A Guide to the Theory of MV-completeness, W. H. Freeman and Co., San Francisco, CA, 1979.
8. T. F. Gonzalez, "Clustering to Minimize the Maximum Intercluster Distance," Theoretical Computer Science 38(1985), 293-306.
9. M. Grötschel, L. Lovasz, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, Heidelberg, New York, 1988.
10. D. S. Hochbaum, "Heuristics for the Fixed-Cost Median Problem," Mathematical Programming 22(1982), 148-162.
11. D. S. Hochbaum and D. B. Shmoys, "Using Dual Approximation Algorithms for Scheduling Problems: Practical and Theoretical Results," Journal of the Association for Computing Machinery 34(1987), 144-162.
12. D. S. Hochbaum and D. B. Shmoys, "A Unified Approach to Approximation Algorithms for Bottleneck Problems," Journal of the Association for Computing Machinery 33 (July 1986), 533-550.
13. D. S. Johnson, "Approximation Algorithms for Combinatorial Problems," Journal of Computer and System Sciences 9(1974), 256-278.
14. O. Kariv and S, L. Hakimi, "An Algorithmic Approach to Network Location Problems. II: The p-MecUans," SIAM Journal on Applied Mathematics (1979), 539-560.
15. N. Karmarkar, "A New Polynomial-Time Algorithm for Linear Programming," Combina-torica 4(1984), 373-395.
16. L. G. Khachiyan, "A Polynomial Algorithm in Linear Programming," Soviet Math. Doklady 20(1979), 191-194.
17. H. W. Kuhn, "The Hungarian Method for the Assignment Problem," Naval Research Logistics Quarterly 2 (1955), 83-97.
18. E. L. Lawler and J. Labetoulle, "On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming," Journal of ACM 25 (October 1978), 612-61.
19. J. K. Lenstra, D. B. Shmoys, and É. Tardos, "Approximation Algorithms for Scheduling Unrelated Parallel Machines," Mathematical Programming A 46(1990), 259-271.
20. J. Lin, J. A. Storer, and M. Cohn, "On the Complexity of Optimal Tree Pruning for Source Coding," in Proceedings of the Data Compression Conference, J. A. Storer and J. H. Reif, eds., Snowbird, Utah, April 1991, 63-72.
21. J.-H. Lin and J. S. Vitter, "A Theory for Memory-Based Learning," Technical Report, Dept. of Computer Science, Brown University, 1992.
22. J.-H. Lin and J. S. Vitter, "Nearly Optimal Vector Quantization via Linear Programming," in Proceedings of the IEEE Data Compression Conference, Snowbird, Utah, March 1992.
23. L. Lovász, "On the Ratio of Optimal Integral and Fractional Covers," Discrete Mathematics 13(1975), 383-390.
24. N. Megiddo and K. J. Supowit, "On the Complexity of Some Common Geometric Location Problems," SIAM Journal on Computing 13 (1984), 182-196.
25. C. H. Papadimitriou, "Worst-case and Probabilistic Analysis of a Geometric Location Problem," SIAM Journal on Computing 10(1981), 542-557.
26. P. Raghavan, "Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs," Journal of Computer and System Science 37(1988), 130-143.
27. P. Raghavan and CD. Thompson, "Randomized Rounding: A Technique for Provably Good Algorithms and Algorithmic Proofs," Combinatorics 7(1987), 365-374.
28. S. Sahni and T. F. Gonzalez, "P-Complete Approximation Problems," Journal of the Association for Computing Machinery 23 (July, 1976), 555-565.
29. D. B. Shmoys and E. Tardos, Personal Communication, January 23, 1992.