The searching over separators strategy to solve some NP-hard problems in subexponential time
- 1 April 1993
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 9 (4) , 398-423
- https://doi.org/10.1007/bf01228511
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On the rectangularp-center problemNaval Research Logistics (NRL), 1987
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987
- Finding small simple cycle separators for 2-connected planar graphsJournal of Computer and System Sciences, 1986
- The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization.Journal of the Operational Research Society, 1986
- On the Complexity of Some Common Geometric Location ProblemsSIAM Journal on Computing, 1984
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related ProblemsSIAM Journal on Computing, 1983
- Worst-Case and Probabilistic Analysis of a Geometric Location ProblemSIAM Journal on Computing, 1981
- Multidimensional divide-and-conquerCommunications of the ACM, 1980
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979
- A Dynamic Programming Approach to Sequencing ProblemsJournal of the Society for Industrial and Applied Mathematics, 1962