A framework for cost-scaling algorithms for submodular flow problems

  title={A framework for cost-scaling algorithms for submodular flow problems},
  author={Harold N. Gabow},
  journal={Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science},
  • H. Gabow
  • Published 3 November 1993
  • Computer Science
  • Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science
The submodular flow problem includes such problems as minimum-cost network flow, dijoin, edge-connectivity orientation and others. We present a cost-scaling algorithm for submodular flow problems. The algorithm applies to these problems in general; we also examine its efficiency for the dijoin and edge-connectivity orientation problems. A minimum-cost dijoin is found in time O(min{m/sup 1/2/, n/sup 2/3/}nmlog(nN)), where n, m and N denote the number of vertices, number of edges and largest… 

A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows

We consider the submodular flow problem of Edmonds and Giles. A submodular flow is a flow in a network satisfying capacity constraints and flow-boundary constraints given in terms of the base

Centroids, Representations, and Submodular Flows

  • H. Gabow
  • Mathematics, Computer Science
    J. Algorithms
  • 1995
The notion of centroid of a tree is generalized to apply to an arbitrary intersecting family of sets, as well as any crossing family, and the representation is used to improve several submodular flow algorithms.

Algorithms for submodular flows

The state of the art in the developments of the submodular flow algorithms is surveyed and possible directions for further investigations are described, including some possible future research directions.

A Cost-scaling Algorithm for 0-1 Submodular Flows

The Minset-Poset Approach to Representations of Graph Connectivity

  • H. Gabow
  • Computer Science, Mathematics
    ACM Trans. Algorithms
  • 2016
The minset poset is used in algorithms to increase the edge connectivity of a graph by adding the fewest edges possible and is proved to be a variant of the well-known cactus representation of all mincuts.

Random sampling in cut, flow, and network design problems

It is shown that the sparse graph, or skeleton, that arises when the authors randomly sample a graph's edges will accurately approximate the value of all cuts in the original graph with high probability, which makes sampling effective for problems involving cuts in graphs.

An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem

A weight-scaling algorithm for the minimum weight bibranching problem (where W denotes the maximum magnitude of arc weights) is developed.

Efficient splitting off algorithms for graphs

  • H. Gabow
  • Computer Science, Mathematics
    STOC '94
  • 1994
The approach mea a graph transformation that allows efficient computation of cuts that are variants of the minimum s, t-cut, and gives efficient algorithms for finding a well-balanced orientation of an undirected graph or Multigraph.

Submodular Flow Problem with a Nonseparable Cost Function

Two optimality criteria are established, one in Terms of potentials associated with vertices and the other in terms of negative cycles in an auxiliary graph, which are natural extensions of the well-known result for the conventional min-cost flow problem.



A representation for crossing set families with applications to submodular flow problems

A representation for intersecting and crossing families of sets is presented, based on a separator theorem for intersectioning families, which is used to improve several submodular flow algorithms.

Faster Scaling Algorithms for Network Problems

This paper presents algorithms for the assignment problem, the transportation problem, and the minimum-cost flow problem of operations research. The algorithms find a minimum-cost solution, yet run

Scaling algorithms for network problems

  • H. Gabow
  • Computer Science
    24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
  • 1983
This work presents efficient algorithms for network problems that work by scaling the numeric parameters, and gives simple algorithms that match the best time bounds for shortest paths on a directed graph with nonnegative lengths and maximum value network flow.

A matroid approach to finding edge connectivity and packing arborescences

  • H. Gabow
  • Computer Science, Mathematics
    STOC '91
  • 1991
An algorithm that finds k edge-disjoint arborescences on a directed graph in time O(kmn + k3n2)2 is presented, based on two theorems of Edmonds that link these two problems and show how they can be solved.

Finding Minimum-Cost Circulations by Successive Approximation

This work develops a new approach to solving minimum-cost circulation problems that combines methods for solving the maximum flow problem with successive approximation techniques based on cost scaling and shows that a minimum- cost circulation can be computed by solving a sequence of On lognC blocking flow problems.

A Primal-Dual Algorithm for Submodular Flows

Modulo an efficient oracle for minimizing certain submodular functions, a polynomial time procedure is presented which uses only combinatorial steps like building auxiliary digraphs, finding augmenting paths.

Efficient algorithms for independent assignment on graphic and linear matroids

  • H. GabowYing Xu
  • Computer Science, Mathematics
    30th Annual Symposium on Foundations of Computer Science
  • 1989
Efficient algorithms are presented for the matroid intersection problem and generalizations of the cardinality algorithm and the algorithm for weighted intersection, both of which take advantage of greater structure.

Maximal Closure of a Graph and Applications to Combinatorial Problems

This paper generalizes the selection problem discussed by J. M. Rhys [Rhys, J. M. W. 1970. Shared fixed cost and network flows. Management Sci.17 3, November.], J. D. Murchland [Murchland, J. D.

Finding feasible vectors of Edmonds-Giles polyhedra

  • A. Frank
  • Mathematics
    J. Comb. Theory, Ser. B
  • 1984