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

DOI10.1006/jagm.1997.0922zbMath0905.68161OpenAlexW3101105133MaRDI QIDQ4216142

F. Miller Maley, Robert H. Lupton, Neal E. Young

Publication date: 21 October 1998

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1997.0922

zbMATH Keywords

sloan digital sky survey

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (6)

Capacitated covering problems in geometric spaces ⋮ Improved bounds for metric capacitated covering problems ⋮ Unnamed Item ⋮ NP-hardness of the Euclidean Max-Cut problem ⋮ Capacitated Covering Problems in Geometric Spaces ⋮ Complexity of the weighted max-cut in Euclidean space

This page was built for publication: Data Collection for the Sloan Digital Sky Survey—A Network-Flow Heuristic