Results 1  10
of
2,064,741
Parallel Algorithms for the Assignment and MinimumCost Flow Problems
"... Let G = (V; E) be a network for an assignment problem with 2n nodes and m edges, in which the largest edge cost is C. Recently the class of instances of bipartite matching problems has been shown to be in RNC provided that C is O(log k n) for some fixed k. We show how to use scaling so as to dev ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
as to develop an improved parallel algorithm and show that bipartite matching problems are in the class RNC provided that C = O(n log k n ) for some fixed k. We then generalize these results to minimumcost flow problems. Let U be an upper bound on the capacities of the edges and on the largest demand. We
MINIMUMCOST FLOW PROBLEM AND APPLICATIONS IN NETWORKS
"... We consider the problem of finding the minimum cost of a feasible flow in directed networks. We allow realvalued upper bounds and convex and differentiable cost functions for the flows on arcs. In this paper, we present an efficient algorithm to solve such a large class of minimum cost flow problem ..."
Abstract
 Add to MetaCart
We consider the problem of finding the minimum cost of a feasible flow in directed networks. We allow realvalued upper bounds and convex and differentiable cost functions for the flows on arcs. In this paper, we present an efficient algorithm to solve such a large class of minimum cost flow
Multiple Objective Minimum Cost Flow Problems: A Review
, 2005
"... In this paper, theory and algorithms for solving the multiple objective minimum cost flow problem are reviewed. For both the continuous and integer case exact and approximation algorithms are presented. In addition, a section on compromise solutions summarizes corresponding results. The reference li ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In this paper, theory and algorithms for solving the multiple objective minimum cost flow problem are reviewed. For both the continuous and integer case exact and approximation algorithms are presented. In addition, a section on compromise solutions summarizes corresponding results. The reference
for Shortest Path, Assignment and Minimum Cost Flow Problems
, 1988
"... r I '.Iii 1.; i i:. " i_·... _· I r. ..."
The Budgeted Minimum Cost Flow Problem with Unit Upgrading Cost
, 2015
"... The budgeted minimum cost flow problem (BMCF(K)) with unit upgrading costs extends the classical minimum cost flow problem by allowing to reduce the cost of at most K arcs. In this paper, we consider complexity and algorithms for the special case of an uncapacitated network with just one source. By ..."
Abstract
 Add to MetaCart
The budgeted minimum cost flow problem (BMCF(K)) with unit upgrading costs extends the classical minimum cost flow problem by allowing to reduce the cost of at most K arcs. In this paper, we consider complexity and algorithms for the special case of an uncapacitated network with just one source
n) Algorithm for the Minimum Cost Flow Problem
"... In this paper we present an Õ(m√n log2 U) time algorithm for solving the maximum flow problem on directed graphs with m edges, n vertices, and capacity ratio U. This improves upon the previous fastest running time of O(mmin (n2/3,m1/2) log (n2/m) logU) achieved over 15 years ago by Goldberg and Ra ..."
Abstract
 Add to MetaCart
of maximum flow, minimum cost flow, and lossy generalized minimum cost flow and applying analysis by Daitch and Spielman[5] we achieve running time of Õ(m√n log2(U/)) for these problems as well. Furthermore, our algorithm is parallelizable and using a recent nearly linear time work polylogarithmic depth
Context Comparison as a Minimum Cost Flow Problem
"... Comparing word contexts is a key component of many NLP tasks, but rarely is it used in conjunction with additional ontological knowledge. One problem is that the amount of overhead required can be high. In this paper, we provide a graphical method which easily combines an ontology with contextual in ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Comparing word contexts is a key component of many NLP tasks, but rarely is it used in conjunction with additional ontological knowledge. One problem is that the amount of overhead required can be high. In this paper, we provide a graphical method which easily combines an ontology with contextual
Context Comparison as a Minimum Cost Flow Problem
"... Comparing word contexts is a key component of many NLP tasks, but rarely is it used in conjunction with additional ontological knowledge. One problem is that the amount of overhead required can be high. In this paper, we provide a graphical method which easily combines an ontology with contextual in ..."
Abstract
 Add to MetaCart
Comparing word contexts is a key component of many NLP tasks, but rarely is it used in conjunction with additional ontological knowledge. One problem is that the amount of overhead required can be high. In this paper, we provide a graphical method which easily combines an ontology with contextual
Genuinely Polynominal Simplex and NonSimplex Algorithms for the Minimum Cost Flow Problem
, 1984
"... We consider the minimum cost network flow problem min(cx: Ax=b, x> 0) on a graph G = (V,E). First we give a minor modification of EdmondsKarp scaling technique, and we show that it solves the minimum cost flow problem in 0((IV12 log IVI)(IEI + IVi log VI)) steps. We also provide two dual simplex ..."
Abstract
 Add to MetaCart
We consider the minimum cost network flow problem min(cx: Ax=b, x> 0) on a graph G = (V,E). First we give a minor modification of EdmondsKarp scaling technique, and we show that it solves the minimum cost flow problem in 0((IV12 log IVI)(IEI + IVi log VI)) steps. We also provide two dual
Results 1  10
of
2,064,741