Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

ICS
2010
Tsinghua U.

favoriteEmaildiscussreport

205views Distributed And Parallel Com...» more ICS 2010»

A New Approach to Strongly Polynomial Linear Programming

14 years 8 months ago

A New Approach to Strongly Polynomial Linear Programming

Download conference.itcs.tsinghua.edu.cn

Mihály Bárász, Santosh Vempala

Real-time Traffic

ICS 2010 | Theoritical Computer Science |

claim paper

Related Content

» Minimum ratio canceling is oracle polynomial for linear programming but not strongly polyn...

» A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time

» Bicriteria Network Design via Iterative Rounding

» Rationality and Strongly Polynomial Solvability of EisenbergGale Markets with Two Agents

» Random walks on polytopes and an affine interior point method for linear programming

» Solving Nonlinear Polynomial Arithmetic via SAT Modulo Linear Arithmetic

» Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs

» A New Practically Efficient Interior Point Method for LP

» A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanent...

Post Info
More Details (n/a)

Added	02 Mar 2010
Updated	02 Mar 2010
Type	Conference
Year	2010
Where	ICS
Authors	Mihály Bárász, Santosh Vempala

Comments (0)