Algorithms for Placing Monitors in a Flow Network

Details Algorithms for Placing Monitors in a Flow Network Algorithms for Placing Monitors in a Flow Network

2009-08-29

arxiv.org/abs/0908.4309v1

Computer Science

Data Structures and Algorithms

13 pages, 5 figures. Preliminary version appeared in AAIM 2009

Scientific paper

In the Flow Edge-Monitor Problem, we are given an undirected graph G=(V,E), an integer k > 0 and some unknown circulation \psi on G. We want to find a set of k edges in G, so that if we place k monitors on those edges to measure the flow along them, the total number of edges for which the flow can be uniquely determined is maximized. In this paper, we first show that the Flow Edge-Monitor Problem is NP-hard, and then we give two approximation algorithms: a 3-approximation algorithm with running time O((m+n)^2) and a 2-approximation algorithm with running time O((m+n)^3), where n = |V| and m=|E|.

Affiliated with

Also associated with

No associations

Rating

Algorithms for Placing Monitors in a Flow Network does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algorithms for Placing Monitors in a Flow Network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithms for Placing Monitors in a Flow Network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-597345