A Cost-Scaling Algorithm for Minimum-Cost Node-Capacitated Multiflow Problem

09/04/2019
by   Hiroshi Hirai, et al.
0

In this paper, we address the minimum-cost node-capacitated multiflow problem in an undirected network. For this problem, Babenko and Karzanov (2012) showed strongly polynomial-time solvability via the ellipsoid method. Our result is the first combinatorial weakly polynomial-time algorithm for this problem. Our algorithm finds a half-integral minimum-cost maximum multiflow in O(m log(nCD)SF(kn, m, k)) time, where n is the number of nodes, m is the number of edges, k is the number of terminals, C is the maximum node capacity, D is the maximum edge cost, and SF(n', m', η) is the time complexity of solving the submodular flow problem in a network of n' nodes, m' edges, and a submodular function with η-time-computable exchange capacity. Our algorithm is built on discrete convex analysis on graph structures and the concept of reducible bisubmodular flows.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/17/2023

Faster Algorithms for Evacuation Problems in Networks with the Single Sink of Small Degree

In this paper, we propose new algorithms for evacuation problems defined...
research
04/05/2018

Distributed Data Compression in Sensor Clusters: A Maximum Independent Flow Approach

Let a cluster (network) of sensors be connected by the communication lin...
research
12/13/2022

Dynamic Maxflow via Dynamic Interior Point Methods

In this paper we provide an algorithm for maintaining a (1-ϵ)-approximat...
research
07/25/2018

Data-Oriented Algorithm for Real-Time Estimation of Flow Rates and Flow Directions in a Water Distribution Network

The aim of this paper is to present how data collected from a water dist...
research
08/05/2020

Robust Minimum Cost Flow Problem Under Consistent Flow Constraints

The robust minimum cost flow problem under consistent flow constraints (...
research
09/25/2020

Covering Tree-Based Phylogenetic Networks

Tree-based phylogenetic networks, which may be roughly defined as leaf-l...
research
08/13/2021

A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton Method

The Quickest Transshipment Problem is to route flow as quickly as possib...

Please sign up or login with your details

Forgot password? Click here to reset