## THE PRIMAL-DUAL METHOD FOR APPROXIMATION ALGORITHMS AND ITS APPLICATION TO NETWORK DESIGN PROBLEMS

### Cached

### Download Links

by
Michel X. Goemans
,
David P. Williamson

Citations: | 120 - 7 self |

### BibTeX

@MISC{Goemans_theprimal-dual,

author = {Michel X. Goemans and David P. Williamson},

title = { THE PRIMAL-DUAL METHOD FOR APPROXIMATION ALGORITHMS AND ITS APPLICATION TO NETWORK DESIGN PROBLEMS},

year = {}

}

### OpenURL

### Abstract

The primal-dual method is a standard tool in the design of algorithms for combinatorial optimization problems. This chapter shows how the primal-dual method can be modified to provide good approximation algorithms for a wide variety of NP-hard problems. We concentrate on results from recent research applying the primal-dual method to problems in network design.