BibTeX Export for On Linear Programming Relaxations for Unsplittable Flow in Trees

Copy to Clipboard Download

@InProceedings{friggstad_et_al:LIPIcs.APPROX-RANDOM.2015.265,
  author =	{Friggstad, Zachary and Gao, Zhihan},
  title =	{{On Linear Programming Relaxations for Unsplittable Flow in Trees}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)},
  pages =	{265--283},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-89-7},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{40},
  editor =	{Garg, Naveen and Jansen, Klaus and Rao, Anup and Rolim, Jos\'{e} D. P.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2015.265},
  URN =		{urn:nbn:de:0030-drops-53073},
  doi =		{10.4230/LIPIcs.APPROX-RANDOM.2015.265},
  annote =	{Keywords: Unsplittable flow, Linear programming relaxation, Approximation algorithm}
}

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode