Bibliographic Details
| Title: |
Diversities and the Geometry of Hypergraphs. |
| Authors: |
Bryant, David1 david.bryant@otago.ac.nz, Tupper, Paul F.2 pft3@math.sfu.ca |
| Source: |
Discrete Mathematics & Theoretical Computer Science (DMTCS). 2014, Vol. 16 Issue 2, p1-20. 20p. |
| Subjects: |
Fuzzy hypergraphs, Embeddings (Mathematics), Geometry, Mathematical optimization, Data analysis, Tree graphs, Graphic methods |
| Abstract: |
The embedding of finite metrics in l1 has become a fundamental tool for both combinatorial optimization and largescale 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 l1. 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, l1 diversities, and their application to Steiner Tree Packing and Hypergraph Cut problems. [ABSTRACT FROM AUTHOR] |
|
Copyright of Discrete Mathematics & Theoretical Computer Science (DMTCS) is the property of Discrete Mathematics & Theoretical Computer Science DMTCS and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
