Primal-Dual Schema and Local Ratio

Part of the Springer Optimization and Its Applications book series (SOIA, volume 62)


Based on the duality theory of linear programming, a new approximation technique, called the primal-dual schema, has been developed. With this technique, we do not need to compute the optimal solution of the relaxed linear program in order to get an approximate solution of the integer program. Thus, we can reduce the running time of many linear programming–based approximation algorithms from O(n3) to at most O(n2). Moreover, this method can actually be formulated in an equivalent form, called the local ratio method, which does not require the knowledge of the theory of linear programming. In this chapter, we study these two techniques and their relationship.


Feasible Solution Network Design Problem Local Ratio Dual Linear Program Complementary Slackness Condition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of Texas at DallasRichardsonUSA
  2. 2.Department of Computer ScienceState University of New York at Stony BrookStony BrookUSA
  3. 3.Institute of Applied MathematicsAcademy of Mathematics and Systems Science Chinese Academy of SciencesBeijingChina

Personalised recommendations