Entry ElOuali:2012:MPH 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{ElOuali:2012:MPH,
  author =       "Mourad {El Ouali} and Gerold J{\"a}ger",
  title =        "The $b$-Matching Problem in Hypergraphs: Hardness and
                 Approximability",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "7402",
  pages =        "200--211",
  year =         "2012",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/978-3-642-31770-5_18",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Wed Dec 19 15:21:48 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
  URL =          "http://link.springer.com/chapter/10.1007/978-3-642-31770-5_18/",
  acknowledgement = ack-nhfb,
  book-DOI =     "https://doi.org/10.1007/978-3-642-31770-5",
  book-URL =     "http://www.springerlink.com/content/978-3-642-31770-5",
  fjournal =     "Lecture Notes in Computer Science",
}

Related entries