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

Robert Lupton, F. Miller Maley, Neal Young

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Abstract

This note describes a combinatorial optimization problem arising in the Sloan Digital Sky Survey and an effective heuristic for the problem that has been implemented and will be used in the Survey. The heuristic is based on network flow theory.

Original languageEnglish (US)
Title of host publicationProceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996
PublisherAssociation for Computing Machinery
Pages296-303
Number of pages8
ISBN (Electronic)0898713668
StatePublished - Jan 28 1996
Event7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996 - Atlanta, United States
Duration: Jan 28 1996Jan 30 1996

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
VolumePart F129447

Conference

Conference7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996
Country/TerritoryUnited States
CityAtlanta
Period1/28/961/30/96

All Science Journal Classification (ASJC) codes

  • Software
  • General 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