Now showing items 1-3 of 3

    • The (parallel) approximability of non-Boolean satisfiability problems and restricted integer programming 

      Serna Iglesias, María José; Trevisan, Luca; Xhafa Xhafa, Fatos (1997-06)
      External research report
      Open Access
      We present parallel approximation algorithms for maximization problems expressible by integer linear programs of a restricted syntactic form introduced recently by Barland et al. One of our motivations was to show ...
    • The parallel complexity of positive linear programming 

      Trevisan, Luca; Xhafa Xhafa, Fatos (1998-12)
      Article
      Open Access
      In this paper we study the parallel complexity of Positive Linear Programming (PLP), i.e. the special case of Linear Programming in packing/covering form where the input constraint matrix and constraint vector consist ...
    • The Parallel complexity of positive linear programming 

      Trevisan, Luca; Xhafa Xhafa, Fatos (1996-09)
      External research report
      Open Access
      In this paper we study the parallel complexity of Positive Linear Programming (PLP), i.e. the special case of Linear Programming in packing/covering form where the input constraint matrix and constraint vector consist ...