Efficient recovery from power outage (extended abstract)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Efficient recovery from power outage (extended abstract)

Full text

Pdf (812 KB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the thirty-first annual ACM symposium on Theory of computing table of contents

Atlanta, Georgia, United States

Pages: 574 - 582

Year of Publication: 1999

ISBN:1-58113-067-8

Authors

Sudipto Guha	Computer Science Department, Stanford University, Stanford, CA
Anna Moss	Computer Science Department, Technion, Haifa 32000, Israel
Joseph (Seffi) Naor	Bell Laboratories, Lucent Technologies, 600 Mountain Ave., Murray Hill, NJ
Baruch Schieber	IBM T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 29, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/301250.301406 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	As	"ASCADA: Software Solutions for Utilities", more information on their offering can be found in http://www.ascada.com/external/products- /tcs/tcs_prod.htm.
	BBL95	O. Berman, D. Bertsimas, and R. C. Larson, "Locating Discretionary Service Fadlities, II: Maximizing Market Size, Minimizing Inconvenience", Operations Research, 43:623-632, 1995
	BLF92	O. Berman, R. C. Larson, and N. Fouska, "Optimal Location of Discretionary Service Facilities", Transportation Science, 26:201-211, 1992
	BRV96	Avrim Blum , R. Ravi , Santosh Vempala, A constant-factor approximation algorithm for the k MST problem (extended abstract), Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.442-448, May 22-24, 1996, Philadelphia, Pennsylvania, United States [doi>10.1145/237814.237992]
	Fe98	Uriel Feige, A threshold of ln n for approximating set cover, Journal of the ACM (JACM), v.45 n.4, p.634-652, July 1998 [doi>10.1145/285055.285059]
	GLV87	B. L. Golden, L. Levy, and R. Vohra, "The orienteering problem", Naval Research Logistics, 34:307-318, 1987.
	Ho97	Dorit S. Hochbaum, Approximation algorithms for NP-hard problems, PWS Publishing Co., Boston, MA, 1996
	KMN98	Samir Khuller , Anna Moss , Joseph (Seffi) Naor, The budgeted maximum coverage problem, Information Processing Letters, v.70 n.1, p.39-45, April 01, 1999 [doi>10.1016/S0020-0190(99)00031-9]
	KR95	Philip Klein , R. Ravi, A nearly best-possible approximation algorithm for node-weighted Steiner trees, Journal of Algorithms, v.19 n.1, p.104-115, July 1995 [doi>10.1006/jagm.1995.1029]
	LT96	C. Letter and J. Tracey, "Next Generation trouble call management system heightens utility responsiveness", Synergy Newsletter, GE Harris Control Division, October 1996.
	MZH83	N. Megiddo, E. Zemel, and S. L. Hakimi. "The Maximum Coverage Location Problem", SIAM Journal on Algebraic and Discrete Methods, 4:253-261, 1983.

CITED BY 4

	Anna Moss , Yuval Rabani, Approximation algorithms for constrained for constrained node weighted steiner tree problems, Proceedings of the thirty-third annual ACM symposium on Theory of computing, p.373-382, July 2001, Hersonissos, Greece
	Mohammad Taghi Hajiaghayi , Kamal Jain, The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, p.631-640, January 22-26, 2006, Miami, Florida
	C. Chekuri , M. T. Hajiaghayi , G. Kortsarz , M. R. Salavatipour, Approximation algorithms for node-weighted buy-at-bulk network design, Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, p.1265-1274, January 07-09, 2007, New Orleans, Louisiana
	Yuval Rabani , Gabriel Scalosub, Bicriteria approximation tradeoff for the node-cost budget problem, ACM Transactions on Algorithms (TALG), v.5 n.2, p.1-14, March 2009