Skip to main content
Article thumbnail
Location of Repository

Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation

By Fabián A. Chudak, Tim Roughgarden and David P. Williamson

Abstract

Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approximatio

Publisher: Springer
Year: 2001
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.4070
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://legacy.orie.cornell.edu... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.