Journal ArticleDOI
Analysis of a Local Search Heuristic for Facility Location Problems
Reads0
Chats0
TLDR
In this article, a simple local search heuristic was proposed to obtain polynomial-time approximation bounds for metric versions of the k-median problem and the uncapacitated facility location problem.About:
This article is published in Journal of Algorithms.The article was published on 2000-10-01. It has received 441 citations till now. The article focuses on the topics: Facility location problem & Local search (optimization).read more
Citations
More filters
Book
Approximation Algorithms
TL;DR: Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results, and conveys the beauty and excitement of work in the field.
Journal ArticleDOI
Facility location models for distribution system design
TL;DR: In this article, the authors present a review of the state-of-the-art in continuous location models and network location models, mixed-integer programming models, and applications for distribution system design.
Journal ArticleDOI
Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation
Kamal Jain,Vijay V. Vazirani +1 more
TL;DR: A new extension of the primal-dual schema and the use of Lagrangian relaxation to derive approximation algorithms for the metric uncapacitated facility location problem and the metric k-median problem achieving guarantees of 3 and 6 respectively.
Proceedings ArticleDOI
Clustering data streams
TL;DR: This work gives constant-factor approximation algorithms for the k-median problem in the data stream model of computation in a single pass, and shows negative results implying that these algorithms cannot be improved in a certain sense.
Book
The Design of Approximation Algorithms
TL;DR: In this paper, the authors present a survey of the central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization.
References
More filters
Book
Network Flows: Theory, Algorithms, and Applications
TL;DR: In-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models are presented.
Journal ArticleDOI
A new polynomial-time algorithm for linear programming
TL;DR: It is proved that given a polytopeP and a strictly interior point a εP, there is a projective transformation of the space that mapsP, a toP′, a′ having the following property: the ratio of the radius of the smallest sphere with center a′, containingP′ to theradius of the largest sphere withCenter a′ contained inP′ isO(n).
Book
Approximation Algorithms for NP-Hard Problems
TL;DR: This book reviews the design techniques for approximation algorithms and the developments in this area since its inception about three decades ago and the "closeness" to optimum that is achievable in polynomial time.
Journal Article
WHO Technical Report.
TL;DR: The Feather River Coordinated Resource Management Group (FR-CRM) has been restoring channel/ meadow/ floodplain systems in the Feather River watershed since 1985 and recognized the possibility of a significant change in carbon stocks in these restored meadows and valleys.
Proceedings ArticleDOI
A new polynomial-time algorithm for linear programming
TL;DR: The algorithm consists of repeated application of such projective transformations each followed by optimization over an inscribed sphere to create a sequence of points which converges to the optimal solution in polynomial-time.