engleski

Computations of metric/cut polyhedra and their relatives

In this chapter we consider metric defined by triangle inequalities. The L1 embeddable metric are described by cut metric and they define another polyhedral cone. We then consider the hypermetric cone and hypermetric polytope which are related to Delaunay polytopes in lattices. Then we consider the variant of metric and cut polytope of graphs. Then quasi-symmetric polyhedra, partial metrics and finally supermetrics and hemimetrics.

metric, cut metric, polytope, hypermetric, dual description

nije evidentirano