Abstract
In this paper, we propose a general class of linear programs that admit efficient parallel approximations and use it for efficient parallel approximations to hard combinatorial optimization problems.
An extended version of this work is given in [7].
Financial support from the Bodosaki Foundation to perform doctoral studies is gratefully announced. Bodosaki Foundation, Leoforos Amalias 20, 10557 Athina, Greece
Chapter PDF
Keywords
- Combinatorial Optimization Problem
- Lagrangian Relaxation
- Parallel Approximation
- Parallel Complexity
- Unrelated Parallel Machine
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Y. Bartal, J. Byers, and D. Raz. Global optimization using local information with applications to flow control. In 38th IEEE FOCS, pages 303–312, 1997.
D. Dobkin, R.J. Lipton, and S. Reiss. Linear programming is log space hard for p. Information Processing Letters, 8:96–97, 1979.
R. Greenlaw, H. J. Hoover, and W. L. Ruzzo. Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, 1995.
R.M. Karp, E. Upfal, and A. Wigderson. The complexity of parallel search. Journal of Computer and System Sciences, 36(2):225–253, 1988.
J.K. Lenstra, D.B. Shmoys, and É. Tardos. Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming, 46:259–271, 1990.
M. Luby and N. Nisan. A parallel approximation algorithm for positive linear programming. In 25th ACM Symp. on Theory of Computing, pages 448–457, 1993.
P.S. Efraimidis and P.G. Spirakis. Positive linear programming extensions: Parallel complexity and applications. Technical Report TR00.06.01, Computer Technology Institute, June 2000.
P. Raghavan and C.D. Thompson. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 7:365–374, 1987.
A.S. Schulz, D.B. Shmoys, and D.P. Williamson. Approximation algorithms. In Proc. National Academy of Sciences, volume 94, pages 12734–12735, 1997.
M. Serna. Approximating linear programming is log-space complete for p. Information Processing Letters, 37(4):233–236, 1991.
D. Shmoys and É. Tardos. An approximation algorithm for the generalized assignment problem. Mathematical Programming, A62:461–474, 1993.
L. Trevisan and F. Xhafa. The parallel complexity of positive linear programming. Parallel Processing Letters, pages 448–457, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Efraimidis, P.S., Spirakis, P.G. (2000). Positive Linear Programming Extensions: Parallel Complexity and Applications. In: Bode, A., Ludwig, T., Karl, W., Wismüller, R. (eds) Euro-Par 2000 Parallel Processing. Euro-Par 2000. Lecture Notes in Computer Science, vol 1900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44520-X_60
Download citation
DOI: https://doi.org/10.1007/3-540-44520-X_60
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67956-1
Online ISBN: 978-3-540-44520-3
eBook Packages: Springer Book Archive