scientific article
From MaRDI portal
Publication:3549731
zbMath1231.68282MaRDI QIDQ3549731
Samuel I. Daitch, Daniel A. Spielman
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (18)
Minimum Cuts in Surface Graphs ⋮ Iteratively reweighted least squares and slime mold dynamics: connection and convergence ⋮ Unit Capacity Maxflow in Almost $m^{4/3}$ Time ⋮ A Simple Efficient Interior Point Method for Min-Cost Flow ⋮ Minimum-cost flows in unit-capacity networks ⋮ A survey on exact algorithms for the maximum flow and minimum‐cost flow problems ⋮ Minimum cost flow in the CONGEST model ⋮ Hardness of graph-structured algebraic and symbolic problems ⋮ Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model ⋮ Hardness Results for Structured Linear Systems ⋮ Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs ⋮ Polynomial-time algorithms for submodular Laplacian systems ⋮ Min-Cost Flow in Unit-Capacity Planar Graphs ⋮ Malleable scheduling for flows of jobs and applications to MapReduce ⋮ Derandomizing Isolation in Space-Bounded Settings ⋮ Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models ⋮ Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, b-matching, and Unweighted f-factors ⋮ A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
This page was built for publication:
