Name
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. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1006/jagm.1997.0922 | Symposium on Discrete Algorithms |
Keywords | DocType | Volume |
data collection,sloan digital sky survey,network-flow heuristic,lagrangian relaxation,network flow | Journal | cs.DS/0205034 |
Issue | ISSN | ISBN |
2 | Journal of Algorithms 27(2):339-356 (1998) | 0-89871-366-8 |
Citations | PageRank | References |
14 | 2.84 | 19 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Robert LuptonF | 1 | 14 | 2.84 |
| F. Miller Maley | 2 | 38 | 6.35 |
| Neal E. Young | 3 | 128 | 10.10 |