Journal ArticleOPEN ACCESS

Positive linear programming extensions: Parallel complexity and applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2000) 1900 456-460
DOI: 10.1007/3-540-44520-x_60
1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © Springer-Verlag Berlin Heidelberg 2000.

Cite

CITATION STYLE

APA

Efraimidis, P. S., & Spirakis, P. G. (2000). Positive linear programming extensions: Parallel complexity and applications. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1900, 456–460. https://doi.org/10.1007/3-540-44520-x_60

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free