A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set. Fernau, H. Electronic Colloquium on Computational Complexity (ECCC), 2004.
A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set [link]Paper  bibtex   
@article{DBLP:journals/eccc/ECCC-TR04-073,
  author    = {Henning Fernau},
  title     = {A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting
               Set},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {073},
  year      = {2004},
  url       = {http://eccc.hpi-web.de/eccc-reports/2004/TR04-073/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ECCC-TR04-073},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0