Results 1  10
of
3,581
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
, 1999
"... We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation scheme for maximum multicommodity flow that is independent of the number of commodities k, and our algorithm improves upon the ru ..."
Abstract

Cited by 110 (8 self)
 Add to MetaCart
We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation scheme for maximum multicommodity flow that is independent of the number of commodities k, and our algorithm improves upon
Multicommodity maxflow mincut theorems and their use in designing approximation algorithms
 J. ACM
, 1999
"... In this paper, we establish maxflow mincut theorems for several important classes of multicommodity flow problems. In particular, we show that for any nnode multicommodity flow problem with uniform demands, the maxflow for the problem is within an O(log n) factor of the upper bound implied by ..."
Abstract

Cited by 357 (6 self)
 Add to MetaCart
In this paper, we establish maxflow mincut theorems for several important classes of multicommodity flow problems. In particular, we show that for any nnode multicommodity flow problem with uniform demands, the maxflow for the problem is within an O(log n) factor of the upper bound implied
Faster and simpler algorithms for multicommodity flow and other fractional packing problems
"... This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We present new faster and much simpler algorithms for these problems. ..."
Abstract

Cited by 325 (5 self)
 Add to MetaCart
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We present new faster and much simpler algorithms for these problems.
The geometry of graphs and some of its algorithmic applications
 COMBINATORICA
, 1995
"... In this paper we explore some implications of viewing graphs as geometric objects. This approach offers a new perspective on a number of graphtheoretic and algorithmic problems. There are several ways to model graphs geometrically and our main concern here is with geometric representations that res ..."
Abstract

Cited by 524 (19 self)
 Add to MetaCart
their geometric images. In this paper we develop efficient algorithms for embedding graphs lowdimensionally with a small distortion. Further algorithmic applications include: 0 A simple, unified approach to a number of problems on multicommodity flows, including the LeightonRae Theorem [29] and some of its ex
Fronts propagating with curvature dependent speed: algorithms based on Hamiltonâ€“Jacobi formulations
, 1988
"... We devise new numerical algorithms, called PSC algorithms, for following fronts propagating with curvaturedependent speed. The speed may be an arbitrary function of curvature, and the front also can be passively advected by an underlying flow. These algorithms approximate the equations of motion, w ..."
Abstract

Cited by 1183 (60 self)
 Add to MetaCart
We devise new numerical algorithms, called PSC algorithms, for following fronts propagating with curvaturedependent speed. The speed may be an arbitrary function of curvature, and the front also can be passively advected by an underlying flow. These algorithms approximate the equations of motion
Active Contours without Edges
, 2001
"... In this paper, we propose a new model for active contours to detect objects in a given image, based on techniques of curve evolution, MumfordShah functional for segmentation and level sets. Our model can detect objects whose boundaries are not necessarily defined by gradient. We minimize an energy ..."
Abstract

Cited by 1206 (38 self)
 Add to MetaCart
an energy which can be seen as a particular case of the minimal partition problem. In the level set formulation, the problem becomes a "meancurvature flow"like evolving the active contour, which will stop on the desired boundary. However, the stopping term does not depend on the gradient
PComplete Approximation Problems
, 1976
"... For Pcomplete problems such as traveling salesperson, cycle covers, 01 integer programming, multicommodity network flows, quadratic assignment, etc, it is shown that the approximation problem is also Pcomplete In contrast with these results, a linear time approximation algorithm for the clusterin ..."
Abstract

Cited by 376 (0 self)
 Add to MetaCart
For Pcomplete problems such as traveling salesperson, cycle covers, 01 integer programming, multicommodity network flows, quadratic assignment, etc, it is shown that the approximation problem is also Pcomplete In contrast with these results, a linear time approximation algorithm
A MarketOriented Programming Environment and its Application to Distributed Multicommodity Flow Problems
 Journal of Artificial Intelligence Research
, 1993
"... Market price systems constitute a wellunderstood class of mechanisms that under certain conditions provide effective decentralization of decision making with minimal communication overhead. In a marketoriented programming approach to distributed problem solving, we derive the activities and resour ..."
Abstract

Cited by 299 (20 self)
 Add to MetaCart
of this approach for a form of multicommodity flow problem, we see that careful construction of the decision process according to economic principles can lead to efficient distributed resource allocation, and that the behavior of the system can be meaningfully analyzed in economic terms. 1. Distributed Planning
A Fluidbased Analysis of a Network of AQM Routers Supporting TCP Flows with an Application to RED
 Proc. SIGCOMM 2000
, 2000
"... In this paper we use jump process driven Stochastic Differential Equations to model the interactions of a set of TCP flows and Active Queue Management routers in a network setting. We show how the SDEs can be transformed into a set of Ordinary Differential Equations which can be easily solved numeri ..."
Abstract

Cited by 417 (21 self)
 Add to MetaCart
cause of tuning problems for RED. We believe this modeling/solution methodology has a great potential in analyzing and understanding various network congestion control algorithms.
Improved bounds for mixing rates of Markov chains and multicommodity flow
 Combinatorics, Probability and Computing
, 1992
"... The paper is concerned with tools for the quantitative analysis of finite Markov chains whose states are combinatorial structures. Chains of this kind have algorithmic applications in many areas, including random sampling, approximate counting, statistical physics and combinatorial optimisation. The ..."
Abstract

Cited by 205 (8 self)
 Add to MetaCart
. The efficiency of the resulting algorithms depends crucially on the mixing rate of the chain, i.e., the time taken for it to reach its stationary or equilibrium distribution. The paper presents a new upper bound on the mixing rate, based on the solution to a multicommodity flow problem in the Markov chain
Results 1  10
of
3,581