A parallel approximation algorithm for positive linear programming

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129585, Issue , 1993, Pages 448-457

  Luby, Michael ^a   Nisan, Noam ^b  

^a INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATION THEORY; LINEAR PROGRAMMING; OPTIMIZATION; CONSTRAINT THEORY; PARALLEL PROCESSING SYSTEMS; PROGRAM PROCESSORS; VECTORS;

CONSTRAINT VECTORS; INPUT CONSTRAINTS; LINEAR PROGRAMMING OPTIMIZATION; PARALLEL APPROXIMATION ALGORITHMS; PARALLEL IMPLEMENTATIONS; POSITIVE LINEAR PROGRAMMING;

APPROXIMATION ALGORITHMS; ALGORITHMS;

PARALLEL APPROXIMATION ALGORITHM; POSITIVE LINEAR PROGRAMMING;

EID: 0027313813     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/167088.167211     Document Type: Conference Paper

References (9)

1. Berger, B., Rompel, J., Shor, P., "Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry", 30th Annual Symposium on Foundations of Computer Science, pp. 54-59, 1989.
2. Chazelle, B., Friedman, J., "A Deterministic View of Random Sampling and Its Use in Geometry", Princeton Technical Report No. CS-TR-436, September 1988. A preliminary version appears in FOCS 1988.
3. Cohen, E., "Approximate max flow on small depth networks", FOCS, 1992, pp. 648-658.
4. Cole, R., "Parallel merge-sort", SIAM J. Comp., 17(4), pp. 770-785, 1988.
5. Ja Ja, J., An Introduction to Parallel Algorithms, Addison Wesley, 1992.
6. Ladner, R., Fischer, M., "Parallel prefix computation", J ACM, 27(4), pp. 831-838, 1980.
7. Lund, C., Yannakakis, M., "On the Hardness of Approximating Minimization Problems", preprint.
8. Plotkin, S., Shmoys, D., Tardos, E., "Fast Approximation Algorithms for Fractional Packing and Covering Problems", Stanford Technical Report No. STAN-CS-92- 1419, February 1992.
9. Raghavan, P., "Probabilistic construction of deterministic algorithms: Approximating packing integer programs", JCSS, October 1988, Vol. 37, pp 130-143.