Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Ismail Naderi, Mohsen Rezapour, and Mohammad R. Salavatipour. Approximation Schemes for Min-Sum k-Clustering. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 84:1-84:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{naderi_et_al:LIPIcs.ESA.2023.84, author = {Naderi, Ismail and Rezapour, Mohsen and Salavatipour, Mohammad R.}, title = {{Approximation Schemes for Min-Sum k-Clustering}}, booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)}, pages = {84:1--84:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-295-2}, ISSN = {1868-8969}, year = {2023}, volume = {274}, editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.84}, URN = {urn:nbn:de:0030-drops-187379}, doi = {10.4230/LIPIcs.ESA.2023.84}, annote = {Keywords: Approximation Algorithms, Clustering, Dynamic Programming} }
Published in: LIPIcs, Volume 244, 30th Annual European Symposium on Algorithms (ESA 2022)
Zachary Friggstad and Mahya Jamshidian. Improved Polynomial-Time Approximations for Clustering with Minimum Sum of Radii or Diameters. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 56:1-56:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{friggstad_et_al:LIPIcs.ESA.2022.56, author = {Friggstad, Zachary and Jamshidian, Mahya}, title = {{Improved Polynomial-Time Approximations for Clustering with Minimum Sum of Radii or Diameters}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {56:1--56:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.56}, URN = {urn:nbn:de:0030-drops-169946}, doi = {10.4230/LIPIcs.ESA.2022.56}, annote = {Keywords: Approximation Algorithms, Clustering, Linear Programming} }
Published in: LIPIcs, Volume 181, 31st International Symposium on Algorithms and Computation (ISAAC 2020)
Haozhou Pang and Mohammad R. Salavatipour. Approximation Algorithms for Generalized Path Scheduling. In 31st International Symposium on Algorithms and Computation (ISAAC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 181, pp. 10:1-10:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{pang_et_al:LIPIcs.ISAAC.2020.10, author = {Pang, Haozhou and Salavatipour, Mohammad R.}, title = {{Approximation Algorithms for Generalized Path Scheduling}}, booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)}, pages = {10:1--10:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-173-3}, ISSN = {1868-8969}, year = {2020}, volume = {181}, editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.10}, URN = {urn:nbn:de:0030-drops-133547}, doi = {10.4230/LIPIcs.ISAAC.2020.10}, annote = {Keywords: Approximation Algorithms, Path Scheduling, Flow shop, Job Shop} }
Published in: LIPIcs, Volume 181, 31st International Symposium on Algorithms and Computation (ISAAC 2020)
Dylan Hyatt-Denesik, Mirmahdi Rahgoshay, and Mohammad R. Salavatipour. Approximations for Throughput Maximization. In 31st International Symposium on Algorithms and Computation (ISAAC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 181, pp. 11:1-11:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{hyattdenesik_et_al:LIPIcs.ISAAC.2020.11, author = {Hyatt-Denesik, Dylan and Rahgoshay, Mirmahdi and Salavatipour, Mohammad R.}, title = {{Approximations for Throughput Maximization}}, booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)}, pages = {11:1--11:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-173-3}, ISSN = {1868-8969}, year = {2020}, volume = {181}, editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.11}, URN = {urn:nbn:de:0030-drops-133555}, doi = {10.4230/LIPIcs.ISAAC.2020.11}, annote = {Keywords: Scheduling, Approximation Algorithms, Throughput Maximization} }
Published in: LIPIcs, Volume 154, 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)
Mirmahdi Rahgoshay and Mohammad R. Salavatipour. Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 33:1-33:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{rahgoshay_et_al:LIPIcs.STACS.2020.33, author = {Rahgoshay, Mirmahdi and Salavatipour, Mohammad R.}, title = {{Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {33:1--33:14}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.33}, URN = {urn:nbn:de:0030-drops-118946}, doi = {10.4230/LIPIcs.STACS.2020.33}, annote = {Keywords: Firefighter Problem, Resource Management, Fire Containment, Approximation Algorithm, Asymptotic Approximation Scheme} }
Published in: LIPIcs, Volume 81, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)
Zachary Friggstad, Arnoosh Golestanian, Kamyar Khodamoradi, Christopher Martin, Mirmahdi Rahgoshay, Mohsen Rezapour, Mohammad R. Salavatipour, and Yifeng Zhang. Scheduling Problems over Network of Machines. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 81, pp. 5:1-5:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{friggstad_et_al:LIPIcs.APPROX-RANDOM.2017.5, author = {Friggstad, Zachary and Golestanian, Arnoosh and Khodamoradi, Kamyar and Martin, Christopher and Rahgoshay, Mirmahdi and Rezapour, Mohsen and Salavatipour, Mohammad R. and Zhang, Yifeng}, title = {{Scheduling Problems over Network of Machines}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)}, pages = {5:1--5:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-044-6}, ISSN = {1868-8969}, year = {2017}, volume = {81}, editor = {Jansen, Klaus and Rolim, Jos\'{e} D. P. and Williamson, David P. and Vempala, Santosh S.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2017.5}, URN = {urn:nbn:de:0030-drops-75547}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2017.5}, annote = {Keywords: approximation algorithms, job-shop scheduling, min-sum edge coloring, minimum latency} }
Published in: LIPIcs, Volume 64, 27th International Symposium on Algorithms and Computation (ISAAC 2016)
Christopher S. Martin and Mohammad R. Salavatipour. Approximation Algorithms for Capacitated k-Travelling Repairmen Problems. In 27th International Symposium on Algorithms and Computation (ISAAC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 64, pp. 56:1-56:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{martin_et_al:LIPIcs.ISAAC.2016.56, author = {Martin, Christopher S. and Salavatipour, Mohammad R.}, title = {{Approximation Algorithms for Capacitated k-Travelling Repairmen Problems}}, booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)}, pages = {56:1--56:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-026-2}, ISSN = {1868-8969}, year = {2016}, volume = {64}, editor = {Hong, Seok-Hee}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.56}, URN = {urn:nbn:de:0030-drops-68262}, doi = {10.4230/LIPIcs.ISAAC.2016.56}, annote = {Keywords: approximation, capacitated, latency, group coverage} }
Published in: LIPIcs, Volume 53, 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)
Zachary Friggstad, Mohsen Rezapour, and Mohammad R. Salavatipour. Approximating Connected Facility Location with Lower and Upper Bounds via LP Rounding. In 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 53, pp. 1:1-1:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{friggstad_et_al:LIPIcs.SWAT.2016.1, author = {Friggstad, Zachary and Rezapour, Mohsen and Salavatipour, Mohammad R.}, title = {{Approximating Connected Facility Location with Lower and Upper Bounds via LP Rounding}}, booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)}, pages = {1:1--1:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-011-8}, ISSN = {1868-8969}, year = {2016}, volume = {53}, editor = {Pagh, Rasmus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.1}, URN = {urn:nbn:de:0030-drops-60302}, doi = {10.4230/LIPIcs.SWAT.2016.1}, annote = {Keywords: Facility Location, Approximation Algorithm, LP Rounding} }
Published in: LIPIcs, Volume 28, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)
Sara Ahmadian, Babak Behsaz, Zachary Friggstad, Amin Jorati, Mohammad R. Salavatipour, and Chaitanya Swamy. Approximation Algorithms for Minimum-Load k-Facility Location. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 28, pp. 17-33, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{ahmadian_et_al:LIPIcs.APPROX-RANDOM.2014.17, author = {Ahmadian, Sara and Behsaz, Babak and Friggstad, Zachary and Jorati, Amin and Salavatipour, Mohammad R. and Swamy, Chaitanya}, title = {{Approximation Algorithms for Minimum-Load k-Facility Location}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)}, pages = {17--33}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-74-3}, ISSN = {1868-8969}, year = {2014}, volume = {28}, editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.17}, URN = {urn:nbn:de:0030-drops-47154}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.17}, annote = {Keywords: approximation algorithms, min-max star cover, facility location, line metrics} }
Feedback for Dagstuhl Publishing