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

Authors:
Takuro Fukunaga
Affiliations:
Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Japan
Venue:
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Year:
2011

Citing 13
Cited 0

Theory of linear and integer programming

Theory of linear and integer programming
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
Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems

Journal of Computer and System Sciences - Special issue on FOCS 2001
Minimum cost source location problem with local 3-vertex-connectivity requirements

Theoretical Computer Science
Approximating minimum bounded degree spanning trees to within one of optimal

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
The source location problem with local 3-vertex-connectivity requirements

Discrete Applied Mathematics
Minimum Cost Source Location Problems with Flow Requirements

Algorithmica
Additive approximation for bounded degree survivable network design

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Minimizing a monotone concave function with laminar covering constraints

Discrete Applied Mathematics
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

Quantified Score

Hi-index	0.01

Visualization

Abstract

The source location problem is a problem of computing a minimum cost source set in an undirected graph so that the connectivity between the source set and each vertex is at least the demand of the vertex. In this paper, 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 vertices except v. We propose an O(d* log d*)- approximation algorithm for the problem with maximum demand d*. We also define a variant of the source location problem and propose an approximation algorithm for it.