Tight spans of distances and the dual fractionality of undirected multiflow problems (Q1044206): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2123783074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hereditary modular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of minimizable metrics in the multifacility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(T_X\)-approach to some results on cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs of some CAT(0) complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generosity Helps or an 11-Competitive Algorithm for Three Servers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tropical convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of the distance between subtrees of a tree by the associated tight span / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tight spans for directed distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Commodity Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5629416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Six theorems about injective metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedra related to undirected multicommodity flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4011256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum 0-extensions of graph metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metrics with finite sets of primitive extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial approaches to multiflow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some connectivity properties of Eulerian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Polytopes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:30, 2 July 2024

scientific article
Language Label Description Also known as
English
Tight spans of distances and the dual fractionality of undirected multiflow problems
scientific article

    Statements

    Tight spans of distances and the dual fractionality of undirected multiflow problems (English)
    0 references
    0 references
    11 December 2009
    0 references
    Suppose \(G=(V,E,c)\) is an undirected graph with nonnegative capacity function \(c\) on \(E\) and suppose \(S \subseteq V\) is a set of terminals and \(\mu\) a nonnegative weight function on the set of pairs in \(S\). A path \(P\) is called an \(S\)-path if both its ends are in \(S\). A collection \(\mathcal{P}\) of \(S\)-paths together with a nonnegative flow-valued function \(\lambda\) on \(\mathcal{P}\) satisfying the capacity constraint for each \(e \in E\), \(\sum_{P\in {\mathcal{P}}:e \in P}\lambda(P) \leq c(e)\) is called a multiflow. The weighted maximum multiflow problem with respect to \(G\) and \((S, \mu)\), denoted by \(M(G;S, \mu)\) is formulated as follows: Max\(\sum_{P \in {\mathcal{P}}}\mu(s_P,t_P)\lambda(P)\) over all multiflows \((P, \lambda)\) in \(G\). The fractionality of \((S,\mu)\) is the least positive integer \(k\) such that \(M(G;S,\mu)\) has a \(1/k\)-integral optimal flow for any integer-capacitated graph \(G\) with \(S \subseteq V\). If such a \(k\) does not exist, the fractionality of \((S, \mu)\) if defined to be infinity. The problem of interest in this paper is a necessary and sufficient condition for \((S, \mu)\) to have bounded fractionality. Even the case where \(\mu\) is a \(0,1\)-function is still open. Karzanov and Lomonosov extended this to metrics \(\mu\) that are cut-decomposable. The author considers the dual \(M^*(G; S, \mu)\) of the \(M(G; S, \mu)\). A necessary and sufficient condition for \((S, \mu)\) with integral \(\mu\) to have bounded dual fractionality is obtained. This extends two fundamental results of Kazarnov: (i) the characterization of commodity graphs \(H\) for which the dual of the maximum multiflow problem with respect to \(H\) has bounded fractionality [\textit{A.V. Karzanov}, ``Undirected multiflow problems and related topics - some recent developments and results'', Proc. Int. Congr. Math., Kyoto/Japan 1990, Vol. II, 1561--1571 (1991; Zbl 0746.90019)], and (ii) a characterization of metrics \(d\) on terminals for which the dual of metric-weighted maximum multiflow problem has bounded fractionality [\textit{A.V. Karzanov}, ``Minimum 0-extensions of graph metrics'', Eur. J. Comb. 19, No.1, 71--101 (1998; Zbl 0894.90147); ``Metrics with finite sets of primitive extensions'', Ann. Comb. 2, No.3, 211--241 (1998; Zbl 0946.90069)]. The key idea of this paper uses a nonmetric generalization of the tight span. These nonmetric tight spans provide a unified duality framework to weighted maximum multiflow problems, and give a unified interpretation of combinatorial dual solutions of several known min-max theorems in multiflow theory.
    0 references
    0 references
    tight spans
    0 references
    metrics
    0 references
    multicommodity flows
    0 references
    polyhedral combinatorics
    0 references
    0 references