Local Search Heuristics for k -Median and Facility Location Problems

We analyze local search heuristics for the metric k-median and facility location problems. We define the locality gap of a local search procedure for a minimization problem as the maximum ratio of a locally optimum solution (obtained using this procedure) to the global optimum. For k-median, we show...

Full description

Saved in:

Bibliographic Details
Published in:	SIAM journal on computing Vol. 33; no. 3; pp. 544 - 562
Main Authors:	Arya, Vijay, Garg, Naveen, Khandekar, Rohit, Meyerson, Adam, Munagala, Kamesh, Pandit, Vinayaka
Format:	Journal Article
Language:	English
Published:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2004
Subjects:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Approximation Computer science Computer science; control theory; systems Costs Exact sciences and technology Heuristic Mathematical programming Operational research and scientific management Operational research. Management science Optimization. Search problems Permits Theoretical computing Traveling salesman problem Facility location Local search Operations research Minimization Global optimum Approximation algorithm Location problem
ISSN:	0097-5397, 1095-7111
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!