330 likes | 489 Views
Lecture 03: More Approximations for QoS Routing. Guoliang (Larry) Xue Department of CSE Arizona State University http://optimization.asu.edu/~xue 14May2008. Outline of the Lecture. Approximation for OMCP Approximation for DMCP Approximation for SMCP Conclusions.
E N D
Lecture 03: More Approximations for QoS Routing Guoliang (Larry) Xue Department of CSE Arizona State University http://optimization.asu.edu/~xue 14May2008
Outline of the Lecture • Approximation for OMCP • Approximation for DMCP • Approximation for SMCP • Conclusions
Outline of the Lecture • Approximation for OMCP • Approximation for DMCP • Approximation for SMCP • Conclusions
Outline of the Lecture • Approximation for SMCP • Approximation for DMCP • Approximation for SMCP • Conclusions
Approximations for SMCP • Let us try to design good approximations to SMCP • Initial pair of LB and UB • Pseudo-polynomial time algorithm • Scaling, rounding, and approximate testing • FPTAS
Outline of the Lecture • Approximation for SMCP • Approximation for DMCP • Approximation for SMCP • Conclusions
Conclusions • We have used DCLC to produce a good approximation to OMCP • We have then designed an FPTAS for OMCP • The same approach can be used for SMCP