On tight spans for directed distances
From MaRDI portal
Publication:1928578
DOI10.1007/s00026-012-0146-5zbMath1271.54064arXiv1004.0415OpenAlexW2075413677MaRDI QIDQ1928578
Publication date: 3 January 2013
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1004.0415
Topological spaces with richer structures (54E99) Distance in graphs (05C12) Extensions of spaces (compactifications, supercompactifications, completions, etc.) (54D35)
Related Items (9)
Completeness and injectivity ⋮ Isbell conjugacy and the reflexive completion ⋮ A generalized inverse for graphs with absorption ⋮ The vector lattice structure on the Isbell-convex hull of an asymmetrically normed real vector space ⋮ Trees, tight-spans and point configurations ⋮ A construction of the \(B\)-completion of a \(T_0\)-quasi-metric space ⋮ On duality and fractionality of multicommodity flows in directed networks ⋮ Endpoints in \(T_0\)-quasimetric spaces. II. ⋮ Tight spans of distances and the dual fractionality of undirected multiflow problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Trees, tight-spans and point configurations
- On duality and fractionality of multicommodity flows in directed networks
- Gradient flows in asymmetric metric spaces
- Tight spans of distances and the dual fractionality of undirected multiflow problems
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
- Combinatorial approaches to multiflow problems
- A canonical decomposition theory for metrics on a finite set
- A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizatons
- Metrics with finite sets of primitive extensions
- Minimum 0-extensions of graph metrics
- A characterization of minimizable metrics in the multifacility location problem
- A note on the metric properties of trees
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Tropical convexity
- Classification of six-point metrics
- Characterization of the distance between subtrees of a tree by the associated tight span
- A geometric study of the split decomposition
- Six theorems about injective metric spaces
- Folder Complexes and Multiflow Combinatorial Dualities
- Basic Phylogenetic Combinatorics
- Directed metrics and directed graph partitioning problems
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
- The distance matrix of a graph and its tree realization
- Generosity Helps or an 11-Competitive Algorithm for Three Servers
- A note on the tree realizability of a distance matrix
This page was built for publication: On tight spans for directed distances
