Approximability of partitioning graphs with supply and demand

Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki. Approximability of partitioning graphs with supply and demand. J. Discrete Algorithms, 6(4):627-650, 2008. [doi]

@article{ItoDZN08,
  title = {Approximability of partitioning graphs with supply and demand},
  author = {Takehiro Ito and Erik D. Demaine and Xiao Zhou and Takao Nishizeki},
  year = {2008},
  doi = {10.1016/j.jda.2008.03.002},
  url = {http://dx.doi.org/10.1016/j.jda.2008.03.002},
  tags = {graph-rewriting, rewriting, partitioning},
  researchr = {https://researchr.org/publication/ItoDZN08},
  cites = {0},
  citedby = {0},
  journal = {J. Discrete Algorithms},
  volume = {6},
  number = {4},
  pages = {627-650},
}