Greedy Facility Location Algorithms Analyzed using Dual Fitting with Factor-Revealing LP

Details Greedy Facility Location Algorithms Analyzed using Dual Fitting with Factor-Revealing LP Greedy Facility Location Algorithms Analyzed using Dual Fitting with Factor-Revealing LP

2002-07-09

arxiv.org/abs/cs/0207028v1

Computer Science

Data Structures and Algorithms

28 pages, 2 figures, 4 tables, abstract appeared in STOC 2002 Montreal

Scientific paper

In this paper, we will formalize the method of dual fitting and the idea of factor-revealing LP. This combination is used to design and analyze two greedy algorithms for the metric uncapacitated facility location problem. Their approximation factors are 1.861 and 1.61, with running times of O(mlog m) and O(n^3), respectively, where n is the total number of vertices and m is the number of edges in the underlying complete bipartite graph between cities and facilities. The algorithms are used to improve recent results for several variants of the problem.

Affiliated with

Also associated with

No associations

Rating

Greedy Facility Location Algorithms Analyzed using Dual Fitting with Factor-Revealing LP does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Greedy Facility Location Algorithms Analyzed using Dual Fitting with Factor-Revealing LP, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Greedy Facility Location Algorithms Analyzed using Dual Fitting with Factor-Revealing LP will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-336659