Multicommodity flows and cuts in polymatroidal networks (Q2826073): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
aliases / en / 0aliases / en / 0
 
Multicommodity Flows and Cuts in Polymatroidal Networks
description / endescription / en
 
scientific article; zbMATH DE number 6468890
Property / title
 
Multicommodity Flows and Cuts in Polymatroidal Networks (English)
Property / title: Multicommodity Flows and Cuts in Polymatroidal Networks (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1346.90698 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1137/130906830 / rank
 
Normal rank
Property / published in
 
Property / published in: SIAM Journal on Computing / rank
 
Normal rank
Property / publication date
 
3 August 2015
Timestamp+2015-08-03T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 3 August 2015 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6468890 / rank
 
Normal rank
Property / zbMATH Keywords
 
multicommodity flow
Property / zbMATH Keywords: multicommodity flow / rank
 
Normal rank
Property / zbMATH Keywords
 
flow-cut gap
Property / zbMATH Keywords: flow-cut gap / rank
 
Normal rank
Property / zbMATH Keywords
 
polymatroidal network
Property / zbMATH Keywords: polymatroidal network / rank
 
Normal rank
Property / zbMATH Keywords
 
line embedding
Property / zbMATH Keywords: line embedding / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2111999854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wireless Network Information Flow: A Deterministic Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation for directed cut problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean distortion and the sparsest cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lipschitz embedding of finite metric spaces in Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cuts, random walks, and dimension reduction in series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing a Monotone Submodular Function Subject to a Matroid Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed metrics and directed graph partitioning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding k-Outerplanar Graphs into l1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular Cost Allocation Problem and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Submodular Multiway Partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular function maximization via the multilinear relaxation and contention resolution schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating directed multicuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial flow-cut gaps and hardness of directed cut problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4149476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divide-and-conquer approximation algorithms via spreading metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polymatroidal flow network models with multiple sinks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Minimum Weight Vertex Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A flow model based on polylinking system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cuts, trees and \(\ell_1\)-embeddings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular Function Minimization under Covering Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacity of Multiple Unicast in Wireless Networks: A Polymatroidal Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluded minors, network decomposition, and multicommodity flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Steiner and Directed Multicuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Maximal “Polymatroidal” Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A node-capacitated Okamura-Seymour theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geometry of graphs with a forbidden minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometry of graphs and some of its algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling with Release Times, Deadlines, and Due Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dominated \(\ell_1\) metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-Approximation Algorithm for the Directed Multiway Cut Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity flows in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds on the max-flow min-cut ratio for multicommodity flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: On average distortion of embedding metrics into the line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compress-and-Forward Scheme for Relay Networks: Backword Decoding and Connection to Bisubmodular Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the integrality gap for minimum multicut in directed networks / 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: Matroids and linking systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for the max-flow min-multicut ratio for planar and \(K_{r,r}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Max-Flow/Min-Cut Algorithm for Linear Deterministic Relay Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective Strong Dimension in Algorithmic Information and Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5515914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Well-Calibrated Bayesian / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE FRACTIONAL DIMENSION OF A SET DEFINED BY DECIMAL PROPERTIES / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Forecast Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic calibration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimension in Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dimensions of individual strings and sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal prediction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The reproducible properties of correct forecasts / rank
 
Normal rank

Latest revision as of 16:15, 12 July 2024

scientific article; zbMATH DE number 6468890
  • Multicommodity Flows and Cuts in Polymatroidal Networks
Language Label Description Also known as
English
Multicommodity flows and cuts in polymatroidal networks
scientific article; zbMATH DE number 6468890
  • Multicommodity Flows and Cuts in Polymatroidal Networks

Statements

Multicommodity flows and cuts in polymatroidal networks (English)
0 references
Multicommodity Flows and Cuts in Polymatroidal Networks (English)
0 references
0 references
0 references
0 references
0 references
7 October 2016
0 references
3 August 2015
0 references
flow-cut gaps
0 references
line embeddings
0 references
node-capacitated networks
0 references
polymatroidal networks
0 references
sub-modular flows
0 references
multicommodity flow
0 references
flow-cut gap
0 references
polymatroidal network
0 references
line embedding
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references