Diversities and the Geometry of Hypergraphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2014

Diversities and the Geometry of Hypergraphs


The embedding of finite metrics in 1 has become a fundamental tool for both combinatorial optimization and large-scale data analysis. One important application is to network flow problems as there is close relation between max-flow min-cut theorems and the minimal distortion embeddings of metrics into 1. Here we show that this theory can be generalized to a larger set of combinatorial optimization problems on both graphs and hypergraphs. This theory is not built on metrics and metric embeddings, but on diversities, a type of multi-way metric introduced recently by the authors. We explore diversity embeddings, 1 diversities, and their application to Steiner Tree Packing and Hypergraph Cut problems.
Fichier principal
Vignette du fichier
dmtcs-16-2-1.pdf (394 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01178648 , version 1 (20-07-2015)


Attribution - NonCommercial



David Bryant, Paul F Tupper. Diversities and the Geometry of Hypergraphs. Discrete Mathematics and Theoretical Computer Science, 2014, Vol. 16 no. 2 (2), pp.1 - 20. ⟨10.46298/dmtcs.2080⟩. ⟨hal-01178648⟩


103 View
1010 Download



Gmail Facebook X LinkedIn More