Data collection for the Sloan Digital Sky Survey—a network-flow heuristic

Authors:
Robert Lupton;F. Miller Maley;Neal Young
Affiliations:
Astrophysics Department, Princeton University, Princeton, NJ;Mathematics Department, Princeton University, Princeton, NJ;Computer Science Department, Dartmouth College, Hanover, NH
Venue:
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Year:
1996

Citing 9
Cited 2

On the complexity of nonconvex covering

SIAM Journal on Computing
Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Integer and combinatorial optimization

Integer and combinatorial optimization
Applications of complex variable residue theory to the evaluation of irrational definite integrals

Applied Mathematics and Computation
Planar geometric location problems and maintaining the width of a planar set

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
How to allocate network centers

Journal of Algorithms
Almost optimal set covers in finite VC-dimension: (preliminary version)

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems

Journal of the ACM (JACM)
LEDA: a platform for combinatorial and geometric computing

LEDA: a platform for combinatorial and geometric computing

Exact and approximation algorithms for clustering

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Optimal placement of convex polygons to maximize point containment

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract