Generating and searching sets induced by networks-Reference-Cited by-同舟云学术

Generating and searching sets induced by networks

Published:1980 Issue: Volume: Page:221-233
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Frederickson Greg N.,Johnson Donald B.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-10003-2_73

Reference15 articles.

1. Bentley, J. L. and A. C. Yao, An almost optimal algorithm for unbounded searching, Inf. Proc. Letters 5 (1976) 82–87.

2. Blum, M., R. W. Floyd, V. R. Pratt, R. L. Rivest, and R. E. Tarjan, Time bounds for selection, J. Comput. Sys. Sci. 7 (1972) 448–461.

3. Chandrasekaran, R. and A. Daughtey, Problems of location on trees, Disc. Paper 357, Ctr. for Math. Studies in Econ. and Mgmt. Sci., Northwestern U., 1978.

4. Chandreskaran, R. and A. Tamir, Polynomially bounded algorithms for locating P-centers on a tree, Disc. Paper 358, Ctr. for Math. Studies in Econ. and Mgmt. Sci., Northwestern U., 1978.

5. Chandrasekaran, R. and A. Tamir, An 0((nlogP)2) algorithm for the continuous P-center problem on a tree, Disc. Paper 367, Ctr. for Math. Studies in Econ. and Mgmt. Sci., Northwestern U., 1978.

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

1. Improved Approximation for Orienting Mixed Graphs;Algorithmica;2014-08-27

2. Approximation Algorithms for Orienting Mixed Graphs;Combinatorial Pattern Matching;2011

3. Improved Orientations of Physical Networks;Lecture Notes in Computer Science;2010

4. A Sublogarithmic Approximation for Highway and Tollbooth Pricing;Automata, Languages and Programming;2010

5. Robust Subgraphs for Trees and Paths;Algorithm Theory - SWAT 2004;2004