PPT-Approximation Algorithms for Graph Routing Problems

Julia Chuzhoy Toyota Technological Institute at Chicago Routing Problems Input Graph G sourcesink pairs s 1 t 1 s k t k Goal Route as many pairs as possible minimize edge congestion. Prasad . Raghavendra. . Ning. Chen C. . . Thach. . Nguyen . . . Atri. . Rudra. . . Gyanit. Singh. University of Washington. Roee . Engelberg. Technion. University. . of Edit Distance. Robert Krauthgamer, . Weizmann Institute of Science. SPIRE 2013. TexPoint. fonts used in EMF. . Read the . TexPoint. manual before you delete this box. .: . A. A. A. A. A. A. A. Yehdhih. . Ould. Mohammed Moctar. 1. . Guy G.F. Lemieux. 2. . Philip Brisk. 1. 1. University of California Riverside . 2. University of British Columbia. 22. nd. International Conference on Field Programmable Logic and Applications. Sometimes we can handle NP problems with polynomial time algorithms which are guaranteed to return a solution within some specific bound of the optimal solution. within a constant . c. . of the optimal. George Caragea, and Uzi Vishkin. University of Maryland. 1. Speaker. James Edwards. It has proven to be quite . difficult. to obtain significant performance improvements using current parallel computing platforms.. Grigory. . Yaroslavtsev. . Penn State + AT&T Labs - Research (intern). Joint work with . Berman (PSU). , . Bhattacharyya (MIT). , . Makarychev. (IBM). , . Raskhodnikova. (PSU). Directed. Spanner Problem. Addressing routing scalability issues. NSF Ignite Project . 1. Routing protocol challenges . All Routing . P. rotocols face. S. calability issues – dependency on network size. Flooding on information changes. Akhil. Krishnan Mikhail Markov . Borzoo. . Bonakdarpour. Presentation at IPDPS'17. May 31, 2017. Outline. Autonomous . vehicles & Distributed VRP. Our . solution. Simulations and experiments. Conclusion. Grigory. . Yaroslavtsev. . Penn State + AT&T Labs - Research (intern). Joint work with . Berman (PSU). , . Bhattacharyya (MIT). , . Makarychev. (IBM). , . Raskhodnikova. (PSU). Directed. Spanner Problem. EECT 7327 . Fall 2014. Successive Approximation. (SA) ADC. Successive Approximation ADC. – . 2. –. Data Converters Successive Approximation ADC Professor Y. Chiu. EECT 7327 . Fall 2014. Binary search algorithm → N*. When the best just isn’t possible. Jeff Chastine. Approximation Algorithms. Some NP-Complete problems are too important to ignore. Approaches:. If input small, run it anyway. Consider special cases that may run in polynomial time. -Poulin - 4073219. CEG 4136 – Computer Architecture III. November 16. th. , 2010. Questions/Topics. Describe several algorithms used for adaptive . routing.. Describe . problems and advantages of these routing . How do weights affects approximation algorithms?. As usual there are no rules whatsoever.. However I will provide some interesting examples in which weights make a difference. I will try and say for every problem, why weights make a difference.. Presented by : Frédéric CHALLITA-Cedric . CHAUVENET-Andreas . BRUNSCHWEILER. 10/01/2016. SUMMARY . Introduction . and project context . G3 PLC LOADng routing protocol. Theoretical comparison between metrics .