Abstract
This paper describes an NP-hard combinatorial optimization problem arising in the Sloan Digital Sky Survey and a practical approximation algorithm that has been implemented and will be used in the survey. The algorithm is based on network flow theory and Lagrangian relaxation.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 339-356 |
| Number of pages | 18 |
| Journal | Journal of Algorithms |
| Volume | 27 |
| Issue number | 2 |
| DOIs | |
| State | Published - May 1998 |
All Science Journal Classification (ASJC) codes
- Control and Optimization
- Computational Mathematics
- Computational Theory and Mathematics
Fingerprint
Dive into the research topics of 'Data Collection for the Sloan Digital Sky Survey - A Network-Flow Heuristic'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver