Results 1  10
of
38
Using random sampling to find maximum flows in uncapacitated undirected graphs
 In Proceedings of the 29th ACM Symposium on Theory of Computing
, 1997
"... vertex capacitated graphs. However, these schemes could not find flows or exactstmincuts, even in uncapacitated graphs. We present new algorithms, based on random sampling, that In this work, we show that sampling can speed up the find maximum flows in undirected uncapacitated graphs. Our fastest ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
vertex capacitated graphs. However, these schemes could not find flows or exactstmincuts, even in uncapacitated graphs. We present new algorithms, based on random sampling, that In this work, we show that sampling can speed up the find maximum flows in undirected uncapacitated graphs. Our fastest
CILITY LOCATION and METRIC UNCAPACITATED FACILITY
, 2011
"... Suppose we are given a graph G = (V, E), with a metric cost function c over the edges. (that is, a cost function which satisfies the triangle inequality). Suppose we have a set of clients D ⊆ V. Consider that facilities can be opened at any client vertex. Each client i ∈ D has an associated demand d ..."
Abstract
 Add to MetaCart
Suppose we are given a graph G = (V, E), with a metric cost function c over the edges. (that is, a cost function which satisfies the triangle inequality). Suppose we have a set of clients D ⊆ V. Consider that facilities can be opened at any client vertex. Each client i ∈ D has an associated demand
An Approximation Scheme for the Uncapacitated Facility Location Problem on Planar Graphs
"... We present an approximation scheme for the planar graph case of the Uncapacitated Facility Location Problem. The scheme is based on an adaptation of the general approach due to Baker and becomes a polynomialtime approximation scheme (PTAS) when all ratios of the transportation cost along an edge to ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present an approximation scheme for the planar graph case of the Uncapacitated Facility Location Problem. The scheme is based on an adaptation of the general approach due to Baker and becomes a polynomialtime approximation scheme (PTAS) when all ratios of the transportation cost along an edge
Lagrangean relaxation with clusters for the uncapacitated facility location problem
 in XIII CLAIO  Congreso LatinoIberoamericano de Investigación Operativa
, 2006
"... A good strategy for the solution of a largescale problem is its division into small ones. In this context, this work explores the lagrangean relaxation with clusters (LagClus) that can be applied to combinatorial problems modeled by conflict graphs. By partitioning and removing the edges that conne ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
A good strategy for the solution of a largescale problem is its division into small ones. In this context, this work explores the lagrangean relaxation with clusters (LagClus) that can be applied to combinatorial problems modeled by conflict graphs. By partitioning and removing the edges
An Animated Demonstration of the Uncapacitated Network Simplex Algorithm
, 2009
"... Operations Research (OR) instructors use visualizations to help teach graph algorithms and data structures. Algorithm visualization is an illustration of abstract concepts included in computer algorithms, making use of either static or dynamic (animated) computer graphics. In this paper we present n ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Operations Research (OR) instructors use visualizations to help teach graph algorithms and data structures. Algorithm visualization is an illustration of abstract concepts included in computer algorithms, making use of either static or dynamic (animated) computer graphics. In this paper we present
ROBUST FAULT TOLERANT UNCAPACITATED FACILITY LOCATION
, 2010
"... In the uncapacitated facility location problem, given a graph, a set of demands and opening costs, it is required to find a set of facilities R, so as to minimize the sum of the cost of opening the facilities in R and the cost of assigning all node demands to open facilities. This paper concerns th ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
In the uncapacitated facility location problem, given a graph, a set of demands and opening costs, it is required to find a set of facilities R, so as to minimize the sum of the cost of opening the facilities in R and the cost of assigning all node demands to open facilities. This paper concerns
Better Random Sampling Algorithms for Flows in Undirected Graphs
, 1997
"... We present better random sampling algorithms for maximum flows in undirected graphs. Our algorithms apply to capacitated or uncapacitated graphs, and find a maximum flow of value v in ~ O( p mnv) time. This improves on a previous bound of ~ O(m 2=3 n 1=3 v) given by the author recently, which ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
We present better random sampling algorithms for maximum flows in undirected graphs. Our algorithms apply to capacitated or uncapacitated graphs, and find a maximum flow of value v in ~ O( p mnv) time. This improves on a previous bound of ~ O(m 2=3 n 1=3 v) given by the author recently
Near Linear Time Approximation Schemes for Uncapacitated and Capacitated b–Matching Problems in Nonbipartite Graphs
, 2013
"... We present the first fully polynomial approximation schemes for the maximum weighted (uncapacitated or capacitated) b–Matching problem for nonbipartite graphs that run in time (near) linear in the number of edges, that is, given any δ> 0 the algorithm produces a (1 − δ) approximation in O(m pol ..."
Abstract
 Add to MetaCart
We present the first fully polynomial approximation schemes for the maximum weighted (uncapacitated or capacitated) b–Matching problem for nonbipartite graphs that run in time (near) linear in the number of edges, that is, given any δ> 0 the algorithm produces a (1 − δ) approximation in O
Greedy Facility Location Algorithms analyzed using Dual Fitting with FactorRevealing LP
 Journal of the ACM
, 2001
"... We present a natural greedy algorithm for the metric uncapacitated facility location problem and use the method of dual fitting to analyze its approximation ratio, which turns out to be 1.861. The running time of our algorithm is O(m log m), where m is the total number of edges in the underlying c ..."
Abstract

Cited by 146 (12 self)
 Add to MetaCart
We present a natural greedy algorithm for the metric uncapacitated facility location problem and use the method of dual fitting to analyze its approximation ratio, which turns out to be 1.861. The running time of our algorithm is O(m log m), where m is the total number of edges in the underlying
Reliability Analysis of Facility Systems Subject to Edge Failures: Based on the Uncapacitated FixedCharge Location Problem
 doi:10.4236/ojdm.2011.13019 Copyright © 2012 SciRes. APM
"... A facility system can be modeled by a connected graph in which the vertices represent entities such as suppliers, distribution centers or customers and the edges represent facilities such as the paths of goods or information. The efficiency, and hence the reliability, of a facility system is to a ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
A facility system can be modeled by a connected graph in which the vertices represent entities such as suppliers, distribution centers or customers and the edges represent facilities such as the paths of goods or information. The efficiency, and hence the reliability, of a facility system is to a
Results 1  10
of
38