Data collection for the sloan digital sky survey - A network-flow heuristic

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 296-303

  Lupton, Robert ^a   Maley, F Miller ^a   Young, Neal ^a,b  

^a PRINCETON UNIVERSITY   (United States)

^b Dartmouth Department of Computer Science_Dartmouth College   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; OPTIMIZATION;

COMBINATORIAL OPTIMIZATION PROBLEMS; DATA COLLECTION; NETWORK FLOWS; NETWORK-FLOW THEORY; SLOAN DIGITAL SKY SURVEY;

SURVEYS;

EID: 0141878439     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. Agarwal and Sharir. Planar geometric location problems. Algorithmica, 11, 1994.
2. P. K. Agarwal and M. Sharir. Planar geometric location problems and maintaining the width of a planar set. In Proc. 2nd ACM-SIAM Sympos, Discrete Algorithms, pages 449-458, 1991.
3. Bar-Ilan, Kortsarz, and Peleg. How to allocate network centers. Journal of Algorithms, 15, 1993.
4. Hervé Broriniman. Personal communication. 1994.
5. H. Brönnimann. Almost optimal set covers in bounded VC-dimension. In Proc. of the 10th Annual Symposium on Computational Geometry, 1994.
6. G. Cornuejols, R. Sridharan, and J.M. Thizy. A comparison of heuristics and relaxations for the capacitated plant location problem. European journal of operational research, 50(3):280, February 1991.
7. Robert P. Crease. How technique is changing science. Science, 257:344-353, July 7 1992.
8. Erkut, Francis, and Tamir. Distance-constrained multifacility minimax location problems on tree networks. Networks: An International Journal, 22, 1992.
9. M. L. Fisher and D. S. Hochbaum. Probabilistic analysis of the planar k-median problem. Mathematics of Operations Research, 5:27-34, 1980.
10. Richard L. Francis. Discrete location theory. Wiley-Interscience series in discrete mathematics and optimization. J. Wiley (New York), 1990.
11. Richard L. Francis, Jr. Leon F. McGinnis, and John A. White. Facility layout and location: an analytical approach. Prentice-Hall international series in industrial and systems engineering. Prentice-Hall, Englewood Cliffs, N.J., 1991.
12. G. N. Frederickson and D. B. Johnson. Finding kth paths and p-centers by generating and searching good data structures. J. Algorithms, 4:61-80, 1983.
13. A. Goldberg and M. Kharitonov. On implementing scaling push-relabel algorithms for the minimum-cost flow problem. In D. Johnson and C. McGeoch, editors, Network Flows and Hatchings - First DIM ACS Implementation Challenge, Volume 12 of Series in Discrete Mathematics and Computer Science, pages 157-198. AMS, 1993.
14. Gurevich, Stockmeyer, and Vishkin. Solving NP-hard problems on graphs that are almost trees and an application to facility location problems. Journal of the ACM, 1984.
15. R. H. Hardin, N. J. A. Sloane, and W. D. Smith. Library of best ways known to us to cover sphere with n caps. AT&T Bell Laboratories, Murray Hill, NJ. ftp://netlib.att.com/netlib/att/math/sloane/coverings, 1994.
16. He and Yesha. Efficient parallel algorithms for r-dominating set and p-center problems on trees. Algorithmica, 5, 1990.
17. David S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256-278, 1974.
18. Lászó Lóvász. On the ratio of optimal integral and fractional covers. Discrete Mathematics, 13:383-390, 1975.
19. R. F. Love, J. G. Morris, and G. O. Wesolowsky. Facilities Location: Models and Methods, Volume 7 of Publications in Operations Research. North-Holland, New York, 1988.
20. W. Maass. On the complexity of nonconvex covering. SIAM J. Comput, 15:453-467, 1986.
21. A. Marchetti-Spaccamela. The p-center problem in the plane is NP-complete. In Proc. 19th Allerton Conf. Commun. Control Comput., pages 31-40, 1981.
22. 2 n) algorithm for the kth longest path in a tree with applications to location problems. SIAM Journal on Computing, 1981.
23. N. Megiddo and K. J. Supowit. On the complexity of some common geometric location problems. SIAM J. Comput., 13:182-196, 1984.
24. N. Megiddo and A. Tamir. New results on the complexity of p-center problems. SIAM J. Comput, 12:751-758, 1983.
25. K. Melhorn and S. Näher. LEDA - a platform for combinatorial and geometric computing. See ftp://ftp.mpi-sb.mpg.de/pub/LEDA/leda.html.
26. G. L. Nemhauser and L. A. Wolsey. Integer and Combinatorial Optimization. John Wiley & Sons, New York, 1988.
27. C. H. Papadimitriou. Worst-case and probabilistic analysis of a geometric location problem. SIAM J. Comput., 10:542-557, 1981.
28. C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ, 1982.
29. Jacquelyn Savani. Sky survey receives $5 million from NSF. Princeton Weekly Bulletin, November 1994.
30. Bala Shetty. Approximate solutions to large scale capacitated facility location problems. Applied mathematics and computation, 39(2): 159, September 1990.
31. R. Sridharan. A lagrangian heuristic for the capacitated plant location problem with single source constraints. European journal of operational research, 66(3):305, May 1993.