Station layouts in the presence of location constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1741, Issue , 1999, Pages 269-278

  Bose, Prosenjit ^b   Kaklamanis, Christos ^a   Kirousis, Lefteris M ^a   Kranakis, Evangelos ^b,c   Krizanc, Danny ^b,c   Peleg, David ^d  

^a UNIVERSITY OF PATRAS   (Greece)

^b CARLETON UNIVERSITY   (Canada)

^c MITACS project CANCCOM ^*  (Canada)

^d Department of Veterinary Resources   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BROADCAST STATIONS; HUMAN HABITATION; LOCATION CONSTRAINTS; PLANAR REGION; WIRELESS COMMUNICATIONS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 84944322305     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46632-0_28     Document Type: Conference Paper

References (11)

1. L. I. Aupperle, H. E. Conn, J. M. Kell, and J. O'Rourke, “Covering Orthogonal Polygons with Squares", in proceedings of 26th Annual Allerton Conference on Coom. Contr, and Comp., Urbana, 28-30, Sep. 1988.
2. R. Bar-Yehuda, and E. Ben-Chanoch, “An O(N log*N) Time Algorithm for Covering Simple Polygons with Squares", in proceedings of the 2nd Canadian Conference on Computational Geometry, held in Ottawa, pp. 186-190, 1990.
3. B. N. Clark, C. J. Colbourn, and D. S. Johnson, “Unit Disk Graphs", Discrete Mathematics 86(1990) 165-177.
4. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, “An Introduction to Algorithms", MIT Press, 1990.
5. N. A. DePano, Y. Ko, and J. O'Rourke, “Finding Largest Equilateral Triangles and Squares", Proceedings of the Allerton Conference, pages 869-878, 1987.
6. F. Gavril, “Algorithms for Minimum Coloring, Minimum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph", SIAM J. Comput., Vol. 1, No. 2, June 1972, pp. 180-187.
7. D. S. Hochbaum and W. Maass, “Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI", J. ACM 32:130-138, 1985.
8. H. B. Hunt, M. V. Marathe, V. Radhakrishnan, S. S. Ravi, D. J. Rosenkrantz, R. E. Stearns, “NC Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs", in Proceedings of 2nd ESA, pp. 468-477.
9. J. C. Lin, “Biological Aspects of Mobile Communication Data", Wireless Networks, pages 439-453, Vol. 3 (1997) No, 6.
10. D. Moitra, "Finding a Minimal Cover for Binary Images: An Optimal Parallel Algorithm", Algorithmica (1991) 6: 624-657.
11. K. Pahlavan and A. Levesque, “Wireless Information Networks," Wiley-Interscience, New York, 1995.