Data Collection for the Sloan Digital Sky Survey - A Network-Flow Heuristic

Robert Lupton, F. Miller Maley, Neal Young

Research output: Contribution to journalArticlepeer-review

19 Scopus citations

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 languageEnglish (US)
Pages (from-to)339-356
Number of pages18
JournalJournal of Algorithms
Volume27
Issue number2
DOIs
StatePublished - 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