The structure of circular decomposable metrics

George Christopher, Martin Farach, Michael Trick

    Research output: Chapter in Book/Report/Conference proceedingConference contribution


    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.

    Original languageEnglish (US)
    Title of host publicationAlgorithms - ESA 1996 - 4th Annual European Symposium, Proceedings
    EditorsJosep Diaz, Maria Serna
    PublisherSpringer Verlag
    Number of pages15
    ISBN (Print)3540616802, 9783540616801
    StatePublished - 1996
    Event4th European Symposium on Algorithms, ESA 1996 - Barcelona, Spain
    Duration: Sep 25 1996Sep 27 1996

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349


    Other4th European Symposium on Algorithms, ESA 1996

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • General Computer Science


    Dive into the research topics of 'The structure of circular decomposable metrics'. Together they form a unique fingerprint.

    Cite this