Incremental Sensor Placement Optimization on Water Network
|
|
- Branden Blankenship
- 5 years ago
- Views:
Transcription
1 Incremental Sensor Placement Optimization on Water Network Xiaomin Xu 1, Yiqi Lu 1, Yanghua Xiao 1, Sheng Huang 2, and Wei Wang 1 1 Department of Computing and Information Technology, Fudan University, Shanghai , Peoples Republic of China 2 IBM Research, Shanghai , Peoples Republic of China {asuka ,luyiqi}@gmail.com, shawyh@fudan.edu.cn, huangssh@cn.ibm.com, weiwang1@fudan.edu.cn Abstract. With the development and expansion of cities, the public water distribution systems in cities would be enlarged as a consequence. Therefore, as far as the monitoring of water distribution systems is concerned, strategic placement of additional sensors throughout distribution network would exert great impact on the performance of real-time early warning systems (EWSs). On the other hand, constraints of the modification cost on the original placement strategy should also be taken into consideration. In this paper, we reduce the incremental sensor deployment optimization problem to set cover problem and algorithms with provable performance guarantees because of the submodularity property of the objective function based on greedy heuristic are designed and optimized by local search approaches such as simulated annealing. The detailed experimental results using two benchmark distribution networks demonstrate the effectiveness and efficiency of our algorithms. 1 Introduction For early warning systems (EWSs) design, the general goal of sensor placement to optimization is to place a limited number of sensors in a water distribution network such that the impact to public health of an accidental or intentional injection of contaminant is minimized. There have been a large amount of works[1-14] proposed on optimizing water sensor network placement. [1] gives an overview for the literature on optimizing sensor networks for containment detection. Most of these approaches are only able to perform on small networks up to about 500 nodes. Many approaches cannot provide provable performance guarantees since they adopt heuristics. To name a few, [1] equate the placement problem with a p-median problem and make use of a large toolset of existing algorithms for this problem. They consider two algorithm mixed integer programming(mip) and a fast heuristic(grasp). [13] uses genetic algorithms and [8] adopt crossentropy selection. The first algorithm which gives a performance bound is [14]. In their work, a algorithm CLEF is proposed by exploiting the submodularity property [15,16], which can achieve at least a fraction of ( 1 1 e ) of the optimal solution. This algorithm can handle network of size up to nodes. All the
2 2 algorithms mentioned above do not consider the sensor placement problem accumulatively. With the development and expansion of cities, the public water distribution systems in cities would be enlarged as a consequence. Therefore, as far as the monitoring of water distribution systems is concerned, strategic placement of additional sensors throughout distribution network would play a vital role in real-time early warning systems (EWSs). On the other hand, the change of the structure of original water distribution systems may exert great influence on the efficiency of EWSs and may be costly. Sometimes, we was not given a fixed amount of sensors and to optimize the objectives defined in previous section, instead, the requirement of sensor placement problem would be: given an expected upper-bound of an objective criteria and to use less sensors in the sensor placement planning to detect possible contamination scenarios as more as possible. That kind of requirement for sensor placement problem is common, because with the expansion of the water distribution system in the city, a lager area should be protected from contamination. What the city government concerned would be: is there existing a global expected upper-bound of criteria such as detection time for the sensor placement design such that the contamination influence could be under control. Therefore, it would be a great challenge to design new strategic to deploy sensors incrementally under the condition that the efficiency should be guaranteed and alteration cost on original sensor placement should be limited. In this paper, we reduce the sensor placement optimization problem in the condition of incremental placement and cost limitation on sensor placement modification to set-cover problem. Optimization Algorithm based on Greedy Heuristic is also presented, whose solution quality is guaranteed due to the sub-modularity property of the Optimization Objective Function defined. Our contributions are: 1. We consider the sensor placement incrementally and take the dynamic change of water distribution system and cost limitation on placement modification in to account. 2. Algorithm for the problem is proposed with provable bound of the solution it returned. Different modification strategies used in the algorithm purposed are also discussed briefly to judge the better strategy. 3. the detailed experimental results using two benchmark distribution networks demonstrate the robustness of the solution found and efficiency of our algorithms. 2 Preliminariesn 2.1 MIP model In MIP model, water distribution systems are modeled as undirected graph G = (V, E), vertices in set V represents junctions, tanks, and other resources in the systems. Edges in E represent pipes, pumps, and valves. In MIP model, A denotes the set of contamination scenarios which consist of several individual
3 3 contamination events. Events can be characterized by quadruples of the form (v x, t s, t f, X), where v x V is the origin of the contamination event, t s and t f are the contamination event start and stop times, and X is the contamination event profile. t a s, t a b respectively denote the start and stop times of the contamination event for scenario a. d a (t) denotes the total network-wide impact of a contamination scenario a at any given point in time t t a s. γ aj denote the earliest time t at which a hypothetical sensor at junction v j can detect contaminant due to a contamination scenario a. d aj = d a (γ aj ) is the total impact of contamination scenario a if the contaminant is first detected by a sensor at v j. t denotes the stop time imposed on the water quality simulations If no contaminant ever reaches v j, then γ aj = t. Let q denote a dummy location that corresponds to failed detection of contamination scenario a. d aq is the total impact of contamination scenario a, if it is not detected before t. MIP model is used to model the placement of p sensors on a set L V, with the objective of minimizing the expected impact of a set A of contamination scenarios. Each contamination scenario A has a likelihood α a such that a A α a = 1. L a L {q} be the subset of vertices in L {q} that could possibly be contaminated by scenario a. x ai is an indicator variable with value 1 if location i raised the alarm for contamination scenario a and 0 otherwise. Binary decision variable s i for each potential sensor location i L equals 1 if a sensor is placed at location i and 0 otherwise. The design objective is to minimize a A α a i L a d ai x ai. Then the formalization of MIP model on sensor placement problem would be as following: (DSP )minimize α a d ai x ai a A i L a i L a x ai = 1, a A x ai s i, a A, i L a (1) where i L s i p s i {0, 1}, i L 0 x ai 1, a A, i L a 2.2 Modification on MIP model We make some modification on the original MIP model for the requirement of additional sensor placement planning problem. Definition of our additional sensor placement problem is: Given current water distribution system G = (V, E ) and the original version of water distribution system denoted as G = (V, E) (assuming V V ), and the current water sensor placement vector S on G. Now we want to place additional u sensors on G. c 1, c 2 denote the cost of installing and uninstalling a sensor respectively and C represents the upper bound of expected cost of sensor placement alteration. Our optimization objective is identical to original problem.
4 4 Vertex set L 1 = {i V S i = 1} represents set of vertices in V which has been placed with sensor previously. The formalization of our optimization problem is: minimize α a a A i L a d aix ai i L a x ai = 1, a A x ai s i, a A, i L a i L where a s i i L a s i + u s i {0, 1}, i L 0 x ai 1, a A, i L a (c 1 + c 2 ) i L 1 (s i s i) + u c 2 C (2) 3 Incremental sensor placement optimization problem The placement performance requirement discussed in the previous section can be defined for both of incremental and non-incremental sensor placement problem. Definition 1 (covered scenario). if contamination scenario a detected under sensor placement strategy S and the total impact of contamination scenario a, denoted as d a is at most M, then we say that scenarios a is covered by sensor placement strategy S with contaminative impact at most M. Definition 2 (non-incremental sensor placement). Given the expected upperbound of the criteria considered M and other parameter definitions are the same to MIP model, find a sensor placement strategy S such that number of scenarios covered by S is maximized. When incremental sensor placement problem is concerned, cost of installing and uninstalling a sensor should be taken into account. Hence, in the following definition, we define a constant upper bound for the number of modifiable original sensor placements. Definition 3 (incremental sensor placement). Given the expected upperbound of the criteria considered M, number of sensors to be incrementally placed p, upper-bound of the number of modifiable original sensor placements o, the original sensor place strategy S 0 and other parameter definitions are the same to MIP model, find a sensor placement strategy S such that number of scenarios covered by S is maximized. 3.1 Reduction to set cover problem Associating scenario set of vertex v represents all the scenarios which could be detected at vertex v with the contaminative impact within constant M, denoted as R v,m = {a a A, v V, d av M}, where d av represent the contaminative
5 5 impact of scenario a when detected at vertex v, similar to definition in MIP model. In order to solve the sensor placement problem on our definitions, we reduce this problem to Maximizing-aimed Set-Cover Problem. Definition 4 (Maximizing-aimed Set-Cover Problem). Given a universe E = {e 1...e n }, collection C = {c 1...c m }, such that for each c i C: c i E, to find a subset C of collection C whose cardinality is p, so that the cardinality C i is maximized. C i C Then we can reduce the incremental sensor placement problem to set-cover problem. Definition 5 (Evaluation Function). For any sensor placement strategy S V and the expected upper-bound of the criteria considered M, the evaluation function F (S) is defined as: F(S) = v S R v,m Definition 6 (incremental sensor placement based on set cover). Given the scenario set A = {a 1...a n } as the universe, the expected upper-bound of the criteria considered denoted as M, G(V, E) represent the water distribution network, collection C = {R v,m v V } and the number of sensor to be place incrementally p, upper-bound of the number of modifiable original sensor deployed o, the original sensor place strategy SO. Denote sensor place strategy as a vertex set, in which each vertex is chosen to place a sensor. Our goal is to find sensor place strategy C, whose cardinality is p + SO and SO C o, so that the cardinality R v,m is maximized. v C 3.2 Submodularity of evaluation fuction The Evaluation Function has several intuitive properties. It is nonnegative, F( ) = 0, i.e., if we place no sensors, the evaluation function is 0. We can also see that evaluation function F is nondecreasing, i.e., for placement strategies A B V, it holds that F (A) F (B), hence the evaluation function can only increase if we place more sensors. There is an additional intuitive property: if we add a sensor to a large deployment, we would expect less object function gain than if we add the sensor to a small deployment. This diminishing returns is formalized by the combinatorial concept of submodularity [15] : A set function F is called submodular if for all subsets A B S and elements S, it holds that F(A {s}) F(A) F(B {s}) F(B), in other words, adding s to the smaller set A helps more than adding it to the larger set B. In fact, we can prove that the Evaluation Function as defined earlier are submodular. Theorem 1. the Evaluation Function F is submodular.
6 6 Proof. Firstly, for any sensor placement strategy A V, it holds true that: F(A {i}) = R v,m v A {i} F(A) = R v,m v A F(A {i}) F(A) = R v,m = R v,m v A {i},v / A v {A {i} A} Assume that :B A, the results still hold true for B. Secondly, according to set operation theorems, we know that: A {i} A = (A {i}) A = (A A) ({i} A) = {i} A Because therefore, B A A B {i} A {i} B F (A {i}) F (A) = R v,m F (B {i}) F (B) = v A {i} v B {i} R v,m A {i} B {i} R v,m v A {i} F (A {i}) F (A) F (B {i}) F (B) R v,m v B {i} 4 Algorithms for Optimization In the last section, we have showed that the sensor placement optimization objective function is submodular. Let s firstly consider the non-incremental sensor placement problem, ( ) in which p sensors will be placed in V places. Obviously, there are possible deployment strategies, which is impossible V p to be searched exhaustively to find the global-optimal deployment strategy for large water distribution network. On the other hand, when our incremental sensor placement problem is considered, which attempt to place p additional sensors and modify placement( of at most ) ( o sensors ) placed originally, the strategy SO V o searching space would be,(where SO represent the original sensor placement strategy). This search space is even larger than that of o p the non-incremental sensor placement problem. As a result, various heuristic approaches are proposed, which try to find high quality solutions through a search procedure. e.g., genetic algorithms [9], mixed integer programming solutions(mip) [2]. However, many of the heuristic approaches don t provide provable quality guarantee about the solution they returned or running-time guarantee.
7 7 But the greedy heuristic approach is an exception, which has been proven to provide specific bound for the quality of the solution it returned. Hence, in the following sections, we will base our algorithm on greedy heuristic because of its strong theoretical guarantees. For simplicity, we will discuss the basic greedy algorithm for non-incremental sensor placement problem firstly. Then some modification will be discussed to ensure that the greedy heuristic would be suitable for solving the incremental sensor placement problem. 4.1 Basic Greedy Heuristic Approach The basic greedy heuristic algorithm start with the empty placement, S = and proceeds iteratively. In each iteration, a new place v V which can increase the Evaluation Function most would be chosen as the next place to deploy a sensor. a fundamental result by [15] shows that this intuitive procedure is near optimal for the class of nondecreasing submodular functions: The greedy algorithm always return a set S G whose evaluation function value F (S G ) such that F (S G ) (1 1 e )F (S ), where S denote the global optimal placement of p sensors. Hence, the greedy solutions achieve an approximation of at least 1 1 e times to the global optimal solution. The 1 1 e 63% of the optimal bound on the greedy algorithm is an offline bound. The submodularity property of the Evaluation Function F also guarantees a tighter bound on the solution the greedy algorithm found. Let S denote an arbitrary solution for sensor placement problem, and for each place a / S, let δ a = F (S {a}) F (S) represent the improvement gained when a sensor is placed at place a. Assume p sensors would be placed, S represents the optimal solution for deploying p sensors, and s 1,..., s p represent the p places with top-p largest improvement gain, then the online bound could be found for arbitrary solution:f (S ) F (S) + p j=1 δ s j. Theorem 2. F (S ) F (S) + p j=1 δ s j Proof. Because the function with submodularity property is nondecreasing, thus, we have: F (S ) F (S S) Secondly, we define S i = i t=1 s t for i = 1,...p, and S 0 = It holds true that S Si = S S i 1 {s i }, S S i S. Hence, according to the submodularity property, we have the following inequalities: for i 1,..., p So, p F (S S i ) F (S S i 1) F (S {s i }) F (S) i=1 F (S S i ) F (S S i 1) p i=1 F (S {s i }) F (S)
8 8 Which is equivalent to: F (S S ) F (S) p i=1 F (S {s i }) F (S) = p j=1 δ s j According to definition that s 1,..., s p represent the p places with top-p largest improvement gain, thus, we have p j=1 δ s p j j=1 δ s j Therefore, F (S ) F (S) F (S S ) F (S) p j=1 δ s j Running time of the greedy algorithm The running time of the algorithm is proportional to the number of locations V = n, the contamination scenarios considered m and the time taken to compute the evaluation function F, which is a union operation in this case whose complexity is O(m). In each iteration, O(n) places should be tested for evaluation function F, thus, the total running time would be O(pnm). Optimization on the basic greedy algorithm In our implementation, some modification would be made on the basic greedy algorithm to enhance its efficiency(see Algorithm 1). The key idea lies in that the set union operation would cost less if the cardinality of sets decrease. Thus, instead of recalculating δ v for each currently unselected place v repeatedly in every iteration, we update set R v,m for each currently unselected place v at the end of each iteration by eliminating the scenarios which has been covered by the place chosen in the iteration. In this case, at each iteration, it hold true that δ v = R v,m and with the proceeding of the algorithm, cardinality of most R v,m would decrease dramatically because we actively update R v,m. Algorithm 1 Optimized Greedy Heuristic Input: p, M, R v,m for v V Output: S G 1: iter 1 2: S G 3: while iter p do 4: 5: v c arg max v V SG R v,m S G {v c} S G 6: for each v V S G do 7: R v,m R v,m R vc,m 8: end for 9: iter iter : end while 11: return S G
9 9 4.2 Algorithm for Incremental Sensor Placement Problem In the last two sections, we have discuss the greedy heuristics algorithms for non-incremental sensor placement optimization. In this section, we would apply the greedy heuristic to incremental sensor placement problem. We use DecisionF unction to decide which partition of the original sensor placement strategy to be preserved and we will discuss different strategies adapted in DecisionF unction and their performance in detail later. According our definition of incremental sensor placement problem, there are at lest SO o sensors remain unchanged in our new sensor placement strategy. Algorithm can be divided into 3 parts. The first part of algorithm is DecisionF unction which is responsible for choosing SO o sensors in SO to be preserved in the final placement strategy(denoted as S r in the algorithm 2). The second part of the algorithm would update R v,m for every place v at which no sensor is deployed to eliminate the scenarios covered by the SO o sensors chosen previously. The third part of the algorithm is identical to Algorithm 1, in which p + o sensors would be placed by greedy heuristic. Strategies Applied in DecisionFunction DecisionF unction is responsible for choose SO o sensors to be preserved in the final sensor placement strategy. Obviously, that decision would make a significant impact on the quality of the final sensor placement strategy found by Algorithm 2. In this paper, the following strategies would be considered. 1. Randomized Heuristic(RH) The randomized Heuristic simply choose SO o sensors from the original sensor placement strategy SO randomly. 2. Greedy Heuristic(GH) The greedy heuristic strategy is identical to algorithm 1, which start with the empty placement, S = and proceeds SO o times iteratively. In each iteration, a new place v SO which can provide increase the Evaluation Function most would be chosen as the next place to deploy a sensor. 3. Simulated Annealing Optimization of Randomized Heuristic(SA) Firstly, we use Randomized Heuristic to choose SO o sensors denoted as S RH. Then, the local search heuristic approach: Simulated Annealing would be applied to the original solution to reach a local optimal solution. Let S cur denotes the solution to be optimized in current iteration. The simulated annealing process, in each round, purposes an exchange of a selected location s S cur and an unselected location s SO S cur and compute the evaluation function gain of the exchange δ = F (S cur {s } {s}) F (S cur ). If δ is positive (i.e. the exchange operation has optimized the previous solution), the proposal is accepted. Otherwise, the proposal is accepted with probability exp( δ/ ϑ t), where ϑ t is the annealing tempature at round t. We use exponential decay schema, where ϑ t = Cq t, for some large constant C and small constant q(0 < q < 1).
10 10 Algorithm 2 Optimized Greedy Heuristic for Incremental Sensor Placement Input: p, M, R v,m for v V,SO,o Output: S G 1: S r DecisionF unction(so, SO o) 2: for each v S r do 3: for each v V do 4: R v,m R v,m R v,m 5: end for 6: end for 7: S G OptimizedGreedyHeuristic(p + o, M, V S G) 8: return S G SG no modification all modifiable limited modification all modifiable no modification limited modification DetectRatio DetectRatio Sensor Placed Incrementally (a) BWSN Sensor Placed Incrementally (b) BWSN2 Fig. 1. (a):detect ratio for BWSN1, assuming 5 sensors have been deployed on network originally, o = 2(b): detect ratio for BWSN1, assuming 10 sensors have been deployed on network originally, o = 4
11 11 5 Experimental Study 5.1 Network Analyzed and Simulation Setting We considered both the small network on 129 nodes (BWSN1),and a large, realistic, 12,527 node distribution network (BWSN2) provided as part of the BWSN challenge [17]. We run EPANET hydraulic simulation and water quality simulation for the two water distribution networks described above. In term of criteria to evaluate contamination impact, in August 2006, the Battle of Water Sensor Networks(BWSN) [17] challenge proposed four realistic objective functions: the time until an intrusion is detected (Z 1 ), the expected population affected by an intrusion(z 2 ), the expected amount of contaminated water consumed(z 3 ) and likelihood of detection(z 4 ). The criteria Z 2, Z 3, Z 4 could be consider as a function varying with elapsed time, thus, we adapt Z 1 as the evaluation criteria in experiment. For network BWSN1, 516 contamination scenarios were generated for each of the nodes in the water distribution network at 4 different attack time: 6 A.M., 12 A.M., 6 P.M., 12 P.M. Each contamination features 96-hour injection of a fictional contaminant at strength 1000mg/min (using EPANET s MASS injection type) and had a total duration of 96 hours. For network BWSN2, 4000 contamination scenarios were generated for 1000 nodes randomly selected in the water distribution network and other settings are the same as BWSN1. In the following experiments, we fix M = 120, 150(min) for BWSN1 and BWSN2 respectively. For both of the two network s water quality simulation, we assume that a sensor would alarm when the concentration of contaminant surpass 10mg/L at the place the sensor was deployed. The quality of the sensor placement strategy S is measured by detect ratio, which is defined as F (S) A, where A denotes the total number of contamination scenarios considered. 5.2 Incremental vs non-incremental Sensor Placement In this section, we will show the necessity of taking the modification cost on original sensor deployment strategy into consideration, when we aim at optimize the performance of sensor placement under the incremental sensor placement case. In this case, 3 modification strategy are compared: no modification, limited modification and complete modification on original placement on both the performance quality and the modification cost spent on original sensor placement. For each network, we would generate an original sensor placement randomly and set SO = 5 and SO = 10 for network BW SN1 and network BW SN2 respectively. o is set as 2 and 5 for BW SN1 and BW SN2 in incremental case study. It s clear that limited modification served as a trade-off compared with the other two strategies. In Figure 1, although the detect ratio is just a little lower than that of complete modification strategy and higher than that of no modification strategy, the modification cost is upper-bounded by o = 2, 5 while that of complete modification strategy much higher on average(number of sensor to be replaced is 5,10 in BWSN1 and BWSN2 respectively).
12 Analysis of different Strategies Applied in DecisionFunction In Section 4.2, we have purpose 3 different strategies for DecisionF unction to choose the sensor placements to be preserved in the final sensor placement. In this section, we will compare the three strategies on the quality of final sensor placement strategy. In Figure 2, we set SO = 5 and SO = 10 for network BW SN1 and network BW SN2 respectively. o is set as 2 and 5 respectively for BW SN1 and BW SN2 in incremental case study. We also set iteration number to be 1000 for the simulated annealing strategy. According to Figure 2(a), simulated annealing(sa) and random heuristic(rh) strategy show higher detect ratio than greedy heuristic(gh) does. However, in Figure 2(b), the performance of the 3 strategies are relatively close to each other, because the scale of network BWSN2 is much larger, which made it more difficult for local search strategy to jump out from a local optimal solution. DetectRatio RH SA GH Sensor Placed Incrementally DetectRatio 0.40 RH SA 0.35 GH Sensor Placed Incrementally (a) DecisionF unction for BWSN1 (b) DecisionF unction for BWSN2 Fig. 2. (a):decisionf unction for BWSN1 with 3 different strategies to preserve a given number of sensors(set o = 2) in the original sensor placement strategy(5 sensors) (b): DecisionF unction for BWSN2 with 3 different strategies to preserve a given number of sensors(set o = 5) in the original sensor placement strategy(10 sensors) 5.4 Robustness against contamination scenario The number of possible contamination scenarios is impossible to be enumerated even theoretically. Thus, could a sensor placement strategy with high detect ratio on scenario set considered be still reliable, when unknown contamination scenario occur? There is no guarantee that a placement strategy with high detect ratio on the training contamination scenario set would also perform well to detect other unknown contamination scenarios. Therefore, in this section, we will illustrate that sensor placement founded by our algorithms are robust against unknown scenarios. During our experiments, we set SO = 5, 10 and o = 2, 5 for network BW SN1
13 13 and network BW SN 2 respectively, and use simulated annealing strategy with 1000 iterations in DecisionF unction. In Figure 3, we vary the number of sensor to be placed incrementally and compute detect ratio on scenarios sets considered respectively. We generate 4 scenario sets for BW SN1 and BW SN2 randomly as test cases, each set contains 100 scenarios, and compute detect ratio for each of the test case scenario sets. In this figure, we compare the detect ratio of the training sets and the test case sets on average. With the sensors to be placed varying, detect ratio of test case on average is almost the same as that of training contamination sets, which shows that the sensor placement strategy is robust against unknown contamination scenarios. DetectRatio Actual Expected Sensors Placed Incrementally (a) Robustness on BWSN1 DetectRatio Actual Expected Sensors Placed Incrementally (b) Robustness on BWSN2 Fig. 3. (a):robustness on average of BWSN1 computed on 4 test case sets (b): Robustness on average of BWSN2 computed on 4 test case sets 5.5 Running Time Analysis In this section, we will compare running time of exhausted searching, the greedy algorithm and the fast greedy algorithm on running on BW SN1 and BW SN2. We fix SO = 5 and SO = 10 for network BW SN1 and network BW SN2 respectively. We can observe in Figure 4 that the greedy algorithms achieve a great improvement comparing with exhausted searching. Moreover, the running time of greedy algorithms is linear to the sensors to be placed when the training contamination scenario set is fixed, which has been proved previously. In Figure 4(b), optimized greedy algorithm shows better efficiency than the original version on large network BWSN2, because a fraction of scenarios is associated with many vertices in network, when they are detected and removed, the cardinality of R v,m for many different vertex v decreased, thus the set operation become faster.
14 Optimized Greedy Original Greedy Exhaustived Search(expected) 10 5 Original Greedy Optimized Greedy Exhaustived Search(expected) Running Time 100 Running Time(sec) Sensor Placed Incrementally (a) Running time on BWSN Sensor Placed Incrementally (b) Running time on BWSN2 Fig. 4. (a):running time on BWSN1 in log scale (b): Running time on BWSN2 in log scale 6 Conclusion In this paper, we consider the sensor placement optimization problem in the condition of incremental placement and cost limitation on sensor placement modification, which is quite realistic in real-world. We also propose a reduction of the problem based on our definition to set-cover problem. In this way, an universal bound on contamination detection time could be guaranteed. Optimization Algorithm based on Greedy Heuristic is proposed, whose solution quality is guaranteed due to the sub-modularity property of the Optimization Objective Function defined. Optimization of the algorithm proposed is also discussed briefly both theoretically and experimentally. References 1. Berry, J., Hart, W. E., Phillips, C. E., Uber, J. G., and Watson, J.P. Sensor placement in municipal water networks with temporal integer programming models. In J. Water Resour. Plann. Manage, 132(4), Berry, J. W., Fleischer, L., Hart, W. E., Phillips, C. A., and Watson, J. P. Sensor placement in municipal water networks. In J. Water Resour. Plann. Manage, 131(3), Kessler, A., Ostfeld, A., and Sinai, G. Detecting accidental contaminations in municipal water networks. In J. Water Resour. Plann. Manage, 124(4), Kumar, A., Kansal, M. L., and Arora, G. Identification of monitoring stations in water distribution system. In J. Environ. Eng. 123(8), Watson, J.-P., Greenberg, H. J., and Hart, W. E. A multipleobjective analysis of sensor placement optimization in water networks. In Proc., World Water and Environmental Resources Conf Ostfeld, A., and Salomons, E. Sensor network design proposal for the battle of the water sensor networks (BWSN). In 8th Annual Symp on Water Distribution Systems Analysis
15 7. Wu, Z. Y., and Walski, T. Multi objective optimization of sensor placement in water distribution systems. In 8th Annual Symp. on Water Distribution Systems Analysis Dorini, G., et al. An efficient algorithm for sensor placement in water distribution systems. In 8th Annual Symp. on Water Distribution Systems Analysis Guan, J., Aral, M. M., Maslia, M. L., and Grayman, W. M. Optimization model and algorithms for design of water sensor placement in water distribution systems. In 8th Annual Symp. on Water Distribution Systems Analysis Berry, J., Hart, W., Phillips, C. A., and Watson, J. P. A facility location approach to sensor placement optimization. In 8th Annual Symp. on Water Distribution Systems Analysis Huang, J. J., McBean, E. A., and James, W. Multiobjective optimization for monitoring sensor placement in water distribution systems. In 8th Annual Symp. on Water Distribution Systems Analysis Preis, A., and Ostfeld, A. Multiobjective sensor design for water distribution systems security. In 8th Annual Symp. on Water Distribution Systems Analysis A. Ostfeld and E. Salomons. Optimal layout of early warning detection stations for water distribution systems security. In J. Water Resources Planning and Management. 130(5): , Jure Leskovec, Andreas Krause, Carlos Guestrin, Christos Faloutsos, Jeanne Van- Briesen and Natalie Glance. Cost-effective Outbreak Detection in Networks. In KDD, G. Nemhauser, L. Wolsey, and M. Fisher. An analysis of the approximations for maximizing submodular set functions. In Mathematical Programming, M. Sviridenko. A note on maximizing a submodular set function subject to knapsack constraint. In Operations Research Letters, A. Ostfeld, J. G. Uber, and E. Salomons. Battle of water sensor networks: A design challenge for engineers and algorithms. In WSDA, Technical Report of Incremental Sensor Placement Optimization. 15
Incremental Sensor Placement Optimization on Water Network
Incremental Sensor Placement Optimization on Water Network Xiaomin Xu Yiqi Lu Yanghua Xiao Sheng Huang Wei Wang Abstract Sensor placement on water networks is critical for the detection of accidental or
More informationCS224W: Analysis of Networks Jure Leskovec, Stanford University
HW2 Q1.1 parts (b) and (c) cancelled. HW3 released. It is long. Start early. CS224W: Analysis of Networks Jure Leskovec, Stanford University http://cs224w.stanford.edu 10/26/17 Jure Leskovec, Stanford
More informationViral Marketing and Outbreak Detection. Fang Jin Yao Zhang
Viral Marketing and Outbreak Detection Fang Jin Yao Zhang Paper 1: Maximizing the Spread of Influence through a Social Network Authors: David Kempe, Jon Kleinberg, Éva Tardos KDD 2003 Outline Problem Statement
More informationContaminant Source Identification for Priority Nodes in Water Distribution Systems
29 Contaminant Source Identification for Priority Nodes in Water Distribution Systems Hailiang Shen, Edward A. McBean and Mirnader Ghazali A multi-stage response procedure is described to assist in the
More informationJure Leskovec Machine Learning Department Carnegie Mellon University
Jure Leskovec Machine Learning Department Carnegie Mellon University Currently: Soon: Today: Large on line systems have detailed records of human activity On line communities: Facebook (64 million users,
More informationTheorem 2.9: nearest addition algorithm
There are severe limits on our ability to compute near-optimal tours It is NP-complete to decide whether a given undirected =(,)has a Hamiltonian cycle An approximation algorithm for the TSP can be used
More informationA Class of Submodular Functions for Document Summarization
A Class of Submodular Functions for Document Summarization Hui Lin, Jeff Bilmes University of Washington, Seattle Dept. of Electrical Engineering June 20, 2011 Lin and Bilmes Submodular Summarization June
More informationGraphs and Network Flows IE411. Lecture 21. Dr. Ted Ralphs
Graphs and Network Flows IE411 Lecture 21 Dr. Ted Ralphs IE411 Lecture 21 1 Combinatorial Optimization and Network Flows In general, most combinatorial optimization and integer programming problems are
More informationData Mining Chapter 8: Search and Optimization Methods Fall 2011 Ming Li Department of Computer Science and Technology Nanjing University
Data Mining Chapter 8: Search and Optimization Methods Fall 2011 Ming Li Department of Computer Science and Technology Nanjing University Search & Optimization Search and Optimization method deals with
More informationCS 598CSC: Approximation Algorithms Lecture date: March 2, 2011 Instructor: Chandra Chekuri
CS 598CSC: Approximation Algorithms Lecture date: March, 011 Instructor: Chandra Chekuri Scribe: CC Local search is a powerful and widely used heuristic method (with various extensions). In this lecture
More informationSubmodular Optimization in Computational Sustainability. Andreas Krause
Submodular Optimization in Computational Sustainability Andreas Krause Master Class at CompSust 2012 Combinatorial optimization in computational sustainability Many applications in computational sustainability
More information5. Lecture notes on matroid intersection
Massachusetts Institute of Technology Handout 14 18.433: Combinatorial Optimization April 1st, 2009 Michel X. Goemans 5. Lecture notes on matroid intersection One nice feature about matroids is that a
More information3 No-Wait Job Shops with Variable Processing Times
3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select
More informationDiscrete Sensor Placement Problems in. Distribution Networks
Discrete Sensor Placement Problems in Distribution Networks Tanya Y. Berger-Wolf a,b William E. Hart c Jared Saia b a Center for Discrete Mathematics and Theoretical Computer Science (DIMACS), CoRE Bldg,
More information1 Linear programming relaxation
Cornell University, Fall 2010 CS 6820: Algorithms Lecture notes: Primal-dual min-cost bipartite matching August 27 30 1 Linear programming relaxation Recall that in the bipartite minimum-cost perfect matching
More informationA Simplified Procedure for Sensor Placement Guidance for Small Utilities
A Simplified Procedure for Sensor Placement Guidance for Small Utilities Stacey Schal¹, L. Sebastian Bryson 2, Lindell Ormsbee³ 1 Research Assistant, Department of Civil Engineering, University of Kentucky,
More informationMain approach: always make the choice that looks best at the moment.
Greedy algorithms Main approach: always make the choice that looks best at the moment. - More efficient than dynamic programming - Always make the choice that looks best at the moment (just one choice;
More informationSubmodular Optimization
Submodular Optimization Nathaniel Grammel N. Grammel Submodular Optimization 1 / 28 Submodularity Captures the notion of Diminishing Returns Definition Suppose U is a set. A set function f :2 U! R is submodular
More information6. Lecture notes on matroid intersection
Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans May 2, 2017 6. Lecture notes on matroid intersection One nice feature about matroids is that a simple greedy algorithm
More informationParameterized Complexity of Independence and Domination on Geometric Graphs
Parameterized Complexity of Independence and Domination on Geometric Graphs Dániel Marx Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099 Berlin, Germany. dmarx@informatik.hu-berlin.de
More informationDiscrete Sensor Placement Problems in Distribution Networks
PERGAMON Mathematical and Computer Modelling 0 (2005) 1 0 www.elsevier.com/locate/mcm Discrete Sensor Placement Problems in Distribution Networks T. Y. Berger-Wolf Center for Discrete Mathematics and Theoretical
More informationA Comparison of Mixed-Integer Programming Models for Non-Convex Piecewise Linear Cost Minimization Problems
A Comparison of Mixed-Integer Programming Models for Non-Convex Piecewise Linear Cost Minimization Problems Keely L. Croxton Fisher College of Business The Ohio State University Bernard Gendron Département
More informationOnline Facility Location
Online Facility Location Adam Meyerson Abstract We consider the online variant of facility location, in which demand points arrive one at a time and we must maintain a set of facilities to service these
More informationAn Evolutionary Algorithm for the Multi-objective Shortest Path Problem
An Evolutionary Algorithm for the Multi-objective Shortest Path Problem Fangguo He Huan Qi Qiong Fan Institute of Systems Engineering, Huazhong University of Science & Technology, Wuhan 430074, P. R. China
More informationLecture 2. 1 Introduction. 2 The Set Cover Problem. COMPSCI 632: Approximation Algorithms August 30, 2017
COMPSCI 632: Approximation Algorithms August 30, 2017 Lecturer: Debmalya Panigrahi Lecture 2 Scribe: Nat Kell 1 Introduction In this lecture, we examine a variety of problems for which we give greedy approximation
More informationPart I Part II Part III Part IV Part V. Influence Maximization
Part I Part II Part III Part IV Part V Influence Maximization 1 Word-of-mouth (WoM) effect in social networks xphone is good xphone is good xphone is good xphone is good xphone is good xphone is good xphone
More informationColumn Generation Method for an Agent Scheduling Problem
Column Generation Method for an Agent Scheduling Problem Balázs Dezső Alpár Jüttner Péter Kovács Dept. of Algorithms and Their Applications, and Dept. of Operations Research Eötvös Loránd University, Budapest,
More information/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Approximation algorithms Date: 11/27/18
601.433/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Approximation algorithms Date: 11/27/18 22.1 Introduction We spent the last two lectures proving that for certain problems, we can
More informationMaximum Betweenness Centrality: Approximability and Tractable Cases
Maximum Betweenness Centrality: Approximability and Tractable Cases Martin Fink and Joachim Spoerhase Chair of Computer Science I University of Würzburg {martin.a.fink, joachim.spoerhase}@uni-wuerzburg.de
More informationNP-Hardness. We start by defining types of problem, and then move on to defining the polynomial-time reductions.
CS 787: Advanced Algorithms NP-Hardness Instructor: Dieter van Melkebeek We review the concept of polynomial-time reductions, define various classes of problems including NP-complete, and show that 3-SAT
More informationNotes for Lecture 24
U.C. Berkeley CS170: Intro to CS Theory Handout N24 Professor Luca Trevisan December 4, 2001 Notes for Lecture 24 1 Some NP-complete Numerical Problems 1.1 Subset Sum The Subset Sum problem is defined
More informationA GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY
A GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY KARL L. STRATOS Abstract. The conventional method of describing a graph as a pair (V, E), where V and E repectively denote the sets of vertices and edges,
More informationSolving NP-hard Problems on Special Instances
Solving NP-hard Problems on Special Instances Solve it in poly- time I can t You can assume the input is xxxxx No Problem, here is a poly-time algorithm 1 Solving NP-hard Problems on Special Instances
More informationα Coverage to Extend Network Lifetime on Wireless Sensor Networks
Noname manuscript No. (will be inserted by the editor) α Coverage to Extend Network Lifetime on Wireless Sensor Networks Monica Gentili Andrea Raiconi Received: date / Accepted: date Abstract An important
More informationHatim Lechgar, Abdelouahed Mallouk, Mohamed El Imame Malaainine, Tarik Nahhal and Hassane Rhinane
Artificial Intelligence (AI) Contribution to GIS in Optimal Positioning of Hydrophone Sensors Using Genetic Algorithm (Case Study: Water Network, Casablanca, Morocco) Hatim Lechgar, Abdelouahed Mallouk,
More informationFormal Model. Figure 1: The target concept T is a subset of the concept S = [0, 1]. The search agent needs to search S for a point in T.
Although this paper analyzes shaping with respect to its benefits on search problems, the reader should recognize that shaping is often intimately related to reinforcement learning. The objective in reinforcement
More informationA Randomized Algorithm for Minimizing User Disturbance Due to Changes in Cellular Technology
A Randomized Algorithm for Minimizing User Disturbance Due to Changes in Cellular Technology Carlos A. S. OLIVEIRA CAO Lab, Dept. of ISE, University of Florida Gainesville, FL 32611, USA David PAOLINI
More informationDirectional Sensor Control for Maximizing Information Gain
Directional Sensor Control for Maximizing Information Gain Shankarachary Ragi a, Hans D. Mittelmann b, and Edwin K. P. Chong a a Department of Electrical and Computer Engineering, Colorado State University,
More informationAdvanced Algorithms Class Notes for Monday, October 23, 2012 Min Ye, Mingfu Shao, and Bernard Moret
Advanced Algorithms Class Notes for Monday, October 23, 2012 Min Ye, Mingfu Shao, and Bernard Moret Greedy Algorithms (continued) The best known application where the greedy algorithm is optimal is surely
More informationCPSC 536N: Randomized Algorithms Term 2. Lecture 10
CPSC 536N: Randomized Algorithms 011-1 Term Prof. Nick Harvey Lecture 10 University of British Columbia In the first lecture we discussed the Max Cut problem, which is NP-complete, and we presented a very
More informationSensor Placement Guidance in Small Water Distribution Systems
Sensor Placement Guidance in Small Water Distribution Systems Developed by the University of Kentucky and KYPIPE LLC Prepared for the National Institute for Hometown Security 368 N. Hwy 27 Somerset, KY
More informationMain approach: always make the choice that looks best at the moment. - Doesn t always result in globally optimal solution, but for many problems does
Greedy algorithms Main approach: always make the choice that looks best at the moment. - More efficient than dynamic programming - Doesn t always result in globally optimal solution, but for many problems
More informationGreedy Algorithms 1. For large values of d, brute force search is not feasible because there are 2 d
Greedy Algorithms 1 Simple Knapsack Problem Greedy Algorithms form an important class of algorithmic techniques. We illustrate the idea by applying it to a simplified version of the Knapsack Problem. Informally,
More informationPolynomial-Time Approximation Algorithms
6.854 Advanced Algorithms Lecture 20: 10/27/2006 Lecturer: David Karger Scribes: Matt Doherty, John Nham, Sergiy Sidenko, David Schultz Polynomial-Time Approximation Algorithms NP-hard problems are a vast
More informationOnline Stochastic Matching CMSC 858F: Algorithmic Game Theory Fall 2010
Online Stochastic Matching CMSC 858F: Algorithmic Game Theory Fall 2010 Barna Saha, Vahid Liaghat Abstract This summary is mostly based on the work of Saberi et al. [1] on online stochastic matching problem
More informationCopyright 2007 Pearson Addison-Wesley. All rights reserved. A. Levitin Introduction to the Design & Analysis of Algorithms, 2 nd ed., Ch.
Iterative Improvement Algorithm design technique for solving optimization problems Start with a feasible solution Repeat the following step until no improvement can be found: change the current feasible
More informationLecture 7. s.t. e = (u,v) E x u + x v 1 (2) v V x v 0 (3)
COMPSCI 632: Approximation Algorithms September 18, 2017 Lecturer: Debmalya Panigrahi Lecture 7 Scribe: Xiang Wang 1 Overview In this lecture, we will use Primal-Dual method to design approximation algorithms
More informationA 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH A FORCING GRAPH. Yotaro Takazawa Shinji Mizuno Tokyo Institute of Technology
Journal of the Operations Research Society of Japan Vol. 60, No. 1, January 2017, pp. 15 23 c The Operations Research Society of Japan A 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH
More informationA New Combinatorial Design of Coded Distributed Computing
A New Combinatorial Design of Coded Distributed Computing Nicholas Woolsey, Rong-Rong Chen, and Mingyue Ji Department of Electrical and Computer Engineering, University of Utah Salt Lake City, UT, USA
More information3 INTEGER LINEAR PROGRAMMING
3 INTEGER LINEAR PROGRAMMING PROBLEM DEFINITION Integer linear programming problem (ILP) of the decision variables x 1,..,x n : (ILP) subject to minimize c x j j n j= 1 a ij x j x j 0 x j integer n j=
More informationOn Distributed Algorithms for Maximizing the Network Lifetime in Wireless Sensor Networks
On Distributed Algorithms for Maximizing the Network Lifetime in Wireless Sensor Networks Akshaye Dhawan Georgia State University Atlanta, Ga 30303 akshaye@cs.gsu.edu Abstract A key challenge in Wireless
More informationCOMP 355 Advanced Algorithms Approximation Algorithms: VC and TSP Chapter 11 (KT) Section (CLRS)
COMP 355 Advanced Algorithms Approximation Algorithms: VC and TSP Chapter 11 (KT) Section 35.1-35.2(CLRS) 1 Coping with NP-Completeness Brute-force search: This is usually only a viable option for small
More informationLast topic: Summary; Heuristics and Approximation Algorithms Topics we studied so far:
Last topic: Summary; Heuristics and Approximation Algorithms Topics we studied so far: I Strength of formulations; improving formulations by adding valid inequalities I Relaxations and dual problems; obtaining
More informationMassachusetts Institute of Technology Department of Electrical Engineering and Computer Science Algorithms For Inference Fall 2014
Suggested Reading: Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.438 Algorithms For Inference Fall 2014 Probabilistic Modelling and Reasoning: The Junction
More informationDiscrete (and Continuous) Optimization WI4 131
Discrete (and Continuous) Optimization WI4 131 Kees Roos Technische Universiteit Delft Faculteit Electrotechniek, Wiskunde en Informatica Afdeling Informatie, Systemen en Algoritmiek e-mail: C.Roos@ewi.tudelft.nl
More informationLeveraging Set Relations in Exact Set Similarity Join
Leveraging Set Relations in Exact Set Similarity Join Xubo Wang, Lu Qin, Xuemin Lin, Ying Zhang, and Lijun Chang University of New South Wales, Australia University of Technology Sydney, Australia {xwang,lxue,ljchang}@cse.unsw.edu.au,
More informationApproximability Results for the p-center Problem
Approximability Results for the p-center Problem Stefan Buettcher Course Project Algorithm Design and Analysis Prof. Timothy Chan University of Waterloo, Spring 2004 The p-center
More informationOutline. CS38 Introduction to Algorithms. Approximation Algorithms. Optimization Problems. Set Cover. Set cover 5/29/2014. coping with intractibility
Outline CS38 Introduction to Algorithms Lecture 18 May 29, 2014 coping with intractibility approximation algorithms set cover TSP center selection randomness in algorithms May 29, 2014 CS38 Lecture 18
More informationInfluence Maximization in the Independent Cascade Model
Influence Maximization in the Independent Cascade Model Gianlorenzo D Angelo, Lorenzo Severini, and Yllka Velaj Gran Sasso Science Institute (GSSI), Viale F. Crispi, 7, 67100, L Aquila, Italy. {gianlorenzo.dangelo,lorenzo.severini,yllka.velaj}@gssi.infn.it
More informationLecture 9: Pipage Rounding Method
Recent Advances in Approximation Algorithms Spring 2015 Lecture 9: Pipage Rounding Method Lecturer: Shayan Oveis Gharan April 27th Disclaimer: These notes have not been subjected to the usual scrutiny
More informationV. Solving Integer Linear Programs
Optimization Methods Draft of August 26, 2005 V. Solving Integer Linear Programs Robert Fourer Department of Industrial Engineering and Management Sciences Northwestern University Evanston, Illinois 60208-3119,
More informationA Reduction of Conway s Thrackle Conjecture
A Reduction of Conway s Thrackle Conjecture Wei Li, Karen Daniels, and Konstantin Rybnikov Department of Computer Science and Department of Mathematical Sciences University of Massachusetts, Lowell 01854
More informationEfficient Synthesis of Production Schedules by Optimization of Timed Automata
Efficient Synthesis of Production Schedules by Optimization of Timed Automata Inga Krause Institute of Automatic Control Engineering Technische Universität München inga.krause@mytum.de Joint Advanced Student
More informationTrees. 3. (Minimally Connected) G is connected and deleting any of its edges gives rise to a disconnected graph.
Trees 1 Introduction Trees are very special kind of (undirected) graphs. Formally speaking, a tree is a connected graph that is acyclic. 1 This definition has some drawbacks: given a graph it is not trivial
More informationOptimization I : Brute force and Greedy strategy
Chapter 3 Optimization I : Brute force and Greedy strategy A generic definition of an optimization problem involves a set of constraints that defines a subset in some underlying space (like the Euclidean
More informationOn the Max Coloring Problem
On the Max Coloring Problem Leah Epstein Asaf Levin May 22, 2010 Abstract We consider max coloring on hereditary graph classes. The problem is defined as follows. Given a graph G = (V, E) and positive
More informationOnline Distributed Sensor Selection
Online Distributed Sensor Selection Daniel Golovin Caltech Matthew Faulkner Caltech Andreas Krause Caltech ABSTRACT A key problem in sensor networks is to decide which sensors to query when, in order to
More informationSolving Large Aircraft Landing Problems on Multiple Runways by Applying a Constraint Programming Approach
Solving Large Aircraft Landing Problems on Multiple Runways by Applying a Constraint Programming Approach Amir Salehipour School of Mathematical and Physical Sciences, The University of Newcastle, Australia
More informationThe complement of PATH is in NL
340 The complement of PATH is in NL Let c be the number of nodes in graph G that are reachable from s We assume that c is provided as an input to M Given G, s, t, and c the machine M operates as follows:
More informationApproximation Algorithms
Approximation Algorithms Prof. Tapio Elomaa tapio.elomaa@tut.fi Course Basics A 4 credit unit course Part of Theoretical Computer Science courses at the Laboratory of Mathematics There will be 4 hours
More informationBoosting Simple Model Selection Cross Validation Regularization. October 3 rd, 2007 Carlos Guestrin [Schapire, 1989]
Boosting Simple Model Selection Cross Validation Regularization Machine Learning 10701/15781 Carlos Guestrin Carnegie Mellon University October 3 rd, 2007 1 Boosting [Schapire, 1989] Idea: given a weak
More informationAn Optimal and Progressive Approach to Online Search of Top-K Influential Communities
An Optimal and Progressive Approach to Online Search of Top-K Influential Communities Fei Bi, Lijun Chang, Xuemin Lin, Wenjie Zhang University of New South Wales, Australia The University of Sydney, Australia
More information1 The Traveling Salesperson Problem (TSP)
CS 598CSC: Approximation Algorithms Lecture date: January 23, 2009 Instructor: Chandra Chekuri Scribe: Sungjin Im In the previous lecture, we had a quick overview of several basic aspects of approximation
More informationComputational complexity
Computational complexity Heuristic Algorithms Giovanni Righini University of Milan Department of Computer Science (Crema) Definitions: problems and instances A problem is a general question expressed in
More informationTraining Digital Circuits with Hamming Clustering
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I: FUNDAMENTAL THEORY AND APPLICATIONS, VOL. 47, NO. 4, APRIL 2000 513 Training Digital Circuits with Hamming Clustering Marco Muselli, Member, IEEE, and Diego
More informationConsistency and Set Intersection
Consistency and Set Intersection Yuanlin Zhang and Roland H.C. Yap National University of Singapore 3 Science Drive 2, Singapore {zhangyl,ryap}@comp.nus.edu.sg Abstract We propose a new framework to study
More informationTheorem: The greedy algorithm for RKP will always output the optimal solution under Selection Criterion 3. Proof sketch: Assume that the objects have
CSE 3500 Algorithms and Complexity Fall 2016 Lecture 16: October 20, 2016 Greedy Algorithms Continued The first part of this lecture was spent on solving Exam 1 problems. In the second part we continued
More informationUnit 8: Coping with NP-Completeness. Complexity classes Reducibility and NP-completeness proofs Coping with NP-complete problems. Y.-W.
: Coping with NP-Completeness Course contents: Complexity classes Reducibility and NP-completeness proofs Coping with NP-complete problems Reading: Chapter 34 Chapter 35.1, 35.2 Y.-W. Chang 1 Complexity
More informationUsing Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions
Using Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions R.Thamaraiselvan 1, S.Gopikrishnan 2, V.Pavithra Devi 3 PG Student, Computer Science & Engineering, Paavai College
More informationPaths, Flowers and Vertex Cover
Paths, Flowers and Vertex Cover Venkatesh Raman M. S. Ramanujan Saket Saurabh Abstract It is well known that in a bipartite (and more generally in a König) graph, the size of the minimum vertex cover is
More informationFast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on PAMI, vol. 23, no. 11, pp. 1222-1239 p.1 Fast Approximate Energy Minimization via Graph Cuts Yuri Boykov, Olga Veksler and Ramin Zabih Abstract Many tasks in computer vision involve
More informationBoosting Simple Model Selection Cross Validation Regularization
Boosting: (Linked from class website) Schapire 01 Boosting Simple Model Selection Cross Validation Regularization Machine Learning 10701/15781 Carlos Guestrin Carnegie Mellon University February 8 th,
More informationQuality Guarantees on Locally Optimal Solutions for Distributed Constraint Optimization Problems
Quality Guarantees on Locally Optimal Solutions for Distributed Constraint Optimization Problems Jonathan P. Pearce and Milind Tambe Computer Science Department University of Southern California Los Angeles,
More informationNUMERICAL METHODS PERFORMANCE OPTIMIZATION IN ELECTROLYTES PROPERTIES MODELING
NUMERICAL METHODS PERFORMANCE OPTIMIZATION IN ELECTROLYTES PROPERTIES MODELING Dmitry Potapov National Research Nuclear University MEPHI, Russia, Moscow, Kashirskoe Highway, The European Laboratory for
More informationPCP and Hardness of Approximation
PCP and Hardness of Approximation January 30, 2009 Our goal herein is to define and prove basic concepts regarding hardness of approximation. We will state but obviously not prove a PCP theorem as a starting
More informationMatching Algorithms. Proof. If a bipartite graph has a perfect matching, then it is easy to see that the right hand side is a necessary condition.
18.433 Combinatorial Optimization Matching Algorithms September 9,14,16 Lecturer: Santosh Vempala Given a graph G = (V, E), a matching M is a set of edges with the property that no two of the edges have
More informationRough Set Methods and Submodular Functions
Rough Set Methods and Submodular Functions Hung Son Nguyen and Wojciech Świeboda Institute of Mathematics, The University of Warsaw, Banacha 2, 02-097, Warsaw Poland Abstract. In this article we discuss
More informationSome Applications of Graph Bandwidth to Constraint Satisfaction Problems
Some Applications of Graph Bandwidth to Constraint Satisfaction Problems Ramin Zabih Computer Science Department Stanford University Stanford, California 94305 Abstract Bandwidth is a fundamental concept
More informationOn the Minimum k-connectivity Repair in Wireless Sensor Networks
On the Minimum k-connectivity epair in Wireless Sensor Networks Hisham M. Almasaeid and Ahmed E. Kamal Dept. of Electrical and Computer Engineering, Iowa State University, Ames, IA 50011 Email:{hisham,kamal}@iastate.edu
More informationOn Distributed Submodular Maximization with Limited Information
On Distributed Submodular Maximization with Limited Information Bahman Gharesifard Stephen L. Smith Abstract This paper considers a class of distributed submodular maximization problems in which each agent
More informationGreedy Algorithms 1 {K(S) K(S) C} For large values of d, brute force search is not feasible because there are 2 d {1,..., d}.
Greedy Algorithms 1 Simple Knapsack Problem Greedy Algorithms form an important class of algorithmic techniques. We illustrate the idea by applying it to a simplified version of the Knapsack Problem. Informally,
More informationOnline Coloring Known Graphs
Online Coloring Known Graphs Magnús M. Halldórsson Science Institute University of Iceland IS-107 Reykjavik, Iceland mmh@hi.is, www.hi.is/ mmh. Submitted: September 13, 1999; Accepted: February 24, 2000.
More informationSolving the Large Scale Next Release Problem with a Backbone Based Multilevel Algorithm
IEEE TRANSACTIONS ON JOURNAL NAME, MANUSCRIPT ID 1 Solving the Large Scale Next Release Problem with a Backbone Based Multilevel Algorithm Jifeng Xuan, He Jiang, Member, IEEE, Zhilei Ren, and Zhongxuan
More informationA Row-and-Column Generation Method to a Batch Machine Scheduling Problem
The Ninth International Symposium on Operations Research and Its Applications (ISORA 10) Chengdu-Jiuzhaigou, China, August 19 23, 2010 Copyright 2010 ORSC & APORC, pp. 301 308 A Row-and-Column Generation
More informationFeature Selection. Department Biosysteme Karsten Borgwardt Data Mining Course Basel Fall Semester / 262
Feature Selection Department Biosysteme Karsten Borgwardt Data Mining Course Basel Fall Semester 2016 239 / 262 What is Feature Selection? Department Biosysteme Karsten Borgwardt Data Mining Course Basel
More informationSolution for Homework set 3
TTIC 300 and CMSC 37000 Algorithms Winter 07 Solution for Homework set 3 Question (0 points) We are given a directed graph G = (V, E), with two special vertices s and t, and non-negative integral capacities
More informationSubset sum problem and dynamic programming
Lecture Notes: Dynamic programming We will discuss the subset sum problem (introduced last time), and introduce the main idea of dynamic programming. We illustrate it further using a variant of the so-called
More informationByzantine Consensus in Directed Graphs
Byzantine Consensus in Directed Graphs Lewis Tseng 1,3, and Nitin Vaidya 2,3 1 Department of Computer Science, 2 Department of Electrical and Computer Engineering, and 3 Coordinated Science Laboratory
More informationModule 1 Lecture Notes 2. Optimization Problem and Model Formulation
Optimization Methods: Introduction and Basic concepts 1 Module 1 Lecture Notes 2 Optimization Problem and Model Formulation Introduction In the previous lecture we studied the evolution of optimization
More informationLecture 11: Maximum flow and minimum cut
Optimisation Part IB - Easter 2018 Lecture 11: Maximum flow and minimum cut Lecturer: Quentin Berthet 4.4. The maximum flow problem. We consider in this lecture a particular kind of flow problem, with
More information