An efficient algorithm for maxdominance, with applications-Reference-Cited by-同舟云学术

An efficient algorithm for maxdominance, with applications

Published:1989-06 Issue:1-4 Volume:4 Page:221-236
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Atallah Mikhail J.,Kosaraju S. Rao

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01553888.pdf

Reference14 articles.

1. M. J. Atallah and G. N. Frederickson, A Note on Finding a Maximum Empty Rectangle,Discrete Applied Mathematics, Vol. 13, No. 1, pp. 87–91 (1986).

2. A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.

3. M. J. Atallah, G. K. Manacher, and J. Urrutia, Finding a Minimum Independent Dominating Set in a Permutation Graph, Purdue C.S. Tech. Rept.

4. A. Aggarwal and S. Suri, Fast Algorithms for Computing the Largest Empty Rectangle,Proc. 3rd ACM Symposium on Computational Geomtry, June 1987 (to appear).

5. B. Bhattacharya and H. ElGindy, Fast Algorithms for the Maximum Empty Rectangle Problem, University of Pennsylvania and Simon Fraser University Tech. Repts., March 1987.

Cited by 36 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Maximal Empty Boxes Amidst Random Points;Combinatorics, Probability and Computing;2013-05-14

2. Algorithmic Aspects of Domination in Graphs;Handbook of Combinatorial Optimization;2013

3. On the Largest Empty Axis-Parallel Box Amidst n Points;Algorithmica;2012-03-07

4. Maximal Empty Boxes Amidst Random Points;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2012

5. Improved bottleneck domination algorithms;Discrete Applied Mathematics;2006-07