Simultaneous source location

@article{Andreev2009SimultaneousSL,
  title={Simultaneous source location},
  author={Konstantin Andreev and Charles Garrod and Daniel Golovin and Bruce M. Maggs and Adam Meyerson},
  journal={ACM Trans. Algorithms},
  year={2009},
  volume={6},
  pages={16:1-16:17}
}
We consider the problem of simultaneous source location: selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied simultaneously, with the goal of minimizing the number of locations chosen. For general directed and undirected graphs we give an <i>O</i>(log <i>D</i>)-approximation algorithm, where <i>D</i> is the sum of demands, and prove matching Ω(log <i>D</i>) hardness results assuming <b>P</b> ≠ <b>NP</b>. For undirected trees, we give an exact… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Similar Papers

Loading similar papers…