Optimal Partitioning Which Maximizes the Weighted Sum of Products

Kai Jin. Optimal Partitioning Which Maximizes the Weighted Sum of Products. In Mingyu Xiao, Frances A. Rosamond, editors, Frontiers in Algorithmics - 11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings. Volume 10336 of Lecture Notes in Computer Science, pages 127-138, Springer, 2017. [doi]

@inproceedings{Jin17a,
  title = {Optimal Partitioning Which Maximizes the Weighted Sum of Products},
  author = {Kai Jin},
  year = {2017},
  doi = {10.1007/978-3-319-59605-1_12},
  url = {https://doi.org/10.1007/978-3-319-59605-1_12},
  researchr = {https://researchr.org/publication/Jin17a},
  cites = {0},
  citedby = {0},
  pages = {127-138},
  booktitle = {Frontiers in Algorithmics - 11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings},
  editor = {Mingyu Xiao and Frances A. Rosamond},
  volume = {10336},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-59605-1},
}