Minimum Cost Source Location Problems with Flow Requirements

@inproceedings{Sakashita2006MinimumCS,
  title={Minimum Cost Source Location Problems with Flow Requirements},
  author={Mariko Sakashita and Kazuhisa Makino and Satoru Fujishige},
  booktitle={LATIN},
  year={2006}
}
In this paper, we consider source location problems and their generalizations with three connectivity requirements (arc-connectivity requirements λ and two kinds of vertex-connectivity requirements κ and κ̂), where the source location problems are to find a minimum-cost set S ⊆ V in a given graph G = (V,A) with a capacity function u : A → R+ such that for each vertex v ∈ V , the connectivity from S to v (resp., from v to S) is at least a given demand d(v) (resp., d(v)). We show that the source… CONTINUE READING

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…