BibTeX Export for Maximizing a Submodular Function with Bounded Curvature Under an Unknown Knapsack Constraint

Copy to Clipboard Download

@InProceedings{klimm_et_al:LIPIcs.APPROX/RANDOM.2022.49,
  author =	{Klimm, Max and Knaack, Martin},
  title =	{{Maximizing a Submodular Function with Bounded Curvature Under an Unknown Knapsack Constraint}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
  pages =	{49:1--49:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-249-5},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{245},
  editor =	{Chakrabarti, Amit and Swamy, Chaitanya},
  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.2022.49},
  URN =		{urn:nbn:de:0030-drops-171711},
  doi =		{10.4230/LIPIcs.APPROX/RANDOM.2022.49},
  annote =	{Keywords: submodular function, knapsack, approximation algorithm, robust optimization}
}

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