Choosing Subsets with Maximum Weighted Average

Journal of Algorithms

Volumn 24, Issue 1, 1997, Pages 177-193

  Eppstein, David ^a   Hirschberg, Daniel S ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039226319     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0849     Document Type: Article

References (24)

1. N. Amenta, Helly theorems and generalized linear programming, Discrete Comput. Geom. 12 (1994), 241-261.
2. M. Bern, D. Eppstein, L. Guibas, J. Hershberger, S. Suri, and J. Wolter, The centroid of points with approximate weights, in "3rd Eur. Symposium on Algorithms," Lecture Notes in Computer Science, Vol. 979, pp. 460-472, 1995.
3. H. Brönnimann and B. Chazelle, Optimal slope selection via cuttings, in "6th Canadian Conference on Computational Geometry," pp. 99-103, 1994.
4. B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, Diameter, width, closest line pair, and parametric searching, in "8th ACM Symposium on Computational Geometry," pp. 120-129, 1992.
5. K. L. Clarkson, A Las Vegas algorithm for linear programming when the dimension is small, in "29th IEEE Symposium in Foundations of Computer Science," pp. 452-456, 1988.
6. R. Cole, J. S. Salowe, W. L. Steiger, and E. Szemerédi, An optimal-time algorithm for slope selection, SIAM J. Comput. 18 (1989), 792-810.
7. M. B. Dillencourt, D. M. Mount, and N. S. Netanyahu, A randomized algorithm for slope selection. Int. J. Comput. Geom. Appl. 2 (1992), 1-27.
8. D. Eppstein and D. S. Hirschberg, "Choosing Subsets with Maximum Weighted Average, Technical Report 95-12, Department of Information and Computer Science, University of California, Irvine, 1995.
9. T. R. Ervolina and S. T. McCormick, Two strongly polynomial cut cancelling algorithms for minimum cost network flow, Discrete Appl. Math. 46 (1993), 133-165.
10. B. Gärtner, A subexponential algorithm for abstract optimization problems, in "33rd IEEE Symposium on Foundations of Computer Science," pp. 464-472, 1992.
11. A. V. Goldberg and R. E. Tarjan, Finding minimum-cost circulations by cancelling negative cycles, J. Assoc. Comput. Mach. 36 (1989), 873-886.
12. M. Hartmann and J. B. Orlin, Finding minimum cost to time ratio cycles with small integral transit times, Networks 23 (1993), 567-574.
13. K. Iwano, S. Misono, S. Tezuka, and S. Fujishige, A new scaling algorithm for the maximum mean cut problem, Algorithmica 11 (1994), 243-255.
14. R. M. Karp, A characterization of the minimum cycle mean in a digraph, Discrete Math. 23 (1978), 309-311.
15. R. M. Karp, Probabilistic recurrence relations, J. Assoc. Comput. Mach. 41 (1994), 1136-1150.
16. R. M. Karp and J. B. Orlin, Parametric shortest path algorithms with an application to cyclic staffing, Discrete Appl. Math. 3 (1981), 37-45.
17. M. J. Katz and M. Sharir, Optimal slope selection via expanders, Inform. Process. Lett. 47 (1993), 115-122.
18. J. Matoušek, Randomized optimal algorithm for slope selection, Inform. Process. Lett. 39 (1991), 183-187.
19. J. Matoušek, Approximations and optimal geometric divide-and-conquer, J. Comput. System Sci. 50 (1995), 203-208.
20. J. Matoušek, M. Sharir, and E. Welzl, A subexponential bound for linear programming, in "8th ACM Symposium on Computational Geometry," pp. 1-8, 1992.
21. T. Radzik and A. V. Goldberg, Tight bounds on the number of minimum-mean cycle cancellations and related results, Algorithmica 11 (1994), 226-242.
22. R. Seidel, Linear programming and convex hulls made easy, Discrete Comput. Geom. 6 (1991), 423-434.
23. L. Shafer and W. Steiger, Randomizing optimal geometric algorithms, in "5th Canadian Conference on Computational Geometry," pp. 133-138, 1993.
24. N. E. Young, R. E. Tarjan, and J. B. Orlin, Faster parametric shortest path and minimum-balance algorithms, Networks 21 (1991), 205-221.