Pages that link to "Item:Q1378296"
From MaRDI portal
The following pages link to Minimum 0-extensions of graph metrics (Q1378296):
Displaying 27 items.
- Bounded fractionality of the multiflow feasibility problem for demand graph \(K_3 + K_3\) and related maximization problems (Q444377) (← links)
- Making doubling metrics geodesic (Q627522) (← links)
- On duality and fractionality of multicommodity flows in directed networks (Q665994) (← links)
- Tight spans of distances and the dual fractionality of undirected multiflow problems (Q1044206) (← links)
- Metrics with finite sets of primitive extensions (Q1293426) (← links)
- A characterization of minimizable metrics in the multifacility location problem (Q1582478) (← links)
- Hard cases of the multifacility location problem (Q1887076) (← links)
- On tight spans for directed distances (Q1928578) (← links)
- Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees (Q1942273) (← links)
- Metric packing for \(K_ 3 + K_ 3\) (Q1945273) (← links)
- Graphs of some CAT(0) complexes (Q1973869) (← links)
- Minimum 0-extension problems on directed metrics (Q2042078) (← links)
- A simple algorithm for the multiway cut problem (Q2294387) (← links)
- On Lipschitz extension from finite subsets (Q2357002) (← links)
- One more well-solved case of the multifacility location problem (Q2386213) (← links)
- The vertex \(k\)-cut problem (Q2419357) (← links)
- Metric extension operators, vertex sparsifiers and Lipschitz extendability (Q2630142) (← links)
- Weakly Modular Graphs and Nonpositive Curvature (Q3380549) (← links)
- Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem (Q4577771) (← links)
- Discrete Convex Functions on Graphs and Their Algorithmic Applications (Q4689627) (← links)
- Simplex Transformations and the Multiway Cut Problem (Q5000653) (← links)
- (Q5002776) (← links)
- (Q5089214) (← links)
- Retracting Graphs to Cycles (Q5091228) (← links)
- Discrete convexity and polynomial solvability in minimum 0-extension problems (Q5962712) (← links)
- A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case (Q6130232) (← links)
- Generalized minimum 0-extension problem and discrete convexity (Q6665385) (← links)
