Minimum cost source location problems with flow requirements

DOI10.1007/S00453-007-9012-YMaRDI QIDQ2482728zbMATH OpenOpenAlexFDO

Authors Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige

Publication date 23 April 2008

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-007-9012-y

zbMATH Keywords

Approximation algorithmCombinatorial optimizationConnectivityLocation problem

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Discrete location and assignment (90B80) Combinatorial optimization (90C27)

Recommendations

• Minimum Cost Source Location Problems with Flow Requirements
• Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands
• Approximating minimum cost source location problems with local vertex-connectivity demands
• Minimum cost source location problem with local 3-vertex-connectivity requirements
• A note on two source location problems

Cites work

• A threshold of ln n for approximating set cover
• Algorithms and Computation
• An algorithm for source location in directed graphs
• An analysis of the greedy algorithm for the submodular set covering problem
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2079376 (Why is no real title available?)
• scientific article; zbMATH DE number 2152473 (Why is no real title available?)
• scientific article; zbMATH DE number 956792 (Why is no real title available?)
• Locating sources to meet flow demands in undirected networks
• Minimum cost source location problem with vertex-connectivity requirements in digraphs
• Minimum Cost Source Location Problems with Flow Requirements
• On the hardness of approximating minimization problems
• Simultaneous source location
• Source location problems considering vertex-connectivity and edge-connectivity simultaneously
• The source location problem with local 3-vertex-connectivity requirements
• Transversals of subtree hypergraphs and the source location problem in digraphs

Cited in

(17)

• A note on two source location problems
• Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs
• Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
• Approximating minimum cost source location problems with local vertex-connectivity demands
• The source location problem with local 3-vertex-connectivity requirements
• Approximating source location and star survivable network problems
• Capacitated network design on undirected graphs
• Simultaneous source location
• Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands
• Minimum Cost Source Location Problems with Flow Requirements
• Deterministic flow-demand location problems
• scientific article; zbMATH DE number 2080258 (Why is no real title available?)
• Approximating source location and star survivable network problems
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs
• Static and dynamic source locations in undirected networks
• Source location in undirected and directed hypergraphs

This page was built for publication: Minimum cost source location problems with flow requirements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482728)