A 2-Approximation Algorithm to (::::k:::: + 1)-Edge-Connect a Specified Set of Vertices in a ::::k::::-Edge-Connected Graph

Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe. A 2-Approximation Algorithm to (::::k:::: + 1)-Edge-Connect a Specified Set of Vertices in a ::::k::::-Edge-Connected Graph. IEICE Transactions, 88-A(5):1290-1300, 2005. [doi]

@article{MashimaTW05,
  title = {A 2-Approximation Algorithm to (::::k:::: + 1)-Edge-Connect a Specified Set of Vertices in a ::::k::::-Edge-Connected Graph},
  author = {Toshiya Mashima and Satoshi Taoka and Toshimasa Watanabe},
  year = {2005},
  doi = {10.1093/ietfec/e88-a.5.1290},
  url = {http://dx.doi.org/10.1093/ietfec/e88-a.5.1290},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/MashimaTW05},
  cites = {0},
  citedby = {0},
  journal = {IEICE Transactions},
  volume = {88-A},
  number = {5},
  pages = {1290-1300},
}