Published in: LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Shi Li. Nearly-Linear Time LP Solvers and Rounding Algorithms for Scheduling Problems. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 86:1-86:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{li:LIPIcs.ICALP.2023.86, author = {Li, Shi}, title = {{Nearly-Linear Time LP Solvers and Rounding Algorithms for Scheduling Problems}}, booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)}, pages = {86:1--86:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-278-5}, ISSN = {1868-8969}, year = {2023}, volume = {261}, editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.86}, URN = {urn:nbn:de:0030-drops-181386}, doi = {10.4230/LIPIcs.ICALP.2023.86}, annote = {Keywords: Nearly-Linear Time, Sheduling, Approximation Algorithms} }
Published in: LIPIcs, Volume 248, 33rd International Symposium on Algorithms and Computation (ISAAC 2022)
Xiangyu Guo, Kelin Luo, Shi Li, and Yuhao Zhang. Minimizing the Maximum Flow Time in the Online Food Delivery Problem. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 33:1-33:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{guo_et_al:LIPIcs.ISAAC.2022.33, author = {Guo, Xiangyu and Luo, Kelin and Li, Shi and Zhang, Yuhao}, title = {{Minimizing the Maximum Flow Time in the Online Food Delivery Problem}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {33:1--33:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.33}, URN = {urn:nbn:de:0030-drops-173181}, doi = {10.4230/LIPIcs.ISAAC.2022.33}, annote = {Keywords: Online algorithm, Capacitated Vehicle Routing, Flow Time Optimization} }
Published in: LIPIcs, Volume 248, 33rd International Symposium on Algorithms and Computation (ISAAC 2022)
Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, and Seeun William Umboh. Nested Active-Time Scheduling. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 36:1-36:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{cao_et_al:LIPIcs.ISAAC.2022.36, author = {Cao, Nairen and Fineman, Jeremy T. and Li, Shi and Mestre, Juli\'{a}n and Russell, Katina and Umboh, Seeun William}, title = {{Nested Active-Time Scheduling}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {36:1--36:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.36}, URN = {urn:nbn:de:0030-drops-173214}, doi = {10.4230/LIPIcs.ISAAC.2022.36}, annote = {Keywords: Scheduling algorithms, Active time, Approximation algorithm} }
Published in: LITES, Volume 8, Issue 1 (2022): Special Issue on Embedded Systems for Computer Vision. Leibniz Transactions on Embedded Systems, Volume 8, Issue 1
Friedrich Kruber, Eduardo Sánchez Morales, Robin Egolf, Jonas Wurst, Samarjit Chakraborty, and Michael Botsch. Micro- and Macroscopic Road Traffic Analysis using Drone Image Data. In LITES, Volume 8, Issue 1 (2022): Special Issue on Embedded Systems for Computer Vision. Leibniz Transactions on Embedded Systems, Volume 8, Issue 1, pp. 02:1-02:27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@Article{kruber_et_al:LITES.8.1.2, author = {Kruber, Friedrich and S\'{a}nchez Morales, Eduardo and Egolf, Robin and Wurst, Jonas and Chakraborty, Samarjit and Botsch, Michael}, title = {{Micro- and Macroscopic Road Traffic Analysis using Drone Image Data}}, journal = {Leibniz Transactions on Embedded Systems}, pages = {02:1--02:27}, ISSN = {2199-2002}, year = {2022}, volume = {8}, number = {1}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LITES.8.1.2}, doi = {10.4230/LITES.8.1.2}, annote = {Keywords: traffic data analysis, trajectory data, drone image data} }
Published in: LIPIcs, Volume 185, 12th Innovations in Theoretical Computer Science Conference (ITCS 2021)
Joshua Lau and Angus Ritossa. Algorithms and Hardness for Multidimensional Range Updates and Queries. In 12th Innovations in Theoretical Computer Science Conference (ITCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 185, pp. 35:1-35:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{lau_et_al:LIPIcs.ITCS.2021.35, author = {Lau, Joshua and Ritossa, Angus}, title = {{Algorithms and Hardness for Multidimensional Range Updates and Queries}}, booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)}, pages = {35:1--35:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-177-1}, ISSN = {1868-8969}, year = {2021}, volume = {185}, editor = {Lee, James R.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.35}, URN = {urn:nbn:de:0030-drops-135742}, doi = {10.4230/LIPIcs.ITCS.2021.35}, annote = {Keywords: Orthogonal range, Range updates, Online and Dynamic Data Structures, Fine-grained complexity, Cycle counting} }
Published in: LIPIcs, Volume 176, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)
Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li, Daniel Vaz, and Jiayi Xian. On Approximating Degree-Bounded Network Design Problems. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 176, pp. 39:1-39:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{guo_et_al:LIPIcs.APPROX/RANDOM.2020.39, author = {Guo, Xiangyu and Kortsarz, Guy and Laekhanukit, Bundit and Li, Shi and Vaz, Daniel and Xian, Jiayi}, title = {{On Approximating Degree-Bounded Network Design Problems}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)}, pages = {39:1--39:21}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.39}, URN = {urn:nbn:de:0030-drops-126420}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.39}, annote = {Keywords: Directed Steiner Tree, Group Steiner Tree, degree-bounded} }
Published in: LIPIcs, Volume 176, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)
Xiangyu Guo, Janardhan Kulkarni, Shi Li, and Jiayi Xian. On the Facility Location Problem in Online and Dynamic Models. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 176, pp. 42:1-42:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{guo_et_al:LIPIcs.APPROX/RANDOM.2020.42, author = {Guo, Xiangyu and Kulkarni, Janardhan and Li, Shi and Xian, Jiayi}, title = {{On the Facility Location Problem in Online and Dynamic Models}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)}, pages = {42:1--42:23}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.42}, URN = {urn:nbn:de:0030-drops-126452}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.42}, annote = {Keywords: Facility location, online algorithm, recourse} }
Published in: LIPIcs, Volume 116, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)
Janardhan Kulkarni and Shi Li. Flow-time Optimization for Concurrent Open-Shop and Precedence Constrained Scheduling Models. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 116, pp. 16:1-16:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{kulkarni_et_al:LIPIcs.APPROX-RANDOM.2018.16, author = {Kulkarni, Janardhan and Li, Shi}, title = {{Flow-time Optimization for Concurrent Open-Shop and Precedence Constrained Scheduling Models}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)}, pages = {16:1--16:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-085-9}, ISSN = {1868-8969}, year = {2018}, volume = {116}, editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.16}, URN = {urn:nbn:de:0030-drops-94205}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.16}, annote = {Keywords: Approximation, Weighted Flow Time, Concurrent Open Shop, Precedence Constraints} }
Published in: LIPIcs, Volume 55, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)
Gökalp Demirci and Shi Li. Constant Approximation for Capacitated k-Median with (1+epsilon)-Capacity Violation. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 73:1-73:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{demirci_et_al:LIPIcs.ICALP.2016.73, author = {Demirci, G\"{o}kalp and Li, Shi}, title = {{Constant Approximation for Capacitated k-Median with (1+epsilon)-Capacity Violation}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {73:1--73:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.73}, URN = {urn:nbn:de:0030-drops-62112}, doi = {10.4230/LIPIcs.ICALP.2016.73}, annote = {Keywords: Approximation Algorithms, Capacitated k-Median, Pseudo Approximation, Capacity Violation} }
Feedback for Dagstuhl Publishing