Locating Sources to Meet Flow Demands in Undirected Networks

DOI10.1006/jagm.2001.1203zbMath0992.68227OpenAlexW2060179276MaRDI QIDQ2777606

Satoru Fujishige, Kouji Arata, Kazuhisa Makino, Satoru Iwata

Publication date: 11 September 2002

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.2001.1203

zbMATH Keywords

location problemgreedy algorithmmaximum adjacency ordering

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (23)

Maximum-cover source location problems with objective edge-connectivity three ⋮ Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs ⋮ Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs ⋮ An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks ⋮ Minimum cost source location problem with local 3-vertex-connectivity requirements ⋮ Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested ⋮ Static and dynamic source locations in undirected networks ⋮ Approximating minimum cost source location problems with local vertex-connectivity demands ⋮ The root location problem for arc-disjoint arborescences ⋮ Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs ⋮ The source location problem with local 3-vertex-connectivity requirements ⋮ Minimizing a monotone concave function with laminar covering constraints ⋮ POSI-MODULAR SYSTEMS WITH MODULOTONE REQUIREMENTS UNDER PERMUTATION CONSTRAINTS ⋮ Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands ⋮ Approximating source location and star survivable network problems ⋮ Minimum cost source location problems with flow requirements ⋮ Multi-commodity Source Location Problems and Price of Greed ⋮ On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines ⋮ Posimodular function optimization ⋮ A note on two source location problems ⋮ Approximating Source Location and Star Survivable Network Problems ⋮ Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs ⋮ Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three

This page was built for publication: Locating Sources to Meet Flow Demands in Undirected Networks