Article

Free access

Greedy strikes back: improved facility location algorithms

Authors:

Sudipto Guha,

Samir KhullerAuthors Info & Claims

SODA '98: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms

Pages 649 - 657

Published: 01 January 1998 Publication History

PDF eReader

References

[1]

M. L. Balinsld, "On finding integer solutions to linear programs", Proc. of the IBM Scientific Computing Symposium on Combinatorial Problems, pages 225- 248, (1966).

Google Scholar

[2]

G. Cornuejols, G. L. Nemhauser and L. A. Wolsey, "The uncapacitated facility location problem", Discrete Location Theory (ed: Mixchaztdaa-ai a~ad Ftaztcis), pages 119-171, (1990).

Google Scholar

[3]

U. Feige, "A threshold of ha n for approximating setcover", 28th A CM Symposium on Theory of Computing, pages 314-318, (1996).

Digital Library

Google Scholar

[4]

D. S. Hochbaum, "Heuristics for the fixed cost median problem", Mathematical Programming, 22: 148-162, (1982).

Google Scholar

[5]

D. S. Hochbaum (Ed), Approximation algorithms/or NP-hard problems, PWS Publiski~g Co., Boston, MA, 1996.

Digital Library

Google Scholar

[6]

M. Korupolu, C. G. Plaxton and R. Rajaraman, "Analysis of a local search heuristic for fazility location problems", 9th A CM-SIAM Annual Symposium on Discrete Algorithms, (1998).

Digital Library

Google Scholar

[7]

A. A. Kuehn and M. J. Hamburger, "A heuristic program for locating warehouses", Management Science, 9:643-666, (19~3).

Google Scholar

[8]

J.-H. Lin and J. S. Vitter, "Approximation algorithms for geometric median problems", Information Processing Letters, 44:245-249, (1992).

Digital Library

Google Scholar

[9]

C. Lund and M. Yunna, "On the hardness of approximating minimization problems", Journal of the ACM, 41(5): 960-981, (1994).

Digital Library

Google Scholar

[10]

A. S. Manne, "Plant location under economies-ofscale-decentralization and computation", Management Science, 11:213-235, (1964).

Google Scholar

[11]

A. Mirzain, " Lagrangian Relaxation for the Star-Star Concentrator Location Problem", Networks 15:1-20, (1985).

Google Scholar

[12]

J. M. Mulvey and H. L. Crowder, ~ Cluster Analysis: An Application of Lagrangiazt Relaxation" Management Science 25:329-340, (1979)

Google Scholar

[13]

C. It. Papadimitriou and M. Yannakalds, "Optimization, approximation, and complexity classes " Journal of Computer and System Sciences 43:425-440, (1991).

Google Scholar

[14]

D. Shmoys, E. Tardos a~d K. Aardal, "Approximation algorithms for facility location problems", 29th ACM Symposium on Theory of Computing, pages 265-274, (1997).

Digital Library

Google Scholar

[15]

J. F. Stollsteimer, "A working model for plant numbers and locations", J. Farm Econom., 45: 631-645, (1963).

Google Scholar

Cited By

View all

Li SChan T(2019)On facility location with general lower boundsProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310573(2279-2290)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.5555/3310435.3310573
Chen XLi MWang CWang CZhao YElkind EVeloso MAgmon NTaylor M(2019)Truthful Mechanisms for Location Games of Dual-Role FacilitiesProceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3306127.3331859(1470-1478)Online publication date: 8-May-2019
https://dl.acm.org/doi/10.5555/3306127.3331859
Krishnaswamy RLi SSandeep SDiakonikolas IKempe DHenzinger M(2018)Constant approximation for k-median and k-means with outliers via iterative roundingProceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3188745.3188882(646-659)Online publication date: 20-Jun-2018
https://dl.acm.org/doi/10.1145/3188745.3188882
Show More Cited By

Index Terms

Greedy strikes back: improved facility location algorithms

Recommendations

Greedy Strikes Back

