Minimum Cost Source Location Problems with Flow Requirements

DOI10.1007/11682462_70zbMath1145.90419OpenAlexW2680469199MaRDI QIDQ3525810

Kazuhisa Makino, Satoru Fujishige, Mariko Sakashita

Publication date: 18 September 2008

Published in: LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11682462_70

zbMATH Keywords

location problemcombinatorial optimizationapproximation algorithmconnectivity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Approximation algorithms (68W25) Connectivity (05C40)

Related Items (7)

Minimum degree orderings ⋮ Sink location to find optimal shelters in evacuation planning ⋮ Minimum cost source location problem with local 3-vertex-connectivity requirements ⋮ Static and dynamic source locations in undirected networks ⋮ Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs ⋮ Minimum cost source location problems with flow requirements ⋮ A note on two source location problems

This page was built for publication: Minimum Cost Source Location Problems with Flow Requirements