Approximation algorithms for spreading points

Journal of Algorithms

Volumn 62, Issue 2, 2007, Pages 49-73

  Cabello, Sergio ^a  

^a INSTITUTE OF MATHEMATICS   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PROBLEM SOLVING; QUADRATIC PROGRAMMING;

CLOSEST PAIRS; QUADRATIC TIME ALGORITHM; SPREADING POINTS;

APPROXIMATION ALGORITHMS;

EID: 34247565654     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2004.06.009     Document Type: Article

References (24)

1. Agarwal P.K., Efrat A., and Sharir M. Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. SIAM J. Comput. 29 (1999) 912-953
2. Agarwal P.K., and Matoušek J. Ray shooting and parametric search. SIAM J. Comput. 22 4 (1993) 794-806
3. Aharoni R., and Haxell P. Hall's theorem for hypergraphs. J. Graph Theory 35 (2000) 83-88
4. Baur C., and Fekete S. Approximation of geometric dispersion problems. Algorithmica 30 (2001) 451-470 A preliminary version appeared in APPROX'98
5. Cabello S., and van Kreveld M. Approximation algorithms for aligning points. Algorithmica 37 (2003) 211-232 A preliminary version appeared in SoCG'03
6. Chandra B., and Halldórsson M.M. Approximation algorithms for dispersion problems. J. Algorithms 38 (2001) 438-465
7. Dent B. Cartography: Thematic Map Design. 5th ed. (1999), McGraw-Hill
8. Di Battista G., Eades P., Tamassia R., and Tollis I.G. Graph Drawing (1999), Prentice Hall, Upper Saddle River, NJ
9. Efrat A., Itai A., and Katz M.J. Geometry helps in bottleneck matching and related problems. Algorithmica 31 1 (2001) 1-28
10. Efrat A., Katz M.J., Nielsen F., and Sharir M. Dynamic data structures for fat objects and their applications. Comput. Geom. Theory Appl. 15 (2000) 215-227 A preliminary version appeared
11. Efrat A., Katz M.J., Nielsen F., and Sharir M. Dynamic data structures for fat objects and their applications. WADS'97. Lecture Notes in Comput. Sci. vol. 1272 (1997)
12. Fekete S., and Meijer H. Maximum dispersion and geometric maximum weight cliques. Algorithmica 38 3 (2004) in press
13. Fiala J., Kratochvíl J., and Proskurowski A. Geometric systems of disjoint representatives. Graph Drawing. 10th GD'02, Irvine, California. Lecture Notes in Comput. Sci. vol. 2528 (2002), Springer-Verlag 110-117
14. J. Fiala, J. Kratochvíl, A. Proskurowski, Systems of sets and their representatives, Technical Report 2002-573, KAM-DIMATIA 2002; Available at http://dimatia.mff.cuni.cz/
15. Formann M., and Wagner F. A packing problem with applications to lettering of maps. Proc. 7th Annu. ACM Sympos. Comput. Geom. (1991) 281-288
16. Goldberg A.V., Plotkin S.A., and Vaidya P.M. Sublinear-time parallel algorithms for matching and related problems. J. Algorithms 14 (1993) 180-213 A preliminary version appeared in FOCS'88
17. 5 / 2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2 4 (1973) 225-231
18. Kedem K., Livne R., Pach J., and Sharir M. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete Comput. Geom. 1 (1986) 59-71
19. Megiddo N. Combinatorial optimization with rational objective functions. Math. Oper. Res. 4 (1979) 414-424
20. Megiddo N. Applying parallel computation algorithms in the design of serial algorithms. J. ACM 30 4 (1983) 852-865
21. Mortensen C.W. Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time. Proceedings of the fourteenth annual ACM-SIAM Symposium on Discrete Algorithms (2003), SIAM 618-627
22. C.W. Mortensen, personal communication, 2003
23. A. Schrijver, A Course in Combinatorial Optimization, Lecture notes, Available at http://homepages.cwi.nl/~lex/files/dict.ps
24. Simons B. A fast algorithm for single processor scheduling. Proc. 19th Annu. IEEE Sympos. Found. Comput. Sci. (1978) 246-252