Optimal Hub Labeling is NP-complete. Weller, M. CoRR, 2014.
Optimal Hub Labeling is NP-complete [link]Paper  bibtex   
@article{DBLP:journals/corr/Weller14a,
  author       = {Mathias Weller},
  title        = {Optimal Hub Labeling is NP-complete},
  journal      = {CoRR},
  volume       = {abs/1407.8373},
  year         = {2014},
  url          = {http://arxiv.org/abs/1407.8373},
  eprinttype    = {arXiv},
  eprint       = {1407.8373},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Weller14a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0