scientific article; zbMATH DE number 5485528
From MaRDI portal
Publication:3549697
Cited in
(17)- Approximation algorithms and hardness of the \(k\)-route cut problem
- A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems
- An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem
- Approximating node-connectivity augmentation problems
- Cluster before you hallucinate: node-capacitated network design and energy efficient routing
- Topology design for on-demand dual-path routing in wireless networks
- An improved approximation algorithm for minimum-cost subset \(k\)-connectivity (extended abstract)
- Black-box reductions for cost-sharing mechanism design
- A note on iterated rounding for the survivable network design problem
- Inapproximability of survivable networks
- scientific article; zbMATH DE number 7651209 (Why is no real title available?)
- Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
- Black-box reductions for cost-sharing mechanism design
- A note on Rooted Survivable Networks
- Approximating fault-tolerant group-Steiner problems
- scientific article; zbMATH DE number 7053371 (Why is no real title available?)
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)
