Simple On-Line Algorithms for the Maximum Disjoint Paths Problem

Authors:
Petr Kolman;Christian Scheideler
Affiliations:
Institute for Theoretical Computer Science, Charles University, Malostranskénám. 25, 118 00 Prague, Czech Republic;Department of Computer Science, Johns Hopkins University, 3400 N. Charles Street, Baltimore, MD 21218, USA
Venue:
Algorithmica
Year:
2004

Citing 0
Cited 2

Simple on-line algorithms for the maximum disjoint paths problem

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Single source multiroute flows and cuts on uniform capacity networks

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a convex, or nonlinear, separable minimization problem with constraints that are dual to the minimum cost network flow problem. We show how to reduce this problem to a polynomial number of minimum s,t-cut problems. The solution of the reduced ...