Approximating source location and star survivable network problems
type: Item
instance of: scholarly article
title: Approximating source location and star survivable network problems
zbMATH Open document ID: 1378.90083
author: Guy Kortsarz
author: Zeev Nutov
published in: Theoretical Computer Science
publication date: 2017-05-12T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 6715027
zbMATH Keywords: source location
zbMATH Keywords: survivable network
zbMATH Keywords: submodular cover
MaRDI profile type: Publication
full work available at URL: j.tcs.2017.02.008
OpenAlex ID: W2589799731
cites work: Locating sources to meet flow demands in undirected networks
cites work: Generalized submodular cover problems and applications
cites work: An algorithm for source location in directed graphs
cites work: An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
cites work: On sparse subgraphs preserving connectivity properties
cites work: An application of submodular flows
cites work: Approximating minimum cost source location problems with local vertex-connectivity demands
cites work: Q3128880
cites work: Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs
cites work: A factor 2 approximation algorithm for the generalized Steiner network problem
cites work: Tight approximation algorithm for connectivity augmentation problems
cites work: Parameters of Two-Prover-One-Round Game and The Hardness of Connectivity Problems
cites work: On the ratio of optimal integral and fractional covers
cites work: Algorithmic Aspects of Graph Connectivity
cites work: Minimum cost source location problem with vertex-connectivity requirements in digraphs
cites work: Approximating minimum-cost connectivity problems via uncrossable bifamilies
cites work: Approximating node-connectivity augmentation problems
cites work: Minimum cost source location problems with flow requirements
cites work: Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
cites work: An analysis of the greedy algorithm for the submodular set covering problem
DOI: 10.1016/J.TCS.2017.02.008
description: scientific article; zbMATH DE number 6715027