Abstract
Circular decomposable metrics (CDM) are sums of cut metrics that satisfy a circularity condition. A number of combinatorial optimization problems, including the traveling salesman problem, are easily solved if the underlying cost matrix represents a CDM. We give a linear time algorithm for recognizing CDMs and show that they are identical to another class of metrics: the Kalmanson metric.
Cite
CITATION STYLE
Christopher, G., Farach, M., & Trick, M. (1996). The structure of circular decomposable metrics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1136, pp. 486–500). Springer Verlag. https://doi.org/10.1007/3-540-61680-2_77
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
