Computing all large sums-of-pairs in ℝn and the discrete planar two-watchtower problem

Information Processing Letters

Volumn 89, Issue 3, 2004, Pages 137-139

  Ben Moshe, Boaz ^a   Carmi, Paz ^a   Katz, Matthew J ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Algorithms; Computational geometry; Facility location

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; PROBLEM SOLVING; SET THEORY; THEOREM PROVING; VECTORS;

DECISION PROBLEMS; FACILITY LOCATION;

MATRIX ALGEBRA;

EID: 0346724324     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2003.07.008     Document Type: Article

References (4)

1. Bespamyatnikh S., Chen Z., Wang K., Zhu B. On the planar two-watchtower problem. Proceedings 7th International Computing and Combinatorics Conference. Lecture Notes in Comput. Sci. Vol. 2108:2001;121-130 Springer-Verlag, Berlin.
2. Coppersmith D., Winograd S. Matrix multiplication via arithmetic progressions. J. Symbolic Comput. 9:(3):1990;251-280.
3. n. Inform. Process. Lett. 38:1991;277-278.
4. Megiddo N. Applying parallel computation algorithms in the design of serial algorithms. J. ACM. 30:1983;852-865.