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

Abstract In this paper we propose a new strategy for designing algorithms, called the searching over separators strategy. Suppose that we have a problem where the divide-and-conquer strategy can not be applied directly. Yet, also suppose that in an optimal solution to this problem, there exists a se...

Full description

Bibliographic Details
Published in:Algorithmica : an international journal in computer science, Vol. 9 (1993), p. 398-423
Other Involved Persons: Hwang, R. Z. ; Chang, R. C. ; Lee, R. C. T.
Format: electronic Article
Item Description:Copyright: Copyright 1993 Springer-Verlag New York Inc.
Physical Description:Online-Ressource
QR Code: Show QR Code