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

Simple item page
dc.creatorJain, Kamal
dc.creatorMahdian, Mohammad
dc.creatorMarkakis, Evangelos
dc.creatorSaberi, Amin
dc.creatorVazirani, Vijay V.
dc.date2002-07-09
dc.date.accessioned2026-07-07T03:18:37Z
dc.date.available2026-07-07T03:18:37Z
dc.descriptionIn 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.
dc.description28 pages, 2 figures, 4 tables, abstract appeared in STOC 2002 Montreal
dc.identifierhttps://arxiv.org/abs/cs/0207028
dc.identifierhttp://arxiv.org/abs/cs/0207028
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31184
dc.subjectData Structures and Algorithms
dc.subjectComputer Science and Game Theory
dc.subjectF.2.2;G.2.1;G.2.2
dc.titleGreedy Facility Location Algorithms Analyzed using Dual Fitting with Factor-Revealing LP
dc.typetext

Files

Collections

arXiv