LIPIcs, Volume 116
APPROX/RANDOM 2018, August 20-22, 2018, Princeton, NJ, USA
Editors: Eric Blais, Klaus Jansen, José D. P. Rolim, and David Steurer
LIPIcs, Volume 81
APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA
Editors: Klaus Jansen, José D. P. Rolim, David P. Williamson, and Santosh S. Vempala
LIPIcs, Volume 60
APPROX/RANDOM 2016, September 7-9, 2016, Paris, France
Editors: Klaus Jansen, Claire Mathieu, José D. P. Rolim, and Chris Umans
LIPIcs, Volume 40
APPROX/RANDOM 2015, August 24-26, 2015, Princeton, USA
Editors: Naveen Garg, Klaus Jansen, Anup Rao, and José D. P. Rolim
LIPIcs, Volume 28
APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain
Editors: Klaus Jansen, José Rolim, Nikhil R. Devanur, and Cristopher Moore
Published in: LIPIcs, Volume 283, 34th International Symposium on Algorithms and Computation (ISAAC 2023)
Sebastian Berndt, Hauke Brinkop, Klaus Jansen, Matthias Mnich, and Tobias Stamm. New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines. In 34th International Symposium on Algorithms and Computation (ISAAC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 283, pp. 13:1-13:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{berndt_et_al:LIPIcs.ISAAC.2023.13, author = {Berndt, Sebastian and Brinkop, Hauke and Jansen, Klaus and Mnich, Matthias and Stamm, Tobias}, title = {{New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines}}, booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)}, pages = {13:1--13:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-289-1}, ISSN = {1868-8969}, year = {2023}, volume = {283}, editor = {Iwata, Satoru and Kakimura, Naonori}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.13}, URN = {urn:nbn:de:0030-drops-193155}, doi = {10.4230/LIPIcs.ISAAC.2023.13}, annote = {Keywords: Integer programming, scheduling algorithms, uniformly related machines, makespan minimization} }
Published in: LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)
Klaus Jansen, Arindam Khan, Marvin Lira, and K. V. N. Sreenivas. A PTAS for Packing Hypercubes into a Knapsack. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 229, pp. 78:1-78:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{jansen_et_al:LIPIcs.ICALP.2022.78, author = {Jansen, Klaus and Khan, Arindam and Lira, Marvin and Sreenivas, K. V. N.}, title = {{A PTAS for Packing Hypercubes into a Knapsack}}, booktitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)}, pages = {78:1--78:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-235-8}, ISSN = {1868-8969}, year = {2022}, volume = {229}, editor = {Boja\'{n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.78}, URN = {urn:nbn:de:0030-drops-164192}, doi = {10.4230/LIPIcs.ICALP.2022.78}, annote = {Keywords: Multidimensional knapsack, geometric packing, cube packing, strip packing} }
Published in: LIPIcs, Volume 207, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)
Max A. Deppert, Klaus Jansen, Arindam Khan, Malin Rau, and Malte Tutas. Peak Demand Minimization via Sliced Strip Packing. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 207, pp. 21:1-21:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{deppert_et_al:LIPIcs.APPROX/RANDOM.2021.21, author = {Deppert, Max A. and Jansen, Klaus and Khan, Arindam and Rau, Malin and Tutas, Malte}, title = {{Peak Demand Minimization via Sliced Strip Packing}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)}, pages = {21:1--21:24}, 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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.21}, URN = {urn:nbn:de:0030-drops-147145}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2021.21}, annote = {Keywords: scheduling, peak demand minimization, approximation} }
Published in: LIPIcs, Volume 204, 29th Annual European Symposium on Algorithms (ESA 2021)
Klaus Jansen and Malin Rau. Closing the Gap for Single Resource Constraint Scheduling. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 53:1-53:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{jansen_et_al:LIPIcs.ESA.2021.53, author = {Jansen, Klaus and Rau, Malin}, title = {{Closing the Gap for Single Resource Constraint Scheduling}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {53:1--53:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.53}, URN = {urn:nbn:de:0030-drops-146344}, doi = {10.4230/LIPIcs.ESA.2021.53}, annote = {Keywords: resource constraint scheduling, approximation algorithm} }
Published in: LIPIcs, Volume 202, 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)
Max A. Deppert, Klaus Jansen, and Kim-Manuel Klein. Fuzzy Simultaneous Congruences. In 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 202, pp. 39:1-39:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{deppert_et_al:LIPIcs.MFCS.2021.39, author = {Deppert, Max A. and Jansen, Klaus and Klein, Kim-Manuel}, title = {{Fuzzy Simultaneous Congruences}}, booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)}, pages = {39:1--39:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-201-3}, ISSN = {1868-8969}, year = {2021}, volume = {202}, editor = {Bonchi, Filippo and Puglisi, Simon J.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.39}, URN = {urn:nbn:de:0030-drops-144792}, doi = {10.4230/LIPIcs.MFCS.2021.39}, annote = {Keywords: Simultaneous congruences, Integer programming, Mixing Set, Real-time scheduling, Diophantine approximation} }
Published in: LIPIcs, Volume 198, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
Moritz Buchem, Lars Rohwedder, Tjark Vredeveld, and Andreas Wiese. Additive Approximation Schemes for Load Balancing Problems. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 198, pp. 42:1-42:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{buchem_et_al:LIPIcs.ICALP.2021.42, author = {Buchem, Moritz and Rohwedder, Lars and Vredeveld, Tjark and Wiese, Andreas}, title = {{Additive Approximation Schemes for Load Balancing Problems}}, booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, pages = {42:1--42:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-195-5}, ISSN = {1868-8969}, year = {2021}, volume = {198}, editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.42}, URN = {urn:nbn:de:0030-drops-141116}, doi = {10.4230/LIPIcs.ICALP.2021.42}, annote = {Keywords: Load balancing, Approximation schemes, Parallel machine scheduling} }
Published in: LIPIcs, Volume 176, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)
Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan, and Malin Rau. A Tight (3/2+ε) Approximation for Skewed Strip Packing. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 176, pp. 44:1-44:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{galvez_et_al:LIPIcs.APPROX/RANDOM.2020.44, author = {G\'{a}lvez, Waldo and Grandoni, Fabrizio and Ameli, Afrouz Jabal and Jansen, Klaus and Khan, Arindam and Rau, Malin}, title = {{A Tight (3/2+\epsilon) Approximation for Skewed Strip Packing}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)}, pages = {44:1--44:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-164-1}, ISSN = {1868-8969}, year = {2020}, volume = {176}, editor = {Byrka, Jaros{\l}aw and Meka, Raghu}, 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.2020.44}, URN = {urn:nbn:de:0030-drops-126478}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.44}, annote = {Keywords: strip packing, approximation algorithm} }
Published in: LIPIcs, Volume 154, 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)
Marten Maack and Klaus Jansen. Inapproximability Results for Scheduling with Interval and Resource Restrictions. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 5:1-5:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{maack_et_al:LIPIcs.STACS.2020.5, author = {Maack, Marten and Jansen, Klaus}, title = {{Inapproximability Results for Scheduling with Interval and Resource Restrictions}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {5:1--5:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.5}, URN = {urn:nbn:de:0030-drops-118663}, doi = {10.4230/LIPIcs.STACS.2020.5}, annote = {Keywords: Scheduling, Restricted Assignment, Approximation, Inapproximability, PTAS} }
Published in: LIPIcs, Volume 144, 27th Annual European Symposium on Algorithms (ESA 2019)
Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, and Lars Rohwedder. Online Bin Covering with Limited Migration. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 18:1-18:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{berndt_et_al:LIPIcs.ESA.2019.18, author = {Berndt, Sebastian and Epstein, Leah and Jansen, Klaus and Levin, Asaf and Maack, Marten and Rohwedder, Lars}, title = {{Online Bin Covering with Limited Migration}}, booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)}, pages = {18:1--18:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-124-5}, ISSN = {1868-8969}, year = {2019}, volume = {144}, editor = {Bender, Michael A. and Svensson, Ola and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2019.18}, URN = {urn:nbn:de:0030-drops-111391}, doi = {10.4230/LIPIcs.ESA.2019.18}, annote = {Keywords: online algorithms, dynamic algorithms, competitive ratio, bin covering, migration factor} }
Published in: LIPIcs, Volume 144, 27th Annual European Symposium on Algorithms (ESA 2019)
Klaus Jansen and Malin Rau. Closing the Gap for Pseudo-Polynomial Strip Packing. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 62:1-62:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{jansen_et_al:LIPIcs.ESA.2019.62, author = {Jansen, Klaus and Rau, Malin}, title = {{Closing the Gap for Pseudo-Polynomial Strip Packing}}, booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)}, pages = {62:1--62:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-124-5}, ISSN = {1868-8969}, year = {2019}, volume = {144}, editor = {Bender, Michael A. and Svensson, Ola and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2019.62}, URN = {urn:nbn:de:0030-drops-111831}, doi = {10.4230/LIPIcs.ESA.2019.62}, annote = {Keywords: Strip Packing, pseudo-polynomial, 90 degree rotation, Contiguous Moldable Task Scheduling} }
Feedback for Dagstuhl Publishing