Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits

Takao Asano, Magnús M. Halldórsson, Kazuo Iwama, Takeshi Matsuda. Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits. In D. T. Lee, Shang-Hua Teng, editors, Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings. Volume 1969 of Lecture Notes in Computer Science, pages 204-215, Springer, 2000. [doi]

@inproceedings{AsanoHIM00,
  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},
  year = {2000},
  url = {http://link.springer.de/link/service/series/0558/bibs/1969/19690204.htm},
  tags = {power consumption},
  researchr = {https://researchr.org/publication/AsanoHIM00},
  cites = {0},
  citedby = {0},
  pages = {204-215},
  booktitle = {Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings},
  editor = {D. T. Lee and Shang-Hua Teng},
  volume = {1969},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-41255-7},
}