Single-sink fractionally subadditive network design
From MaRDI portal
Publication:5111735
Recommendations
- Improved approximation for fractionally subadditive network design
- Single-sink network design with vertex connectivity requirements
- Approximation algorithms for a capacitated network design problem
- On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem
- On network design problems: fixed cost flows and the covering steiner problem
Cites work
- scientific article; zbMATH DE number 2089220 (Why is no real title available?)
- A General Approximation Technique for Constrained Forest Problems
- A factor 2 approximation algorithm for the generalized Steiner network problem
- A tight bound on approximating arbitrary metrics by tree metrics
- An improved approximation algorithm for requirement cut
- Combinatorial auctions with decreasing marginal utilities
- Designing Least-Cost Nonblocking Broadband Networks
- Fast Approximation Algorithms for the Generalized Survivable Network Design Problem
- From uncertainty to nonlinearity: solving virtual private network via single-sink buy-at-bulk
- Network design with a discrete set of traffic matrices
- Node-and edge-deletion NP-complete problems
- On maximizing welfare when utility functions are subadditive
- Provisioning a virtual private network: a network design problem for multicommodity flow
- Routing of uncertain traffic demands
- The VPN conjecture is true
- Welfare guarantees for combinatorial auctions with item bidding
Cited in
(4)
This page was built for publication: Single-sink fractionally subadditive network design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111735)
