Finding a Minimum-Sum Dipolar Spanning Tree in R3

Steven Bitner, Ovidiu Daescu. Finding a Minimum-Sum Dipolar Spanning Tree in R3. In 41st Hawaii International International Conference on Systems Science (HICSS-41 2008), Proceedings, 7-10 January 2008, Waikoloa, Big Island, HI, USA. pages 469, IEEE Computer Society, 2008. [doi]

@inproceedings{BitnerD08,
  title = {Finding a Minimum-Sum Dipolar Spanning Tree in R3},
  author = {Steven Bitner and Ovidiu Daescu},
  year = {2008},
  doi = {10.1109/HICSS.2008.171},
  url = {http://doi.ieeecomputersociety.org/10.1109/HICSS.2008.171},
  researchr = {https://researchr.org/publication/BitnerD08},
  cites = {0},
  citedby = {0},
  pages = {469},
  booktitle = {41st Hawaii International International Conference on Systems Science (HICSS-41 2008), Proceedings, 7-10 January 2008, Waikoloa, Big Island, HI, USA},
  publisher = {IEEE Computer Society},
}