Abstract:

In this talk, we briefly review algorithms for some structured linear programming problems, which can find solutions with theoretical approximation bounds in polynomial time. We also show some applications of these approximation algorithms in communication networks, VLSI routing and wireless communication.