D. P. Williamson. The primal-dual method for approximation algorithms. Mathematical Programming, Series B, 91(3):447-478, 2002.  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Greedy Edge-Disjoint Paths in Complete Graphs - Yoshio Okamoto December (Correct)
....complete graphs, but there is still a large gap between them. For the future direction of this research, we will propose an interpretation of SGA via the primal dual method of linear programming. Since some approximation algorithms have recently been analyzed in terms of linear programming duality [11, 12], this interpretation may be useful for improving the known bound. Particularly, the dual fitting method [10, 11] seems to fit our problems. The organization of this report is as follows. We prove a better upper bound (Theorem 1.1) in Section 2; we construct some instances which give lower bounds ....
....the same upper bound 9. Therefore, we must find and utilize other features of SGA. For a possible answer, we will propose an interpretation of SGA via the primal dual method of linear programming. Recent progress of approximation algorithms are much due to some techniques via linear programming [11, 12]. Particularly, the dual fitting method [10, 11] has been used in order to analyze the approximation ratio of some greedy algorithms. We will see the formulation of MEDP in the first subsection, and in the second subsection we will give another view of SGA and explain what the dual fitting method ....
[Article contains additional citation context not shown here]
D.P. Williamson, The primal-dual method for approximation algorithms. Mathematical Programming , to appear. 14
Primal-Dual Algorithms for Connected Facility - Location Problems Chaitanya (Correct)
No context found.
D. P. Williamson. The primal-dual method for approximation algorithms. Mathematical Programming, Series B, 91(3):447-478, 2002.
A Constant-Factor Approximation Algorithm for the.. - Kumar, Gupta.. (2002) (4 citations) (Correct)
No context found.
D. P. Williamson. The primal-dual method for approximation algorithms. Mathematical Programming, Series B, 91(3):447--478, 2002.
A Constant-Factor Approximation Algorithm for the.. - Kumar, Gupta.. (2002) (4 citations) (Correct)
No context found.
D. P. Williamson. The primal-dual method for approximation algorithms. Mathematical Programming, Series B, 91(3):447--478, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC