Beating Simplex for Fractional Packing and Covering Linear Programs - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Christos Koufogiannakis, Neal E. Young. Beating Simplex for Fractional Packing and Covering Linear Programs. In 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings. pages 494-504, IEEE Computer Society, 2007. [doi]

The following publications are possibly variants of this publication:

A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear ProgramsChristos Koufogiannakis, Neal E. Young. algorithmica, 70(4):648-674, 2014. [doi]

runs on WebDSL