scientific article; zbMATH DE number 5485528
From MaRDI portal
Publication:3549697
Cited in
(19)- Inapproximability of survivable networks
- A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems
- Black-box reductions for cost-sharing mechanism design
- Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming
- Topology design for on-demand dual-path routing in wireless networks
- Approximating node-connectivity augmentation problems
- An improved approximation algorithm for minimum-cost subset k-connectivity (extended abstract)
- An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem
- A note on iterated rounding for the survivable network design problem
- Approximation algorithms and hardness of the \(k\)-route cut problem
- Black-box reductions for cost-sharing mechanism design
- scientific article; zbMATH DE number 7053371 (Why is no real title available?)
- scientific article; zbMATH DE number 7651209 (Why is no real title available?)
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
- Cluster before you hallucinate: node-capacitated network design and energy efficient routing
- Survivable network design with group-to-group requirement
- Streaming algorithms for network design
- Approximating fault-tolerant group-Steiner problems
- A note on Rooted Survivable Networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549697)
