Search dblp for Publications

export results for "A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees."

 download as .bib file

@article{DBLP:journals/jal/KleinR95,
  author       = {Philip N. Klein and
                  R. Ravi},
  title        = {A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner
                  Trees},
  journal      = {J. Algorithms},
  volume       = {19},
  number       = {1},
  pages        = {104--115},
  year         = {1995}
}

@inproceedings{DBLP:conf/ipco/KleinR93a,
  author       = {Philip N. Klein and
                  R. Ravi},
  title        = {A nearly best-possible approximation algorithm for node-weighted Steiner
                  trees},
  booktitle    = {{IPCO}},
  pages        = {323--332},
  publisher    = {{CIACO}},
  year         = {1993}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.