Traffic-oblivious multi-commodity flow network design
From MaRDI portal
Cites work
- A factor 2 approximation algorithm for the generalized Steiner network problem
- A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem
- Algorithms for a network design problem with crossing supermodular demands
- Analytical approach to parallel repetition
- Approximability of robust network design: the directed case
- Approximating directed buy-at-bulk network design
- Approximating the Minimum Equivalent Digraph
- Approximating the minimum strongly connected subgraph via a matching lower bound
- Approximating Transitive Reductions for Directed Networks
- Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
- Approximation algorithms for nonuniform buy-at-bulk network design
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- Capacity-preserving subgraphs of directed flow networks
- Computationally Related Problems
- Designing multi-commodity flow trees
- Extensions and limits to vertex sparsification
- Graph spanners: a tutorial review
- scientific article; zbMATH DE number 6474898 (Why is no real title available?)
- scientific article; zbMATH DE number 5485537 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 6472639 (Why is no real title available?)
- Minimizing congestion in general networks
- Network flows. Theory, algorithms, and applications.
- Oblivious routing on node-capacitated and directed graphs
- On the approximability of robust network design
- Optimal oblivious routing in polynomial time
- Reducibility among combinatorial problems
- Routing of uncertain traffic demands
- The design of approximation algorithms
- The Transitive Reduction of a Directed Graph
- Towards \((1 + \varepsilon)\)-approximate flow sparsifiers
- Vertex sparsifiers: new results from old techniques
This page was built for publication: Traffic-oblivious multi-commodity flow network design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7364359)
