Data Collection for the Sloan Digital Sky Survey—A Network-Flow Heuristic
Open Access
- 1 May 1998
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 27 (2) , 339-356
- https://doi.org/10.1006/jagm.1997.0922
Abstract
No abstract availableKeywords
All Related Versions
This publication has 21 references indexed in Scilit:
- An Efficient Implementation of a Scaling Minimum-Cost Flow AlgorithmJournal of Algorithms, 1997
- Almost optimal set covers in finite VC-dimensionDiscrete & Computational Geometry, 1995
- Planar geometric location problemsAlgorithmica, 1994
- How to Allocate Network CentersJournal of Algorithms, 1993
- How Technique Is Changing ScienceScience, 1992
- Distance‐constrained multifacility minimax location problems on tree networksNetworks, 1992
- A comparison of heuristics and relaxations for the capacitated plant location problemEuropean Journal of Operational Research, 1991
- Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location ProblemsJournal of the ACM, 1984
- Finding kth paths and p-centers by generating and searching good data structuresJournal of Algorithms, 1983
- Probabilistic Analysis of the Planar k-Median ProblemMathematics of Operations Research, 1980