Positive Linear Programming Extensions: Parallel Complexity and Applications (Research Note)

Authors:
Pavlos Efraimidis;Paul G. Spirakis
Affiliations:
-;-
Venue:
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Year:
2000

Citing 8
Cited 0

Randomized rounding: a technique for provably good algorithms and algorithmic proofs

Combinatorica - Theory of Computing
The complexity of parallel search

Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Approximation algorithms for scheduling unrelated parallel machines

Mathematical Programming: Series A and B
Approximating linear programming is log-space complete for P

Information Processing Letters
A parallel approximation algorithm for positive linear programming

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An approximation algorithm for the generalized assignment problem

Mathematical Programming: Series A and B
Limits to parallel computation: P-completeness theory

Limits to parallel computation: P-completeness theory
Global Optimization Using Local Information with Applications to Flow Control

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.