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

Fabián A. Chudak, Tim Roughgarden, David P. Williamson. Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation. In Karen Aardal, Bert Gerards, editors, Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings. Volume 2081 of Lecture Notes in Computer Science, pages 60-70, Springer, 2001. [doi]

@inproceedings{ChudakRW01,
  title = {Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation},
  author = {Fabián A. Chudak and Tim Roughgarden and David P. Williamson},
  year = {2001},
  url = {http://link.springer.de/link/service/series/0558/bibs/2081/20810060.htm},
  researchr = {https://researchr.org/publication/ChudakRW01},
  cites = {0},
  citedby = {0},
  pages = {60-70},
  booktitle = {Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
  editor = {Karen Aardal and Bert Gerards},
  volume = {2081},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-42225-0},
}