Published in: LIPIcs, Volume 207, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)
Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, and Danny Raz. General Knapsack Problems in a Dynamic Setting. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 207, pp. 15:1-15:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{fairstein_et_al:LIPIcs.APPROX/RANDOM.2021.15, author = {Fairstein, Yaron and Kulik, Ariel and Naor, Joseph (Seffi) and Raz, Danny}, title = {{General Knapsack Problems in a Dynamic Setting}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)}, pages = {15:1--15:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-207-5}, ISSN = {1868-8969}, year = {2021}, volume = {207}, editor = {Wootters, Mary and Sanit\`{a}, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.15}, URN = {urn:nbn:de:0030-drops-147081}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2021.15}, annote = {Keywords: Multistage, Multiple-Knapsacks, Multidimensional Knapsack} }
Published in: LIPIcs, Volume 173, 28th Annual European Symposium on Algorithms (ESA 2020)
Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, and Hadas Shachnai. A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 44:1-44:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{fairstein_et_al:LIPIcs.ESA.2020.44, author = {Fairstein, Yaron and Kulik, Ariel and Naor, Joseph (Seffi) and Raz, Danny and Shachnai, Hadas}, title = {{A (1-e^\{-1\}-\epsilon)-Approximation for the Monotone Submodular Multiple Knapsack Problem}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {44:1--44:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.44}, URN = {urn:nbn:de:0030-drops-129107}, doi = {10.4230/LIPIcs.ESA.2020.44}, annote = {Keywords: Sumodular Optimization, Multiple Knapsack, Randomized Rounding} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Orit E. Raz and József Solymosi. Dense Graphs Have Rigid Parts. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 65:1-65:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{raz_et_al:LIPIcs.SoCG.2020.65, author = {Raz, Orit E. and Solymosi, J\'{o}zsef}, title = {{Dense Graphs Have Rigid Parts}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {65:1--65:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.65}, URN = {urn:nbn:de:0030-drops-122236}, doi = {10.4230/LIPIcs.SoCG.2020.65}, annote = {Keywords: Graph rigidity, line configurations in 3D} }
Published in: LIPIcs, Volume 149, 30th International Symposium on Algorithms and Computation (ISAAC 2019)
David Naori and Danny Raz. Online Multidimensional Packing Problems in the Random-Order Model. In 30th International Symposium on Algorithms and Computation (ISAAC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 149, pp. 10:1-10:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{naori_et_al:LIPIcs.ISAAC.2019.10, author = {Naori, David and Raz, Danny}, title = {{Online Multidimensional Packing Problems in the Random-Order Model}}, booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)}, pages = {10:1--10:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-130-6}, ISSN = {1868-8969}, year = {2019}, volume = {149}, editor = {Lu, Pinyan and Zhang, Guochuan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.10}, URN = {urn:nbn:de:0030-drops-115067}, doi = {10.4230/LIPIcs.ISAAC.2019.10}, annote = {Keywords: Random Order, Generalized Assignment Problem, Knapsack Problem, Multidimensional Packing, Secretary Problem} }
Published in: LIPIcs, Volume 123, 29th International Symposium on Algorithms and Computation (ISAAC 2018)
Galia Shabtai, Danny Raz, and Yuval Shavitt. A Relaxed FPTAS for Chance-Constrained Knapsack. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 72:1-72:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{shabtai_et_al:LIPIcs.ISAAC.2018.72, author = {Shabtai, Galia and Raz, Danny and Shavitt, Yuval}, title = {{A Relaxed FPTAS for Chance-Constrained Knapsack}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {72:1--72:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.72}, URN = {urn:nbn:de:0030-drops-100201}, doi = {10.4230/LIPIcs.ISAAC.2018.72}, annote = {Keywords: Stochastic knapsack, Chance constraint, Approximation algorithms, Combinatorial optimization} }
Feedback for Dagstuhl Publishing