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.
EUCLID / RESEARCH OUTPUT
Book Chapter
Lecture Notes in Computer Science · 2000
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.
CITATION
@inbook{Efraimidis_2000,
title={Positive Linear Programming Extensions: Parallel Complexity and Applications},
ISBN={9783540445203},
ISSN={0302-9743},
url={http://dx.doi.org/10.1007/3-540-44520-X_60},
DOI={10.1007/3-540-44520-x_60},
booktitle={Euro-Par 2000 Parallel Processing},
publisher={Springer Berlin Heidelberg},
author={Efraimidis, Pavlos S. and Spirakis, Paul G.},
year={2000},
pages={456–460}
}