Approximating minimum cost source location problems with local vertex-connectivity demands

Authors:
Takuro Fukunaga
Affiliations:
National Institute of Informatics, Tokyo, Japan
Venue:
Journal of Discrete Algorithms
Year:
2013

Citing 12
Cited 0

Minimum cost source location problem with vertex-connectivity requirements in digraphs

Information Processing Letters
Locating sources to meet flow demands in undirected networks

Journal of Algorithms
Minimum cost source location problem with local 3-vertex-connectivity requirements

Theoretical Computer Science
The source location problem with local 3-vertex-connectivity requirements

Discrete Applied Mathematics
Minimum Cost Source Location Problems with Flow Requirements

Algorithmica
Minimizing a monotone concave function with laminar covering constraints

Discrete Applied Mathematics
A note on two source location problems

Journal of Discrete Algorithms
Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs

Journal of Discrete Algorithms
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences
Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Iterative Methods in Combinatorial Optimization

Iterative Methods in Combinatorial Optimization
Approximating Node-Connectivity Augmentation Problems

Algorithmica

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the source location problem, the goal is to compute a minimum cost source set in a graph so that the connectivity between the source set and each vertex is at least the demand of the vertex. In this paper, we consider the problem for undirected graphs, and the connectivity between a source set S and a vertex v is defined as the maximum number of paths between v and S no two of which have common vertex except v. We give an O(d^@?logd^@?)-approximation algorithm for the problem with maximum demand d^@?. We also define a variant of the source location problem and give an approximation algorithm for it.