Minimum Cost Source Location Problems with Flow Requirements

DOI10.1007/11682462_70MaRDI QIDQ3525810zbMATH OpenOpenAlexFDO

Authors Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige

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

approximation algorithmcombinatorial optimizationconnectivitylocation problem

Mathematics Subject Classification ID

Connectivity (05C40) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) 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

Cited in

(16)

• A note on two source location problems
• Minimum cost source location problems with flow requirements
• Locating sources to meet flow demands in undirected networks
• Approximating source location and star survivable network problems
• Simultaneous source location
• Sink location to find optimal shelters in evacuation planning
• Deterministic flow-demand location problems
• scientific article; zbMATH DE number 2152473 (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
• Minimizing the expense transmission time from the source node to demand nodes
• Minimum degree orderings
• Minimum cost source location problem with local 3-vertex-connectivity requirements
• 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 Q3525810)