article · 2001

A primaldual approximation algorithm for the survivable network design problem in hypergraph

Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki

Cited by 0Abstract and details only

Abstract

The index has no abstract for this paper.

Cite this paper

Zhao, L., Nagamochi, H., & Ibaraki, T. (2001). A primaldual approximation algorithm for the survivable network design problem in hypergraph.

MLA 9

Zhao, Liang, et al. “A primaldual approximation algorithm for the survivable network design problem in hypergraph.” 2001.

Chicago

Zhao, Liang, Hiroshi Nagamochi, and Toshihide Ibaraki. 2001. “A primaldual approximation algorithm for the survivable network design problem in hypergraph.”

Harvard

Zhao, L., Nagamochi, H. and Ibaraki, T. (2001) ‘A primaldual approximation algorithm for the survivable network design problem in hypergraph’.

BibTeX

@article{zhao2001primaldual,
  title = {{A primaldual approximation algorithm for the survivable network design problem in hypergraph}},
  author = {Zhao, Liang and Nagamochi, Hiroshi and Ibaraki, Toshihide},
  year = {2001}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.