Paper by Erik D. Demaine

Reference:

Takehiro Ito, Erik D. Demaine, Xiao Zhou, and Takao Nishizeki, “Approximability of Partitioning Graphs with Supply and Demand”, Journal of Discrete Algorithms, volume 6, number 4, December 2008, pages 627–650.

BibTeX

@Article{SupplyDemand_JDA,
  AUTHOR        = {Takehiro Ito and Erik D. Demaine and Xiao Zhou and
                   Takao Nishizeki},
  TITLE         = {Approximability of Partitioning Graphs
                   with Supply and Demand},
  JOURNAL       = {Journal of Discrete Algorithms},
  journalurl    = {http://www.elsevier.com/locate/jda},
  VOLUME        = 6,
  NUMBER        = 4,
  MONTH         = {December},
  YEAR          = 2008,
  PAGES         = {627--650},

  dblp          = {https://dblp.org/rec/journals/jda/ItoDZN08},
  doi           = {https://dx.doi.org/10.1016/J.JDA.2008.03.002},
  comments      = {This paper is also available from <A HREF="http://dx.doi.org/10.1016/j.jda.2008.03.002">ScienceDirect</A>.},
  replaces      = {SupplyDemand_ISAAC2006},
  papers        = {SupplyDemand_ISAAC2006},
}

Comments:

This paper is also available from ScienceDirect.

Availability:

The paper is available in PDF (521k).

See information on file formats.

[Google Scholar search]

Related papers:

SupplyDemand_ISAAC2006 (Approximability of Partitioning Graphs with Supply and Demand)