Login / Signup

Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation.

Fabián A. ChudakTim RoughgardenDavid P. Williamson
Published in: IPCO (2001)
Keyphrases
  • convergence rate
  • interior point algorithm
  • objective function
  • primal dual
  • lagrangean relaxation
  • dynamic programming
  • worst case
  • training samples
  • mathematical model
  • quadratic programming
  • interior point methods