Entry Berman:2012:PDA from lncs2012g.bib

Last update: Sun Oct 15 02:37:19 MDT 2017                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Berman:2012:PDA,
  author =       "Piotr Berman and Grigory Yaroslavtsev",
  title =        "Primal-Dual Approximation Algorithms for Node-Weighted
                 Network Design in Planar Graphs",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "7408",
  pages =        "50--60",
  year =         "2012",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/978-3-642-32512-0_5",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Wed Dec 19 15:21:55 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
  URL =          "http://link.springer.com/chapter/10.1007/978-3-642-32512-0_5/",
  acknowledgement = ack-nhfb,
  book-DOI =     "https://doi.org/10.1007/978-3-642-32512-0",
  book-URL =     "http://www.springerlink.com/content/978-3-642-32512-0",
  fjournal =     "Lecture Notes in Computer Science",
}

Related entries