A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some commodity. There are associated costs for locating the facilities, as well ...
Greedy versus recursive greedy: Uncorrelated heuristics for the binary paint shop problem
Abstract
It is well-known that there are instances of the binary paint shop problem for which the recursive greedy heuristic is better than the greedy heuristic. In this note, we give an example of a family of instances where the greedy ...
Greedy by Chance - Stochastic Greedy Algorithms
ICAS '10: Proceedings of the 2010 Sixth International Conference on Autonomic and Autonomous Systems

For many complex combinatorial optimization problems, obtaining good solutions quickly is of value either by itself or as part of an exact algorithm. Greedy algorithms to obtain such solutions are known for many problems. In this paper we present ...

Comments

Information & Contributors

Information

Published In

SODA '98: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms

January 1998

704 pages

ISBN:0898714109

Chairman:
Howard Karloff

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 January 1998

Check for updates

Qualifiers

Article

Conference

SODA98

Sponsor:

SIGACT
SIAM

SODA98: 1998 Conference on Discrete Algorithms

January 25 - 27, 1998

California, San Francisco, USA

Acceptance Rates

Overall Acceptance Rate 411 of 1,322 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

65
Total Citations
View Citations
1,255
Total Downloads

Downloads (Last 12 months)86
Downloads (Last 6 weeks)6

Reflects downloads up to 17 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Li SChan T(2019)On facility location with general lower boundsProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310573(2279-2290)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.5555/3310435.3310573
Chen XLi MWang CWang CZhao YElkind EVeloso MAgmon NTaylor M(2019)Truthful Mechanisms for Location Games of Dual-Role FacilitiesProceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3306127.3331859(1470-1478)Online publication date: 8-May-2019
https://dl.acm.org/doi/10.5555/3306127.3331859
Krishnaswamy RLi SSandeep SDiakonikolas IKempe DHenzinger M(2018)Constant approximation for k-median and k-means with outliers via iterative roundingProceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3188745.3188882(646-659)Online publication date: 20-Jun-2018
https://dl.acm.org/doi/10.1145/3188745.3188882
Bandyapadhyay SInamdar TPai SPemmaraju S(2018)Near-Optimal Clustering in the k-machine modelProceedings of the 19th International Conference on Distributed Computing and Networking10.1145/3154273.3154317(1-10)Online publication date: 4-Jan-2018
https://dl.acm.org/doi/10.1145/3154273.3154317
Li SMarkarian CMeyer Auf Der Heide F(2018)Towards Flexible Demands in Online Leasing ProblemsAlgorithmica10.1007/s00453-018-0420-y80:5(1556-1574)Online publication date: 1-May-2018
https://dl.acm.org/doi/10.1007/s00453-018-0420-y
Kao MKlein P(2017)Iterative partial rounding for vertex cover with hard capacitiesProceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3039686.3039860(2638-2653)Online publication date: 16-Jan-2017
https://dl.acm.org/doi/10.5555/3039686.3039860
Krishnaswamy RSviridenko M(2016)Inapproximability of the Multilevel Uncapacitated Facility Location ProblemACM Transactions on Algorithms10.1145/290705013:1(1-25)Online publication date: 21-Sep-2016
https://dl.acm.org/doi/10.1145/2907050
Hajiaghayi MHu WLi JLi SSaha B(2016)A Constant Factor Approximation Algorithm for Fault-Tolerant k-MedianACM Transactions on Algorithms10.1145/285415312:3(1-19)Online publication date: 25-Apr-2016
https://dl.acm.org/doi/10.1145/2854153
Behsaz BSalavatipour MSvitkina Z(2016)New Approximation Algorithms for the Unsplittable Capacitated Facility Location ProblemAlgorithmica10.1007/s00453-015-0012-z75:1(53-83)Online publication date: 1-May-2016
https://dl.acm.org/doi/10.1007/s00453-015-0012-z
Byrka JFleszar KRybicki BSpoerhase JIndyk P(2015)Bi-factor approximation algorithms for hard capacitated k-median problemsProceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms10.5555/2722129.2722178(722-736)Online publication date: 4-Jan-2015
https://dl.acm.org/doi/10.5555/2722129.2722178
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations