Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits. Asano, T., Halldórsson, M. M., Iwama, K., & Matsuda, T. In Proceedings of International Symposium on Algorithms and Computation (ISAAC), pages 204-215, 2000.
Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits [link]Paper  bibtex   
@inproceedings{ dblp3239547,
  title = {Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits},
  author = {Takao Asano and Magnús M. Halldórsson and Kazuo Iwama and Takeshi Matsuda},
  author_short = {Asano, T. and Halldórsson, M. M. and Iwama, K. and Matsuda, T.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {2000},
  key = {dblp3239547},
  id = {dblp3239547},
  biburl = {http://www.dblp.org/rec/bibtex/conf/isaac/AsanoHIM00},
  url = {http://dx.doi.org/10.1007/3-540-40996-3_18},
  conference = {ISAAC},
  pages = {204-215},
  text = {ISAAC 2000:204-215},
  booktitle = {Proceedings of International Symposium on Algorithms and Computation (ISAAC)}
}

Downloads: 0