Results 1  10
of
865
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
Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs
, 2011
"... We describe random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a nearlineartime randomized combinatorial construction that transforms any graph on n vertices into an O(n log n)edge graph on the same vertices whose cuts have approximately t ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
We describe random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a nearlineartime randomized combinatorial construction that transforms any graph on n vertices into an O(n log n)edge graph on the same vertices whose cuts have approximately
Implementing Weighted bMatching Algorithms: Insights from a Computational Study
 IN PROCEEDINGS OF THE WORKSHOP ON ALGORITHM ENGINEERING AND EXPERIMENTATION (ALENEX99
, 2000
"... ... In this paper several algorithmic variants are compared on synthetic and application problem data of very sparse graphs. This study was motivated by the practical need for an efficient bmatching solver for the latter application, namely as a subroutine in our approach to a mesh refinement probl ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
... In this paper several algorithmic variants are compared on synthetic and application problem data of very sparse graphs. This study was motivated by the practical need for an efficient bmatching solver for the latter application, namely as a subroutine in our approach to a mesh refinement
Approximation schemes for Euclidean kMedians And Related Problems
 In Proc. 30th Annu. ACM Sympos. Theory Comput
, 1998
"... In the kmedian problem we are given a set S of n points in a metric space and a positive integer k. We desire to locate k medians in space, such that the sum of the distances from each of the points of S to the nearest median is minimized. This paper gives an approximation scheme for the plane that ..."
Abstract

Cited by 142 (3 self)
 Add to MetaCart
that for any c > 0 produces a solution of cost at most 1 + 1/c times the optimum and runs in time O(n O(c+1) ). The approximation scheme also generalizes to some problems related to kmedian. Our methodology is to extend Arora's [1, 2] techniques for the TSP, which hitherto seemed inapplicable
Improved Combinatorial Algorithms for the Facility Location and kMedian Problems
 In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science
, 1999
"... We present improved combinatorial approximation algorithms for the uncapacitated facility location and kmedian problems. Two central ideas in most of our results are cost scaling and greedy improvement. We present a simple greedy local search algorithm which achieves an approximation ratio of 2:414 ..."
Abstract

Cited by 227 (11 self)
 Add to MetaCart
We present improved combinatorial approximation algorithms for the uncapacitated facility location and kmedian problems. Two central ideas in most of our results are cost scaling and greedy improvement. We present a simple greedy local search algorithm which achieves an approximation ratio of 2
An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
, 2002
"... We design new approximation algorithm for the metric uncapacitated facility location problem. This algorithm is of LP rounding type and is based on a rounding technique developed in [57]. ..."
Abstract

Cited by 40 (3 self)
 Add to MetaCart
We design new approximation algorithm for the metric uncapacitated facility location problem. This algorithm is of LP rounding type and is based on a rounding technique developed in [57].
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
A Hybrid Multistart Heuristic for the Uncapacitated Facility Location Problem
, 2003
"... We present a multistart heuristic for the uncapacitated facility location problem, based on a very successful method we originally developed for the pmedian problem. ..."
Abstract

Cited by 22 (4 self)
 Add to MetaCart
We present a multistart heuristic for the uncapacitated facility location problem, based on a very successful method we originally developed for the pmedian problem.
A new greedy approach for facility location problems
"... We present a simple and natural greedy algorithm for the metric uncapacitated facility location problem achieving an approximation guarantee of 1.61 whereas the best previously known was 1.73. Furthermore, we will show that our algorithm has a property which allows us to apply the technique of Lagra ..."
Abstract

Cited by 143 (9 self)
 Add to MetaCart
We present a simple and natural greedy algorithm for the metric uncapacitated facility location problem achieving an approximation guarantee of 1.61 whereas the best previously known was 1.73. Furthermore, we will show that our algorithm has a property which allows us to apply the technique
Results 1  10
of
865