The searching over separators strategy to solve some NP-hard problems in subexponential time-Reference-Cited by-同舟云学术

The searching over separators strategy to solve some NP-hard problems in subexponential time

Published:1993-04 Issue:4 Volume:9 Page:398-423
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Hwang R. Z.,Chang R. C.,Lee R. C. T.

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/BF01228511.pdf

Reference22 articles.

1. Aho, A. V., Hopcroft, J. E., and Ullman, J. D.,The Design and Analysis of Computer Algorithms, Bell Telephone Laboratories, Inc., New York, 1976.

2. Bentley, J. L., Divide and Conquer Algorithms for Closest Point Problems in Multidimensional Space, Ph.D. Thesis, Department of Computer Science, University of North Carolina, 1976.

3. Bentley, J. L., Multidimensional Divide-and-Conquer,Communications of the Association for Computing Machinery, Vol. 23, 1980, pp. 214?229.

4. Delaunay, B., Sur la sphère vide,Izvestiya Akademii Nauk SSSR, Otdelenie Matematicheskii i Estestvennyka Nauk, Vol. 7, 1934, pp. 793?800.

5. Drezner, Z., TheP-Center Problem ? Heuristics and Optimal Algorithms,Journal of the Operational Research Society, Vol. 35, No. 8, 1984, pp. 741?748.

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

1. Euclidean TSP in Narrow Strips;Discrete & Computational Geometry;2024-01-08

2. An ETH-Tight Exact Algorithm for Euclidean TSP;SIAM Journal on Computing;2023-06-05

3. Offline and Online UAV-Enabled Data Collection in Time-Constrained IoT Networks;IEEE Transactions on Green Communications and Networking;2021-12

4. The Euclidean k-supplier problem in IR2;Operations Research Letters;2021-01

5. Constrained k-Center Problem on a Convex Polygon;International Journal of Foundations of Computer Science;2020-02