See this document in CiteSeerX!

Linear Programming with Two Variables per Inequality in Poly-Log Time (1990)  (Make Corrections)  (12 citations)
George S. Lueker, Nimrod Megiddo, Vijaya Ramachandran



  Home/Search   Context   Related

 
View or download:
stanford.edu/%7Emegiddo/pdf...tworj.pdf
Cached:  PDF   PS.gz  PS  Image  Update  Help

From:  stanford.edu/~megiddo/bio (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: The parallel time complexity of the linear programming problem with at most twovariables per inequality is discussed. Let n and m denote the number of variables and the number of inequalities, respectively, in a linear programming problem. We describe an O((log m+log n) time parallel algorithm under the concurrent-read-exclusive-write PRAM model for deciding feasibility. (Update)

Context of citations to this paper:   More

...per inequality (TVPI) It is probably the case that the MDP(2) problem is in NC, meaning that it can be eciently solved in parallel. In [81], the same open question is 139 raised about the TVPI problem. Linear optimization over TVPI is P complete [81] Deterministic MDP...

Cited by:   More
Decidability of Type-checking in the Calculus of Algebraic.. - Blanqui (2005)   (Correct)
Parallel Algorithms for the All-Sources Generalized Shortest.. - Oldham, Pratt (1999)   (Correct)
Maximizing Concave Functions in Fixed Dimension - Cohen, Megiddo (1993)   (Correct)

Similar documents (at the sentence level):
36.6%:   Linear Programming with Two Variables per Inequality in.. - George Lueker (1990)   (Correct)

Active bibliography (related documents):   More   All
0.1:   Computational Complexity of an Optical Model of Computation - Woods (2005)   (Correct)
0.1:   Upper Bounds on the Computational Power of an Optical Model of.. - Woods (2005)   (Correct)
0.1:   Parallel Computation: Models and Complexity Issues - Greenlaw, Hoover (1996)   (Correct)

Similar documents based on text:   More   All
0.4:   Tight Bounds and 2-Approximation Algorithms for.. - Hochbaum, Megiddo.. (1992)   (Correct)
0.2:   An Efficient Parallel Algorithm for the General Planar.. - Ramachandran, Yang (1994)   (Correct)
0.2:   Workshop on Parallel Algorithms: From Solving Combinatorial.. - Flanagan, al. (1993)   (Correct)

Related documents from co-citation:   More   All
6:   Improved Algorithms for Linear Inequalities with Two Variables per Inequality (context) - Cohen, Megiddo - 1991
4:   Two easy theories whose combination is hard - Pratt - 1977
4:   Simple and fast algorithms for linear and integer programs with two variables pe.. (context) - Hochbaum, Naor - 1994

BibTeX entry:   (Update)

G. S. Lueker, N. Megiddo, and V. Ramachandran. Linear programming with two variables per inequality in poly log time. SIAM J. Comput., 19(6):1000--1010, 1990. http://citeseer.ist.psu.edu/article/lueker90linear.html   More

@inproceedings{ lueker86linear,
    author = "G. S. Lueker and N. Megiddo and V. Ramachandran",
    title = "Linear programming with two variables per inequality in poly-log time",
    pages = "196--205",
    year = "1986",
    url = "citeseer.ist.psu.edu/article/lueker90linear.html" }
Citations (may not include all citations):
303   Princeton University Press (context) - Ford, Fulkerson et al.
268   Parallel algorithms for shared memory machines (context) - Karp, Ramachandran
58   On relating time and space to size and depth (context) - Borodin
25   The maximum flow problem is log space complete for P (context) - Goldschlager, Shaw et al.
19   Linear programming is log space hard for P (context) - Dobkin, Lipton et al.
8   Synchronous parallel computation (context) - Goldschlager
3   Fast scheduling problems on parallel computers (context) - Helmbold, Mayr
2   The parallel evaluation of expressions (context) - Brent



The graph only includes citing articles where the year of publication is known.

Documents on the same site (http://theory.stanford.edu/~megiddo/bio.html):   More
Efficient Computation of Equilibria for Extensive.. - Koller, Megiddo, von.. (1995)   (Correct)
A Note on Total Functions, Existence Theorems, and.. - Megiddo, Papadimitriou (1989)   (Correct)
Tight Bounds and 2-Approximation Algorithms for.. - Hochbaum, Megiddo.. (1992)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC