Positive Linear Programming Extensions: Parallel Complexity and Applications
Pavlos S. Efraimidis5 
and Paul G. Spirakis5
| (5) |
Computer Technology Institute, Dept. of Computer Engineering and Informatics, University of Patras, Riga Feraiou 61, 26221 Patras, Greece |
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
References secured to subscribers.