Maintenance of a piercing set for intervals with applications

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

Volumn 1969, Issue , 2000, Pages 552-563

  Katz, Matthew J ^a   Nielsen, Frank ^b   Segal, Michael ^c  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b SONY COMPUTER SCIENCE LABORATORIES INC   (Japan)

^c UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AMORTIZED TIME; DYNAMIC DATA STRUCTURE; INSERTIONS AND DELETIONS; LOCATION PROBLEMS; POINT SET;

PIERCING;

EID: 84949810725     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40996-3_47     Document Type: Conference Paper

References (15)

1. J. Chaudhri and S.C. Nandy “Generalized shooter location problem”, in Lecture Notes in Computer Science 1627, pp. 389-401, 1999.
2. B. Chazelle “Cutting hyperplanes for divide-and-conquer”, Discrete Comput. Geom. 9 (1993), pp. 145-158.
3. K. Daniels and V. Milenkovic “Limited Gaps”, in Proc. 6th Canad. Conf. Comput. Geom., pp. 225-231, 1994.
4. R. J. Fowler and M. S. Paterson and S. L. Tanimoto “Optimal packing and covering in the plane are NP-complete”, Info. Processing Letters 12(3) (1981), pp. 133-137.
5. M. C. Golumbic and P. L. Hammer “Stability in circular arc graphs”, J. of Algorithms 9 (1988), pp. 314-320.
6. U. Gupta, D. T. Lee and Y.-T. Leung “Efficient algorithms for interval graphs and circular-arc graphs”, Networks 12 (1982), pp. 459-467.
7. W.-L. Hsu and K.-H. Tsai “Linear time algorithms on circular-arc graphs”, Information Processing Letters 40 (1991), pp. 123-129.
8. D. T. Lee, M. Sarrafzadeh and Y. F. Wu “Minimum cuts for circular-arc graphs”, SIAM J. Computing 19(6) (1990), pp. 1041-1050.
9. S. Masuda and K. Nakajima “An optimal algorithm for finding a maximum independent set of a circular-arc graph”, SIAM J. Computing 17(1) (1988), pp. 41-52.
10. S. C. Nandy and K. Mukhopadhyaya and B. B. Bhattacharya “Shooter location problem”, in Proc. 8th Canad. Conf. Comput. Geom., pp. 93-98, 1996.
11. F. Nielsen “Fast stabbing of boxes in high dimensions”, in Proc. 8th Canad. Conf. Comput. Geom., pp. 87-92, 1996. Theo. Comp. Sci., Elsevier Sci., Sept. 2000.
12. A. S. Rao and C. P. Rangan “Optimal parallel algorithms on circular-arc graphs”, Information Processing Letters 33 (1989), pp. 147-156.
13. R. E. Tarjan “Data Structures and Network Algorithms”, Regional Conference Series in Applied Mathematics 44, SIAM, 1983.
14. K. H. Tsai and D. T. Lee “k-best cuts for circular-arc graphs”, Algorithmica 18(2) (1997), pp. 198-216.
15. C. A. Wang and B. Zhu “Shooter location problems revisited”, in Proc. 9th Canad. Conf. Comput. Geom., pp. 223-228, 1997.