Now showing items 1-1 of 1

    • Algorithmic and game-theoretic perspectives on scheduling 

      Uhan, Nelson A. (Nelson Alexander) (Massachusetts Institute of Technology, 2008)
      (cont.) Second, for almost all 0-1 bipartite instances, we give a lower bound on the integrality gap of various linear programming relaxations of this problem. Finally, we show that for almost all 0-1 bipartite instances, ...