2008
Faster approximate lossy generalized flow via interior point algorithms
Daitch S, Spielman D. Faster approximate lossy generalized flow via interior point algorithms. 2008, 451-460. DOI: 10.1145/1374376.1374441.Peer-Reviewed Original ResearchInterior-point algorithmSymmetric M-matricesFlow problemLinear systemsPoint algorithmLinear equationsM-matrixGeneralized maximum flow problemMinimum cost flow problemLinear system solverFast approximation algorithmMaximum flow problemNumber of edgesRatios of integersDiagonally Dominant MatricesSystem solverΕ-approximationOptimal costApproximation algorithmFast algorithmParameter rangeMaximum flowEquationsPrevious algorithmsAlgorithm
2003
Smoothed analysis of termination of linear programming algorithms
Spielman D, Teng S. Smoothed analysis of termination of linear programming algorithms. Mathematical Programming 2003, 97: 375-404. DOI: 10.1007/s10107-003-0448-9.Peer-Reviewed Original Research