The added interest to this problem stems from the fact that standard tools used for approximating network design problems do not seem to apply to f-SAND.

This is the first improve- ment over the (trivial) k-approximation obtained using shortest paths for any k. Our approximation algorithm is based on pairing ...

Jul 5, 2017 · Furthermore, we prove some structural results that prevent many well-known techniques from doing better than the known O(\log n)-approximation.

We consider the problem of maximizing a fractionally subadditive function under an increasing knapsack constraint. An incremental solution to this problem ...

Abstract. We consider the problem of maximizing a fractionally subadditive function under an increasing knapsack constraint. An incremental solution to this ...

... Subadditive ... Fast approximation algorithms for the generalized survivable network design problem. ... An improved approximation algorithm for requirement cut.

Missing: Fractionally Subadditive

TL;DR: A 2-approximation algorithm for the Steiner tree problem was given in this paper with running time of O(n 2 log n) for the shortest path problem, where n ...

We first obtain mechanisms with an improved approximation ratio for weighted coverage valuations, a special class of submodular functions. We then provide a ...

Missing: Network | Show results with:Network