3. Related work In our experiment Our MinMax-Alg runs within 3 minutes only The best-known method runs for more than 10 hours At least 200 times faster 16
3. Related Work ◼ In our experiment, ◼ Our MinMax-Alg runs within 3 minutes only ◼ The best-known method runs for more than 10 hours ◼ At least 200 times faster 16
Outline 1 Introduction 2. Problem definition 3. Related work 4. Algorithm) 5. Empirical Study 6. Conclusion 17
17 Outline 1. Introduction 2. Problem Definition 3. Related Work 4. Algorithm 5. Empirical Study 6. Conclusion
4. Algorithm s={S1S2} hospitals Assume that all clients are sorted in descending order of their costs C={c1,C2} residential estates That is, Cost(C1)> Cost(c,) C,, dist earest hospita Cost(cu) C12V2 NLC of C1 NLC of C V5 C2.dist nearest hospital =S2 5 Cost( C2)
4. Algorithm S = {s1 , s2} C = {c1 , c2} hospitals residential estates v1 v2 v3 v4 v5 v6 c1 c2 s1 nearest hospital = s1 nearest hospital = s2 5 2 4 s 5 2 6 NLC of c1 NLC of c2 c1 .dist c2 .dist Assume that all clients are sorted in descending order of their costs. That is, Cost(c1 ) ≥ Cost(c2 ) Cost(c1 ) Cost(c2 )