Approximating the minimum rank of a graph via alternating projection

Franklin H. J. Kenter. Approximating the minimum rank of a graph via alternating projection. Oper. Res. Lett., 44(2):255-259, 2016. [doi]

@article{Kenter16,
  title = {Approximating the minimum rank of a graph via alternating projection},
  author = {Franklin H. J. Kenter},
  year = {2016},
  doi = {10.1016/j.orl.2016.02.001},
  url = {http://dx.doi.org/10.1016/j.orl.2016.02.001},
  researchr = {https://researchr.org/publication/Kenter16},
  cites = {0},
  citedby = {0},
  journal = {Oper. Res. Lett.},
  volume = {44},
  number = {2},
  pages = {255-259},
}