D1
Algorithms & Complexity

Publications

2023
[1]
P. S. Ardra, R. Krithika, S. Saurabh, and R. Sharma, “Balanced Substructures in Bicolored Graphs,” in SOFSEM 2023: Theory and Practice of Computer Science, Nový Smokovec, Slovakia, 2023.
Export
BibTeX
@inproceedings{Ardra_SOFSEM23, TITLE = {Balanced Substructures in Bicolored Graphs}, AUTHOR = {Ardra, P. S. and Krithika, R. and Saurabh, Saket and Sharma, Roohani}, LANGUAGE = {eng}, ISBN = {978-3-031-23100-1}, DOI = {10.1007/978-3-031-23101-8_12}, PUBLISHER = {Springer}, YEAR = {2023}, MARGINALMARK = {$\bullet$}, DATE = {2023}, BOOKTITLE = {SOFSEM 2023: Theory and Practice of Computer Science}, EDITOR = {G{\c a}sieniec, Leszek}, PAGES = {177--191}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {13878}, ADDRESS = {Nov{\'y} Smokovec, Slovakia}, }
Endnote
%0 Conference Proceedings %A Ardra, P. S. %A Krithika, R. %A Saurabh, Saket %A Sharma, Roohani %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Balanced Substructures in Bicolored Graphs : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1D8F-4 %R 10.1007/978-3-031-23101-8_12 %D 2023 %B 48th International Conference on Current Trends in Theory and Practice of Computer Science %Z date of event: 2023-01-15 - 2023-01-18 %C Nový Smokovec, Slovakia %B SOFSEM 2023: Theory and Practice of Computer Science %E Gąsieniec, Leszek %P 177 - 191 %I Springer %@ 978-3-031-23100-1 %B Lecture Notes in Computer Science %N 13878 %U https://rdcu.be/c2Gfk
[2]
S. Bhattacharya, P. Kiss, and T. Saranurak, “Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight,” in Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), Florence, Italy. (Accepted/in press)
Export
BibTeX
@inproceedings{BhattacharyaSODA23, TITLE = {Dynamic Algorithms for Packing-Covering {LPs} via Multiplicative Weight}, AUTHOR = {Bhattacharya, Sayan and Kiss, Peter and Saranurak, Thatchaphol}, LANGUAGE = {eng}, YEAR = {2023}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023)}, ADDRESS = {Florence, Italy}, }
Endnote
%0 Conference Proceedings %A Bhattacharya, Sayan %A Kiss, Peter %A Saranurak, Thatchaphol %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight : %G eng %U http://hdl.handle.net/21.11116/0000-000C-4333-F %D 2022 %B Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2023-01-22 - 2023-01-25 %C Florence, Italy %B Annual ACM-SIAM Symposium on Discrete Algorithms
[3]
S. Bhattacharya, P. Kiss, T. Saranurak, and D. Wajc, “Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time,” in Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), Florence, Italy. (Accepted/in press)
Export
BibTeX
@inproceedings{BhattacharyaSODA23b, TITLE = {Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time}, AUTHOR = {Bhattacharya, Sayan and Kiss, Peter and Saranurak, Thatchaphol and Wajc, David}, LANGUAGE = {eng}, YEAR = {2023}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023)}, ADDRESS = {Florence, Italy}, }
Endnote
%0 Conference Proceedings %A Bhattacharya, Sayan %A Kiss, Peter %A Saranurak, Thatchaphol %A Wajc, David %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time : %G eng %U http://hdl.handle.net/21.11116/0000-000C-4336-C %D 2022 %B Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2023-01-22 - 2023-01-25 %C Florence, Italy %B Annual ACM-SIAM Symposium on Discrete Algorithms
[4]
K. Bringmann, M. Kapralov, M. Makarov, V. Nakos, A. Yagudin, and A. Zandieh, “Sparse Fourier Transform by Traversing Cooley-Tukey FFT Computation Graphs,” in Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), Florence, Italy. (Accepted/in press)
Export
BibTeX
@inproceedings{BringmannSODA23, TITLE = {Sparse {F}ourier Transform by traversing {C}ooley-{T}ukey {FFT} computation graphs}, AUTHOR = {Bringmann, Karl and Kapralov, Michael and Makarov, Mikhail and Nakos, Vasileios and Yagudin, Amir and Zandieh, Amir}, LANGUAGE = {eng}, YEAR = {2023}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023)}, ADDRESS = {Florence, Italy}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Kapralov, Michael %A Makarov, Mikhail %A Nakos, Vasileios %A Yagudin, Amir %A Zandieh, Amir %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Sparse Fourier Transform by Traversing Cooley-Tukey FFT Computation Graphs : %G eng %U http://hdl.handle.net/21.11116/0000-000C-26DB-3 %D 2022 %B Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2023-01-22 - 2023-01-25 %C Florence, Italy %B Annual ACM-SIAM Symposium on Discrete Algorithms
[5]
F. Dross, K. Fleszar, K. Węgrzycki, and A. Zych-Pawlewicz, “Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours,” in Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), Florence, Italy. (Accepted/in press)
Export
BibTeX
@inproceedings{DrossSODA23, TITLE = {Gap-{ETH}-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing {E}uclidean Travelling Salesman Tours}, AUTHOR = {Dross, Fran{\c c}ois and Fleszar, Krzysztof and W{\c e}grzycki, Karol and Zych-Pawlewicz, Anna}, LANGUAGE = {eng}, YEAR = {2023}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023)}, ADDRESS = {Florence, Italy}, }
Endnote
%0 Conference Proceedings %A Dross, François %A Fleszar, Krzysztof %A Węgrzycki, Karol %A Zych-Pawlewicz, Anna %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1F6C-A %D 2022 %B Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2023-01-22 - 2023-01-25 %C Florence, Italy %B Annual ACM-SIAM Symposium on Discrete Algorithms
[6]
J. Focke, D. Marx, F. M. Inerney, D. Neuen, G. S. Sankar, P. Schepper, and P. Wellnitz, “Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs,” in Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), Florence, Italy. (Accepted/in press)
Export
BibTeX
@inproceedings{FockeSODA23, TITLE = {Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs}, AUTHOR = {Focke, Jacob and Marx, D{\'a}niel and Inerney, Fionn Mc and Neuen, Daniel and Sankar, Govind S. and Schepper, Philipp and Wellnitz, Philip}, LANGUAGE = {eng}, YEAR = {2023}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023)}, ADDRESS = {Florence, Italy}, }
Endnote
%0 Conference Proceedings %A Focke, Jacob %A Marx, Dániel %A Inerney, Fionn Mc %A Neuen, Daniel %A Sankar, Govind S. %A Schepper, Philipp %A Wellnitz, Philip %+ External Organizations External Organizations External Organizations External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1EA4-A %D 2022 %B Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2023-01-22 - 2023-01-25 %C Florence, Italy %B Annual ACM-SIAM Symposium on Discrete Algorithms
[7]
A. Gionis, K. Khodamoradi, B. Ordozgoiti, B. Riegel, and J. Spoerhase, “A Constant-Factor Approximation Algorithm for Reconciliation k-Median,” in Proceedings of the 26th International Conference on Artificial Intelligence and Statistics (AISTATS 2023), Valencia, Spain. (Accepted/in press)
Export
BibTeX
@inproceedings{Gionis_AISTATS2023, TITLE = {A Constant-Factor Approximation Algorithm for Reconciliation $k$-Median}, AUTHOR = {Gionis, Aristides and Khodamoradi, Kamyar and Ordozgoiti, Bruno and Riegel, Benedikt and Spoerhase, Joachim}, LANGUAGE = {eng}, PUBLISHER = {PMLR}, YEAR = {2023}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Proceedings of the 26th International Conference on Artificial Intelligence and Statistics (AISTATS 2023)}, SERIES = {Proceedings of the Machine Learning Research}, ADDRESS = {Valencia, Spain}, }
Endnote
%0 Conference Proceedings %A Gionis, Aristides %A Khodamoradi, Kamyar %A Ordozgoiti, Bruno %A Riegel, Benedikt %A Spoerhase, Joachim %+ External Organizations External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Constant-Factor Approximation Algorithm for Reconciliation k-Median : %G eng %U http://hdl.handle.net/21.11116/0000-000C-739D-2 %D 2023 %B 26th International Conference on Artificial Intelligence and Statistics %Z date of event: 2023-04-25 - 2023-04-27 %C Valencia, Spain %B Proceedings of the 26th International Conference on Artificial Intelligence and Statistics %I PMLR %B Proceedings of the Machine Learning Research
[8]
E. Goldenberg, T. Kociumaka, R. Krauthgamer, and B. Saha, “An Algorithmic Bridge Between Hamming and Levenshtein Distances,” in 14th Innovations in Theoretical Computer Science Conference (ITCS 2023), Cambridge, MA, USA. (Accepted/in press)
Export
BibTeX
@inproceedings{Goldenberg_ITCS23, TITLE = {An Algorithmic Bridge Between Hamming and Levenshtein Distances}, AUTHOR = {Goldenberg, Elazar and Kociumaka, Tomasz and Krauthgamer, Robert and Saha, Barna}, LANGUAGE = {eng}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2023}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)}, EDITOR = {Tauman Kalai, Yael}, SERIES = {Leibniz International Proceedings in Informatics}, ADDRESS = {Cambridge, MA, USA}, }
Endnote
%0 Conference Proceedings %A Goldenberg, Elazar %A Kociumaka, Tomasz %A Krauthgamer, Robert %A Saha, Barna %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T An Algorithmic Bridge Between Hamming and Levenshtein Distances : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1588-3 %D 2022 %B 14th Innovations in Theoretical Computer Science Conference %Z date of event: 2023-01-10 - 2023-01-13 %C Cambridge, MA, USA %B 14th Innovations in Theoretical Computer Science Conference %E Tauman Kalai, Yael %I Schloss Dagstuhl %B Leibniz International Proceedings in Informatics
[9]
T. Gouleakis, K. Lakis, and G. Shahkarami, “Learning-Augmented Algorithms for Online TSP on the Line,” in Proceedings of the 37th AAAI Conference on Artificial Intelligence, Washington, DC, USA. (Accepted/in press)
Export
BibTeX
@inproceedings{Gouleakis_AAAI23, TITLE = {Learning-Augmented Algorithms for Online {TSP} on the Line}, AUTHOR = {Gouleakis, Themis and Lakis, Konstantinos and Shahkarami, Golnoosh}, LANGUAGE = {eng}, PUBLISHER = {AAAI}, YEAR = {2023}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Proceedings of the 37th AAAI Conference on Artificial Intelligence}, ADDRESS = {Washington, DC, USA}, }
Endnote
%0 Conference Proceedings %A Gouleakis, Themis %A Lakis, Konstantinos %A Shahkarami, Golnoosh %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Learning-Augmented Algorithms for Online TSP on the Line : %G eng %U http://hdl.handle.net/21.11116/0000-000C-466C-D %D 2023 %B 37th AAAI Conference on Artificial Intelligence %Z date of event: 2023-02-07 - 2023-02-14 %C Washington, DC, USA %B Proceedings of the 37th AAAI Conference on Artificial Intelligence %I AAAI
[10]
D. Kempa and T. Kociumaka, “Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays,” in Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), Florence, Italy. (Accepted/in press)
Export
BibTeX
@inproceedings{KempaSODA23, TITLE = {Breaking the $O(n)$-{B}arrier in the Construction of Compressed Suffix Arrays}, AUTHOR = {Kempa, Dominik and Kociumaka, Tomasz}, YEAR = {2023}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023)}, ADDRESS = {Florence, Italy}, }
Endnote
%0 Conference Proceedings %A Kempa, Dominik %A Kociumaka, Tomasz %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays : %U http://hdl.handle.net/21.11116/0000-000C-158F-C %D 2022 %B Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2023-01-22 - 2023-01-25 %C Florence, Italy %B Annual ACM-SIAM Symposium on Discrete Algorithms
[11]
P. Kleer and H. U. Simon, “Primal and Dual Combinatorial Dimensions,” Discrete Applied Mathematics, vol. 327, 2023.
Export
BibTeX
@article{Kleer2023, TITLE = {Primal and Dual Combinatorial Dimensions}, AUTHOR = {Kleer, Pieter and Simon, Hans U.}, LANGUAGE = {eng}, ISSN = {0166-218X}, DOI = {10.1016/j.dam.2022.11.010}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2023}, MARGINALMARK = {$\bullet$}, JOURNAL = {Discrete Applied Mathematics}, VOLUME = {327}, PAGES = {185--196}, }
Endnote
%0 Journal Article %A Kleer, Pieter %A Simon, Hans U. %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Primal and Dual Combinatorial Dimensions : %G eng %U http://hdl.handle.net/21.11116/0000-000C-15FE-F %R 10.1016/j.dam.2022.11.010 %7 2023 %D 2023 %J Discrete Applied Mathematics %V 327 %& 185 %P 185 - 196 %I Elsevier %C Amsterdam %@ false
[12]
F. Mazowiecki, H. Sinclair-Banks, and K. Węgrzycki, “Coverability in 2-VASS with One Unary Counter is in NP,” in 26th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2023), Paris, France. (Accepted/in press)
Export
BibTeX
@inproceedings{Mazowieckie_FoSSaCS23, TITLE = {Coverability in 2-{VASS} with One Unary Counter is in {NP}}, AUTHOR = {Mazowiecki, Filip and Sinclair-Banks, Henry and W{\c e}grzycki, Karol}, LANGUAGE = {eng}, PUBLISHER = {Springer}, YEAR = {2023}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {26th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2023)}, ADDRESS = {Paris, France}, }
Endnote
%0 Conference Proceedings %A Mazowiecki, Filip %A Sinclair-Banks, Henry %A Węgrzycki, Karol %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Coverability in 2-VASS with One Unary Counter is in NP : Coverability in 2-{VASS} with One Unary Counter is in {NP} %G eng %U http://hdl.handle.net/21.11116/0000-000C-4678-F %D 2023 %B 26th International Conference on Foundations of Software Science and Computation Structures %Z date of event: 2023-04-22 - 2023-04-27 %C Paris, France %B 26th International Conference on Foundations of Software Science and Computation Structures %I Springer
[13]
J. Olkowski, M. Pilipczuk, M. Rychlicki, K. Węgrzycki, and A. Zych-Pawlewicz, “Dynamic Data Structures for Parameterized String Problems,” in 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023), Hamburg, Germany. (Accepted/in press)
Export
BibTeX
@inproceedings{OlkowskiSTACS23, TITLE = {Dynamic Data Structures for Parameterized String Problems}, AUTHOR = {Olkowski, J{\c e}drzej and Pilipczuk, Micha{\l} and Rychlicki, Mateusz and W{\c e}grzycki, Karol and Zych-Pawlewicz, Anna}, LANGUAGE = {eng}, YEAR = {2023}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)}, ADDRESS = {Hamburg, Germany}, }
Endnote
%0 Conference Proceedings %A Olkowski, Jędrzej %A Pilipczuk, Michał %A Rychlicki, Mateusz %A Węgrzycki, Karol %A Zych-Pawlewicz, Anna %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Dynamic Data Structures for Parameterized String Problems : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1F0E-4 %D 2023 %B 40th International Symposium on Theoretical Aspects of Computer Science %Z date of event: 2023-03-07 - 2023-03-10 %C Hamburg, Germany %B 40th International Symposium on Theoretical Aspects of Computer Science
2022
[14]
A. Abboud, K. Bringmann, S. Khoury, and O. Zamir, “Hardness of Approximation in p via Short Cycle Removal: Cycle Detection, Distance Oracles, and Beyond,” in STOC ’22, 54th Annual ACM Symposium on Theory of Computing, Rome, Italy, 2022.
Export
BibTeX
@inproceedings{AbboudSTOC22, TITLE = {Hardness of Approximation in {P} via Short Cycle Removal: {C}ycle Detection, Distance Oracles, and Beyond}, AUTHOR = {Abboud, Amir and Bringmann, Karl and Khoury, Seri and Zamir, Or}, LANGUAGE = {eng}, ISBN = {978-1-4503-9264-8}, DOI = {10.1145/3519935.3520066}, PUBLISHER = {ACM}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {STOC '22, 54th Annual ACM Symposium on Theory of Computing}, EDITOR = {Leonardi, Stefano and Gupta, Anupam}, PAGES = {1487--1500}, ADDRESS = {Rome, Italy}, }
Endnote
%0 Conference Proceedings %A Abboud, Amir %A Bringmann, Karl %A Khoury, Seri %A Zamir, Or %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Hardness of Approximation in p via Short Cycle Removal: Cycle Detection, Distance Oracles, and Beyond : %G eng %U http://hdl.handle.net/21.11116/0000-000B-4797-B %R 10.1145/3519935.3520066 %D 2022 %B 54th Annual ACM Symposium on Theory of Computing %Z date of event: 2022-06-20 - 2022-06-24 %C Rome, Italy %B STOC '22 %E Leonardi, Stefano; Gupta, Anupam %P 1487 - 1500 %I ACM %@ 978-1-4503-9264-8
[15]
A. Abboud, K. Bringmann, D. Hermelin, and D. Shabtay, “Scheduling Lower Bounds via AND Subset Sum,” Journal of Computer and System Sciences, vol. 127, 2022.
Export
BibTeX
@article{Abboud22, TITLE = {Scheduling Lower Bounds via {AND} Subset Sum}, AUTHOR = {Abboud, Amir and Bringmann, Karl and Hermelin, Danny and Shabtay, Dvir}, LANGUAGE = {eng}, ISSN = {0022-0000}, DOI = {10.1016/j.jcss.2022.01.005}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, DATE = {2022}, JOURNAL = {Journal of Computer and System Sciences}, VOLUME = {127}, PAGES = {29--40}, }
Endnote
%0 Journal Article %A Abboud, Amir %A Bringmann, Karl %A Hermelin, Danny %A Shabtay, Dvir %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Scheduling Lower Bounds via AND Subset Sum : %G eng %U http://hdl.handle.net/21.11116/0000-000B-153C-B %R 10.1016/j.jcss.2022.01.005 %7 2022 %D 2022 %J Journal of Computer and System Sciences %V 127 %& 29 %P 29 - 40 %I Elsevier %C Amsterdam %@ false
[16]
A. Abboud, K. Bringmann, D. Hermelin, and D. Shabtay, “SETH-Based Lower Bounds for Subset Sum and Bicriteria Path,” ACM Transactions on Algorithms, vol. 18, no. 1, 2022.
Export
BibTeX
@article{Abboud22a, TITLE = {{SETH}-Based Lower Bounds for {Subset Sum} and Bicriteria Path}, AUTHOR = {Abboud, Amir and Bringmann, Karl and Hermelin, Danny and Shabtay, Dvir}, LANGUAGE = {eng}, ISSN = {1549-6325}, DOI = {10.1145/3450524}, PUBLISHER = {ACM}, ADDRESS = {New York, NY}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, JOURNAL = {ACM Transactions on Algorithms}, VOLUME = {18}, NUMBER = {1}, PAGES = {1--22}, EID = {6}, }
Endnote
%0 Journal Article %A Abboud, Amir %A Bringmann, Karl %A Hermelin, Danny %A Shabtay, Dvir %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T SETH-Based Lower Bounds for Subset Sum and Bicriteria Path : %G eng %U http://hdl.handle.net/21.11116/0000-000B-1543-2 %R 10.1145/3450524 %7 2022 %D 2022 %J ACM Transactions on Algorithms %V 18 %N 1 %& 1 %P 1 - 22 %Z sequence number: 6 %I ACM %C New York, NY %@ false
[17]
A. Agrawal, D. Lokshtanov, P. Misra, S. Saurabh, and M. Zehavi, “Erdős–Pósa Property of Obstructions to Interval Graphs,” Journal of Graph Theory, vol. Early View, 2022.
Export
BibTeX
@article{Agrawal2022, TITLE = {{Erd{\H o}s-{P}{\'o}sa} Property of Obstructions to Interval Graphs}, AUTHOR = {Agrawal, Akanksha and Lokshtanov, Daniel and Misra, Pranabendu and Saurabh, Saket and Zehavi, Meirav}, LANGUAGE = {eng}, ISSN = {0364-9024}, DOI = {10.1002/jgt.22895}, PUBLISHER = {John Wiley \& Sons.}, ADDRESS = {New York}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, JOURNAL = {Journal of Graph Theory}, VOLUME = {Early View}, }
Endnote
%0 Journal Article %A Agrawal, Akanksha %A Lokshtanov, Daniel %A Misra, Pranabendu %A Saurabh, Saket %A Zehavi, Meirav %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Erdős–Pósa Property of Obstructions to Interval Graphs : %G eng %U http://hdl.handle.net/21.11116/0000-000B-589A-5 %R 10.1002/jgt.22895 %7 2022 %D 2022 %J Journal of Graph Theory %V Early View %I John Wiley & Sons. %C New York %@ false
[18]
H. Akrami, N. Alon, B. Ray Chaudhury, J. Garg, K. Mehlhorn, and R. Mehta, “EFX Allocations: Simplifications and Improvements,” 2022. [Online]. Available: https://arxiv.org/abs/2205.07638. (arXiv: 2205.07638)
Abstract
The existence of EFX allocations is a fundamental open problem in discrete<br>fair division. Given a set of agents and indivisible goods, the goal is to<br>determine the existence of an allocation where no agent envies another<br>following the removal of any single good from the other agent's bundle. Since<br>the general problem has been illusive, progress is made on two fronts: $(i)$<br>proving existence when the number of agents is small, $(ii)$ proving existence<br>of relaxations of EFX. In this paper, we improve results on both fronts (and<br>simplify in one of the cases).<br> We prove the existence of EFX allocations with three agents, restricting only<br>one agent to have an MMS-feasible valuation function (a strict generalization<br>of nice-cancelable valuation functions introduced by Berger et al. which<br>subsumes additive, budget-additive and unit demand valuation functions). The<br>other agents may have any monotone valuation functions. Our proof technique is<br>significantly simpler and shorter than the proof by Chaudhury et al. on<br>existence of EFX allocations when there are three agents with additive<br>valuation functions and therefore more accessible.<br> Secondly, we consider relaxations of EFX allocations, namely, approximate-EFX<br>allocations and EFX allocations with few unallocated goods (charity). Chaudhury<br>et al. showed the existence of $(1-\epsilon)$-EFX allocation with<br>$O((n/\epsilon)^{\frac{4}{5}})$ charity by establishing a connection to a<br>problem in extremal combinatorics. We improve their result and prove the<br>existence of $(1-\epsilon)$-EFX allocations with $\tilde{O}((n/<br>\epsilon)^{\frac{1}{2}})$ charity. In fact, some of our techniques can be used<br>to prove improved upper-bounds on a problem in zero-sum combinatorics<br>introduced by Alon and Krivelevich.<br>
Export
BibTeX
@online{Akrami2205.07638, TITLE = {{EFX} Allocations: Simplifications and Improvements}, AUTHOR = {Akrami, Hannaneh and Alon, Noga and Ray Chaudhury, Bhaskar and Garg, Jugal and Mehlhorn, Kurt and Mehta, Ruta}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2205.07638}, EPRINT = {2205.07638}, EPRINTTYPE = {arXiv}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, ABSTRACT = {The existence of EFX allocations is a fundamental open problem in discrete<br>fair division. Given a set of agents and indivisible goods, the goal is to<br>determine the existence of an allocation where no agent envies another<br>following the removal of any single good from the other agent's bundle. Since<br>the general problem has been illusive, progress is made on two fronts: $(i)$<br>proving existence when the number of agents is small, $(ii)$ proving existence<br>of relaxations of EFX. In this paper, we improve results on both fronts (and<br>simplify in one of the cases).<br> We prove the existence of EFX allocations with three agents, restricting only<br>one agent to have an MMS-feasible valuation function (a strict generalization<br>of nice-cancelable valuation functions introduced by Berger et al. which<br>subsumes additive, budget-additive and unit demand valuation functions). The<br>other agents may have any monotone valuation functions. Our proof technique is<br>significantly simpler and shorter than the proof by Chaudhury et al. on<br>existence of EFX allocations when there are three agents with additive<br>valuation functions and therefore more accessible.<br> Secondly, we consider relaxations of EFX allocations, namely, approximate-EFX<br>allocations and EFX allocations with few unallocated goods (charity). Chaudhury<br>et al. showed the existence of $(1-\epsilon)$-EFX allocation with<br>$O((n/\epsilon)^{\frac{4}{5}})$ charity by establishing a connection to a<br>problem in extremal combinatorics. We improve their result and prove the<br>existence of $(1-\epsilon)$-EFX allocations with $\tilde{O}((n/<br>\epsilon)^{\frac{1}{2}})$ charity. In fact, some of our techniques can be used<br>to prove improved upper-bounds on a problem in zero-sum combinatorics<br>introduced by Alon and Krivelevich.<br>}, }
Endnote
%0 Report %A Akrami, Hannaneh %A Alon, Noga %A Ray Chaudhury, Bhaskar %A Garg, Jugal %A Mehlhorn, Kurt %A Mehta, Ruta %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T EFX Allocations: Simplifications and Improvements : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1FEB-A %U https://arxiv.org/abs/2205.07638 %D 2022 %X The existence of EFX allocations is a fundamental open problem in discrete<br>fair division. Given a set of agents and indivisible goods, the goal is to<br>determine the existence of an allocation where no agent envies another<br>following the removal of any single good from the other agent's bundle. Since<br>the general problem has been illusive, progress is made on two fronts: $(i)$<br>proving existence when the number of agents is small, $(ii)$ proving existence<br>of relaxations of EFX. In this paper, we improve results on both fronts (and<br>simplify in one of the cases).<br> We prove the existence of EFX allocations with three agents, restricting only<br>one agent to have an MMS-feasible valuation function (a strict generalization<br>of nice-cancelable valuation functions introduced by Berger et al. which<br>subsumes additive, budget-additive and unit demand valuation functions). The<br>other agents may have any monotone valuation functions. Our proof technique is<br>significantly simpler and shorter than the proof by Chaudhury et al. on<br>existence of EFX allocations when there are three agents with additive<br>valuation functions and therefore more accessible.<br> Secondly, we consider relaxations of EFX allocations, namely, approximate-EFX<br>allocations and EFX allocations with few unallocated goods (charity). Chaudhury<br>et al. showed the existence of $(1-\epsilon)$-EFX allocation with<br>$O((n/\epsilon)^{\frac{4}{5}})$ charity by establishing a connection to a<br>problem in extremal combinatorics. We improve their result and prove the<br>existence of $(1-\epsilon)$-EFX allocations with $\tilde{O}((n/<br>\epsilon)^{\frac{1}{2}})$ charity. In fact, some of our techniques can be used<br>to prove improved upper-bounds on a problem in zero-sum combinatorics<br>introduced by Alon and Krivelevich.<br> %K Computer Science, Computer Science and Game Theory, cs.GT
[19]
H. Akrami, B. Ray Chaudhury, M. Hoefer, K. Mehlhorn, M. Schmalhofer, G. Shahkarami, G. Varricchio, Q. Vermande, and E. van Wijland, “Maximizing Nash Social Welfare in 2-Value Instances,” in Proceedings of the 36th AAAI Conference on Artificial Intelligence, Virtual Conference, 2022.
Export
BibTeX
@inproceedings{AkramiAAAI22, TITLE = {Maximizing {N}ash Social Welfare in 2-Value Instances}, AUTHOR = {Akrami, Hannaneh and Ray Chaudhury, Bhaskar and Hoefer, Martin and Mehlhorn, Kurt and Schmalhofer, Marco and Shahkarami, Golnoosh and Varricchio, Giovanna and Vermande, Quentin and van Wijland, Ernest}, LANGUAGE = {eng}, ISBN = {978-1-57735-876-3}, DOI = {10.1609/aaai.v36i5.20402}, PUBLISHER = {AAAI}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Proceedings of the 36th AAAI Conference on Artificial Intelligence}, PAGES = {4760--4767}, ADDRESS = {Virtual Conference}, }
Endnote
%0 Conference Proceedings %A Akrami, Hannaneh %A Ray Chaudhury, Bhaskar %A Hoefer, Martin %A Mehlhorn, Kurt %A Schmalhofer, Marco %A Shahkarami, Golnoosh %A Varricchio, Giovanna %A Vermande, Quentin %A van Wijland, Ernest %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Maximizing Nash Social Welfare in 2-Value Instances : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1FC6-3 %R 10.1609/aaai.v36i5.20402 %D 2022 %B 36th AAAI Conference on Artificial Intelligence %Z date of event: 2022-02-22 - 2022-03-01 %C Virtual Conference %B Proceedings of the 36th AAAI Conference on Artificial Intelligence %P 4760 - 4767 %I AAAI %@ 978-1-57735-876-3 %U https://ojs.aaai.org/index.php/AAAI/article/view/20402
[20]
H. Akrami, B. Ray Chaudhury, M. Hoefer, K. Mehlhorn, M. Schmalhofer, G. Shahkarami, G. Varricchio, Q. Vermande, and E. van Wijland, “Maximizing Nash Social Welfare in 2-Value Instances: The Half-Integer Case,” 2022. [Online]. Available: https://arxiv.org/abs/2207.10949. (arXiv: 2207.10949)
Abstract
We consider the problem of maximizing the Nash social welfare when allocating<br>a set $G$ of indivisible goods to a set $N$ of agents. We study instances, in<br>which all agents have 2-value additive valuations: The value of a good $g \in<br>G$ for an agent $i \in N$ is either $1$ or $s$, where $s$ is an odd multiple of<br>$\frac{1}{2}$ larger than one. We show that the problem is solvable in<br>polynomial time. Akrami et at. showed that this problem is solvable in<br>polynomial time if $s$ is integral and is NP-hard whenever $s = \frac{p}{q}$,<br>$p \in \mathbb{N}$ and $q\in \mathbb{N}$ are co-prime and $p > q \ge 3$. For<br>the latter situation, an approximation algorithm was also given. It obtains an<br>approximation ratio of at most $1.0345$. Moreover, the problem is APX-hard,<br>with a lower bound of $1.000015$ achieved at $\frac{p}{q} = \frac{5}{4}$. The<br>case $q = 2$ and odd $p$ was left open.<br> In the case of integral $s$, the problem is separable in the sense that the<br>optimal allocation of the heavy goods (= value $s$ for some agent) is<br>independent of the number of light goods (= value $1$ for all agents). This<br>leads to an algorithm that first computes an optimal allocation of the heavy<br>goods and then adds the light goods greedily. This separation no longer holds<br>for $s = \frac{3}{2}$; a simple example is given in the introduction. Thus an<br>algorithm has to consider heavy and light goods together. This complicates<br>matters considerably. Our algorithm is based on a collection of improvement<br>rules that transfers any allocation into an optimal allocation and exploits a<br>connection to matchings with parity constraints.<br>
Export
BibTeX
@online{Akrami2207.10949, TITLE = {Maximizing Nash Social Welfare in 2-Value Instances: The Half-Integer Case}, AUTHOR = {Akrami, Hannaneh and Ray Chaudhury, Bhaskar and Hoefer, Martin and Mehlhorn, Kurt and Schmalhofer, Marco and Shahkarami, Golnoosh and Varricchio, Giovanna and Vermande, Quentin and van Wijland, Ernest}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2207.10949}, EPRINT = {2207.10949}, EPRINTTYPE = {arXiv}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We consider the problem of maximizing the Nash social welfare when allocating<br>a set $G$ of indivisible goods to a set $N$ of agents. We study instances, in<br>which all agents have 2-value additive valuations: The value of a good $g \in<br>G$ for an agent $i \in N$ is either $1$ or $s$, where $s$ is an odd multiple of<br>$\frac{1}{2}$ larger than one. We show that the problem is solvable in<br>polynomial time. Akrami et at. showed that this problem is solvable in<br>polynomial time if $s$ is integral and is NP-hard whenever $s = \frac{p}{q}$,<br>$p \in \mathbb{N}$ and $q\in \mathbb{N}$ are co-prime and $p > q \ge 3$. For<br>the latter situation, an approximation algorithm was also given. It obtains an<br>approximation ratio of at most $1.0345$. Moreover, the problem is APX-hard,<br>with a lower bound of $1.000015$ achieved at $\frac{p}{q} = \frac{5}{4}$. The<br>case $q = 2$ and odd $p$ was left open.<br> In the case of integral $s$, the problem is separable in the sense that the<br>optimal allocation of the heavy goods (= value $s$ for some agent) is<br>independent of the number of light goods (= value $1$ for all agents). This<br>leads to an algorithm that first computes an optimal allocation of the heavy<br>goods and then adds the light goods greedily. This separation no longer holds<br>for $s = \frac{3}{2}$; a simple example is given in the introduction. Thus an<br>algorithm has to consider heavy and light goods together. This complicates<br>matters considerably. Our algorithm is based on a collection of improvement<br>rules that transfers any allocation into an optimal allocation and exploits a<br>connection to matchings with parity constraints.<br>}, }
Endnote
%0 Report %A Akrami, Hannaneh %A Ray Chaudhury, Bhaskar %A Hoefer, Martin %A Mehlhorn, Kurt %A Schmalhofer, Marco %A Shahkarami, Golnoosh %A Varricchio, Giovanna %A Vermande, Quentin %A van Wijland, Ernest %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Maximizing Nash Social Welfare in 2-Value Instances: The Half-Integer Case : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1FD5-2 %U https://arxiv.org/abs/2207.10949 %D 2022 %X We consider the problem of maximizing the Nash social welfare when allocating<br>a set $G$ of indivisible goods to a set $N$ of agents. We study instances, in<br>which all agents have 2-value additive valuations: The value of a good $g \in<br>G$ for an agent $i \in N$ is either $1$ or $s$, where $s$ is an odd multiple of<br>$\frac{1}{2}$ larger than one. We show that the problem is solvable in<br>polynomial time. Akrami et at. showed that this problem is solvable in<br>polynomial time if $s$ is integral and is NP-hard whenever $s = \frac{p}{q}$,<br>$p \in \mathbb{N}$ and $q\in \mathbb{N}$ are co-prime and $p > q \ge 3$. For<br>the latter situation, an approximation algorithm was also given. It obtains an<br>approximation ratio of at most $1.0345$. Moreover, the problem is APX-hard,<br>with a lower bound of $1.000015$ achieved at $\frac{p}{q} = \frac{5}{4}$. The<br>case $q = 2$ and odd $p$ was left open.<br> In the case of integral $s$, the problem is separable in the sense that the<br>optimal allocation of the heavy goods (= value $s$ for some agent) is<br>independent of the number of light goods (= value $1$ for all agents). This<br>leads to an algorithm that first computes an optimal allocation of the heavy<br>goods and then adds the light goods greedily. This separation no longer holds<br>for $s = \frac{3}{2}$; a simple example is given in the introduction. Thus an<br>algorithm has to consider heavy and light goods together. This complicates<br>matters considerably. Our algorithm is based on a collection of improvement<br>rules that transfers any allocation into an optimal allocation and exploits a<br>connection to matchings with parity constraints.<br> %K Computer Science, Computer Science and Game Theory, cs.GT
[21]
H. Akrami, R. Rezvan, and M. Seddighin, “An EF2X Allocation Protocol for Restricted Additive Valuations,” in Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (IJCAI 2022), Vienna, Austria, 2022.
Export
BibTeX
@inproceedings{AkramiIJCAI22, TITLE = {An {EF2X} Allocation Protocol for Restricted Additive Valuations}, AUTHOR = {Akrami, Hannaneh and Rezvan, Rojin and Seddighin, Masoud}, LANGUAGE = {eng}, ISBN = {978-1-956792-00-3}, DOI = {10.24963/ijcai.2022/3}, PUBLISHER = {IJCAI}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (IJCAI 2022)}, EDITOR = {de Raedt, Luc}, PAGES = {17--23}, ADDRESS = {Vienna, Austria}, }
Endnote
%0 Conference Proceedings %A Akrami, Hannaneh %A Rezvan, Rojin %A Seddighin, Masoud %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T An EF2X Allocation Protocol for Restricted Additive Valuations : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1FFA-9 %R 10.24963/ijcai.2022/3 %D 2022 %B Thirty-First International Joint Conference on Artificial Intelligence %Z date of event: 2022-07-23 - 2022-07-29 %C Vienna, Austria %B Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence %E de Raedt, Luc %P 17 - 23 %I IJCAI %@ 978-1-956792-00-3
[22]
H. Akrami, R. Rezvan, and M. Seddighin, “An EF2X Allocation Protocol for Restricted Additive Valuations,” 2022. [Online]. Available: https://arxiv.org/abs/2202.13676. (arXiv: 2202.13676)
Abstract
We study the problem of fairly allocating a set of $m$ indivisible goods to a<br>set of $n$ agents. Envy-freeness up to any good (EFX) criteria -- which<br>requires that no agent prefers the bundle of another agent after removal of any<br>single good -- is known to be a remarkable analogous of envy-freeness when the<br>resource is a set of indivisible goods. In this paper, we investigate EFX<br>notion for the restricted additive valuations, that is, every good has some<br>non-negative value, and every agent is interested in only some of the goods.<br> We introduce a natural relaxation of EFX called EFkX which requires that no<br>agent envies another agent after removal of any $k$ goods. Our main<br>contribution is an algorithm that finds a complete (i.e., no good is discarded)<br>EF2X allocation for the restricted additive valuations. In our algorithm we<br>devise new concepts, namely "configuration" and "envy-elimination" that might<br>be of independent interest.<br> We also use our new tools to find an EFX allocation for restricted additive<br>valuations that discards at most $\lfloor n/2 \rfloor -1$ goods. This improves<br>the state of the art for the restricted additive valuations by a factor of $2$.<br>
Export
BibTeX
@online{Akrami2202.13676, TITLE = {An {EF2X} Allocation Protocol for Restricted Additive Valuations}, AUTHOR = {Akrami, Hannaneh and Rezvan, Rojin and Seddighin, Masoud}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2202.13676}, EPRINT = {2202.13676}, EPRINTTYPE = {arXiv}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We study the problem of fairly allocating a set of $m$ indivisible goods to a<br>set of $n$ agents. Envy-freeness up to any good (EFX) criteria -- which<br>requires that no agent prefers the bundle of another agent after removal of any<br>single good -- is known to be a remarkable analogous of envy-freeness when the<br>resource is a set of indivisible goods. In this paper, we investigate EFX<br>notion for the restricted additive valuations, that is, every good has some<br>non-negative value, and every agent is interested in only some of the goods.<br> We introduce a natural relaxation of EFX called EFkX which requires that no<br>agent envies another agent after removal of any $k$ goods. Our main<br>contribution is an algorithm that finds a complete (i.e., no good is discarded)<br>EF2X allocation for the restricted additive valuations. In our algorithm we<br>devise new concepts, namely "configuration" and "envy-elimination" that might<br>be of independent interest.<br> We also use our new tools to find an EFX allocation for restricted additive<br>valuations that discards at most $\lfloor n/2 \rfloor -1$ goods. This improves<br>the state of the art for the restricted additive valuations by a factor of $2$.<br>}, }
Endnote
%0 Report %A Akrami, Hannaneh %A Rezvan, Rojin %A Seddighin, Masoud %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T An EF2X Allocation Protocol for Restricted Additive Valuations : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1FF3-0 %U https://arxiv.org/abs/2202.13676 %D 2022 %X We study the problem of fairly allocating a set of $m$ indivisible goods to a<br>set of $n$ agents. Envy-freeness up to any good (EFX) criteria -- which<br>requires that no agent prefers the bundle of another agent after removal of any<br>single good -- is known to be a remarkable analogous of envy-freeness when the<br>resource is a set of indivisible goods. In this paper, we investigate EFX<br>notion for the restricted additive valuations, that is, every good has some<br>non-negative value, and every agent is interested in only some of the goods.<br> We introduce a natural relaxation of EFX called EFkX which requires that no<br>agent envies another agent after removal of any $k$ goods. Our main<br>contribution is an algorithm that finds a complete (i.e., no good is discarded)<br>EF2X allocation for the restricted additive valuations. In our algorithm we<br>devise new concepts, namely "configuration" and "envy-elimination" that might<br>be of independent interest.<br> We also use our new tools to find an EFX allocation for restricted additive<br>valuations that discards at most $\lfloor n/2 \rfloor -1$ goods. This improves<br>the state of the art for the restricted additive valuations by a factor of $2$.<br> %K Computer Science, Computer Science and Game Theory, cs.GT
[23]
G. Amanatidis and P. Kleer, “Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices,” SIAM Journal on Discrete Mathematics, vol. 36, no. 1, 2022.
Export
BibTeX
@article{Amanatidis2022, TITLE = {Rapid Mixing of the Switch {M}arkov Chain for 2-Class Joint Degree Matrices}, AUTHOR = {Amanatidis, Georgios and Kleer, Pieter}, LANGUAGE = {eng}, ISSN = {0895-4801}, DOI = {10.1137/20M1352697}, PUBLISHER = {The Society}, ADDRESS = {Philadelphia, Pa.}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, DATE = {2022}, JOURNAL = {SIAM Journal on Discrete Mathematics}, VOLUME = {36}, NUMBER = {1}, PAGES = {118--146}, }
Endnote
%0 Journal Article %A Amanatidis, Georgios %A Kleer, Pieter %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices : %G eng %U http://hdl.handle.net/21.11116/0000-000A-567A-D %R 10.1137/20M1352697 %7 2022 %D 2022 %J SIAM Journal on Discrete Mathematics %V 36 %N 1 %& 118 %P 118 - 146 %I The Society %C Philadelphia, Pa. %@ false
[24]
S. A. Amiri and B. Wiederhake, “Distributed Distance-r Dominating Set on Sparse High-Girth Graphs,” Theoretical Computer Science, vol. 906, 2022.
Export
BibTeX
@article{Amiri22, TITLE = {Distributed Distance-$r$ Dominating Set on Sparse High-Girth Graphs}, AUTHOR = {Amiri, Saeed Akhoondian and Wiederhake, Ben}, LANGUAGE = {eng}, ISSN = {0304-3975}, DOI = {10.1016/j.tcs.2022.01.001}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, JOURNAL = {Theoretical Computer Science}, VOLUME = {906}, PAGES = {18--31}, }
Endnote
%0 Journal Article %A Amiri, Saeed Akhoondian %A Wiederhake, Ben %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Distributed Distance-r Dominating Set on Sparse High-Girth Graphs : %G eng %U http://hdl.handle.net/21.11116/0000-000A-9DFE-8 %R 10.1016/j.tcs.2022.01.001 %7 2022 %D 2022 %J Theoretical Computer Science %V 906 %& 18 %P 18 - 31 %I Elsevier %C Amsterdam %@ false
[25]
I. Anagnostides, C. Lenzen, B. Haeupler, G. Zuzic, and T. Gouleakis, “Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts,” in 36th International Symposium on Distributed Computing (DISC 2022), Augusta, GA, USA, 2022.
Export
BibTeX
@inproceedings{Anagnostides_DISC22, TITLE = {Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts}, AUTHOR = {Anagnostides, Ioannis and Lenzen, Christoph and Haeupler, Bernhard and Zuzic, Goran and Gouleakis, Themis}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-210-5}, URL = {urn:nbn:de:0030-drops-171978}, DOI = {10.4230/LIPIcs.DISC.2022.6}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {36th International Symposium on Distributed Computing (DISC 2022)}, EDITOR = {Scheideler, Christian}, PAGES = {1--20}, EID = {6}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {246}, ADDRESS = {Augusta, GA, USA}, }
Endnote
%0 Conference Proceedings %A Anagnostides, Ioannis %A Lenzen, Christoph %A Haeupler, Bernhard %A Zuzic, Goran %A Gouleakis, Themis %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts : %G eng %U http://hdl.handle.net/21.11116/0000-000C-7314-C %R 10.4230/LIPIcs.DISC.2022.6 %U urn:nbn:de:0030-drops-171978 %D 2022 %B 36th International Symposium on Distributed Computing %Z date of event: 2022-10-25 - 2022-10-27 %C Augusta, GA, USA %B 36th International Symposium on Distributed Computing %E Scheideler, Christian %P 1 - 20 %Z sequence number: 6 %I Schloss Dagstuhl %@ 978-3-95977-210-5 %B Leibniz International Proceedings in Informatics %N 246 %@ false %U https://drops.dagstuhl.de/opus/volltexte/2022/17197/https://creativecommons.org/licenses/by/4.0/legalcode
[26]
H. An, M. Gurumukhani, R. Impagliazzo, M. Jaber, M. Künnemann, and M. P. P. Nina, “The Fine-Grained Complexity of Multi-Dimensional Ordering Properties,” Algorithmica, vol. 84, 2022.
Export
BibTeX
@article{An22, TITLE = {The Fine-Grained Complexity of Multi-Dimensional Ordering Properties}, AUTHOR = {An, Haozhe and Gurumukhani, Mohit and Impagliazzo, Russell and Jaber, Michael and K{\"u}nnemann, Marvin and Nina, Maria Paula Parga}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-022-01014-x}, PUBLISHER = {Springer-Verlag}, ADDRESS = {New York}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, JOURNAL = {Algorithmica}, VOLUME = {84}, PAGES = {3156--3191}, }
Endnote
%0 Journal Article %A An, Haozhe %A Gurumukhani, Mohit %A Impagliazzo, Russell %A Jaber, Michael %A K&#252;nnemann, Marvin %A Nina, Maria Paula Parga %+ External Organizations External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T The Fine-Grained Complexity of Multi-Dimensional Ordering Properties : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1F9C-3 %R 10.1007/s00453-022-01014-x %7 2022 %D 2022 %J Algorithmica %V 84 %& 3156 %P 3156 - 3191 %I Springer-Verlag %C New York %@ false
[27]
A. Antoniadis, P. Jabbarzade, and G. Shahkarami, “A Novel Prediction Setup for Online Speed-Scaling,” in 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022), Tórshavn, Faroe Islands, 2022.
Export
BibTeX
@inproceedings{AntoniadisSWAT22, TITLE = {A Novel Prediction Setup for Online Speed-Scaling}, AUTHOR = {Antoniadis, Antonios and Jabbarzade, Peyman and Shahkarami, Golnoosh}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-236-5}, URL = {urn:nbn:de:0030-drops-161693; https://drops.dagstuhl.de/opus/volltexte/2022/16169/}, DOI = {10.4230/LIPIcs.SWAT.2022.9}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)}, EDITOR = {Czumai, Artur and Xin, Qin}, PAGES = {1--20}, EID = {9}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {227}, ADDRESS = {T{\'o}rshavn, Faroe Islands}, }
Endnote
%0 Conference Proceedings %A Antoniadis, Antonios %A Jabbarzade, Peyman %A Shahkarami, Golnoosh %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Novel Prediction Setup for Online Speed-Scaling : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1FBA-1 %R 10.4230/LIPIcs.SWAT.2022.9 %U urn:nbn:de:0030-drops-161693 %U https://drops.dagstuhl.de/opus/volltexte/2022/16169/ %D 2022 %B 18th Scandinavian Symposium and Workshops on Algorithm Theory %Z date of event: 2022-06-27 - 2022-06-29 %C T&#243;rshavn, Faroe Islands %B 18th Scandinavian Symposium and Workshops on Algorithm Theory %E Czumai, Artur; Xin, Qin %P 1 - 20 %Z sequence number: 9 %I Schloss Dagstuhl %@ 978-3-95977-236-5 %B Leibniz International Proceedings in Informatics %N 227 %@ false
[28]
A. Antoniadis, P. Jabbarzade Ganje, and G. Shahkarami, “A Novel Prediction Setup for Online Speed-Scaling,” 2022. [Online]. Available: https://arxiv.org/abs/2112.03082. (arXiv: 2112.03082)
Abstract
Given the rapid rise in energy demand by data centers and computing systems<br>in general, it is fundamental to incorporate energy considerations when<br>designing (scheduling) algorithms. Machine learning can be a useful approach in<br>practice by predicting the future load of the system based on, for example,<br>historical data. However, the effectiveness of such an approach highly depends<br>on the quality of the predictions and can be quite far from optimal when<br>predictions are sub-par. On the other hand, while providing a worst-case<br>guarantee, classical online algorithms can be pessimistic for large classes of<br>inputs arising in practice.<br> This paper, in the spirit of the new area of machine learning augmented<br>algorithms, attempts to obtain the best of both worlds for the classical,<br>deadline based, online speed-scaling problem: Based on the introduction of a<br>novel prediction setup, we develop algorithms that (i) obtain provably low<br>energy-consumption in the presence of adequate predictions, and (ii) are robust<br>against inadequate predictions, and (iii) are smooth, i.e., their performance<br>gradually degrades as the prediction error increases.<br>
Export
BibTeX
@online{Antoniadis2112.03082, TITLE = {A Novel Prediction Setup for Online Speed-Scaling}, AUTHOR = {Antoniadis, Antonios and Jabbarzade Ganje, Peyman and Shahkarami, Golnoosh}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2112.03082}, EPRINT = {2112.03082}, EPRINTTYPE = {arXiv}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Given the rapid rise in energy demand by data centers and computing systems<br>in general, it is fundamental to incorporate energy considerations when<br>designing (scheduling) algorithms. Machine learning can be a useful approach in<br>practice by predicting the future load of the system based on, for example,<br>historical data. However, the effectiveness of such an approach highly depends<br>on the quality of the predictions and can be quite far from optimal when<br>predictions are sub-par. On the other hand, while providing a worst-case<br>guarantee, classical online algorithms can be pessimistic for large classes of<br>inputs arising in practice.<br> This paper, in the spirit of the new area of machine learning augmented<br>algorithms, attempts to obtain the best of both worlds for the classical,<br>deadline based, online speed-scaling problem: Based on the introduction of a<br>novel prediction setup, we develop algorithms that (i) obtain provably low<br>energy-consumption in the presence of adequate predictions, and (ii) are robust<br>against inadequate predictions, and (iii) are smooth, i.e., their performance<br>gradually degrades as the prediction error increases.<br>}, }
Endnote
%0 Report %A Antoniadis, Antonios %A Jabbarzade Ganje, Peyman %A Shahkarami, Golnoosh %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Novel Prediction Setup for Online Speed-Scaling : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1FBE-D %U https://arxiv.org/abs/2112.03082 %D 2022 %X Given the rapid rise in energy demand by data centers and computing systems<br>in general, it is fundamental to incorporate energy considerations when<br>designing (scheduling) algorithms. Machine learning can be a useful approach in<br>practice by predicting the future load of the system based on, for example,<br>historical data. However, the effectiveness of such an approach highly depends<br>on the quality of the predictions and can be quite far from optimal when<br>predictions are sub-par. On the other hand, while providing a worst-case<br>guarantee, classical online algorithms can be pessimistic for large classes of<br>inputs arising in practice.<br> This paper, in the spirit of the new area of machine learning augmented<br>algorithms, attempts to obtain the best of both worlds for the classical,<br>deadline based, online speed-scaling problem: Based on the introduction of a<br>novel prediction setup, we develop algorithms that (i) obtain provably low<br>energy-consumption in the presence of adequate predictions, and (ii) are robust<br>against inadequate predictions, and (iii) are smooth, i.e., their performance<br>gradually degrades as the prediction error increases.<br> %K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Learning, cs.LG
[29]
S. Apers, Y. Efron, P. Gawrychowski, T. Lee, S. Mukhopadhyay, and D. Nanongkai, “Cut Query Algorithms with Star Contraction,” in FOCS 2022, IEEE 63rd Annual Symposium on Foundations of Computer Science, Denver, CO, USA, 2022.
Export
BibTeX
@inproceedings{Apers_FOCS22, TITLE = {Cut Query Algorithms with Star Contraction}, AUTHOR = {Apers, Simon and Efron, Yuval and Gawrychowski, Pawe{\l} and Lee, Troy and Mukhopadhyay, Sagnik and Nanongkai, Danupon}, LANGUAGE = {eng}, ISBN = {978-1-6654-5519-0}, DOI = {10.1109/FOCS54457.2022.00055}, PUBLISHER = {IEEE}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {FOCS 2022, IEEE 63rd Annual Symposium on Foundations of Computer Science}, PAGES = {507--518}, ADDRESS = {Denver, CO, USA}, }
Endnote
%0 Conference Proceedings %A Apers, Simon %A Efron, Yuval %A Gawrychowski, Pawe&#322; %A Lee, Troy %A Mukhopadhyay, Sagnik %A Nanongkai, Danupon %+ External Organizations External Organizations External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Cut Query Algorithms with Star Contraction : %G eng %U http://hdl.handle.net/21.11116/0000-000C-26C5-B %R 10.1109/FOCS54457.2022.00055 %D 2022 %B IEEE 63rd Annual Symposium on Foundations of Computer Science %Z date of event: 2022-10-31 - 2022-11-03 %C Denver, CO, USA %B FOCS 2022 %P 507 - 518 %I IEEE %@ 978-1-6654-5519-0
[30]
B. Banyassady, M. de Berg, K. Bringmann, K. Buchin, H. Fernau, D. Halperin, I. Kostitsyna, Y. Okamoto, and S. Slot, “Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds,” in 38th International Symposium on Computational Geometry (SoCG 2022), Berlin, Germany, 2022.
Export
BibTeX
@inproceedings{Banyassady_SoCG2022, TITLE = {Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds}, AUTHOR = {Banyassady, Bahareh and de Berg, Mark and Bringmann, Karl and Buchin, Kevin and Fernau, Henning and Halperin, Dan and Kostitsyna, Irina and Okamoto, Yoshio and Slot, Stijn}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-227-3}, URL = {urn:nbn:de:0030-drops-160203}, DOI = {10.4230/LIPIcs.SoCG.2022.12}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {38th International Symposium on Computational Geometry (SoCG 2022)}, EDITOR = {Goaoc, Xavier and Kerber, Michael}, PAGES = {1--16}, EID = {12}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {224}, ADDRESS = {Berlin, Germany}, }
Endnote
%0 Conference Proceedings %A Banyassady, Bahareh %A de Berg, Mark %A Bringmann, Karl %A Buchin, Kevin %A Fernau, Henning %A Halperin, Dan %A Kostitsyna, Irina %A Okamoto, Yoshio %A Slot, Stijn %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations External Organizations External Organizations %T Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds : %G eng %U http://hdl.handle.net/21.11116/0000-000B-1553-0 %R 10.4230/LIPIcs.SoCG.2022.12 %U urn:nbn:de:0030-drops-160203 %D 2022 %B 38th International Symposium on Computational Geometry %Z date of event: 2022-06-07 - 2022-06-10 %C Berlin, Germany %B 38th International Symposium on Computational Geometry %E Goaoc, Xavier; Kerber, Michael %P 1 - 16 %Z sequence number: 12 %I Schloss Dagstuhl %@ 978-3-95977-227-3 %B Leibniz International Proceedings in Informatics %N 224 %@ false
[31]
R. Beier, H. Röglin, C. Rösner, and B. Vöcking, “The Smoothed Number of Pareto-optimal Solutions in Bicriteria Integer Optimization,” Mathematical Programming / A, 2022.
Export
BibTeX
@article{Beier2022, TITLE = {The smoothed number of {P}areto-optimal solutions in bicriteria integer optimization}, AUTHOR = {Beier, Ren{\'e} and R{\"o}glin, Heiko and R{\"o}sner, Clemens and V{\"o}cking, Berthold}, LANGUAGE = {eng}, ISSN = {0025-5610}, DOI = {10.1007/s10107-022-01885-6}, PUBLISHER = {Springer}, ADDRESS = {Heidelberg}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, DATE = {2022}, JOURNAL = {Mathematical Programming / A}, }
Endnote
%0 Journal Article %A Beier, Ren&#233; %A R&#246;glin, Heiko %A R&#246;sner, Clemens %A V&#246;cking, Berthold %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T The Smoothed Number of Pareto-optimal Solutions in Bicriteria Integer Optimization : %G eng %U http://hdl.handle.net/21.11116/0000-000B-58A2-B %R 10.1007/s10107-022-01885-6 %7 2022 %D 2022 %J Mathematical Programming / A %I Springer %C Heidelberg %@ false
[32]
A. Bernstein, D. Nanongkai, and C. Wulff-Nilsen, “Negative-Weight Single-Source Shortest Paths in Near-linear Time,” in FOCS 2022, IEEE 63rd Annual Symposium on Foundations of Computer Science, Denver, CO, USA, 2022.
Export
BibTeX
@inproceedings{Bernstein_FOCS22, TITLE = {Negative-Weight Single-Source Shortest Paths in Near-linear Time}, AUTHOR = {Bernstein, Aaron and Nanongkai, Danupon and Wulff-Nilsen, Christian}, LANGUAGE = {eng}, ISBN = {978-1-6654-5519-0}, DOI = {10.1109/FOCS54457.2022.00063}, PUBLISHER = {IEEE}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {FOCS 2022, IEEE 63rd Annual Symposium on Foundations of Computer Science}, PAGES = {600--611}, ADDRESS = {Denver, CO, USA}, }
Endnote
%0 Conference Proceedings %A Bernstein, Aaron %A Nanongkai, Danupon %A Wulff-Nilsen, Christian %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Negative-Weight Single-Source Shortest Paths in Near-linear Time : %G eng %U http://hdl.handle.net/21.11116/0000-000C-26C9-7 %R 10.1109/FOCS54457.2022.00063 %D 2022 %B IEEE 63rd Annual Symposium on Foundations of Computer Science %Z date of event: 2022-10-31 - 2022-11-03 %C Denver, CO, USA %B FOCS 2022 %P 600 - 611 %I IEEE %@ 978-1-6654-5519-0
[33]
S. Bhattacharya, P. Kiss, and T. Saranurak, “Sublinear Algorithms for (1.5+Epsilon)-Approximate Matching,” 2022. [Online]. Available: https://arxiv.org/abs/2212.00189. (arXiv: 2212.00189)
Abstract
We study sublinear time algorithms for estimating the size of maximum<br>matching. After a long line of research, the problem was finally settled by<br>Behnezhad [FOCS'22], in the regime where one is willing to pay an approximation<br>factor of $2$. Very recently, Behnezhad et al.[SODA'23] improved the<br>approximation factor to $(2-\frac{1}{2^{O(1/\gamma)}})$ using $n^{1+\gamma}$<br>time. This improvement over the factor $2$ is, however, minuscule and they<br>asked if even $1.99$-approximation is possible in $n^{2-\Omega(1)}$ time. We<br>give a strong affirmative answer to this open problem by showing<br>$(1.5+\epsilon)$-approximation algorithms that run in<br>$n^{2-\Theta(\epsilon^{2})}$ time. Our approach is conceptually simple and<br>diverges from all previous sublinear-time matching algorithms: we show a<br>sublinear time algorithm for computing a variant of the edge-degree constrained<br>subgraph (EDCS), a concept that has previously been exploited in dynamic<br>[Bernstein Stein ICALP'15, SODA'16], distributed [Assadi et al. SODA'19] and<br>streaming [Bernstein ICALP'20] settings, but never before in the sublinear<br>setting. Independent work: Behnezhad, Roghani and Rubinstein [BRR'23]<br>independently showed sublinear algorithms similar to our Theorem 1.2 in both<br>adjacency list and matrix models. Furthermore, in [BRR'23], they show<br>additional results on strictly better-than-1.5 approximate matching algorithms<br>in both upper and lower bound sides.<br>
Export
BibTeX
@online{Bhattacharya2212.00189, TITLE = {Sublinear Algorithms for $(1.5+\epsilon)$-Approximate Matching}, AUTHOR = {Bhattacharya, Sayan and Kiss, Peter and Saranurak, Thatchaphol}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2212.00189}, EPRINT = {2212.00189}, EPRINTTYPE = {arXiv}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We study sublinear time algorithms for estimating the size of maximum<br>matching. After a long line of research, the problem was finally settled by<br>Behnezhad [FOCS'22], in the regime where one is willing to pay an approximation<br>factor of $2$. Very recently, Behnezhad et al.[SODA'23] improved the<br>approximation factor to $(2-\frac{1}{2^{O(1/\gamma)}})$ using $n^{1+\gamma}$<br>time. This improvement over the factor $2$ is, however, minuscule and they<br>asked if even $1.99$-approximation is possible in $n^{2-\Omega(1)}$ time. We<br>give a strong affirmative answer to this open problem by showing<br>$(1.5+\epsilon)$-approximation algorithms that run in<br>$n^{2-\Theta(\epsilon^{2})}$ time. Our approach is conceptually simple and<br>diverges from all previous sublinear-time matching algorithms: we show a<br>sublinear time algorithm for computing a variant of the edge-degree constrained<br>subgraph (EDCS), a concept that has previously been exploited in dynamic<br>[Bernstein Stein ICALP'15, SODA'16], distributed [Assadi et al. SODA'19] and<br>streaming [Bernstein ICALP'20] settings, but never before in the sublinear<br>setting. Independent work: Behnezhad, Roghani and Rubinstein [BRR'23]<br>independently showed sublinear algorithms similar to our Theorem 1.2 in both<br>adjacency list and matrix models. Furthermore, in [BRR'23], they show<br>additional results on strictly better-than-1.5 approximate matching algorithms<br>in both upper and lower bound sides.<br>}, }
Endnote
%0 Report %A Bhattacharya, Sayan %A Kiss, Peter %A Saranurak, Thatchaphol %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Sublinear Algorithms for (1.5+Epsilon)-Approximate Matching : %G eng %U http://hdl.handle.net/21.11116/0000-000C-2696-0 %U https://arxiv.org/abs/2212.00189 %D 2022 %X We study sublinear time algorithms for estimating the size of maximum<br>matching. After a long line of research, the problem was finally settled by<br>Behnezhad [FOCS'22], in the regime where one is willing to pay an approximation<br>factor of $2$. Very recently, Behnezhad et al.[SODA'23] improved the<br>approximation factor to $(2-\frac{1}{2^{O(1/\gamma)}})$ using $n^{1+\gamma}$<br>time. This improvement over the factor $2$ is, however, minuscule and they<br>asked if even $1.99$-approximation is possible in $n^{2-\Omega(1)}$ time. We<br>give a strong affirmative answer to this open problem by showing<br>$(1.5+\epsilon)$-approximation algorithms that run in<br>$n^{2-\Theta(\epsilon^{2})}$ time. Our approach is conceptually simple and<br>diverges from all previous sublinear-time matching algorithms: we show a<br>sublinear time algorithm for computing a variant of the edge-degree constrained<br>subgraph (EDCS), a concept that has previously been exploited in dynamic<br>[Bernstein Stein ICALP'15, SODA'16], distributed [Assadi et al. SODA'19] and<br>streaming [Bernstein ICALP'20] settings, but never before in the sublinear<br>setting. Independent work: Behnezhad, Roghani and Rubinstein [BRR'23]<br>independently showed sublinear algorithms similar to our Theorem 1.2 in both<br>adjacency list and matrix models. Furthermore, in [BRR'23], they show<br>additional results on strictly better-than-1.5 approximate matching algorithms<br>in both upper and lower bound sides.<br> %K Computer Science, Data Structures and Algorithms, cs.DS
[34]
J. Blikstad, J. V. D. Brand, Y. Efron, S. Mukhopadhyay, and D. Nanongkai, “Nearly Optimal Communication and Query Complexity of Bipartite Matching,” in FOCS 2022, IEEE 63rd Annual Symposium on Foundations of Computer Science, Denver, CO, USA, 2022.
Export
BibTeX
@inproceedings{Blikstad_FOCS22, TITLE = {Nearly Optimal Communication and Query Complexity of Bipartite Matching}, AUTHOR = {Blikstad, Joakim and Brand, Jan Van Den and Efron, Yuval and Mukhopadhyay, Sagnik and Nanongkai, Danupon}, LANGUAGE = {eng}, ISBN = {978-1-6654-5519-0}, DOI = {10.1109/FOCS54457.2022.00113}, PUBLISHER = {IEEE}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {FOCS 2022, IEEE 63rd Annual Symposium on Foundations of Computer Science}, PAGES = {1174--1185}, ADDRESS = {Denver, CO, USA}, }
Endnote
%0 Conference Proceedings %A Blikstad, Joakim %A Brand, Jan Van Den %A Efron, Yuval %A Mukhopadhyay, Sagnik %A Nanongkai, Danupon %+ External Organizations External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Nearly Optimal Communication and Query Complexity of Bipartite Matching : %G eng %U http://hdl.handle.net/21.11116/0000-000C-26CF-1 %R 10.1109/FOCS54457.2022.00113 %D 2022 %B IEEE 63rd Annual Symposium on Foundations of Computer Science %Z date of event: 2022-10-31 - 2022-11-03 %C Denver, CO, USA %B FOCS 2022 %P 1174 - 1185 %I IEEE %@ 978-1-6654-5519-0
[35]
V. Bonifaci, E. Facca, F. Folz, A. Karrenbauer, P. Kolev, K. Mehlhorn, G. Morigi, G. Shahkarami, and Q. Vermande, “Physarum-inspired Multi-commodity Flow Dynamics,” Theoretical Computer Science, vol. 920, 2022.
Export
BibTeX
@article{Bonifaci2022, TITLE = {Physarum-inspired Multi-commodity Flow Dynamics}, AUTHOR = {Bonifaci, Vincenzo and Facca, Enrico and Folz, Frederic and Karrenbauer, Andreas and Kolev, Pavel and Mehlhorn, Kurt and Morigi, Giovanna and Shahkarami, Golnoosh and Vermande, Quentin}, LANGUAGE = {eng}, ISSN = {0304-3975}, DOI = {10.1016/j.tcs.2022.02.001}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, DATE = {2022}, JOURNAL = {Theoretical Computer Science}, VOLUME = {920}, PAGES = {1--20}, }
Endnote
%0 Journal Article %A Bonifaci, Vincenzo %A Facca, Enrico %A Folz, Frederic %A Karrenbauer, Andreas %A Kolev, Pavel %A Mehlhorn, Kurt %A Morigi, Giovanna %A Shahkarami, Golnoosh %A Vermande, Quentin %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Physarum-inspired Multi-commodity Flow Dynamics : %G eng %U http://hdl.handle.net/21.11116/0000-000A-28A1-3 %R 10.1016/j.tcs.2022.02.001 %7 2022 %D 2022 %J Theoretical Computer Science %V 920 %& 1 %P 1 - 20 %I Elsevier %C Amsterdam %@ false
[36]
M. Briański, G. Joret, K. Majewski, P. Micek, M. T. Seweryn, and R. Sharma, “Treedepth Vs Circumference,” 2022. [Online]. Available: https://arxiv.org/abs/2211.11410. (arXiv: 2211.11410)
Abstract
The circumference of a graph $G$ is the length of a longest cycle in $G$, or<br>$+\infty$ if $G$ has no cycle. Birmel\'e (2003) showed that the treewidth of a<br>graph $G$ is at most its circumference minus one. We strengthen this result for<br>$2$-connected graphs as follows: If $G$ is $2$-connected, then its treedepth is<br>at most its circumference. The bound is best possible and improves on an<br>earlier quadratic upper bound due to Marshall and Wood (2015).<br>
Export
BibTeX
@online{Brianski2211.11410, TITLE = {Treedepth Vs Circumference}, AUTHOR = {Bria{\'n}ski, Marcin and Joret, Gwena{\"e}l and Majewski, Konrad and Micek, Piotr and Seweryn, Micha{\l} T. and Sharma, Roohani}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2211.11410}, EPRINT = {2211.11410}, EPRINTTYPE = {arXiv}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, ABSTRACT = {The circumference of a graph $G$ is the length of a longest cycle in $G$, or<br>$+\infty$ if $G$ has no cycle. Birmel\'e (2003) showed that the treewidth of a<br>graph $G$ is at most its circumference minus one. We strengthen this result for<br>$2$-connected graphs as follows: If $G$ is $2$-connected, then its treedepth is<br>at most its circumference. The bound is best possible and improves on an<br>earlier quadratic upper bound due to Marshall and Wood (2015).<br>}, }
Endnote
%0 Report %A Bria&#324;ski, Marcin %A Joret, Gwena&#235;l %A Majewski, Konrad %A Micek, Piotr %A Seweryn, Micha&#322; T. %A Sharma, Roohani %+ External Organizations External Organizations External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Treedepth Vs Circumference : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1E81-1 %U https://arxiv.org/abs/2211.11410 %D 2022 %X The circumference of a graph $G$ is the length of a longest cycle in $G$, or<br>$+\infty$ if $G$ has no cycle. Birmel\'e (2003) showed that the treewidth of a<br>graph $G$ is at most its circumference minus one. We strengthen this result for<br>$2$-connected graphs as follows: If $G$ is $2$-connected, then its treedepth is<br>at most its circumference. The bound is best possible and improves on an<br>earlier quadratic upper bound due to Marshall and Wood (2015).<br> %K Mathematics, Combinatorics, math.CO,Computer Science, Discrete Mathematics, cs.DM
[37]
K. Bringmann, A. Cassis, N. Fischer, and V. Nakos, “Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime,” in STOC ’22, 54th Annual ACM Symposium on Theory of Computing, Rome, Italy, 2022.
Export
BibTeX
@inproceedings{BringmannSTOC22, TITLE = {Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime}, AUTHOR = {Bringmann, Karl and Cassis, Alejandro and Fischer, Nick and Nakos, Vasileios}, LANGUAGE = {eng}, ISBN = {978-1-4503-9264-8}, DOI = {10.1145/3519935.3519990}, PUBLISHER = {ACM}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {STOC '22, 54th Annual ACM Symposium on Theory of Computing}, EDITOR = {Leonardi, Stefano and Gupta, Anupam}, PAGES = {1102--1115}, ADDRESS = {Rome, Italy}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Cassis, Alejandro %A Fischer, Nick %A Nakos, Vasileios %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime : %G eng %U http://hdl.handle.net/21.11116/0000-000B-588D-4 %R 10.1145/3519935.3519990 %D 2022 %B 54th Annual ACM Symposium on Theory of Computing %Z date of event: 2022-06-20 - 2022-06-24 %C Rome, Italy %B STOC '22 %E Leonardi, Stefano; Gupta, Anupam %P 1102 - 1115 %I ACM %@ 978-1-4503-9264-8
[38]
K. Bringmann, A. Driemel, A. Nusser, and I. Psarros, “Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fréchet Distance,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022), Virtual, 2022.
Export
BibTeX
@inproceedings{Bringmann_SODA22, TITLE = {Tight Bounds for Approximate Near Neighbor Searching for Time Series under the {F}r\'{e}chet Distance}, AUTHOR = {Bringmann, Karl and Driemel, Anne and Nusser, Andr{\'e} and Psarros, Ioannis}, LANGUAGE = {eng}, ISBN = {978-1-61197-707-3}, DOI = {10.1137/1.9781611977073.25}, PUBLISHER = {SIAM}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022)}, EDITOR = {Naor, Seffi and Buchbinder, Niv}, PAGES = {517--550}, ADDRESS = {Virtual}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Driemel, Anne %A Nusser, Andr&#233; %A Psarros, Ioannis %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fr&#233;chet Distance : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1D7D-9 %R 10.1137/1.9781611977073.25 %D 2022 %B Thirty-Third Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2022-01-09 - 2022-01-12 %C Virtual %B Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms %E Naor, Seffi; Buchbinder, Niv %P 517 - 550 %I SIAM %@ 978-1-61197-707-3
[39]
K. Bringmann, N. Fischer, and V. Nakos, “Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022), Virtual, 2022.
Export
BibTeX
@inproceedings{Bringmann_SODA22b, TITLE = {Deterministic and {Las Vegas} Algorithms for Sparse Nonnegative Convolution}, AUTHOR = {Bringmann, Karl and Fischer, Nick and Nakos, Vasileios}, LANGUAGE = {eng}, ISBN = {978-1-61197-707-3}, DOI = {10.1137/1.9781611977073.119}, PUBLISHER = {SIAM}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022)}, EDITOR = {Naor, Seffi and Buchbinder, Niv}, PAGES = {3069--3090}, ADDRESS = {Virtual}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Fischer, Nick %A Nakos, Vasileios %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1D81-2 %R 10.1137/1.9781611977073.119 %D 2022 %B Thirty-Third Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2022-01-09 - 2022-01-12 %C Virtual %B Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms %E Naor, Seffi; Buchbinder, Niv %P 3069 - 3090 %I SIAM %@ 978-1-61197-707-3
[40]
K. Bringmann, R. Keusch, J. Lengler, Y. Maus, and A. R. Molla, “Greedy Routing and the Algorithmic Small-World Phenomenon,” Journal of Computer and System Sciences, vol. 125, 2022.
Export
BibTeX
@article{Bringmann22, TITLE = {Greedy Routing and the Algorithmic Small-World Phenomenon}, AUTHOR = {Bringmann, Karl and Keusch, Ralph and Lengler, Johannes and Maus, Yannic and Molla, Anisur Rahaman}, LANGUAGE = {eng}, ISSN = {0022-0000}, DOI = {10.1016/j.jcss.2021.11.003}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, JOURNAL = {Journal of Computer and System Sciences}, VOLUME = {125}, PAGES = {59--105}, }
Endnote
%0 Journal Article %A Bringmann, Karl %A Keusch, Ralph %A Lengler, Johannes %A Maus, Yannic %A Molla, Anisur Rahaman %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations %T Greedy Routing and the Algorithmic Small-World Phenomenon : %G eng %U http://hdl.handle.net/21.11116/0000-000A-9DD0-A %R 10.1016/j.jcss.2021.11.003 %7 2022 %D 2022 %J Journal of Computer and System Sciences %V 125 %& 59 %P 59 - 105 %I Elsevier %C Amsterdam %@ false
[41]
K. Bringmann, N. Fischer, D. Hermelin, D. Shabtay, and P. Wellnitz, “Faster Minimization of Tardy Processing Time on a Single Machine,” Algorithmica, vol. 84, 2022.
Export
BibTeX
@article{Bringmann2022, TITLE = {Faster Minimization of Tardy Processing Time on a Single Machine}, AUTHOR = {Bringmann, Karl and Fischer, Nick and Hermelin, Danny and Shabtay, Dvir and Wellnitz, Philip}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-022-00928-w}, PUBLISHER = {Springer}, ADDRESS = {New York}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, DATE = {2022}, JOURNAL = {Algorithmica}, VOLUME = {84}, PAGES = {1341--1356}, }
Endnote
%0 Journal Article %A Bringmann, Karl %A Fischer, Nick %A Hermelin, Danny %A Shabtay, Dvir %A Wellnitz, Philip %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Faster Minimization of Tardy Processing Time on a Single Machine : %G eng %U http://hdl.handle.net/21.11116/0000-0009-FAD4-E %R 10.1007/s00453-022-00928-w %7 2022 %D 2022 %J Algorithmica %V 84 %& 1341 %P 1341 - 1356 %I Springer %C New York %@ false %U https://rdcu.be/cG2A9
[42]
K. Bringmann, S. Kisfaludi-Bak, M. Künnemann, D. Marx, and A. Nusser, “Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves,” in 38th International Symposium on Computational Geometry (SoCG 2022), Berlin, Germany, 2022.
Export
BibTeX
@inproceedings{Bringmann_SoCG2022, TITLE = {Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves}, AUTHOR = {Bringmann, Karl and Kisfaludi-Bak, S{\'a}ndor and K{\"u}nnemann, Marvin and Marx, D{\'a}niel and Nusser, Andr{\'e}}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-227-3}, URL = {urn:nbn:de:0030-drops-160287}, DOI = {10.4230/LIPIcs.SoCG.2022.20}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {38th International Symposium on Computational Geometry (SoCG 2022)}, EDITOR = {Goaoc, Xavier and Kerber, Michael}, PAGES = {1--17}, EID = {20}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {224}, ADDRESS = {Berlin, Germany}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Kisfaludi-Bak, S&#225;ndor %A K&#252;nnemann, Marvin %A Marx, D&#225;niel %A Nusser, Andr&#233; %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations %T Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves : %G eng %U http://hdl.handle.net/21.11116/0000-000B-1560-1 %R 10.4230/LIPIcs.SoCG.2022.20 %U urn:nbn:de:0030-drops-160287 %D 2022 %B 38th International Symposium on Computational Geometry %Z date of event: 2022-06-07 - 2022-06-10 %C Berlin, Germany %B 38th International Symposium on Computational Geometry %E Goaoc, Xavier; Kerber, Michael %P 1 - 17 %Z sequence number: 20 %I Schloss Dagstuhl %@ 978-3-95977-227-3 %B Leibniz International Proceedings in Informatics %N 224 %@ false
[43]
K. Bringmann, S. Kisfaludi-Bak, M. Künnemann, A. Nusser, and Z. Parsaeian, “Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs,” in 38th International Symposium on Computational Geometry (SoCG 2022), Berlin, Germany, 2022.
Export
BibTeX
@inproceedings{Bringmann_SoCG2022b, TITLE = {Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs}, AUTHOR = {Bringmann, Karl and Kisfaludi-Bak, S{\'a}ndor and K{\"u}nnemann, Marvin and Nusser, Andr{\'e} and Parsaeian, Zahra}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-227-3}, URL = {urn:nbn:de:0030-drops-160294}, DOI = {10.4230/LIPIcs.SoCG.2022.21}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {38th International Symposium on Computational Geometry (SoCG 2022)}, EDITOR = {Goaoc, Xavier and Kerber, Michael}, PAGES = {1--16}, EID = {21}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {224}, ADDRESS = {Berlin, Germany}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Kisfaludi-Bak, S&#225;ndor %A K&#252;nnemann, Marvin %A Nusser, Andr&#233; %A Parsaeian, Zahra %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs : %G eng %U http://hdl.handle.net/21.11116/0000-000B-1572-D %R 10.4230/LIPIcs.SoCG.2022.21 %U urn:nbn:de:0030-drops-160294 %D 2022 %B 38th International Symposium on Computational Geometry %Z date of event: 2022-06-07 - 2022-06-10 %C Berlin, Germany %B 38th International Symposium on Computational Geometry %E Goaoc, Xavier; Kerber, Michael %P 1 - 16 %Z sequence number: 21 %I Schloss Dagstuhl %@ 978-3-95977-227-3 %B Leibniz International Proceedings in Informatics %N 224 %@ false
[44]
K. Bringmann, A. Cassis, N. Fischer, and M. Künnemann, “A Structural Investigation of the Approximability of Polynomial-Time Problems,” in 49th EATCS International Conference on Automata, Languages, and Programming (ICALP 2022), Paris, France, 2022.
Export
BibTeX
@inproceedings{Bringmann_ICALP22, TITLE = {A Structural Investigation of the Approximability of Polynomial-Time Problems}, AUTHOR = {Bringmann, Karl and Cassis, Alejandro and Fischer, Nick and K{\"u}nnemann, Marvin}, LANGUAGE = {eng}, ISBN = {978-3-95977-235-8{\textbraceright}}, URL = {urn:nbn:de:0030-drops-163713}, DOI = {10.4230/LIPIcs.ICALP.2022.30}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {49th EATCS International Conference on Automata, Languages, and Programming (ICALP 2022)}, EDITOR = {Boja{\'n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.}, PAGES = {1--20}, EID = {30}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {229}, ADDRESS = {Paris, France}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Cassis, Alejandro %A Fischer, Nick %A K&#252;nnemann, Marvin %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T A Structural Investigation of the Approximability of Polynomial-Time Problems : %G eng %U http://hdl.handle.net/21.11116/0000-000B-15B5-1 %R 10.4230/LIPIcs.ICALP.2022.30 %U urn:nbn:de:0030-drops-163713 %D 2022 %B 49th International Colloquium on Automata, Languages, and Programming %Z date of event: 2022-07-04 - 2022-07-08 %C Paris, France %B 49th EATCS International Conference on Automata, Languages, and Programming %E Boja&#324;czyk, Miko&#322;aj; Merelli, Emanuela; Woodruff, David P. %P 1 - 20 %Z sequence number: 30 %I Schloss Dagstuhl %@ 978-3-95977-235-8} %B Leibniz International Proceedings in Informatics %N 229
[45]
K. Bringmann, A. Cassis, N. Fischer, and V. Nakos, “Improved Sublinear-Time Edit Distance for Preprocessed Strings,” in 49th EATCS International Conference on Automata, Languages, and Programming (ICALP 2022), Paris, France, 2022.
Export
BibTeX
@inproceedings{Bringmann_ICALP22c, TITLE = {Improved Sublinear-Time Edit Distance for Preprocessed Strings}, AUTHOR = {Bringmann, Karl and Cassis, Alejandro and Fischer, Nick and Nakos, Vasileios}, LANGUAGE = {eng}, ISBN = {978-3-95977-235-8{\textbraceright}}, URL = {urn:nbn:de:0030-drops-163734}, DOI = {10.4230/LIPIcs.ICALP.2022.32}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {49th EATCS International Conference on Automata, Languages, and Programming (ICALP 2022)}, EDITOR = {Boja{\'n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.}, PAGES = {1--20}, EID = {32}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {229}, ADDRESS = {Paris, France}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Cassis, Alejandro %A Fischer, Nick %A Nakos, Vasileios %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Improved Sublinear-Time Edit Distance for Preprocessed Strings : %G eng %U http://hdl.handle.net/21.11116/0000-000B-163A-C %R 10.4230/LIPIcs.ICALP.2022.32 %U urn:nbn:de:0030-drops-163734 %D 2022 %B 49th International Colloquium on Automata, Languages, and Programming %Z date of event: 2022-07-04 - 2022-07-08 %C Paris, France %B 49th EATCS International Conference on Automata, Languages, and Programming %E Boja&#324;czyk, Miko&#322;aj; Merelli, Emanuela; Woodruff, David P. %P 1 - 20 %Z sequence number: 32 %I Schloss Dagstuhl %@ 978-3-95977-235-8} %B Leibniz International Proceedings in Informatics %N 229
[46]
K. Bringmann and A. Cassis, “Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution,” in 49th EATCS International Conference on Automata, Languages, and Programming (ICALP 2022), Paris, France, 2022.
Export
BibTeX
@inproceedings{Bringmann_ICALP22b, TITLE = {Faster {K}napsack Algorithms via Bounded Monotone {Min-Plus-Convolution}}, AUTHOR = {Bringmann, Karl and Cassis, Alejandro}, LANGUAGE = {eng}, ISBN = {978-3-95977-235-8{\textbraceright}}, URL = {urn:nbn:de:0030-drops-163727}, DOI = {10.4230/LIPIcs.ICALP.2022.31}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {49th EATCS International Conference on Automata, Languages, and Programming (ICALP 2022)}, EDITOR = {Boja{\'n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.}, PAGES = {1--21}, EID = {31}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {229}, ADDRESS = {Paris, France}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Cassis, Alejandro %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution : %G eng %U http://hdl.handle.net/21.11116/0000-000B-1622-6 %R 10.4230/LIPIcs.ICALP.2022.31 %U urn:nbn:de:0030-drops-163727 %D 2022 %B 49th International Colloquium on Automata, Languages, and Programming %Z date of event: 2022-07-04 - 2022-07-08 %C Paris, France %B 49th EATCS International Conference on Automata, Languages, and Programming %E Boja&#324;czyk, Miko&#322;aj; Merelli, Emanuela; Woodruff, David P. %P 1 - 21 %Z sequence number: 31 %I Schloss Dagstuhl %@ 978-3-95977-235-8} %B Leibniz International Proceedings in Informatics %N 229
[47]
K. Bringmann, N. Carmeli, and S. Mengel, “Tight Fine-Grained Bounds for Direct Access on Join Queries,” in PODS ’22, 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, Philadelphia, PA, USA, 2022.
Export
BibTeX
@inproceedings{Bringmann_PODS22, TITLE = {Tight Fine-Grained Bounds for Direct Access on Join Queries}, AUTHOR = {Bringmann, Karl and Carmeli, Nofar and Mengel, Stefan}, LANGUAGE = {eng}, ISBN = {978-1-4503-9260-0}, DOI = {10.1145/3517804.3526234}, PUBLISHER = {ACM}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {PODS '22, 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems}, EDITOR = {Libkin, Leonid and Barcel{\'o}, Pablo and Grez, Alejandro}, PAGES = {427--436}, ADDRESS = {Philadelphia, PA, USA}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Carmeli, Nofar %A Mengel, Stefan %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Tight Fine-Grained Bounds for Direct Access on Join Queries : %G eng %U http://hdl.handle.net/21.11116/0000-000B-2037-3 %R 10.1145/3517804.3526234 %D 2022 %B 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems %Z date of event: 2022-06-12 - 2022-06-17 %C Philadelphia, PA, USA %B PODS '22 %E Libkin, Leonid; Barcel&#243;, Pablo; Grez, Alejandro %P 427 - 436 %I ACM %@ 978-1-4503-9260-0
[48]
K. Buchin, A. Nusser, and S. Wong, “Computing Continuous Dynamic Time Warping of Time Series in Polynomial Time,” in 38th International Symposium on Computational Geometry (SoCG 2022), Berlin, Germany, 2022.
Export
BibTeX
@inproceedings{Buchin_SoCG2022a, TITLE = {Computing Continuous Dynamic Time Warping of Time Series in Polynomial Time}, AUTHOR = {Buchin, Kevin and Nusser, Andr{\'e} and Wong, Sampson}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-227-3}, URL = {urn:nbn:de:0030-drops-160307}, DOI = {10.4230/LIPIcs.SoCG.2022.22}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {38th International Symposium on Computational Geometry (SoCG 2022)}, EDITOR = {Goaoc, Xavier and Kerber, Michael}, PAGES = {1--16}, EID = {22}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {224}, ADDRESS = {Berlin, Germany}, }
Endnote
%0 Conference Proceedings %A Buchin, Kevin %A Nusser, Andr&#233; %A Wong, Sampson %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Computing Continuous Dynamic Time Warping of Time Series in Polynomial Time : %G eng %U http://hdl.handle.net/21.11116/0000-000C-268B-D %R 10.4230/LIPIcs.SoCG.2022.22 %U urn:nbn:de:0030-drops-160307 %D 2022 %B 38th International Symposium on Computational Geometry %Z date of event: 2022-06-07 - 2022-06-10 %C Berlin, Germany %B 38th International Symposium on Computational Geometry %E Goaoc, Xavier; Kerber, Michael %P 1 - 16 %Z sequence number: 22 %I Schloss Dagstuhl %@ 978-3-95977-227-3 %B Leibniz International Proceedings in Informatics %N 224 %@ false
[49]
M. Caoduro, J. Cslovjecsek, M. Pilipczuk, and K. Węgrzycki, “Independence Number of Intersection Graphs of Axis-Parallel Segments,” 2022. [Online]. Available: https://arxiv.org/abs/2205.15189. (arXiv: 2205.15189)
Abstract
We prove that for any triangle-free intersection graph of $n$ axis-parallel<br>segments in the plane, the independence number $\alpha$ of this graph is at<br>least $\alpha \ge n/4 + \Omega(\sqrt{n})$. We complement this with a<br>construction of a graph in this class satisfying $\alpha \le n/4 + c \sqrt{n}$<br>for an absolute constant $c$, which demonstrates the optimality of our result.<br>
Export
BibTeX
@online{Caoduro2205.15189, TITLE = {Independence Number of Intersection Graphs of Axis-Parallel Segments}, AUTHOR = {Caoduro, Marco and Cslovjecsek, Jana and Pilipczuk, Micha{\l} and W{\c e}grzycki, Karol}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2205.15189}, EPRINT = {2205.15189}, EPRINTTYPE = {arXiv}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We prove that for any triangle-free intersection graph of $n$ axis-parallel<br>segments in the plane, the independence number $\alpha$ of this graph is at<br>least $\alpha \ge n/4 + \Omega(\sqrt{n})$. We complement this with a<br>construction of a graph in this class satisfying $\alpha \le n/4 + c \sqrt{n}$<br>for an absolute constant $c$, which demonstrates the optimality of our result.<br>}, }
Endnote
%0 Report %A Caoduro, Marco %A Cslovjecsek, Jana %A Pilipczuk, Micha&#322; %A W&#281;grzycki, Karol %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Independence Number of Intersection Graphs of Axis-Parallel Segments : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1F1D-3 %U https://arxiv.org/abs/2205.15189 %D 2022 %X We prove that for any triangle-free intersection graph of $n$ axis-parallel<br>segments in the plane, the independence number $\alpha$ of this graph is at<br>least $\alpha \ge n/4 + \Omega(\sqrt{n})$. We complement this with a<br>construction of a graph in this class satisfying $\alpha \le n/4 + c \sqrt{n}$<br>for an absolute constant $c$, which demonstrates the optimality of our result.<br> %K Mathematics, Combinatorics, math.CO,Computer Science, Computational Geometry, cs.CG,Computer Science, Discrete Mathematics, cs.DM,
[50]
P. Charalampopoulos, T. Kociumaka, and P. Wellnitz, “Faster Pattern Matching under Edit Distance,” 2022. [Online]. Available: https://arxiv.org/abs/2204.03087. (arXiv: 2204.03087)
Abstract
We consider the approximate pattern matching problem under the edit distance.<br>Given a text $T$ of length $n$, a pattern $P$ of length $m$, and a threshold<br>$k$, the task is to find the starting positions of all substrings of $T$ that<br>can be transformed to $P$ with at most $k$ edits. More than 20 years ago, Cole<br>and Hariharan [SODA'98, J. Comput.'02] gave an $\mathcal{O}(n+k^4 \cdot n/<br>m)$-time algorithm for this classic problem, and this runtime has not been<br>improved since.<br> Here, we present an algorithm that runs in time $\mathcal{O}(n+k^{3.5}<br>\sqrt{\log m \log k} \cdot n/m)$, thus breaking through this long-standing<br>barrier. In the case where $n^{1/4+\varepsilon} \leq k \leq<br>n^{2/5-\varepsilon}$ for some arbitrarily small positive constant<br>$\varepsilon$, our algorithm improves over the state-of-the-art by polynomial<br>factors: it is polynomially faster than both the algorithm of Cole and<br>Hariharan and the classic $\mathcal{O}(kn)$-time algorithm of Landau and<br>Vishkin [STOC'86, J. Algorithms'89].<br> We observe that the bottleneck case of the alternative $\mathcal{O}(n+k^4<br>\cdot n/m)$-time algorithm of Charalampopoulos, Kociumaka, and Wellnitz<br>[FOCS'20] is when the text and the pattern are (almost) periodic. Our new<br>algorithm reduces this case to a new dynamic problem (Dynamic Puzzle Matching),<br>which we solve by building on tools developed by Tiskin [SODA'10,<br>Algorithmica'15] for the so-called seaweed monoid of permutation matrices. Our<br>algorithm relies only on a small set of primitive operations on strings and<br>thus also applies to the fully-compressed setting (where text and pattern are<br>given as straight-line programs) and to the dynamic setting (where we maintain<br>a collection of strings under creation, splitting, and concatenation),<br>improving over the state of the art.<br>
Export
BibTeX
@online{Charalampopoulos2204.03087, TITLE = {Faster Pattern Matching under Edit Distance}, AUTHOR = {Charalampopoulos, Panagiotis and Kociumaka, Tomasz and Wellnitz, Philip}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2204.03087}, EPRINT = {2204.03087}, EPRINTTYPE = {arXiv}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We consider the approximate pattern matching problem under the edit distance.<br>Given a text $T$ of length $n$, a pattern $P$ of length $m$, and a threshold<br>$k$, the task is to find the starting positions of all substrings of $T$ that<br>can be transformed to $P$ with at most $k$ edits. More than 20 years ago, Cole<br>and Hariharan [SODA'98, J. Comput.'02] gave an $\mathcal{O}(n+k^4 \cdot n/<br>m)$-time algorithm for this classic problem, and this runtime has not been<br>improved since.<br> Here, we present an algorithm that runs in time $\mathcal{O}(n+k^{3.5}<br>\sqrt{\log m \log k} \cdot n/m)$, thus breaking through this long-standing<br>barrier. In the case where $n^{1/4+\varepsilon} \leq k \leq<br>n^{2/5-\varepsilon}$ for some arbitrarily small positive constant<br>$\varepsilon$, our algorithm improves over the state-of-the-art by polynomial<br>factors: it is polynomially faster than both the algorithm of Cole and<br>Hariharan and the classic $\mathcal{O}(kn)$-time algorithm of Landau and<br>Vishkin [STOC'86, J. Algorithms'89].<br> We observe that the bottleneck case of the alternative $\mathcal{O}(n+k^4<br>\cdot n/m)$-time algorithm of Charalampopoulos, Kociumaka, and Wellnitz<br>[FOCS'20] is when the text and the pattern are (almost) periodic. Our new<br>algorithm reduces this case to a new dynamic problem (Dynamic Puzzle Matching),<br>which we solve by building on tools developed by Tiskin [SODA'10,<br>Algorithmica'15] for the so-called seaweed monoid of permutation matrices. Our<br>algorithm relies only on a small set of primitive operations on strings and<br>thus also applies to the fully-compressed setting (where text and pattern are<br>given as straight-line programs) and to the dynamic setting (where we maintain<br>a collection of strings under creation, splitting, and concatenation),<br>improving over the state of the art.<br>}, }
Endnote
%0 Report %A Charalampopoulos, Panagiotis %A Kociumaka, Tomasz %A Wellnitz, Philip %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Faster Pattern Matching under Edit Distance : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1EC9-1 %U https://arxiv.org/abs/2204.03087 %D 2022 %X We consider the approximate pattern matching problem under the edit distance.<br>Given a text $T$ of length $n$, a pattern $P$ of length $m$, and a threshold<br>$k$, the task is to find the starting positions of all substrings of $T$ that<br>can be transformed to $P$ with at most $k$ edits. More than 20 years ago, Cole<br>and Hariharan [SODA'98, J. Comput.'02] gave an $\mathcal{O}(n+k^4 \cdot n/<br>m)$-time algorithm for this classic problem, and this runtime has not been<br>improved since.<br> Here, we present an algorithm that runs in time $\mathcal{O}(n+k^{3.5}<br>\sqrt{\log m \log k} \cdot n/m)$, thus breaking through this long-standing<br>barrier. In the case where $n^{1/4+\varepsilon} \leq k \leq<br>n^{2/5-\varepsilon}$ for some arbitrarily small positive constant<br>$\varepsilon$, our algorithm improves over the state-of-the-art by polynomial<br>factors: it is polynomially faster than both the algorithm of Cole and<br>Hariharan and the classic $\mathcal{O}(kn)$-time algorithm of Landau and<br>Vishkin [STOC'86, J. Algorithms'89].<br> We observe that the bottleneck case of the alternative $\mathcal{O}(n+k^4<br>\cdot n/m)$-time algorithm of Charalampopoulos, Kociumaka, and Wellnitz<br>[FOCS'20] is when the text and the pattern are (almost) periodic. Our new<br>algorithm reduces this case to a new dynamic problem (Dynamic Puzzle Matching),<br>which we solve by building on tools developed by Tiskin [SODA'10,<br>Algorithmica'15] for the so-called seaweed monoid of permutation matrices. Our<br>algorithm relies only on a small set of primitive operations on strings and<br>thus also applies to the fully-compressed setting (where text and pattern are<br>given as straight-line programs) and to the dynamic setting (where we maintain<br>a collection of strings under creation, splitting, and concatenation),<br>improving over the state of the art.<br> %K Computer Science, Data Structures and Algorithms, cs.DS
[51]
P. Charalampopoulos, T. Kociumaka, and P. Wellnitz, “Faster Pattern Matching under Edit Distance,” in FOCS 2022, IEEE 63rd Annual Symposium on Foundations of Computer Science, Denver, CO, USA, 2022.
Export
BibTeX
@inproceedings{Charalampopoulos_FOCS22, TITLE = {Faster Pattern Matching under Edit Distance}, AUTHOR = {Charalampopoulos, Panagiotis and Kociumaka, Tomasz and Wellnitz, Philip}, LANGUAGE = {eng}, ISBN = {978-1-6654-5519-0}, DOI = {10.1109/FOCS54457.2022.00072}, PUBLISHER = {IEEE}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {FOCS 2022, IEEE 63rd Annual Symposium on Foundations of Computer Science}, PAGES = {698--707}, ADDRESS = {Denver, CO, USA}, }
Endnote
%0 Conference Proceedings %A Charalampopoulos, Panagiotis %A Kociumaka, Tomasz %A Wellnitz, Philip %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Faster Pattern Matching under Edit Distance : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1571-D %R 10.1109/FOCS54457.2022.00072 %D 2022 %B IEEE 63rd Annual Symposium on Foundations of Computer Science %Z date of event: 2022-10-31 - 2022-11-03 %C Denver, CO, USA %B FOCS 2022 %P 698 - 707 %I IEEE %@ 978-1-6654-5519-0
[52]
P. Charalampopoulos, T. Kociumaka, J. Radoszewski, S. P. Pissis, W. Rytter, T. Waleń, and W. Zuba, “Approximate Circular Pattern Matching,” in 30th Annual European Symposium on Algorithms (ESA 2022), Berlin/Potsdam, Germany, 2022.
Export
BibTeX
@inproceedings{CharalampopoulosESA22, TITLE = {Approximate Circular Pattern Matching}, AUTHOR = {Charalampopoulos, Panagiotis and Kociumaka, Tomasz and Radoszewski, Jakub and Pissis, Solon P. and Rytter, Wojciech and Wale{\'n}, Tomasz and Zuba, Wiktor}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-247-1}, URL = {urn:nbn:de:0030-drops-169738; https://drops.dagstuhl.de/opus/volltexte/2022/16973/}, DOI = {10.4230/LIPIcs.ESA.2022.35}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {30th Annual European Symposium on Algorithms (ESA 2022)}, EDITOR = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, PAGES = {1--19}, EID = {35}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {244}, ADDRESS = {Berlin/Potsdam, Germany}, }
Endnote
%0 Conference Proceedings %A Charalampopoulos, Panagiotis %A Kociumaka, Tomasz %A Radoszewski, Jakub %A Pissis, Solon P. %A Rytter, Wojciech %A Wale&#324;, Tomasz %A Zuba, Wiktor %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations External Organizations %T Approximate Circular Pattern Matching : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1531-5 %R 10.4230/LIPIcs.ESA.2022.35 %U urn:nbn:de:0030-drops-169738 %U https://drops.dagstuhl.de/opus/volltexte/2022/16973/ %D 2022 %B 30th Annual European Symposium on Algorithms %Z date of event: 2022-09-05 - 2022-09-09 %C Berlin/Potsdam, Germany %B 30th Annual European Symposium on Algorithms %E Chechik, Shiri; Navarro, Gonzalo; Rotenberg, Eva; Herman, Grzegorz %P 1 - 19 %Z sequence number: 35 %I Schloss Dagstuhl %@ 978-3-95977-247-1 %B Leibniz International Proceedings in Informatics %N 244 %@ false
[53]
D. Coudert, A. Nusser, and L. Viennot, “Computing Graph Hyperbolicity Using Dominating Sets,” in Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX 2022), Alexandria, VA, USA, 2022.
Export
BibTeX
@inproceedings{Coudert_ALENEX22, TITLE = {Computing Graph Hyperbolicity Using Dominating Sets}, AUTHOR = {Coudert, David and Nusser, Andr{\'e} and Viennot, Laurent}, LANGUAGE = {eng}, ISBN = {978-1-61197-704-2}, DOI = {10.1137/1.9781611977042.7}, PUBLISHER = {SIAM}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX 2022)}, EDITOR = {Phillips, Cynthia A. and Speckman, Bettina}, PAGES = {78--90}, ADDRESS = {Alexandria, VA, USA}, }
Endnote
%0 Conference Proceedings %A Coudert, David %A Nusser, Andr&#233; %A Viennot, Laurent %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Computing Graph Hyperbolicity Using Dominating Sets : %G eng %U http://hdl.handle.net/21.11116/0000-000C-268E-A %R 10.1137/1.9781611977042.7 %D 2022 %B Symposium on Algorithm Engineering and Experiments %Z date of event: 2022-01-09 - 2022-01-10 %C Alexandria, VA, USA %B Proceedings of the Symposium on Algorithm Engineering and Experiments %E Phillips, Cynthia A.; Speckman, Bettina %P 78 - 90 %I SIAM %@ 978-1-61197-704-2
[54]
D. Coudert, A. Nusser, and L. Viennot, “Enumeration of Far-Apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation,” ACM Journal of Experimental Algorithmics, vol. 27, 2022.
Export
BibTeX
@article{Coudert22, TITLE = {Enumeration of Far-Apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation}, AUTHOR = {Coudert, David and Nusser, Andr{\'e} and Viennot, Laurent}, LANGUAGE = {eng}, ISSN = {1084-6654}, DOI = {10.1145/3569169}, PUBLISHER = {ACM}, ADDRESS = {New York, NY}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, JOURNAL = {ACM Journal of Experimental Algorithmics}, VOLUME = {27}, EID = {1.15}, }
Endnote
%0 Journal Article %A Coudert, David %A Nusser, Andr&#233; %A Viennot, Laurent %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Enumeration of Far-Apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation : %G eng %U http://hdl.handle.net/21.11116/0000-000B-FE19-C %R 10.1145/3569169 %7 2022 %D 2022 %J ACM Journal of Experimental Algorithmics %V 27 %Z sequence number: 1.15 %I ACM %C New York, NY %@ false
[55]
C. Coupette, J. Vreeken, and B. Rieck, “All the World’s a (Hyper)Graph: A Data Drama,” 2022. [Online]. Available: https://arxiv.org/abs/2206.08225. (arXiv: 2206.08225)
Abstract
We introduce Hyperbard, a dataset of diverse relational data representations<br>derived from Shakespeare's plays. Our representations range from simple graphs<br>capturing character co-occurrence in single scenes to hypergraphs encoding<br>complex communication settings and character contributions as hyperedges with<br>edge-specific node weights. By making multiple intuitive representations<br>readily available for experimentation, we facilitate rigorous representation<br>robustness checks in graph learning, graph mining, and network analysis,<br>highlighting the advantages and drawbacks of specific representations.<br>Leveraging the data released in Hyperbard, we demonstrate that many solutions<br>to popular graph mining problems are highly dependent on the representation<br>choice, thus calling current graph curation practices into question. As an<br>homage to our data source, and asserting that science can also be art, we<br>present all our points in the form of a play.<br>
Export
BibTeX
@online{Coupette2206.08225, TITLE = {All the World's a (Hyper)Graph: A Data Drama}, AUTHOR = {Coupette, Corinna and Vreeken, Jilles and Rieck, Bastian}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2206.08225}, EPRINT = {2206.08225}, EPRINTTYPE = {arXiv}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We introduce Hyperbard, a dataset of diverse relational data representations<br>derived from Shakespeare's plays. Our representations range from simple graphs<br>capturing character co-occurrence in single scenes to hypergraphs encoding<br>complex communication settings and character contributions as hyperedges with<br>edge-specific node weights. By making multiple intuitive representations<br>readily available for experimentation, we facilitate rigorous representation<br>robustness checks in graph learning, graph mining, and network analysis,<br>highlighting the advantages and drawbacks of specific representations.<br>Leveraging the data released in Hyperbard, we demonstrate that many solutions<br>to popular graph mining problems are highly dependent on the representation<br>choice, thus calling current graph curation practices into question. As an<br>homage to our data source, and asserting that science can also be art, we<br>present all our points in the form of a play.<br>}, }
Endnote
%0 Report %A Coupette, Corinna %A Vreeken, Jilles %A Rieck, Bastian %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T All the World's a (Hyper)Graph: A Data Drama : %G eng %U http://hdl.handle.net/21.11116/0000-000C-10C1-7 %U https://arxiv.org/abs/2206.08225 %D 2022 %X We introduce Hyperbard, a dataset of diverse relational data representations<br>derived from Shakespeare's plays. Our representations range from simple graphs<br>capturing character co-occurrence in single scenes to hypergraphs encoding<br>complex communication settings and character contributions as hyperedges with<br>edge-specific node weights. By making multiple intuitive representations<br>readily available for experimentation, we facilitate rigorous representation<br>robustness checks in graph learning, graph mining, and network analysis,<br>highlighting the advantages and drawbacks of specific representations.<br>Leveraging the data released in Hyperbard, we demonstrate that many solutions<br>to popular graph mining problems are highly dependent on the representation<br>choice, thus calling current graph curation practices into question. As an<br>homage to our data source, and asserting that science can also be art, we<br>present all our points in the form of a play.<br> %K Computer Science, Learning, cs.LG,Computer Science, Computation and Language, cs.CL,Computer Science, Computers and Society, cs.CY,cs.SI
[56]
C. Coupette and D. Hartung, “Sharing and Caring: Creating a Culture of Constructive Criticism in Computational Legal Studies,” 2022. [Online]. Available: https://arxiv.org/abs/2205.01071. (arXiv: 2205.01071)
Abstract
We introduce seven foundational principles for creating a culture of<br>constructive criticism in computational legal studies. Beginning by challenging<br>the current perception of papers as the primary scholarly output, we call for a<br>more comprehensive interpretation of publications. We then suggest to make<br>these publications computationally reproducible, releasing all of the data and<br>all of the code all of the time, on time, and in the most functioning form<br>possible. Subsequently, we invite constructive criticism in all phases of the<br>publication life cycle. We posit that our proposals will help form our field,<br>and float the idea of marking this maturity by the creation of a modern<br>flagship publication outlet for computational legal studies.<br>
Export
BibTeX
@online{Coupette2205.01071, TITLE = {Sharing and Caring: Creating a Culture of Constructive Criticism in Computational Legal Studies}, AUTHOR = {Coupette, Corinna and Hartung, Dirk}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2205.01071}, EPRINT = {2205.01071}, EPRINTTYPE = {arXiv}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We introduce seven foundational principles for creating a culture of<br>constructive criticism in computational legal studies. Beginning by challenging<br>the current perception of papers as the primary scholarly output, we call for a<br>more comprehensive interpretation of publications. We then suggest to make<br>these publications computationally reproducible, releasing all of the data and<br>all of the code all of the time, on time, and in the most functioning form<br>possible. Subsequently, we invite constructive criticism in all phases of the<br>publication life cycle. We posit that our proposals will help form our field,<br>and float the idea of marking this maturity by the creation of a modern<br>flagship publication outlet for computational legal studies.<br>}, }
Endnote
%0 Report %A Coupette, Corinna %A Hartung, Dirk %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Sharing and Caring: Creating a Culture of Constructive Criticism in Computational Legal Studies : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1083-D %U https://arxiv.org/abs/2205.01071 %D 2022 %X We introduce seven foundational principles for creating a culture of<br>constructive criticism in computational legal studies. Beginning by challenging<br>the current perception of papers as the primary scholarly output, we call for a<br>more comprehensive interpretation of publications. We then suggest to make<br>these publications computationally reproducible, releasing all of the data and<br>all of the code all of the time, on time, and in the most functioning form<br>possible. Subsequently, we invite constructive criticism in all phases of the<br>publication life cycle. We posit that our proposals will help form our field,<br>and float the idea of marking this maturity by the creation of a modern<br>flagship publication outlet for computational legal studies.<br> %K Computer Science, Computers and Society, cs.CY,Computer Science, Computation and Language, cs.CL
[57]
C. Coupette and D. Hartung, “Rechtsstrukturvergleichung,” Rabels Zeitschrift für ausländisches und internationales Privatrecht, vol. 86, no. 4, 2022.
Export
BibTeX
@article{CoupetteRabelsZ22, TITLE = {Rechtsstrukturvergleichung}, AUTHOR = {Coupette, Corinna and Hartung, Dirk}, LANGUAGE = {eng}, DOI = {10.1628/rabelsz-2022-0082}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, DATE = {2022}, JOURNAL = {Rabels Zeitschrift f{\"u}r ausl{\"a}ndisches und internationales Privatrecht}, VOLUME = {86}, NUMBER = {4}, PAGES = {935--975}, }
Endnote
%0 Journal Article %A Coupette, Corinna %A Hartung, Dirk %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Rechtsstrukturvergleichung : %G eng %U http://hdl.handle.net/21.11116/0000-000C-108A-6 %R 10.1628/rabelsz-2022-0082 %7 2022 %D 2022 %J Rabels Zeitschrift f&#252;r ausl&#228;ndisches und internationales Privatrecht %O RabelsZ %V 86 %N 4 %& 935 %P 935 - 975
[58]
C. Coupette, S. Dalleiger, and J. Vreeken, “Differentially Describing Groups of Graphs,” in Proceedings of the 36th AAAI Conference on Artificial Intelligence, Virtual Conference, 2022.
Export
BibTeX
@inproceedings{CoupetteAAAI22, TITLE = {Differentially Describing Groups of Graphs}, AUTHOR = {Coupette, Corinna and Dalleiger, Sebastian and Vreeken, Jilles}, LANGUAGE = {eng}, ISBN = {978-1-57735-876-3}, DOI = {10.1609/aaai.v36i4.20312}, PUBLISHER = {AAAI}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Proceedings of the 36th AAAI Conference on Artificial Intelligence}, PAGES = {3959--3967}, ADDRESS = {Virtual Conference}, }
Endnote
%0 Conference Proceedings %A Coupette, Corinna %A Dalleiger, Sebastian %A Vreeken, Jilles %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Differentially Describing Groups of Graphs : %G eng %U http://hdl.handle.net/21.11116/0000-000C-105C-B %R 10.1609/aaai.v36i4.20312 %D 2022 %B 36th AAAI Conference on Artificial Intelligence %Z date of event: 2022-02-22 - 2022-03-01 %C Virtual Conference %B Proceedings of the 36th AAAI Conference on Artificial Intelligence %P 3959 - 3967 %I AAAI %@ 978-1-57735-876-3 %U https://ojs.aaai.org/index.php/AAAI/article/view/20312/20071
[59]
C. Coupette, D. Hartung, J. Beckedorf, M. Bother, and D. M. Katz, “Law Smells - Defining and Detecting Problematic Patterns in Legal Drafting,” Artificial Intelligence and Law, 2022.
Export
BibTeX
@article{Coupette22, TITLE = {Law Smells -- Defining and Detecting Problematic Patterns in Legal Drafting}, AUTHOR = {Coupette, Corinna and Hartung, Dirk and Beckedorf, Janis and Bother, Maximilian and Katz, Daniel Martin}, LANGUAGE = {eng}, ISSN = {0924-8463}, DOI = {10.1007/s10506-022-09315-w}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, JOURNAL = {Artificial Intelligence and Law}, }
Endnote
%0 Journal Article %A Coupette, Corinna %A Hartung, Dirk %A Beckedorf, Janis %A Bother, Maximilian %A Katz, Daniel Martin %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations %T Law Smells - Defining and Detecting Problematic Patterns in Legal Drafting : %G eng %U http://hdl.handle.net/21.11116/0000-000A-CD04-B %R 10.1007/s10506-022-09315-w %7 2022 %D 2022 %J Artificial Intelligence and Law %I Springer %C New York, NY %@ false
[60]
C. Coupette, S. Dalleiger, and J. Vreeken, “Differentially Describing Groups of Graphs,” 2022. [Online]. Available: https://arxiv.org/abs/2201.04064. (arXiv: 2201.04064)
Abstract
How does neural connectivity in autistic children differ from neural<br>connectivity in healthy children or autistic youths? What patterns in global<br>trade networks are shared across classes of goods, and how do these patterns<br>change over time? Answering questions like these requires us to differentially<br>describe groups of graphs: Given a set of graphs and a partition of these<br>graphs into groups, discover what graphs in one group have in common, how they<br>systematically differ from graphs in other groups, and how multiple groups of<br>graphs are related. We refer to this task as graph group analysis, which seeks<br>to describe similarities and differences between graph groups by means of<br>statistically significant subgraphs. To perform graph group analysis, we<br>introduce Gragra, which uses maximum entropy modeling to identify a<br>non-redundant set of subgraphs with statistically significant associations to<br>one or more graph groups. Through an extensive set of experiments on a wide<br>range of synthetic and real-world graph groups, we confirm that Gragra works<br>well in practice.<br>
Export
BibTeX
@online{Coupette2201.04064, TITLE = {Differentially Describing Groups of Graphs}, AUTHOR = {Coupette, Corinna and Dalleiger, Sebastian and Vreeken, Jilles}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2201.04064}, EPRINT = {2201.04064}, EPRINTTYPE = {arXiv}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, ABSTRACT = {How does neural connectivity in autistic children differ from neural<br>connectivity in healthy children or autistic youths? What patterns in global<br>trade networks are shared across classes of goods, and how do these patterns<br>change over time? Answering questions like these requires us to differentially<br>describe groups of graphs: Given a set of graphs and a partition of these<br>graphs into groups, discover what graphs in one group have in common, how they<br>systematically differ from graphs in other groups, and how multiple groups of<br>graphs are related. We refer to this task as graph group analysis, which seeks<br>to describe similarities and differences between graph groups by means of<br>statistically significant subgraphs. To perform graph group analysis, we<br>introduce Gragra, which uses maximum entropy modeling to identify a<br>non-redundant set of subgraphs with statistically significant associations to<br>one or more graph groups. Through an extensive set of experiments on a wide<br>range of synthetic and real-world graph groups, we confirm that Gragra works<br>well in practice.<br>}, }
Endnote
%0 Report %A Coupette, Corinna %A Dalleiger, Sebastian %A Vreeken, Jilles %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Differentially Describing Groups of Graphs : %G eng %U http://hdl.handle.net/21.11116/0000-000C-165D-4 %U https://arxiv.org/abs/2201.04064 %D 2022 %X How does neural connectivity in autistic children differ from neural<br>connectivity in healthy children or autistic youths? What patterns in global<br>trade networks are shared across classes of goods, and how do these patterns<br>change over time? Answering questions like these requires us to differentially<br>describe groups of graphs: Given a set of graphs and a partition of these<br>graphs into groups, discover what graphs in one group have in common, how they<br>systematically differ from graphs in other groups, and how multiple groups of<br>graphs are related. We refer to this task as graph group analysis, which seeks<br>to describe similarities and differences between graph groups by means of<br>statistically significant subgraphs. To perform graph group analysis, we<br>introduce Gragra, which uses maximum entropy modeling to identify a<br>non-redundant set of subgraphs with statistically significant associations to<br>one or more graph groups. Through an extensive set of experiments on a wide<br>range of synthetic and real-world graph groups, we confirm that Gragra works<br>well in practice.<br> %K cs.SI,Computer Science, Information Theory, cs.IT,Computer Science, Learning, cs.LG,Mathematics, Information Theory, math.IT
[61]
C. Coupette, S. Dalleiger, and B. Rieck, “Ollivier-Ricci Curvature for Hypergraphs: A Unified Framework,” 2022. [Online]. Available: https://arxiv.org/abs/2210.12048. (arXiv: 2210.12048)
Abstract
Bridging geometry and topology, curvature is a powerful and expressive<br>invariant. While the utility of curvature has been theoretically and<br>empirically confirmed in the context of manifolds and graphs, its<br>generalization to the emerging domain of hypergraphs has remained largely<br>unexplored. On graphs, Ollivier-Ricci curvature measures differences between<br>random walks via Wasserstein distances, thus grounding a geometric concept in<br>ideas from probability and optimal transport. We develop ORCHID, a flexible<br>framework generalizing Ollivier-Ricci curvature to hypergraphs, and prove that<br>the resulting curvatures have favorable theoretical properties. Through<br>extensive experiments on synthetic and real-world hypergraphs from different<br>domains, we demonstrate that ORCHID curvatures are both scalable and useful to<br>perform a variety of hypergraph tasks in practice.<br>
Export
BibTeX
@online{, TITLE = {Ollivier-Ricci Curvature for Hypergraphs: A Unified Framework}, AUTHOR = {Coupette, Corinna and Dalleiger, Sebastian and Rieck, Bastian}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2210.12048}, DOI = {Coupette2210.12048}, EPRINT = {2210.12048}, EPRINTTYPE = {arXiv}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Bridging geometry and topology, curvature is a powerful and expressive<br>invariant. While the utility of curvature has been theoretically and<br>empirically confirmed in the context of manifolds and graphs, its<br>generalization to the emerging domain of hypergraphs has remained largely<br>unexplored. On graphs, Ollivier-Ricci curvature measures differences between<br>random walks via Wasserstein distances, thus grounding a geometric concept in<br>ideas from probability and optimal transport. We develop ORCHID, a flexible<br>framework generalizing Ollivier-Ricci curvature to hypergraphs, and prove that<br>the resulting curvatures have favorable theoretical properties. Through<br>extensive experiments on synthetic and real-world hypergraphs from different<br>domains, we demonstrate that ORCHID curvatures are both scalable and useful to<br>perform a variety of hypergraph tasks in practice.<br>}, }
Endnote
%0 Report %A Coupette, Corinna %A Dalleiger, Sebastian %A Rieck, Bastian %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Ollivier-Ricci Curvature for Hypergraphs: A Unified Framework : %G eng %U http://hdl.handle.net/21.11116/0000-000C-10CD-B %U https://arxiv.org/abs/2210.12048 %R Coupette2210.12048 %D 2022 %X Bridging geometry and topology, curvature is a powerful and expressive<br>invariant. While the utility of curvature has been theoretically and<br>empirically confirmed in the context of manifolds and graphs, its<br>generalization to the emerging domain of hypergraphs has remained largely<br>unexplored. On graphs, Ollivier-Ricci curvature measures differences between<br>random walks via Wasserstein distances, thus grounding a geometric concept in<br>ideas from probability and optimal transport. We develop ORCHID, a flexible<br>framework generalizing Ollivier-Ricci curvature to hypergraphs, and prove that<br>the resulting curvatures have favorable theoretical properties. Through<br>extensive experiments on synthetic and real-world hypergraphs from different<br>domains, we demonstrate that ORCHID curvatures are both scalable and useful to<br>perform a variety of hypergraph tasks in practice.<br> %K Computer Science, Learning, cs.LG,cs.SI,Statistics, Machine Learning, stat.ML
[62]
C. Croitoru and M. Croitoru, “Indepth Combinatorial Analysis of Admissible Sets for Abstract Argumentation,” Annals of Mathematics and Artificial Intelligence, 2022.
Export
BibTeX
@article{Croitoru2022, TITLE = {Indepth Combinatorial Analysis of Admissible Sets for Abstract Argumentation}, AUTHOR = {Croitoru, Cosmina and Croitoru, Madalina}, LANGUAGE = {eng}, ISSN = {1012-2443}, DOI = {10.1007/s10472-022-09785-3}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, JOURNAL = {Annals of Mathematics and Artificial Intelligence}, }
Endnote
%0 Journal Article %A Croitoru, Cosmina %A Croitoru, Madalina %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Indepth Combinatorial Analysis of Admissible Sets for Abstract Argumentation : %G eng %U http://hdl.handle.net/21.11116/0000-000A-5D72-E %R 10.1007/s10472-022-09785-3 %7 2022 %D 2022 %J Annals of Mathematics and Artificial Intelligence %I Springer %C New York, NY %@ false
[63]
Á. Cseh, Y. Faenza, T. Kavitha, and V. Powers, “Understanding Popular Matchings via Stable Matchings,” SIAM Journal on Discrete Mathematics, vol. 36, no. 1, 2022.
Export
BibTeX
@article{Cseh2022, TITLE = {Understanding Popular Matchings via Stable Matchings}, AUTHOR = {Cseh, {\'A}gnes and Faenza, Yuri and Kavitha, Telikepalli and Powers, Vladlena}, LANGUAGE = {eng}, ISSN = {0895-4801}, DOI = {10.1137/19M124770X}, PUBLISHER = {The Society}, ADDRESS = {Philadelphia, Pa.}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, DATE = {2022}, JOURNAL = {SIAM Journal on Discrete Mathematics}, VOLUME = {36}, NUMBER = {1}, PAGES = {188--213}, }
Endnote
%0 Journal Article %A Cseh, &#193;gnes %A Faenza, Yuri %A Kavitha, Telikepalli %A Powers, Vladlena %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Understanding Popular Matchings via Stable Matchings : %G eng %U http://hdl.handle.net/21.11116/0000-000A-57C3-8 %R 10.1137/19M124770X %7 2022 %D 2022 %J SIAM Journal on Discrete Mathematics %V 36 %N 1 %& 188 %P 188 - 213 %I The Society %C Philadelphia, Pa. %@ false
[64]
J. Cslovjecsek, M. Pilipczuk, and K. Węgrzycki, “Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments,” 2022. [Online]. Available: https://arxiv.org/abs/2212.01620. (arXiv: 2212.01620)
Abstract
In the Maximum Weight Independent Set of Rectangles problem (MWISR) we are<br>given a weighted set of $n$ axis-parallel rectangles in the plane. The task is<br>to find a subset of pairwise non-overlapping rectangles with the maximum<br>possible total weight. This problem is NP-hard and the best-known<br>polynomial-time approximation algorithm, due to by Chalermsook and Walczak<br>(SODA 2021), achieves approximation factor $O(\log\log n )$. While in the<br>unweighted setting, constant factor approximation algorithms are known, due to<br>Mitchell (FOCS 2021) and to G\'alvez et al. (SODA 2022), it remains open to<br>extend these techniques to the weighted setting.<br> In this paper, we consider MWISR through the lens of parameterized<br>approximation. Grandoni et al. (ESA 2019) gave a $(1-\epsilon)$-approximation<br>algorithm with running time $k^{O(k/\epsilon^8)} n^{O(1/\epsilon^8)}$ time,<br>where $k$ is the number of rectangles in an optimum solution. Unfortunately,<br>their algorithm works only in the unweighted setting and they left it as an<br>open problem to give a parameterized approximation scheme in the weighted<br>setting.<br> Our contribution is a partial answer to the open question of Grandoni et al.<br>(ESA 2019). We give a parameterized approximation algorithm for MWISR that<br>given a parameter $k$, finds a set of non-overlapping rectangles of weight at<br>least $(1-\epsilon) \text{opt}_k$ in $2^{O(k \log(k/\epsilon))}<br>n^{O(1/\epsilon)}$ time, where $\text{opt}_k$ is the maximum weight of a<br>solution of cardinality at most $k$. Note that thus, our algorithm may return a<br>solution consisting of more than $k$ rectangles. To complement this apparent<br>weakness, we also propose a parameterized approximation scheme with running<br>time $2^{O(k^2 \log(k/\epsilon))} n^{O(1)}$ that finds a solution with<br>cardinality at most $k$ and total weight at least $(1-\epsilon)\text{opt}_k$<br>for the special case of axis-parallel segments.<br>
Export
BibTeX
@online{Cslovjecsek2212.01620, TITLE = {Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments}, AUTHOR = {Cslovjecsek, Jana and Pilipczuk, Micha{\l} and W{\c e}grzycki, Karol}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2212.01620}, EPRINT = {2212.01620}, EPRINTTYPE = {arXiv}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, ABSTRACT = {In the Maximum Weight Independent Set of Rectangles problem (MWISR) we are<br>given a weighted set of $n$ axis-parallel rectangles in the plane. The task is<br>to find a subset of pairwise non-overlapping rectangles with the maximum<br>possible total weight. This problem is NP-hard and the best-known<br>polynomial-time approximation algorithm, due to by Chalermsook and Walczak<br>(SODA 2021), achieves approximation factor $O(\log\log n )$. While in the<br>unweighted setting, constant factor approximation algorithms are known, due to<br>Mitchell (FOCS 2021) and to G\'alvez et al. (SODA 2022), it remains open to<br>extend these techniques to the weighted setting.<br> In this paper, we consider MWISR through the lens of parameterized<br>approximation. Grandoni et al. (ESA 2019) gave a $(1-\epsilon)$-approximation<br>algorithm with running time $k^{O(k/\epsilon^8)} n^{O(1/\epsilon^8)}$ time,<br>where $k$ is the number of rectangles in an optimum solution. Unfortunately,<br>their algorithm works only in the unweighted setting and they left it as an<br>open problem to give a parameterized approximation scheme in the weighted<br>setting.<br> Our contribution is a partial answer to the open question of Grandoni et al.<br>(ESA 2019). We give a parameterized approximation algorithm for MWISR that<br>given a parameter $k$, finds a set of non-overlapping rectangles of weight at<br>least $(1-\epsilon) \text{opt}_k$ in $2^{O(k \log(k/\epsilon))}<br>n^{O(1/\epsilon)}$ time, where $\text{opt}_k$ is the maximum weight of a<br>solution of cardinality at most $k$. Note that thus, our algorithm may return a<br>solution consisting of more than $k$ rectangles. To complement this apparent<br>weakness, we also propose a parameterized approximation scheme with running<br>time $2^{O(k^2 \log(k/\epsilon))} n^{O(1)}$ that finds a solution with<br>cardinality at most $k$ and total weight at least $(1-\epsilon)\text{opt}_k$<br>for the special case of axis-parallel segments.<br>}, }
Endnote
%0 Report %A Cslovjecsek, Jana %A Pilipczuk, Micha&#322; %A W&#281;grzycki, Karol %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1F75-F %U https://arxiv.org/abs/2212.01620 %D 2022 %X In the Maximum Weight Independent Set of Rectangles problem (MWISR) we are<br>given a weighted set of $n$ axis-parallel rectangles in the plane. The task is<br>to find a subset of pairwise non-overlapping rectangles with the maximum<br>possible total weight. This problem is NP-hard and the best-known<br>polynomial-time approximation algorithm, due to by Chalermsook and Walczak<br>(SODA 2021), achieves approximation factor $O(\log\log n )$. While in the<br>unweighted setting, constant factor approximation algorithms are known, due to<br>Mitchell (FOCS 2021) and to G\'alvez et al. (SODA 2022), it remains open to<br>extend these techniques to the weighted setting.<br> In this paper, we consider MWISR through the lens of parameterized<br>approximation. Grandoni et al. (ESA 2019) gave a $(1-\epsilon)$-approximation<br>algorithm with running time $k^{O(k/\epsilon^8)} n^{O(1/\epsilon^8)}$ time,<br>where $k$ is the number of rectangles in an optimum solution. Unfortunately,<br>their algorithm works only in the unweighted setting and they left it as an<br>open problem to give a parameterized approximation scheme in the weighted<br>setting.<br> Our contribution is a partial answer to the open question of Grandoni et al.<br>(ESA 2019). We give a parameterized approximation algorithm for MWISR that<br>given a parameter $k$, finds a set of non-overlapping rectangles of weight at<br>least $(1-\epsilon) \text{opt}_k$ in $2^{O(k \log(k/\epsilon))}<br>n^{O(1/\epsilon)}$ time, where $\text{opt}_k$ is the maximum weight of a<br>solution of cardinality at most $k$. Note that thus, our algorithm may return a<br>solution consisting of more than $k$ rectangles. To complement this apparent<br>weakness, we also propose a parameterized approximation scheme with running<br>time $2^{O(k^2 \log(k/\epsilon))} n^{O(1)}$ that finds a solution with<br>cardinality at most $k$ and total weight at least $(1-\epsilon)\text{opt}_k$<br>for the special case of axis-parallel segments.<br> %K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Computational Geometry, cs.CG
[65]
D. Das, T. Kociumaka, and B. Saha, “Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding,” in 49th EATCS International Conference on Automata, Languages, and Programming (ICALP 2022), Paris, France, 2022.
Export
BibTeX
@inproceedings{Das_ICALP22b, TITLE = {Improved Approximation Algorithms for {D}yck Edit Distance and {RNA} Folding}, AUTHOR = {Das, Debarati and Kociumaka, Tomasz and Saha, Barna}, LANGUAGE = {eng}, ISBN = {978-3-95977-235-8}, URL = {urn:nbn:de:0030-drops-163902; https://drops.dagstuhl.de/opus/volltexte/2022/16390/}, DOI = {10.4230/LIPIcs.ICALP.2022.49}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {49th EATCS International Conference on Automata, Languages, and Programming (ICALP 2022)}, EDITOR = {Boja{\'n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.}, PAGES = {1--20}, EID = {49}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {229}, ADDRESS = {Paris, France}, }
Endnote
%0 Conference Proceedings %A Das, Debarati %A Kociumaka, Tomasz %A Saha, Barna %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1541-3 %R 10.4230/LIPIcs.ICALP.2022.49 %U urn:nbn:de:0030-drops-163902 %U https://drops.dagstuhl.de/opus/volltexte/2022/16390/ %D 2022 %B 49th International Colloquium on Automata, Languages, and Programming %Z date of event: 2022-07-04 - 2022-07-08 %C Paris, France %B 49th EATCS International Conference on Automata, Languages, and Programming %E Boja&#324;czyk, Miko&#322;aj; Merelli, Emanuela; Woodruff, David P. %P 1 - 20 %Z sequence number: 49 %I Schloss Dagstuhl %@ 978-3-95977-235-8 %B Leibniz International Proceedings in Informatics %N 229
[66]
D. Das, J. Gilbert, M. Hajiaghayi, T. Kociumaka, and B. Saha, “Õ(n + poly(k))-time Algorithm for Distance k Tree Edit Distance,” in FOCS 2022, IEEE 63rd Annual Symposium on Foundations of Computer Science, Denver, CO, USA, 2022.
Export
BibTeX
@inproceedings{Das_FOCS22, TITLE = {$\tilde{O}(n + \mathrm{poly}(k))$-time Algorithm for Bounded Tree Edit Distance}, AUTHOR = {Das, Debarati and Gilbert, Jacob and Hajiaghayi, MohammadTaghi and Kociumaka, Tomasz and Saha, Barna}, LANGUAGE = {eng}, ISBN = {978-1-6654-5519-0}, DOI = {10.1109/FOCS54457.2022.00071}, PUBLISHER = {IEEE}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {FOCS 2022, IEEE 63rd Annual Symposium on Foundations of Computer Science}, PAGES = {686--697}, ADDRESS = {Denver, CO, USA}, }
Endnote
%0 Conference Proceedings %A Das, Debarati %A Gilbert, Jacob %A Hajiaghayi, MohammadTaghi %A Kociumaka, Tomasz %A Saha, Barna %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T &#213;(n + poly(k))-time Algorithm for Distance k Tree Edit Distance : %G eng %U http://hdl.handle.net/21.11116/0000-000C-153D-9 %R 10.1109/FOCS54457.2022.00071 %D 2022 %B IEEE 63rd Annual Symposium on Foundations of Computer Science %Z date of event: 2022-10-31 - 2022-11-03 %C Denver, CO, USA %B FOCS 2022 %P 686 - 697 %I IEEE %@ 978-1-6654-5519-0
[67]
B. C. Esmer, A. Kulik, D. Marx, D. Neuen, and R. Sharma, “Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search,” in 30th Annual European Symposium on Algorithms (ESA 2022), Berlin/Potsdam, Germany, 2022.
Export
BibTeX
@inproceedings{EsmerESA22, TITLE = {Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search}, AUTHOR = {Esmer, Bari{\c s} Can and Kulik, Ariel and Marx, D{\'a}niel and Neuen, Daniel and Sharma, Roohani}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-247-1}, URL = {urn:nbn:de:0030-drops-169887; https://drops.dagstuhl.de/opus/volltexte/2022/16988/}, DOI = {10.4230/LIPIcs.ESA.2022.50}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {30th Annual European Symposium on Algorithms (ESA 2022)}, EDITOR = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, PAGES = {1--19}, EID = {50}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {244}, ADDRESS = {Berlin/Potsdam, Germany}, }
Endnote
%0 Conference Proceedings %A Esmer, Bari&#351; Can %A Kulik, Ariel %A Marx, D&#225;niel %A Neuen, Daniel %A Sharma, Roohani %+ External Organizations External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1DA2-D %R 10.4230/LIPIcs.ESA.2022.50 %U urn:nbn:de:0030-drops-169887 %U https://drops.dagstuhl.de/opus/volltexte/2022/16988/ %D 2022 %B 30th Annual European Symposium on Algorithms %Z date of event: 2022-09-05 - 2022-09-09 %C Berlin/Potsdam, Germany %B 30th Annual European Symposium on Algorithms %E Chechik, Shiri; Navarro, Gonzalo; Rotenberg, Eva; Herman, Grzegorz %P 1 - 19 %Z sequence number: 50 %I Schloss Dagstuhl %@ 978-3-95977-247-1 %B Leibniz International Proceedings in Informatics %N 244 %@ false
[68]
B. C. Esmer, A. Kulik, D. Marx, P. Schepper, and K. Węgrzycki, “Computing Generalized Convolutions Faster Than Brute Force,” in 17th International Symposium on Parameterized and Exact Computation (IPEC 2022), Potsdam, Germany, 2022.
Export
BibTeX
@inproceedings{Esmer_IPEC22, TITLE = {Computing Generalized Convolutions Faster Than Brute Force}, AUTHOR = {Esmer, Bari{\c s} Can and Kulik, Ariel and Marx, D{\'a}niel and Schepper, Philipp and W{\c e}grzycki, Karol}, LANGUAGE = {eng}, ISBN = {978-3-95977-260-0}, URL = {urn:nbn:de:0030-drops-173685; https://drops.dagstuhl.de/opus/volltexte/2022/17368/}, DOI = {10.4230/LIPIcs.IPEC.2022.12}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)}, EDITOR = {Dell, Holger and Nederlof, Jesper}, PAGES = {1--22}, EID = {12}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {249}, ADDRESS = {Potsdam, Germany}, }
Endnote
%0 Conference Proceedings %A Esmer, Bari&#351; Can %A Kulik, Ariel %A Marx, D&#225;niel %A Schepper, Philipp %A W&#281;grzycki, Karol %+ External Organizations External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Computing Generalized Convolutions Faster Than Brute Force : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1EE6-0 %R 10.4230/LIPIcs.IPEC.2022.12 %U urn:nbn:de:0030-drops-173685 %U https://drops.dagstuhl.de/opus/volltexte/2022/17368/ %D 2022 %B 17th International Symposium on Parameterized and Exact Computation %Z date of event: 2022-09-07 - 2022-09-09 %C Potsdam, Germany %B 17th International Symposium on Parameterized and Exact Computation %E Dell, Holger; Nederlof, Jesper %P 1 - 22 %Z sequence number: 12 %I Schloss Dagstuhl %@ 978-3-95977-260-0 %B Leibniz International Proceedings in Informatics %N 249
[69]
B. C. Esmer, A. Kulik, D. Marx, D. Neuen, and R. Sharma, “Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search,” 2022. [Online]. Available: https://arxiv.org/abs/2206.13481. (arXiv: 2206.13481)
Abstract
We generalize the monotone local search approach of Fomin, Gaspers,<br>Lokshtanov and Saurabh [J.ACM 2019], by establishing a connection between<br>parameterized approximation and exponential-time approximation algorithms for<br>monotone subset minimization problems. In a monotone subset minimization<br>problem the input implicitly describes a non-empty set family over a universe<br>of size $n$ which is closed under taking supersets. The task is to find a<br>minimum cardinality set in this family. Broadly speaking, we use approximate<br>monotone local search to show that a parameterized $\alpha$-approximation<br>algorithm that runs in $c^k \cdot n^{O(1)}$ time, where $k$ is the solution<br>size, can be used to derive an $\alpha$-approximation randomized algorithm that<br>runs in $d^n \cdot n^{O(1)}$ time, where $d$ is the unique value in $d \in<br>(1,1+\frac{c-1}{\alpha})$ such that<br>$\mathcal{D}(\frac{1}{\alpha}\|\frac{d-1}{c-1})=\frac{\ln c}{\alpha}$ and<br>$\mathcal{D}(a \|b)$ is the Kullback-Leibler divergence. This running time<br>matches that of Fomin et al. for $\alpha=1$, and is strictly better when<br>$\alpha >1$, for any $c > 1$. Furthermore, we also show that this result can be<br>derandomized at the expense of a sub-exponential multiplicative factor in the<br>running time.<br> We demonstrate the potential of approximate monotone local search by deriving<br>new and faster exponential approximation algorithms for Vertex Cover,<br>$3$-Hitting Set, Directed Feedback Vertex Set, Directed Subset Feedback Vertex<br>Set, Directed Odd Cycle Transversal and Undirected Multicut. For instance, we<br>get a $1.1$-approximation algorithm for Vertex Cover with running time $1.114^n<br>\cdot n^{O(1)}$, improving upon the previously best known $1.1$-approximation<br>running in time $1.127^n \cdot n^{O(1)}$ by Bourgeois et al. [DAM 2011].<br>
Export
BibTeX
@online{Esmer2206.13481, TITLE = {Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search}, AUTHOR = {Esmer, Bar{\i}{\c s} Can and Kulik, Ariel and Marx, D{\'a}niel and Neuen, Daniel and Sharma, Roohani}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2206.13481}, EPRINT = {2206.13481}, EPRINTTYPE = {arXiv}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We generalize the monotone local search approach of Fomin, Gaspers,<br>Lokshtanov and Saurabh [J.ACM 2019], by establishing a connection between<br>parameterized approximation and exponential-time approximation algorithms for<br>monotone subset minimization problems. In a monotone subset minimization<br>problem the input implicitly describes a non-empty set family over a universe<br>of size $n$ which is closed under taking supersets. The task is to find a<br>minimum cardinality set in this family. Broadly speaking, we use approximate<br>monotone local search to show that a parameterized $\alpha$-approximation<br>algorithm that runs in $c^k \cdot n^{O(1)}$ time, where $k$ is the solution<br>size, can be used to derive an $\alpha$-approximation randomized algorithm that<br>runs in $d^n \cdot n^{O(1)}$ time, where $d$ is the unique value in $d \in<br>(1,1+\frac{c-1}{\alpha})$ such that<br>$\mathcal{D}(\frac{1}{\alpha}\|\frac{d-1}{c-1})=\frac{\ln c}{\alpha}$ and<br>$\mathcal{D}(a \|b)$ is the Kullback-Leibler divergence. This running time<br>matches that of Fomin et al. for $\alpha=1$, and is strictly better when<br>$\alpha >1$, for any $c > 1$. Furthermore, we also show that this result can be<br>derandomized at the expense of a sub-exponential multiplicative factor in the<br>running time.<br> We demonstrate the potential of approximate monotone local search by deriving<br>new and faster exponential approximation algorithms for Vertex Cover,<br>$3$-Hitting Set, Directed Feedback Vertex Set, Directed Subset Feedback Vertex<br>Set, Directed Odd Cycle Transversal and Undirected Multicut. For instance, we<br>get a $1.1$-approximation algorithm for Vertex Cover with running time $1.114^n<br>\cdot n^{O(1)}$, improving upon the previously best known $1.1$-approximation<br>running in time $1.127^n \cdot n^{O(1)}$ by Bourgeois et al. [DAM 2011].<br>}, }
Endnote
%0 Report %A Esmer, Bar&#305;&#351; Can %A Kulik, Ariel %A Marx, D&#225;niel %A Neuen, Daniel %A Sharma, Roohani %+ External Organizations External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1E6F-8 %U https://arxiv.org/abs/2206.13481 %D 2022 %X We generalize the monotone local search approach of Fomin, Gaspers,<br>Lokshtanov and Saurabh [J.ACM 2019], by establishing a connection between<br>parameterized approximation and exponential-time approximation algorithms for<br>monotone subset minimization problems. In a monotone subset minimization<br>problem the input implicitly describes a non-empty set family over a universe<br>of size $n$ which is closed under taking supersets. The task is to find a<br>minimum cardinality set in this family. Broadly speaking, we use approximate<br>monotone local search to show that a parameterized $\alpha$-approximation<br>algorithm that runs in $c^k \cdot n^{O(1)}$ time, where $k$ is the solution<br>size, can be used to derive an $\alpha$-approximation randomized algorithm that<br>runs in $d^n \cdot n^{O(1)}$ time, where $d$ is the unique value in $d \in<br>(1,1+\frac{c-1}{\alpha})$ such that<br>$\mathcal{D}(\frac{1}{\alpha}\|\frac{d-1}{c-1})=\frac{\ln c}{\alpha}$ and<br>$\mathcal{D}(a \|b)$ is the Kullback-Leibler divergence. This running time<br>matches that of Fomin et al. for $\alpha=1$, and is strictly better when<br>$\alpha >1$, for any $c > 1$. Furthermore, we also show that this result can be<br>derandomized at the expense of a sub-exponential multiplicative factor in the<br>running time.<br> We demonstrate the potential of approximate monotone local search by deriving<br>new and faster exponential approximation algorithms for Vertex Cover,<br>$3$-Hitting Set, Directed Feedback Vertex Set, Directed Subset Feedback Vertex<br>Set, Directed Odd Cycle Transversal and Undirected Multicut. For instance, we<br>get a $1.1$-approximation algorithm for Vertex Cover with running time $1.114^n<br>\cdot n^{O(1)}$, improving upon the previously best known $1.1$-approximation<br>running in time $1.127^n \cdot n^{O(1)}$ by Bourgeois et al. [DAM 2011].<br> %K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Computational Complexity, cs.CC
[70]
O. Firman and J. Spoerhase, “Hypergraph Representation via Axis-Aligned Point-Subspace Cover,” in WALCOM: Algorithms and Computation, Jember, Indonesia, 2022.
Export
BibTeX
@inproceedings{firman-spoerhase22:walcom, TITLE = {Hypergraph Representation via Axis-Aligned Point-Subspace Cover}, AUTHOR = {Firman, Oksana and Spoerhase, Joachim}, LANGUAGE = {eng}, ISBN = {978-3-030-96730-7}, DOI = {10.1007/978-3-030-96731-4_27}, PUBLISHER = {Springer}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, DATE = {2022}, BOOKTITLE = {WALCOM: Algorithms and Computation}, EDITOR = {Mutzel, Petra and Rahman, Md. Saidur and Slamin, }, PAGES = {328--339}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {13174}, ADDRESS = {Jember, Indonesia}, }
Endnote
%0 Conference Proceedings %A Firman, Oksana %A Spoerhase, Joachim %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Hypergraph Representation via Axis-Aligned Point-Subspace Cover : %G eng %U http://hdl.handle.net/21.11116/0000-000C-26B3-F %R 10.1007/978-3-030-96731-4_27 %D 2022 %B 16th International Conference and Workshops on Algorithms and Computation %Z date of event: 2022-03-24 - 2022-03-26 %C Jember, Indonesia %B WALCOM: Algorithms and Computation %E Mutzel, Petra; Rahman, Md. Saidur; Slamin %P 328 - 339 %I Springer %@ 978-3-030-96730-7 %B Lecture Notes in Computer Science %N 13174 %U https://rdcu.be/c21qy
[71]
F. V. Fomin, P. A. Golovach, W. Lochet, P. Misra, S. Saurabh, and R. Sharma, “Parameterized Complexity of Directed Spanner Problems,” Algorithmica, vol. 84, 2022.
Export
BibTeX
@article{Formin21, TITLE = {Parameterized Complexity of Directed Spanner Problems}, AUTHOR = {Fomin, Fedor V. and Golovach, Petr A. and Lochet, William and Misra, Pranabendu and Saurabh, Saket and Sharma, Roohani}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-021-00911-x}, PUBLISHER = {Springer-Verlag}, ADDRESS = {New York}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, DATE = {2022}, JOURNAL = {Algorithmica}, VOLUME = {84}, PAGES = {2292--2308}, }
Endnote
%0 Journal Article %A Fomin, Fedor V. %A Golovach, Petr A. %A Lochet, William %A Misra, Pranabendu %A Saurabh, Saket %A Sharma, Roohani %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Parameterized Complexity of Directed Spanner Problems : %G eng %U http://hdl.handle.net/21.11116/0000-0009-BAB8-6 %R 10.1007/s00453-021-00911-x %7 2021 %D 2022 %J Algorithmica %V 84 %& 2292 %P 2292 - 2308 %I Springer-Verlag %C New York %@ false
[72]
M. Függer, A. Kinali, C. Lenzen, and B. Wiederhake, “Fast All-Digital Clock Frequency Adaptation Circuit for Voltage Droop Tolerance,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 41, no. 8, 2022.
Export
BibTeX
@article{Fuegger2021, TITLE = {Fast All-Digital Clock Frequency Adaptation Circuit for Voltage Droop Tolerance}, AUTHOR = {F{\"u}gger, Matthias and Kinali, Attila and Lenzen, Christoph and Wiederhake, Ben}, LANGUAGE = {eng}, ISSN = {0278-0070}, DOI = {10.1109/TCAD.2021.3097599}, PUBLISHER = {IEEE}, ADDRESS = {Piscataway, NJ}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, DATE = {2022}, JOURNAL = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems}, VOLUME = {41}, NUMBER = {8}, PAGES = {2518--2531}, }
Endnote
%0 Journal Article %A F&#252;gger, Matthias %A Kinali, Attila %A Lenzen, Christoph %A Wiederhake, Ben %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Fast All-Digital Clock Frequency Adaptation Circuit for Voltage Droop Tolerance : %G eng %U http://hdl.handle.net/21.11116/0000-0009-201C-4 %R 10.1109/TCAD.2021.3097599 %7 2021 %D 2022 %J IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems %V 41 %N 8 %& 2518 %P 2518 - 2531 %I IEEE %C Piscataway, NJ %@ false
[73]
E. Galby, D. Marx, P. Schepper, R. Sharma, and P. Tale, “Parameterized Complexity of Weighted Multicut in Trees,” in Graph-Theoretic Concepts in Computer Science (WG 2022), Tübingen, Germany, 2022.
Export
BibTeX
@inproceedings{GalbyWG22, TITLE = {Parameterized Complexity of Weighted Multicut in Trees}, AUTHOR = {Galby, Esther and Marx, D{\'a}niel and Schepper, Philipp and Sharma, Roohani and Tale, Prafullkumar}, LANGUAGE = {eng}, ISBN = {978-3-031-15913-8}, DOI = {10.1007/978-3-031-15914-5_19}, PUBLISHER = {Springer}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, DATE = {2022}, BOOKTITLE = {Graph-Theoretic Concepts in Computer Science (WG 2022)}, EDITOR = {Bekos, Michael A. and Kaufmann, Michael}, PAGES = {257--270}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {13453}, ADDRESS = {T{\"u}bingen, Germany}, }
Endnote
%0 Conference Proceedings %A Galby, Esther %A Marx, D&#225;niel %A Schepper, Philipp %A Sharma, Roohani %A Tale, Prafullkumar %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Parameterized Complexity of Weighted Multicut in Trees : %G eng %U http://hdl.handle.net/21.11116/0000-000B-5925-8 %R 10.1007/978-3-031-15914-5_19 %D 2022 %B 48th International Workshop on Graph-Theoretic Concepts in Computer Science %Z date of event: 2022-06-22 - 2022-06-24 %C T&#252;bingen, Germany %B Graph-Theoretic Concepts in Computer Science %E Bekos, Michael A.; Kaufmann, Michael %P 257 - 270 %I Springer %@ 978-3-031-15913-8 %B Lecture Notes in Computer Science %N 13453
[74]
E. Galby, D. Marx, P. Schepper, R. Sharma, and P. Tale, “Domination and Cut Problems on Chordal Graphs with Bounded Leafage,” in 17th International Symposium on Parameterized and Exact Computation (IPEC 2022), Potsdam, Germany, 2022.
Export
BibTeX
@inproceedings{Galby_IPEC22, TITLE = {Domination and Cut Problems on Chordal Graphs with Bounded Leafage}, AUTHOR = {Galby, Esther and Marx, D{\'a}niel and Schepper, Philipp and Sharma, Roohani and Tale, Prafullkumar}, LANGUAGE = {eng}, ISBN = {978-3-95977-260-0}, URL = {urn:nbn:de:0030-drops-173704; https://drops.dagstuhl.de/opus/volltexte/2022/17370/}, DOI = {10.4230/LIPIcs.IPEC.2022.14}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)}, EDITOR = {Dell, Holger and Nederlof, Jesper}, PAGES = {1--24}, EID = {14}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {249}, ADDRESS = {Potsdam, Germany}, }
Endnote
%0 Conference Proceedings %A Galby, Esther %A Marx, D&#225;niel %A Schepper, Philipp %A Sharma, Roohani %A Tale, Prafullkumar %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Domination and Cut Problems on Chordal Graphs with Bounded Leafage : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1DB2-B %R 10.4230/LIPIcs.IPEC.2022.14 %U urn:nbn:de:0030-drops-173704 %U https://drops.dagstuhl.de/opus/volltexte/2022/17370/ %D 2022 %B 17th International Symposium on Parameterized and Exact Computation %Z date of event: 2022-09-07 - 2022-09-09 %C Potsdam, Germany %B 17th International Symposium on Parameterized and Exact Computation %E Dell, Holger; Nederlof, Jesper %P 1 - 24 %Z sequence number: 14 %I Schloss Dagstuhl %@ 978-3-95977-260-0 %B Leibniz International Proceedings in Informatics %N 249
[75]
E. Galby, L. Khazaliya, F. Mc Inerney, R. Sharma, and P. Tale, “Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters,” in 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), Vienna, Austria, 2022.
Export
BibTeX
@inproceedings{Galby_MFCS22, TITLE = {Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters}, AUTHOR = {Galby, Esther and Khazaliya, Liana and Mc Inerney, Fionn and Sharma, Roohani and Tale, Prafullkumar}, LANGUAGE = {eng}, ISBN = {978-3-95977-256-3}, URL = {urn:nbn:de:0030-drops-168496; https://drops.dagstuhl.de/opus/volltexte/2022/16849/}, DOI = {10.4230/LIPIcs.MFCS.2022.51}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, EDITOR = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra}, PAGES = {1--15}, EID = {51}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {241}, ADDRESS = {Vienna, Austria}, }
Endnote
%0 Conference Proceedings %A Galby, Esther %A Khazaliya, Liana %A Mc Inerney, Fionn %A Sharma, Roohani %A Tale, Prafullkumar %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1DB9-4 %R 10.4230/LIPIcs.MFCS.2022.51 %U urn:nbn:de:0030-drops-168496 %U https://drops.dagstuhl.de/opus/volltexte/2022/16849/ %D 2022 %B 47th International Symposium on Mathematical Foundations of Computer Science %Z date of event: 2022-08-22 - 2022-08-26 %C Vienna, Austria %B 47th International Symposium on Mathematical Foundations of Computer Science %E Szeider, Stefan; Ganian, Robert; Silva, Alexandra %P 1 - 15 %Z sequence number: 51 %I Schloss Dagstuhl %@ 978-3-95977-256-3 %B Leibniz International Proceedings in Informatics %N 241
[76]
E. Galby, D. Marx, P. Schepper, R. Sharma, and P. Tale, “Parameterized Complexity of Weighted Multicut in Trees,” 2022. [Online]. Available: https://arxiv.org/abs/2205.10105. (arXiv: 2205.10105)
Abstract
The Edge Multicut problem is a classical cut problem where given an<br>undirected graph $G$, a set of pairs of vertices $\mathcal{P}$, and a budget<br>$k$, the goal is to determine if there is a set $S$ of at most $k$ edges such<br>that for each $(s,t) \in \mathcal{P}$, $G-S$ has no path from $s$ to $t$. Edge<br>Multicut has been relatively recently shown to be fixed-parameter tractable<br>(FPT), parameterized by $k$, by Marx and Razgon [SICOMP 2014], and<br>independently by Bousquet et al. [SICOMP 2018]. In the weighted version of the<br>problem, called Weighted Edge Multicut one is additionally given a weight<br>function $\mathtt{wt} : E(G) \to \mathbb{N}$ and a weight bound $w$, and the<br>goal is to determine if there is a solution of size at most $k$ and weight at<br>most $w$. Both the FPT algorithms for Edge Multicut by Marx et al. and Bousquet<br>et al. fail to generalize to the weighted setting. In fact, the weighted<br>problem is non-trivial even on trees and determining whether Weighted Edge<br>Multicut on trees is FPT was explicitly posed as an open problem by Bousquet et<br>al. [STACS 2009]. In this article, we answer this question positively by<br>designing an algorithm which uses a very recent result by Kim et al. [STOC<br>2022] about directed flow augmentation as subroutine.<br> We also study a variant of this problem where there is no bound on the size<br>of the solution, but the parameter is a structural property of the input, for<br>example, the number of leaves of the tree. We strengthen our results by stating<br>them for the more general vertex deletion version.<br>
Export
BibTeX
@online{Galby2205.10105, TITLE = {Parameterized Complexity of Weighted Multicut in Trees}, AUTHOR = {Galby, Esther and Marx, D{\'a}niel and Schepper, Philipp and Sharma, Roohani and Tale, Prafullkumar}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2205.10105}, EPRINT = {2205.10105}, EPRINTTYPE = {arXiv}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, ABSTRACT = {The Edge Multicut problem is a classical cut problem where given an<br>undirected graph $G$, a set of pairs of vertices $\mathcal{P}$, and a budget<br>$k$, the goal is to determine if there is a set $S$ of at most $k$ edges such<br>that for each $(s,t) \in \mathcal{P}$, $G-S$ has no path from $s$ to $t$. Edge<br>Multicut has been relatively recently shown to be fixed-parameter tractable<br>(FPT), parameterized by $k$, by Marx and Razgon [SICOMP 2014], and<br>independently by Bousquet et al. [SICOMP 2018]. In the weighted version of the<br>problem, called Weighted Edge Multicut one is additionally given a weight<br>function $\mathtt{wt} : E(G) \to \mathbb{N}$ and a weight bound $w$, and the<br>goal is to determine if there is a solution of size at most $k$ and weight at<br>most $w$. Both the FPT algorithms for Edge Multicut by Marx et al. and Bousquet<br>et al. fail to generalize to the weighted setting. In fact, the weighted<br>problem is non-trivial even on trees and determining whether Weighted Edge<br>Multicut on trees is FPT was explicitly posed as an open problem by Bousquet et<br>al. [STACS 2009]. In this article, we answer this question positively by<br>designing an algorithm which uses a very recent result by Kim et al. [STOC<br>2022] about directed flow augmentation as subroutine.<br> We also study a variant of this problem where there is no bound on the size<br>of the solution, but the parameter is a structural property of the input, for<br>example, the number of leaves of the tree. We strengthen our results by stating<br>them for the more general vertex deletion version.<br>}, }
Endnote
%0 Report %A Galby, Esther %A Marx, D&#225;niel %A Schepper, Philipp %A Sharma, Roohani %A Tale, Prafullkumar %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Parameterized Complexity of Weighted Multicut in Trees : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1DC8-3 %U https://arxiv.org/abs/2205.10105 %D 2022 %X The Edge Multicut problem is a classical cut problem where given an<br>undirected graph $G$, a set of pairs of vertices $\mathcal{P}$, and a budget<br>$k$, the goal is to determine if there is a set $S$ of at most $k$ edges such<br>that for each $(s,t) \in \mathcal{P}$, $G-S$ has no path from $s$ to $t$. Edge<br>Multicut has been relatively recently shown to be fixed-parameter tractable<br>(FPT), parameterized by $k$, by Marx and Razgon [SICOMP 2014], and<br>independently by Bousquet et al. [SICOMP 2018]. In the weighted version of the<br>problem, called Weighted Edge Multicut one is additionally given a weight<br>function $\mathtt{wt} : E(G) \to \mathbb{N}$ and a weight bound $w$, and the<br>goal is to determine if there is a solution of size at most $k$ and weight at<br>most $w$. Both the FPT algorithms for Edge Multicut by Marx et al. and Bousquet<br>et al. fail to generalize to the weighted setting. In fact, the weighted<br>problem is non-trivial even on trees and determining whether Weighted Edge<br>Multicut on trees is FPT was explicitly posed as an open problem by Bousquet et<br>al. [STACS 2009]. In this article, we answer this question positively by<br>designing an algorithm which uses a very recent result by Kim et al. [STOC<br>2022] about directed flow augmentation as subroutine.<br> We also study a variant of this problem where there is no bound on the size<br>of the solution, but the parameter is a structural property of the input, for<br>example, the number of leaves of the tree. We strengthen our results by stating<br>them for the more general vertex deletion version.<br> %K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Computational Complexity, cs.CC
[77]
E. Galby, D. Marx, P. Schepper, R. Sharma, and P. Tale, “Domination and Cut Problems on Chordal Graphs with Bounded Leafage,” 2022. [Online]. Available: https://arxiv.org/abs/2208.02850. (arXiv: 2208.02850)
Abstract
The leafage of a chordal graph G is the minimum integer l such that G can be<br>realized as an intersection graph of subtrees of a tree with l leaves. We<br>consider structural parameterization by the leafage of classical domination and<br>cut problems on chordal graphs. Fomin, Golovach, and Raymond [ESA 2018,<br>Algorithmica 2020] proved, among other things, that Dominating Set on chordal<br>graphs admits an algorithm running in time $2^{O(l^2)} n^{O(1)}$. We present a<br>conceptually much simpler algorithm that runs in time $2^{O(l)} n^{O(1)}$. We<br>extend our approach to obtain similar results for Connected Dominating Set and<br>Steiner Tree. We then consider the two classical cut problems MultiCut with<br>Undeletable Terminals and Multiway Cut with Undeletable Terminals. We prove<br>that the former is W[1]-hard when parameterized by the leafage and complement<br>this result by presenting a simple $n^{O(l)}$-time algorithm. To our surprise,<br>we find that Multiway Cut with Undeletable Terminals on chordal graphs can be<br>solved, in contrast, in $n^{O(1)}$-time.<br>
Export
BibTeX
@online{Galby2208.02850, TITLE = {Domination and Cut Problems on Chordal Graphs with Bounded Leafage}, AUTHOR = {Galby, Esther and Marx, D{\'a}niel and Schepper, Philipp and Sharma, Roohani and Tale, Prafullkumar}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2208.02850}, EPRINT = {2208.02850}, EPRINTTYPE = {arXiv}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, ABSTRACT = {The leafage of a chordal graph G is the minimum integer l such that G can be<br>realized as an intersection graph of subtrees of a tree with l leaves. We<br>consider structural parameterization by the leafage of classical domination and<br>cut problems on chordal graphs. Fomin, Golovach, and Raymond [ESA 2018,<br>Algorithmica 2020] proved, among other things, that Dominating Set on chordal<br>graphs admits an algorithm running in time $2^{O(l^2)} n^{O(1)}$. We present a<br>conceptually much simpler algorithm that runs in time $2^{O(l)} n^{O(1)}$. We<br>extend our approach to obtain similar results for Connected Dominating Set and<br>Steiner Tree. We then consider the two classical cut problems MultiCut with<br>Undeletable Terminals and Multiway Cut with Undeletable Terminals. We prove<br>that the former is W[1]-hard when parameterized by the leafage and complement<br>this result by presenting a simple $n^{O(l)}$-time algorithm. To our surprise,<br>we find that Multiway Cut with Undeletable Terminals on chordal graphs can be<br>solved, in contrast, in $n^{O(1)}$-time.<br>}, }
Endnote
%0 Report %A Galby, Esther %A Marx, D&#225;niel %A Schepper, Philipp %A Sharma, Roohani %A Tale, Prafullkumar %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Domination and Cut Problems on Chordal Graphs with Bounded Leafage : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1DF6-F %U https://arxiv.org/abs/2208.02850 %D 2022 %X The leafage of a chordal graph G is the minimum integer l such that G can be<br>realized as an intersection graph of subtrees of a tree with l leaves. We<br>consider structural parameterization by the leafage of classical domination and<br>cut problems on chordal graphs. Fomin, Golovach, and Raymond [ESA 2018,<br>Algorithmica 2020] proved, among other things, that Dominating Set on chordal<br>graphs admits an algorithm running in time $2^{O(l^2)} n^{O(1)}$. We present a<br>conceptually much simpler algorithm that runs in time $2^{O(l)} n^{O(1)}$. We<br>extend our approach to obtain similar results for Connected Dominating Set and<br>Steiner Tree. We then consider the two classical cut problems MultiCut with<br>Undeletable Terminals and Multiway Cut with Undeletable Terminals. We prove<br>that the former is W[1]-hard when parameterized by the leafage and complement<br>this result by presenting a simple $n^{O(l)}$-time algorithm. To our surprise,<br>we find that Multiway Cut with Undeletable Terminals on chordal graphs can be<br>solved, in contrast, in $n^{O(1)}$-time.<br> %K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Computational Complexity, cs.CC,
[78]
E. Galby, L. Khazaliya, F. M. Inerney, R. Sharma, and P. Tale, “Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters,” 2022. [Online]. Available: https://arxiv.org/abs/2206.15424. (arXiv: 2206.15424)
Abstract
For a graph $G$, a subset $S \subseteq V(G)$ is called a \emph{resolving set}<br>if for any two vertices $u,v \in V(G)$, there exists a vertex $w \in S$ such<br>that $d(w,u) \neq d(w,v)$. The {\sc Metric Dimension} problem takes as input a<br>graph $G$ and a positive integer $k$, and asks whether there exists a resolving<br>set of size at most $k$. This problem was introduced in the 1970s and is known<br>to be NP-hard~[GT~61 in Garey and Johnson's book]. In the realm of<br>parameterized complexity, Hartung and Nichterlein~[CCC~2013] proved that the<br>problem is W[2]-hard when parameterized by the natural parameter $k$. They also<br>observed that it is FPT when parameterized by the vertex cover number and asked<br>about its complexity under \emph{smaller} parameters, in particular the<br>feedback vertex set number. We answer this question by proving that {\sc Metric<br>Dimension} is W[1]-hard when parameterized by the feedback vertex set number.<br>This also improves the result of Bonnet and Purohit~[IPEC 2019] which states<br>that the problem is W[1]-hard parameterized by the treewidth. Regarding the<br>parameterization by the vertex cover number, we prove that {\sc Metric<br>Dimension} does not admit a polynomial kernel under this parameterization<br>unless $NP\subseteq coNP/poly$. We observe that a similar result holds when the<br>parameter is the distance to clique. On the positive side, we show that {\sc<br>Metric Dimension} is FPT when parameterized by either the distance to cluster<br>or the distance to co-cluster, both of which are smaller parameters than the<br>vertex cover number.<br>
Export
BibTeX
@online{Galby2206.15424, TITLE = {Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters}, AUTHOR = {Galby, Esther and Khazaliya, Liana and Inerney, Fionn Mc and Sharma, Roohani and Tale, Prafullkumar}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2206.15424}, EPRINT = {2206.15424}, EPRINTTYPE = {arXiv}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, ABSTRACT = {For a graph $G$, a subset $S \subseteq V(G)$ is called a \emph{resolving set}<br>if for any two vertices $u,v \in V(G)$, there exists a vertex $w \in S$ such<br>that $d(w,u) \neq d(w,v)$. The {\sc Metric Dimension} problem takes as input a<br>graph $G$ and a positive integer $k$, and asks whether there exists a resolving<br>set of size at most $k$. This problem was introduced in the 1970s and is known<br>to be NP-hard~[GT~61 in Garey and Johnson's book]. In the realm of<br>parameterized complexity, Hartung and Nichterlein~[CCC~2013] proved that the<br>problem is W[2]-hard when parameterized by the natural parameter $k$. They also<br>observed that it is FPT when parameterized by the vertex cover number and asked<br>about its complexity under \emph{smaller} parameters, in particular the<br>feedback vertex set number. We answer this question by proving that {\sc Metric<br>Dimension} is W[1]-hard when parameterized by the feedback vertex set number.<br>This also improves the result of Bonnet and Purohit~[IPEC 2019] which states<br>that the problem is W[1]-hard parameterized by the treewidth. Regarding the<br>parameterization by the vertex cover number, we prove that {\sc Metric<br>Dimension} does not admit a polynomial kernel under this parameterization<br>unless $NP\subseteq coNP/poly$. We observe that a similar result holds when the<br>parameter is the distance to clique. On the positive side, we show that {\sc<br>Metric Dimension} is FPT when parameterized by either the distance to cluster<br>or the distance to co-cluster, both of which are smaller parameters than the<br>vertex cover number.<br>}, }
Endnote
%0 Report %A Galby, Esther %A Khazaliya, Liana %A Inerney, Fionn Mc %A Sharma, Roohani %A Tale, Prafullkumar %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1DDF-A %U https://arxiv.org/abs/2206.15424 %D 2022 %X For a graph $G$, a subset $S \subseteq V(G)$ is called a \emph{resolving set}<br>if for any two vertices $u,v \in V(G)$, there exists a vertex $w \in S$ such<br>that $d(w,u) \neq d(w,v)$. The {\sc Metric Dimension} problem takes as input a<br>graph $G$ and a positive integer $k$, and asks whether there exists a resolving<br>set of size at most $k$. This problem was introduced in the 1970s and is known<br>to be NP-hard~[GT~61 in Garey and Johnson's book]. In the realm of<br>parameterized complexity, Hartung and Nichterlein~[CCC~2013] proved that the<br>problem is W[2]-hard when parameterized by the natural parameter $k$. They also<br>observed that it is FPT when parameterized by the vertex cover number and asked<br>about its complexity under \emph{smaller} parameters, in particular the<br>feedback vertex set number. We answer this question by proving that {\sc Metric<br>Dimension} is W[1]-hard when parameterized by the feedback vertex set number.<br>This also improves the result of Bonnet and Purohit~[IPEC 2019] which states<br>that the problem is W[1]-hard parameterized by the treewidth. Regarding the<br>parameterization by the vertex cover number, we prove that {\sc Metric<br>Dimension} does not admit a polynomial kernel under this parameterization<br>unless $NP\subseteq coNP/poly$. We observe that a similar result holds when the<br>parameter is the distance to clique. On the positive side, we show that {\sc<br>Metric Dimension} is FPT when parameterized by either the distance to cluster<br>or the distance to co-cluster, both of which are smaller parameters than the<br>vertex cover number.<br> %K Computer Science, Discrete Mathematics, cs.DM,Computer Science, Computational Complexity, cs.CC,Computer Science, Data Structures and Algorithms, cs.DS
[79]
E. Galby, S. Kisfaludi-Bak, D. Marx, and R. Sharma, “Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification,” 2022. [Online]. Available: https://arxiv.org/abs/2208.06015. (arXiv: 2208.06015)
Abstract
In the Directed Steiner Network problem, the input is a directed graph G, a<br>subset T of k vertices of G called the terminals, and a demand graph D on T.<br>The task is to find a subgraph H of G with the minimum number of edges such<br>that for every edge (s,t) in D, the solution H contains a directed s to t path.<br>In this paper we investigate how the complexity of the problem depends on the<br>demand pattern when G is planar. Formally, if \mathcal{D} is a class of<br>directed graphs closed under identification of vertices, then the<br>\mathcal{D}-Steiner Network (\mathcal{D}-SN) problem is the special case where<br>the demand graph D is restricted to be from \mathcal{D}. For general graphs,<br>Feldmann and Marx [ICALP 2016] characterized those families of demand graphs<br>where the problem is fixed-parameter tractable (FPT) parameterized by the<br>number k of terminals. They showed that if \mathcal{D} is a superset of one of<br>the five hard families, then \mathcal{D}-SN is W[1]-hard parameterized by k,<br>otherwise it can be solved in time f(k)n^{O(1)}.<br> For planar graphs an interesting question is whether the W[1]-hard cases can<br>be solved by subexponential parameterized algorithms. Chitnis et al. [SICOMP<br>2020] showed that, assuming the ETH, there is no f(k)n^{o(k)} time algorithm<br>for the general \mathcal{D}-SN problem on planar graphs, but the special case<br>called Strongly Connected Steiner Subgraph can be solved in time f(k)<br>n^{O(\sqrt{k})} on planar graphs. We present a far-reaching generalization and<br>unification of these two results: we give a complete characterization of the<br>behavior of every $\mathcal{D}$-SN problem on planar graphs. We show that<br>assuming ETH, either the problem is (1) solvable in time 2^{O(k)}n^{O(1)}, and<br>not in time 2^{o(k)}n^{O(1)}, or (2) solvable in time f(k)n^{O(\sqrt{k})}, but<br>not in time f(k)n^{o(\sqrt{k})}, or (3) solvable in time f(k)n^{O(k)}, but not<br>in time f(k)n^{o({k})}.<br>
Export
BibTeX
@online{Galby2208.06015, TITLE = {Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification}, AUTHOR = {Galby, Esther and Kisfaludi-Bak, S{\'a}ndor and Marx, D{\'a}niel and Sharma, Roohani}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2208.06015}, EPRINT = {2208.06015}, EPRINTTYPE = {arXiv}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, ABSTRACT = {In the Directed Steiner Network problem, the input is a directed graph G, a<br>subset T of k vertices of G called the terminals, and a demand graph D on T.<br>The task is to find a subgraph H of G with the minimum number of edges such<br>that for every edge (s,t) in D, the solution H contains a directed s to t path.<br>In this paper we investigate how the complexity of the problem depends on the<br>demand pattern when G is planar. Formally, if \mathcal{D} is a class of<br>directed graphs closed under identification of vertices, then the<br>\mathcal{D}-Steiner Network (\mathcal{D}-SN) problem is the special case where<br>the demand graph D is restricted to be from \mathcal{D}. For general graphs,<br>Feldmann and Marx [ICALP 2016] characterized those families of demand graphs<br>where the problem is fixed-parameter tractable (FPT) parameterized by the<br>number k of terminals. They showed that if \mathcal{D} is a superset of one of<br>the five hard families, then \mathcal{D}-SN is W[1]-hard parameterized by k,<br>otherwise it can be solved in time f(k)n^{O(1)}.<br> For planar graphs an interesting question is whether the W[1]-hard cases can<br>be solved by subexponential parameterized algorithms. Chitnis et al. [SICOMP<br>2020] showed that, assuming the ETH, there is no f(k)n^{o(k)} time algorithm<br>for the general \mathcal{D}-SN problem on planar graphs, but the special case<br>called Strongly Connected Steiner Subgraph can be solved in time f(k)<br>n^{O(\sqrt{k})} on planar graphs. We present a far-reaching generalization and<br>unification of these two results: we give a complete characterization of the<br>behavior of every $\mathcal{D}$-SN problem on planar graphs. We show that<br>assuming ETH, either the problem is (1) solvable in time 2^{O(k)}n^{O(1)}, and<br>not in time 2^{o(k)}n^{O(1)}, or (2) solvable in time f(k)n^{O(\sqrt{k})}, but<br>not in time f(k)n^{o(\sqrt{k})}, or (3) solvable in time f(k)n^{O(k)}, but not<br>in time f(k)n^{o({k})}.<br>}, }
Endnote
%0 Report %A Galby, Esther %A Kisfaludi-Bak, S&#225;ndor %A Marx, D&#225;niel %A Sharma, Roohani %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1E72-3 %U https://arxiv.org/abs/2208.06015 %D 2022 %X In the Directed Steiner Network problem, the input is a directed graph G, a<br>subset T of k vertices of G called the terminals, and a demand graph D on T.<br>The task is to find a subgraph H of G with the minimum number of edges such<br>that for every edge (s,t) in D, the solution H contains a directed s to t path.<br>In this paper we investigate how the complexity of the problem depends on the<br>demand pattern when G is planar. Formally, if \mathcal{D} is a class of<br>directed graphs closed under identification of vertices, then the<br>\mathcal{D}-Steiner Network (\mathcal{D}-SN) problem is the special case where<br>the demand graph D is restricted to be from \mathcal{D}. For general graphs,<br>Feldmann and Marx [ICALP 2016] characterized those families of demand graphs<br>where the problem is fixed-parameter tractable (FPT) parameterized by the<br>number k of terminals. They showed that if \mathcal{D} is a superset of one of<br>the five hard families, then \mathcal{D}-SN is W[1]-hard parameterized by k,<br>otherwise it can be solved in time f(k)n^{O(1)}.<br> For planar graphs an interesting question is whether the W[1]-hard cases can<br>be solved by subexponential parameterized algorithms. Chitnis et al. [SICOMP<br>2020] showed that, assuming the ETH, there is no f(k)n^{o(k)} time algorithm<br>for the general \mathcal{D}-SN problem on planar graphs, but the special case<br>called Strongly Connected Steiner Subgraph can be solved in time f(k)<br>n^{O(\sqrt{k})} on planar graphs. We present a far-reaching generalization and<br>unification of these two results: we give a complete characterization of the<br>behavior of every $\mathcal{D}$-SN problem on planar graphs. We show that<br>assuming ETH, either the problem is (1) solvable in time 2^{O(k)}n^{O(1)}, and<br>not in time 2^{o(k)}n^{O(1)}, or (2) solvable in time f(k)n^{O(\sqrt{k})}, but<br>not in time f(k)n^{o(\sqrt{k})}, or (3) solvable in time f(k)n^{O(k)}, but not<br>in time f(k)n^{o({k})}.<br> %K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Computational Complexity, cs.CC,
[80]
Y. Gao, H. Kamkari, A. Karrenbauer, K. Mehlhorn, and M. Sharifi, “Physarum Inspired Dynamics to Solve Semi-Definite Programs,” 2022. [Online]. Available: https://arxiv.org/abs/2111.02291. (arXiv: 2111.02291)
Abstract
Physarum Polycephalum is a Slime mold that can solve the shortest path<br>problem. A mathematical model based on the Physarum's behavior, known as the<br>Physarum Directed Dynamics, can solve positive linear programs. In this paper,<br>we will propose a Physarum based dynamic based on the previous work and<br>introduce a new way to solve positive Semi-Definite Programming (SDP) problems,<br>which are more general than positive linear programs. Empirical results suggest<br>that this extension of the dynamic can solve the positive SDP showing that the<br>nature-inspired algorithm can solve one of the hardest problems in the<br>polynomial domain. In this work, we will formulate an accurate algorithm to<br>solve positive and some non-negative SDPs and formally prove some key<br>characteristics of this solver thus inspiring future work to try and refine<br>this method.<br>
Export
BibTeX
@online{Kamkari_2111.02291, TITLE = {Physarum Inspired Dynamics to Solve Semi-Definite Programs}, AUTHOR = {Gao, Yuan and Kamkari, Hamidreza and Karrenbauer, Andreas and Mehlhorn, Kurt and Sharifi, Mohammadamin}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2111.02291}, EPRINT = {2111.02291}, EPRINTTYPE = {arXiv}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Physarum Polycephalum is a Slime mold that can solve the shortest path<br>problem. A mathematical model based on the Physarum's behavior, known as the<br>Physarum Directed Dynamics, can solve positive linear programs. In this paper,<br>we will propose a Physarum based dynamic based on the previous work and<br>introduce a new way to solve positive Semi-Definite Programming (SDP) problems,<br>which are more general than positive linear programs. Empirical results suggest<br>that this extension of the dynamic can solve the positive SDP showing that the<br>nature-inspired algorithm can solve one of the hardest problems in the<br>polynomial domain. In this work, we will formulate an accurate algorithm to<br>solve positive and some non-negative SDPs and formally prove some key<br>characteristics of this solver thus inspiring future work to try and refine<br>this method.<br>}, }
Endnote
%0 Report %A Gao, Yuan %A Kamkari, Hamidreza %A Karrenbauer, Andreas %A Mehlhorn, Kurt %A Sharifi, Mohammadamin %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Physarum Inspired Dynamics to Solve Semi-Definite Programs : %G eng %U http://hdl.handle.net/21.11116/0000-0009-B656-9 %U https://arxiv.org/abs/2111.02291 %D 2022 %X Physarum Polycephalum is a Slime mold that can solve the shortest path<br>problem. A mathematical model based on the Physarum's behavior, known as the<br>Physarum Directed Dynamics, can solve positive linear programs. In this paper,<br>we will propose a Physarum based dynamic based on the previous work and<br>introduce a new way to solve positive Semi-Definite Programming (SDP) problems,<br>which are more general than positive linear programs. Empirical results suggest<br>that this extension of the dynamic can solve the positive SDP showing that the<br>nature-inspired algorithm can solve one of the hardest problems in the<br>polynomial domain. In this work, we will formulate an accurate algorithm to<br>solve positive and some non-negative SDPs and formally prove some key<br>characteristics of this solver thus inspiring future work to try and refine<br>this method.<br> %K Computer Science, Data Structures and Algorithms, cs.DS,Mathematics, Optimization and Control, math.OC
[81]
J. Giliberti and A. Karrenbauer, “Improved Online Algorithm for Fractional Knapsack in the Random Order Model,” in Approximation and Online Algorithms, Lisbon, Portugal, 2022.
Export
BibTeX
@inproceedings{GilbertiGK2021, TITLE = {Improved Online Algorithm for Fractional Knapsack in the Random Order Model}, AUTHOR = {Giliberti, Jeff and Karrenbauer, Andreas}, LANGUAGE = {eng}, ISBN = {978-3-030-92701-1}, DOI = {10.1007/978-3-030-92702-8_12}, PUBLISHER = {Springer}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, DATE = {2022}, BOOKTITLE = {Approximation and Online Algorithms}, EDITOR = {Koenemann, Jochen and Preis, Britta}, PAGES = {188--205}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {12982}, ADDRESS = {Lisbon, Portugal}, }
Endnote
%0 Conference Proceedings %A Giliberti, Jeff %A Karrenbauer, Andreas %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Improved Online Algorithm for Fractional Knapsack in the Random Order Model : %G eng %U http://hdl.handle.net/21.11116/0000-000C-11BF-A %R 10.1007/978-3-030-92702-8_12 %D 2022 %B 19th Workshop on Approximation and Online Algorithms %Z date of event: 2021-09-06 - 2021-09-10 %C Lisbon, Portugal %B Approximation and Online Algorithms %E Koenemann, Jochen; Preis, Britta %P 188 - 205 %I Springer %@ 978-3-030-92701-1 %B Lecture Notes in Computer Science %N 12982
[82]
E. Goldenberg, T. Kociumaka, R. Krauthgamer, and B. Saha, “Gap Edit Distance via Non-Adaptive Queries: Simple and Optimal,” in FOCS 2022, IEEE 63rd Annual Symposium on Foundations of Computer Science, Denver, CO, USA. (Accepted/in press)
Export
BibTeX
@inproceedings{Goldenberg_FOCS22, TITLE = {Gap Edit Distance via Non-Adaptive Queries: {S}imple and Optimal}, AUTHOR = {Goldenberg, Elazar and Kociumaka, Tomasz and Krauthgamer, Robert and Saha, Barna}, LANGUAGE = {eng}, PUBLISHER = {IEEE}, YEAR = {2022}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {FOCS 2022, IEEE 63rd Annual Symposium on Foundations of Computer Science}, EDITOR = {Jelani, Nelson}, ADDRESS = {Denver, CO, USA}, }
Endnote
%0 Conference Proceedings %A Goldenberg, Elazar %A Kociumaka, Tomasz %A Krauthgamer, Robert %A Saha, Barna %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Gap Edit Distance via Non-Adaptive Queries: Simple and Optimal : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1578-6 %D 2022 %B IEEE 63rd Annual Symposium on Foundations of Computer Science %Z date of event: 2022-10-31 - 2022-11-03 %C Denver, CO, USA %B FOCS 2022 %E Jelani, Nelson %I IEEE
[83]
T. Gouleakis, K. Lakis, and G. Shahkarami, “Learning-Augmented Algorithms for Online TSP on the Line,” 2022. [Online]. Available: https://arxiv.org/abs/2206.00655. (arXiv: 2206.00655)
Abstract
We study the online Traveling Salesman Problem (TSP) on the line augmented<br>with machine-learned predictions. In the classical problem, there is a stream<br>of requests released over time along the real line. The goal is to minimize the<br>makespan of the algorithm. We distinguish between the open variant and the<br>closed one, in which we additionally require the algorithm to return to the<br>origin after serving all requests. The state of the art is a $1.64$-competitive<br>algorithm and a $2.04$-competitive algorithm for the closed and open variants,<br>respectively \cite{Bjelde:1.64}. In both cases, a tight lower bound is known<br>\cite{Ausiello:1.75, Bjelde:1.64}.<br> In both variants, our primary prediction model involves predicted positions<br>of the requests. We introduce algorithms that (i) obtain a tight 1.5<br>competitive ratio for the closed variant and a 1.66 competitive ratio for the<br>open variant in the case of perfect predictions, (ii) are robust against<br>unbounded prediction error, and (iii) are smooth, i.e., their performance<br>degrades gracefully as the prediction error increases.<br> Moreover, we further investigate the learning-augmented setting in the open<br>variant by additionally considering a prediction for the last request served by<br>the optimal offline algorithm. Our algorithm for this enhanced setting obtains<br>a 1.33 competitive ratio with perfect predictions while also being smooth and<br>robust, beating the lower bound of 1.44 we show for our original prediction<br>setting for the open variant. Also, we provide a lower bound of 1.25 for this<br>enhanced setting.<br>
Export
BibTeX
@online{Gouleakis2206.00655, TITLE = {Learning-Augmented Algorithms for Online {TSP} on the Line}, AUTHOR = {Gouleakis, Themis and Lakis, Konstantinos and Shahkarami, Golnoosh}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2206.00655}, EPRINT = {2206.00655}, EPRINTTYPE = {arXiv}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We study the online Traveling Salesman Problem (TSP) on the line augmented<br>with machine-learned predictions. In the classical problem, there is a stream<br>of requests released over time along the real line. The goal is to minimize the<br>makespan of the algorithm. We distinguish between the open variant and the<br>closed one, in which we additionally require the algorithm to return to the<br>origin after serving all requests. The state of the art is a $1.64$-competitive<br>algorithm and a $2.04$-competitive algorithm for the closed and open variants,<br>respectively \cite{Bjelde:1.64}. In both cases, a tight lower bound is known<br>\cite{Ausiello:1.75, Bjelde:1.64}.<br> In both variants, our primary prediction model involves predicted positions<br>of the requests. We introduce algorithms that (i) obtain a tight 1.5<br>competitive ratio for the closed variant and a 1.66 competitive ratio for the<br>open variant in the case of perfect predictions, (ii) are robust against<br>unbounded prediction error, and (iii) are smooth, i.e., their performance<br>degrades gracefully as the prediction error increases.<br> Moreover, we further investigate the learning-augmented setting in the open<br>variant by additionally considering a prediction for the last request served by<br>the optimal offline algorithm. Our algorithm for this enhanced setting obtains<br>a 1.33 competitive ratio with perfect predictions while also being smooth and<br>robust, beating the lower bound of 1.44 we show for our original prediction<br>setting for the open variant. Also, we provide a lower bound of 1.25 for this<br>enhanced setting.<br>}, }
Endnote
%0 Report %A Gouleakis, Themis %A Lakis, Konstantinos %A Shahkarami, Golnoosh %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Learning-Augmented Algorithms for Online TSP on the Line : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1FCC-D %U https://arxiv.org/abs/2206.00655 %D 2022 %X We study the online Traveling Salesman Problem (TSP) on the line augmented<br>with machine-learned predictions. In the classical problem, there is a stream<br>of requests released over time along the real line. The goal is to minimize the<br>makespan of the algorithm. We distinguish between the open variant and the<br>closed one, in which we additionally require the algorithm to return to the<br>origin after serving all requests. The state of the art is a $1.64$-competitive<br>algorithm and a $2.04$-competitive algorithm for the closed and open variants,<br>respectively \cite{Bjelde:1.64}. In both cases, a tight lower bound is known<br>\cite{Ausiello:1.75, Bjelde:1.64}.<br> In both variants, our primary prediction model involves predicted positions<br>of the requests. We introduce algorithms that (i) obtain a tight 1.5<br>competitive ratio for the closed variant and a 1.66 competitive ratio for the<br>open variant in the case of perfect predictions, (ii) are robust against<br>unbounded prediction error, and (iii) are smooth, i.e., their performance<br>degrades gracefully as the prediction error increases.<br> Moreover, we further investigate the learning-augmented setting in the open<br>variant by additionally considering a prediction for the last request served by<br>the optimal offline algorithm. Our algorithm for this enhanced setting obtains<br>a 1.33 competitive ratio with perfect predictions while also being smooth and<br>robust, beating the lower bound of 1.44 we show for our original prediction<br>setting for the open variant. Also, we provide a lower bound of 1.25 for this<br>enhanced setting.<br> %K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Learning, cs.LG
[84]
G. Gutowski, F. Mittelstädt, I. Rutter, J. Spoerhase, A. Wolff, and J. Zink, “Coloring Mixed and Directional Interval Graphs,” in Graph Drawing and Network Visualization (GD 2022), Tokyo, Japan. (Accepted/in press)
Export
BibTeX
@inproceedings{gutowski-etal22:gd, TITLE = {Coloring Mixed and Directional Interval Graphs}, AUTHOR = {Gutowski, Grzegorz and Mittelst{\"a}dt, Florian and Rutter, Ignaz and Spoerhase, Joachim and Wolff, Alexander and Zink, Johannes}, LANGUAGE = {eng}, PUBLISHER = {Springer}, YEAR = {2022}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Graph Drawing and Network Visualization (GD 2022)}, EDITOR = {Angelini, Patrizio and von Hanxleden, Reinhard}, SERIES = {Lecture Notes in Computer Science}, ADDRESS = {Tokyo, Japan}, }
Endnote
%0 Conference Proceedings %A Gutowski, Grzegorz %A Mittelst&#228;dt, Florian %A Rutter, Ignaz %A Spoerhase, Joachim %A Wolff, Alexander %A Zink, Johannes %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Coloring Mixed and Directional Interval Graphs : %G eng %U http://hdl.handle.net/21.11116/0000-000C-26A4-0 %D 2022 %B 30th International Symposium on Graph Drawing and Network Visualization %Z date of event: 2022-09-13 - 2022-09-16 %C Tokyo, Japan %B Graph Drawing and Network Visualization %E Angelini, Patrizio; von Hanxleden, Reinhard %I Springer %B Lecture Notes in Computer Science
[85]
G. Gutowski, F. Mittelstädt, I. Rutter, J. Spoerhase, A. Wolff, and J. Zink, “Coloring Mixed and Directional Interval Graphs,” 2022. [Online]. Available: https://arxiv.org/abs/2208.14250. (arXiv: 2208.14250)
Abstract
A mixed graph has a set of vertices, a set of undirected egdes, and a set of<br>directed arcs. A proper coloring of a mixed graph $G$ is a function $c$ that<br>assigns to each vertex in $G$ a positive integer such that, for each edge $uv$<br>in $G$, $c(u) \ne c(v)$ and, for each arc $uv$ in $G$, $c(u) < c(v)$. For a<br>mixed graph $G$, the chromatic number $\chi(G)$ is the smallest number of<br>colors in any proper coloring of $G$. A directional interval graph is a mixed<br>graph whose vertices correspond to intervals on the real line. Such a graph has<br>an edge between every two intervals where one is contained in the other and an<br>arc between every two overlapping intervals, directed towards the interval that<br>starts and ends to the right.<br> Coloring such graphs has applications in routing edges in layered orthogonal<br>graph drawing according to the Sugiyama framework; the colors correspond to the<br>tracks for routing the edges. We show how to recognize directional interval<br>graphs, and how to compute their chromatic number efficiently. On the other<br>hand, for mixed interval graphs, i.e., graphs where two intersecting intervals<br>can be connected by an edge or by an arc in either direction arbitrarily, we<br>prove that computing the chromatic number is NP-hard.<br>
Export
BibTeX
@online{gutowski-etal22:arxiv, TITLE = {Coloring Mixed and Directional Interval Graphs}, AUTHOR = {Gutowski, Grzegorz and Mittelst{\"a}dt, Florian and Rutter, Ignaz and Spoerhase, Joachim and Wolff, Alexander and Zink, Johannes}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2208.14250}, EPRINT = {2208.14250}, EPRINTTYPE = {arXiv}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, ABSTRACT = {A mixed graph has a set of vertices, a set of undirected egdes, and a set of<br>directed arcs. A proper coloring of a mixed graph $G$ is a function $c$ that<br>assigns to each vertex in $G$ a positive integer such that, for each edge $uv$<br>in $G$, $c(u) \ne c(v)$ and, for each arc $uv$ in $G$, $c(u) < c(v)$. For a<br>mixed graph $G$, the chromatic number $\chi(G)$ is the smallest number of<br>colors in any proper coloring of $G$. A directional interval graph is a mixed<br>graph whose vertices correspond to intervals on the real line. Such a graph has<br>an edge between every two intervals where one is contained in the other and an<br>arc between every two overlapping intervals, directed towards the interval that<br>starts and ends to the right.<br> Coloring such graphs has applications in routing edges in layered orthogonal<br>graph drawing according to the Sugiyama framework; the colors correspond to the<br>tracks for routing the edges. We show how to recognize directional interval<br>graphs, and how to compute their chromatic number efficiently. On the other<br>hand, for mixed interval graphs, i.e., graphs where two intersecting intervals<br>can be connected by an edge or by an arc in either direction arbitrarily, we<br>prove that computing the chromatic number is NP-hard.<br>}, }
Endnote
%0 Report %A Gutowski, Grzegorz %A Mittelst&#228;dt, Florian %A Rutter, Ignaz %A Spoerhase, Joachim %A Wolff, Alexander %A Zink, Johannes %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Coloring Mixed and Directional Interval Graphs : %G eng %U http://hdl.handle.net/21.11116/0000-000C-269B-B %U https://arxiv.org/abs/2208.14250 %D 2022 %X A mixed graph has a set of vertices, a set of undirected egdes, and a set of<br>directed arcs. A proper coloring of a mixed graph $G$ is a function $c$ that<br>assigns to each vertex in $G$ a positive integer such that, for each edge $uv$<br>in $G$, $c(u) \ne c(v)$ and, for each arc $uv$ in $G$, $c(u) < c(v)$. For a<br>mixed graph $G$, the chromatic number $\chi(G)$ is the smallest number of<br>colors in any proper coloring of $G$. A directional interval graph is a mixed<br>graph whose vertices correspond to intervals on the real line. Such a graph has<br>an edge between every two intervals where one is contained in the other and an<br>arc between every two overlapping intervals, directed towards the interval that<br>starts and ends to the right.<br> Coloring such graphs has applications in routing edges in layered orthogonal<br>graph drawing according to the Sugiyama framework; the colors correspond to the<br>tracks for routing the edges. We show how to recognize directional interval<br>graphs, and how to compute their chromatic number efficiently. On the other<br>hand, for mixed interval graphs, i.e., graphs where two intersecting intervals<br>can be connected by an edge or by an arc in either direction arbitrarily, we<br>prove that computing the chromatic number is NP-hard.<br> %K Computer Science, Discrete Mathematics, cs.DM
[86]
D. Halperin, S. Har-Peled, K. Mehlhorn, E. Oh, and M. Sharir, “The Maximum-Level Vertex in an Arrangement of Lines,” Discrete & Computational Geometry, vol. 67, 2022.
Export
BibTeX
@article{Halperin2022, TITLE = {The Maximum-Level Vertex in an Arrangement of Lines}, AUTHOR = {Halperin, Dan and Har-Peled, Sariel and Mehlhorn, Kurt and Oh, Eunjin and Sharir, Micha}, LANGUAGE = {eng}, ISSN = {0179-5376}, DOI = {10.1007/s00454-021-00338-9}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, JOURNAL = {Discrete \& Computational Geometry}, VOLUME = {67}, PAGES = {439--461}, }
Endnote
%0 Journal Article %A Halperin, Dan %A Har-Peled, Sariel %A Mehlhorn, Kurt %A Oh, Eunjin %A Sharir, Micha %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T The Maximum-Level Vertex in an Arrangement of Lines : %G eng %U http://hdl.handle.net/21.11116/0000-0009-D020-7 %R 10.1007/s00454-021-00338-9 %7 2022 %D 2022 %J Discrete & Computational Geometry %V 67 %& 439 %P 439 - 461 %I Springer %C New York, NY %@ false %U https://rdcu.be/cFlQF
[87]
M. Hatzel, L. Jaffke, P. T. Lima, T. Masařík, M. Pilipczuk, R. Sharma, and M. Sorge, “Fixed-Parameter Tractability of Directed Multicut with Three Terminal Pairs Parameterized by the Size of the Cutset: Twin-width Meets Flow-Augmentation,” 2022. [Online]. Available: https://arxiv.org/abs/2207.07425. (arXiv: 2207.07425)
Abstract
We show fixed-parameter tractability of the Directed Multicut problem with<br>three terminal pairs (with a randomized algorithm). This problem, given a<br>directed graph $G$, pairs of vertices (called terminals) $(s_1,t_1)$,<br>$(s_2,t_2)$, and $(s_3,t_3)$, and an integer $k$, asks to find a set of at most<br>$k$ non-terminal vertices in $G$ that intersect all $s_1t_1$-paths, all<br>$s_2t_2$-paths, and all $s_3t_3$-paths. The parameterized complexity of this<br>case has been open since Chitnis, Cygan, Hajiaghayi, and Marx proved<br>fixed-parameter tractability of the 2-terminal-pairs case at SODA 2012, and<br>Pilipczuk and Wahlstr\"{o}m proved the W[1]-hardness of the 4-terminal-pairs<br>case at SODA 2016.<br> On the technical side, we use two recent developments in parameterized<br>algorithms. Using the technique of directed flow-augmentation [Kim, Kratsch,<br>Pilipczuk, Wahlstr\"{o}m, STOC 2022] we cast the problem as a CSP problem with<br>few variables and constraints over a large ordered domain.We observe that this<br>problem can be in turn encoded as an FO model-checking task over a structure<br>consisting of a few 0-1 matrices. We look at this problem through the lenses of<br>twin-width, a recently introduced structural parameter [Bonnet, Kim,<br>Thomass\'{e}, Watrigant, FOCS 2020]: By a recent characterization [Bonnet,<br>Giocanti, Ossona de Mendes, Simon, Thomass\'{e}, Toru\'{n}czyk, STOC 2022] the<br>said FO model-checking task can be done in FPT time if the said matrices have<br>bounded grid rank. To complete the proof, we show an irrelevant vertex rule: If<br>any of the matrices in the said encoding has a large grid minor, a vertex<br>corresponding to the ``middle'' box in the grid minor can be proclaimed<br>irrelevant -- not contained in the sought solution -- and thus reduced.<br>
Export
BibTeX
@online{Hatzel2207.07425, TITLE = {Fixed-Parameter Tractability of Directed Multicut with Three Terminal Pairs Parameterized by the Size of the Cutset: Twin-width Meets Flow-Augmentation}, AUTHOR = {Hatzel, Meike and Jaffke, Lars and Lima, Paloma T. and Masa{\v r}{\'i}k, Tom{\'a}{\v s} and Pilipczuk, Marcin and Sharma, Roohani and Sorge, Manuel}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2207.07425}, EPRINT = {2207.07425}, EPRINTTYPE = {arXiv}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We show fixed-parameter tractability of the Directed Multicut problem with<br>three terminal pairs (with a randomized algorithm). This problem, given a<br>directed graph $G$, pairs of vertices (called terminals) $(s_1,t_1)$,<br>$(s_2,t_2)$, and $(s_3,t_3)$, and an integer $k$, asks to find a set of at most<br>$k$ non-terminal vertices in $G$ that intersect all $s_1t_1$-paths, all<br>$s_2t_2$-paths, and all $s_3t_3$-paths. The parameterized complexity of this<br>case has been open since Chitnis, Cygan, Hajiaghayi, and Marx proved<br>fixed-parameter tractability of the 2-terminal-pairs case at SODA 2012, and<br>Pilipczuk and Wahlstr\"{o}m proved the W[1]-hardness of the 4-terminal-pairs<br>case at SODA 2016.<br> On the technical side, we use two recent developments in parameterized<br>algorithms. Using the technique of directed flow-augmentation [Kim, Kratsch,<br>Pilipczuk, Wahlstr\"{o}m, STOC 2022] we cast the problem as a CSP problem with<br>few variables and constraints over a large ordered domain.We observe that this<br>problem can be in turn encoded as an FO model-checking task over a structure<br>consisting of a few 0-1 matrices. We look at this problem through the lenses of<br>twin-width, a recently introduced structural parameter [Bonnet, Kim,<br>Thomass\'{e}, Watrigant, FOCS 2020]: By a recent characterization [Bonnet,<br>Giocanti, Ossona de Mendes, Simon, Thomass\'{e}, Toru\'{n}czyk, STOC 2022] the<br>said FO model-checking task can be done in FPT time if the said matrices have<br>bounded grid rank. To complete the proof, we show an irrelevant vertex rule: If<br>any of the matrices in the said encoding has a large grid minor, a vertex<br>corresponding to the ``middle'' box in the grid minor can be proclaimed<br>irrelevant -- not contained in the sought solution -- and thus reduced.<br>}, }
Endnote
%0 Report %A Hatzel, Meike %A Jaffke, Lars %A Lima, Paloma T. %A Masa&#345;&#237;k, Tom&#225;&#353; %A Pilipczuk, Marcin %A Sharma, Roohani %A Sorge, Manuel %+ External Organizations External Organizations External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Fixed-Parameter Tractability of Directed Multicut with Three Terminal Pairs Parameterized by the Size of the Cutset: Twin-width Meets Flow-Augmentation : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1DE8-F %U https://arxiv.org/abs/2207.07425 %D 2022 %X We show fixed-parameter tractability of the Directed Multicut problem with<br>three terminal pairs (with a randomized algorithm). This problem, given a<br>directed graph $G$, pairs of vertices (called terminals) $(s_1,t_1)$,<br>$(s_2,t_2)$, and $(s_3,t_3)$, and an integer $k$, asks to find a set of at most<br>$k$ non-terminal vertices in $G$ that intersect all $s_1t_1$-paths, all<br>$s_2t_2$-paths, and all $s_3t_3$-paths. The parameterized complexity of this<br>case has been open since Chitnis, Cygan, Hajiaghayi, and Marx proved<br>fixed-parameter tractability of the 2-terminal-pairs case at SODA 2012, and<br>Pilipczuk and Wahlstr\"{o}m proved the W[1]-hardness of the 4-terminal-pairs<br>case at SODA 2016.<br> On the technical side, we use two recent developments in parameterized<br>algorithms. Using the technique of directed flow-augmentation [Kim, Kratsch,<br>Pilipczuk, Wahlstr\"{o}m, STOC 2022] we cast the problem as a CSP problem with<br>few variables and constraints over a large ordered domain.We observe that this<br>problem can be in turn encoded as an FO model-checking task over a structure<br>consisting of a few 0-1 matrices. We look at this problem through the lenses of<br>twin-width, a recently introduced structural parameter [Bonnet, Kim,<br>Thomass\'{e}, Watrigant, FOCS 2020]: By a recent characterization [Bonnet,<br>Giocanti, Ossona de Mendes, Simon, Thomass\'{e}, Toru\'{n}czyk, STOC 2022] the<br>said FO model-checking task can be done in FPT time if the said matrices have<br>bounded grid rank. To complete the proof, we show an irrelevant vertex rule: If<br>any of the matrices in the said encoding has a large grid minor, a vertex<br>corresponding to the ``middle'' box in the grid minor can be proclaimed<br>irrelevant -- not contained in the sought solution -- and thus reduced.<br> %K Computer Science, Data Structures and Algorithms, cs.DS
[88]
L. Jaffke, P. T. Lima, and R. Sharma, “b-Coloring Parameterized by Pathwidth is XNLP-complete,” 2022. [Online]. Available: https://arxiv.org/abs/2209.07772. (arXiv: 2209.07772)
Abstract
We show that the $b$-Coloring problem is complete for the class XNLP when<br>parameterized by the pathwidth of the input graph. Besides determining the<br>precise parameterized complexity of this problem, this implies that b-Coloring<br>parameterized by pathwidth is $W[t]$-hard for all $t$, and resolves the<br>parameterized complexity of $b$-Coloring parameterized by treewidth.<br>
Export
BibTeX
@online{Jaffke2209.07772, TITLE = {$b$-Coloring Parameterized by Pathwidth is {XNLP}-complete}, AUTHOR = {Jaffke, Lars and Lima, Paloma T. and Sharma, Roohani}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2209.07772}, EPRINT = {2209.07772}, EPRINTTYPE = {arXiv}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We show that the $b$-Coloring problem is complete for the class XNLP when<br>parameterized by the pathwidth of the input graph. Besides determining the<br>precise parameterized complexity of this problem, this implies that b-Coloring<br>parameterized by pathwidth is $W[t]$-hard for all $t$, and resolves the<br>parameterized complexity of $b$-Coloring parameterized by treewidth.<br>}, }
Endnote
%0 Report %A Jaffke, Lars %A Lima, Paloma T. %A Sharma, Roohani %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T b-Coloring Parameterized by Pathwidth is XNLP-complete : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1E7E-7 %U https://arxiv.org/abs/2209.07772 %D 2022 %X We show that the $b$-Coloring problem is complete for the class XNLP when<br>parameterized by the pathwidth of the input graph. Besides determining the<br>precise parameterized complexity of this problem, this implies that b-Coloring<br>parameterized by pathwidth is $W[t]$-hard for all $t$, and resolves the<br>parameterized complexity of $b$-Coloring parameterized by treewidth.<br> %K Computer Science, Computational Complexity, cs.CC,Computer Science, Data Structures and Algorithms, cs.DS
[89]
Y. Jiang and C. Zheng, “Robust and Optimal Contention Resolution without Collision Detection,” in SPAA ’22, 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, 2022.
Export
BibTeX
@inproceedings{Jiang_SPAA22, TITLE = {Robust and Optimal Contention Resolution without Collision Detection}, AUTHOR = {Jiang, Yonggang and Zheng, Chaodong}, LANGUAGE = {eng}, ISBN = {978-1-4503-9146-7}, DOI = {10.1145/3490148.3538592}, PUBLISHER = {ACM}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {SPAA '22, 34th ACM Symposium on Parallelism in Algorithms and Architectures}, EDITOR = {Agrawal, Kunal and Lee, I-Ting Angelina}, PAGES = {107--118}, ADDRESS = {Philadelphia, PA, USA}, }
Endnote
%0 Conference Proceedings %A Jiang, Yonggang %A Zheng, Chaodong %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Robust and Optimal Contention Resolution without Collision Detection : %G eng %U http://hdl.handle.net/21.11116/0000-000C-104C-D %R 10.1145/3490148.3538592 %D 2022 %B 34th ACM Symposium on Parallelism in Algorithms and Architectures %Z date of event: 2022-07-11 - 2022-07-14 %C Philadelphia, PA, USA %B SPAA '22 %E Agrawal, Kunal; Lee, I-Ting Angelina %P 107 - 118 %I ACM %@ 978-1-4503-9146-7
[90]
E. J. Kim, T. Masařík, M. Pilipczuk, R. Sharma, and M. Wahlström, “On Weighted Graph Separation Problems and Flow-Augmentation,” 2022. [Online]. Available: https://arxiv.org/abs/2208.14841. (arXiv: 2208.14841)
Abstract
One of the first application of the recently introduced technique of<br>\emph{flow-augmentation} [Kim et al., STOC 2022] is a fixed-parameter algorithm<br>for the weighted version of \textsc{Directed Feedback Vertex Set}, a landmark<br>problem in parameterized complexity. In this note we explore applicability of<br>flow-augmentation to other weighted graph separation problems parameterized by<br>the size of the cutset. We show the following. -- In weighted undirected graphs<br>\textsc{Multicut} is FPT, both in the edge- and vertex-deletion version. -- The<br>weighted version of \textsc{Group Feedback Vertex Set} is FPT, even with an<br>oracle access to group operations. -- The weighted version of \textsc{Directed<br>Subset Feedback Vertex Set} is FPT. Our study reveals \textsc{Directed<br>Symmetric Multicut} as the next important graph separation problem whose<br>parameterized complexity remains unknown, even in the unweighted setting.<br>
Export
BibTeX
@online{Kim2208.14841, TITLE = {On Weighted Graph Separation Problems and Flow-Augmentation}, AUTHOR = {Kim, Eun Jung and Masa{\v r}{\'i}k, Tom{\'a}{\v s} and Pilipczuk, Marcin and Sharma, Roohani and Wahlstr{\"o}m, Magnus}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2208.14841}, EPRINT = {2208.14841}, EPRINTTYPE = {arXiv}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, ABSTRACT = {One of the first application of the recently introduced technique of<br>\emph{flow-augmentation} [Kim et al., STOC 2022] is a fixed-parameter algorithm<br>for the weighted version of \textsc{Directed Feedback Vertex Set}, a landmark<br>problem in parameterized complexity. In this note we explore applicability of<br>flow-augmentation to other weighted graph separation problems parameterized by<br>the size of the cutset. We show the following. -- In weighted undirected graphs<br>\textsc{Multicut} is FPT, both in the edge- and vertex-deletion version. -- The<br>weighted version of \textsc{Group Feedback Vertex Set} is FPT, even with an<br>oracle access to group operations. -- The weighted version of \textsc{Directed<br>Subset Feedback Vertex Set} is FPT. Our study reveals \textsc{Directed<br>Symmetric Multicut} as the next important graph separation problem whose<br>parameterized complexity remains unknown, even in the unweighted setting.<br>}, }
Endnote
%0 Report %A Kim, Eun Jung %A Masa&#345;&#237;k, Tom&#225;&#353; %A Pilipczuk, Marcin %A Sharma, Roohani %A Wahlstr&#246;m, Magnus %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T On Weighted Graph Separation Problems and Flow-Augmentation : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1E78-D %U https://arxiv.org/abs/2208.14841 %D 2022 %X One of the first application of the recently introduced technique of<br>\emph{flow-augmentation} [Kim et al., STOC 2022] is a fixed-parameter algorithm<br>for the weighted version of \textsc{Directed Feedback Vertex Set}, a landmark<br>problem in parameterized complexity. In this note we explore applicability of<br>flow-augmentation to other weighted graph separation problems parameterized by<br>the size of the cutset. We show the following. -- In weighted undirected graphs<br>\textsc{Multicut} is FPT, both in the edge- and vertex-deletion version. -- The<br>weighted version of \textsc{Group Feedback Vertex Set} is FPT, even with an<br>oracle access to group operations. -- The weighted version of \textsc{Directed<br>Subset Feedback Vertex Set} is FPT. Our study reveals \textsc{Directed<br>Symmetric Multicut} as the next important graph separation problem whose<br>parameterized complexity remains unknown, even in the unweighted setting.<br> %K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Computational Complexity, cs.CC,
[91]
A. Kinali-Dogan, “On Time, Time Synchronization and Noise in Time Measurement Systems,” Universität des Saarlandes, Saarbrücken, 2022.
Export
BibTeX
@phdthesis{Attilaphd2022, TITLE = {On Time, Time Synchronization and Noise in Time Measurement Systems}, AUTHOR = {Kinali-Dogan, Attila}, LANGUAGE = {eng}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, DATE = {2022}, }
Endnote
%0 Thesis %A Kinali-Dogan, Attila %Y Lenzen, Christoph %A referee: Mehlhorn, Kurt %A referee: Vernotte, Francoise %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society International Max Planck Research School, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T On Time, Time Synchronization and Noise in Time Measurement Systems : %G eng %U http://hdl.handle.net/21.11116/0000-000B-5436-A %I Universit&#228;t des Saarlandes %C Saarbr&#252;cken %D 2022 %P 140 p. %V phd %9 phd
[92]
D. Kirkpatrick, H. U. Simon, and S. Zilles, “Optimal Collusion-Free Teaching,” Journal of Machine Learning Research. (arXiv: 1903.04012, Accepted/in press)
Abstract
Formal models of learning from teachers need to respect certain criteria to<br>avoid collusion. The most commonly accepted notion of collusion-freeness was<br>proposed by Goldman and Mathias (1996), and various teaching models obeying<br>their criterion have been studied. For each model $M$ and each concept class<br>$\mathcal{C}$, a parameter $M$-$\mathrm{TD}(\mathcal{C})$ refers to the<br>teaching dimension of concept class $\mathcal{C}$ in model $M$---defined to be<br>the number of examples required for teaching a concept, in the worst case over<br>all concepts in $\mathcal{C}$.<br> This paper introduces a new model of teaching, called no-clash teaching,<br>together with the corresponding parameter $\mathrm{NCTD}(\mathcal{C})$.<br>No-clash teaching is provably optimal in the strong sense that, given any<br>concept class $\mathcal{C}$ and any model $M$ obeying Goldman and Mathias's<br>collusion-freeness criterion, one obtains $\mathrm{NCTD}(\mathcal{C})\le<br>M$-$\mathrm{TD}(\mathcal{C})$. We also study a corresponding notion<br>$\mathrm{NCTD}^+$ for the case of learning from positive data only, establish<br>useful bounds on $\mathrm{NCTD}$ and $\mathrm{NCTD}^+$, and discuss relations<br>of these parameters to the VC-dimension and to sample compression.<br> In addition to formulating an optimal model of collusion-free teaching, our<br>main results are on the computational complexity of deciding whether<br>$\mathrm{NCTD}^+(\mathcal{C})=k$ (or $\mathrm{NCTD}(\mathcal{C})=k$) for given<br>$\mathcal{C}$ and $k$. We show some such decision problems to be equivalent to<br>the existence question for certain constrained matchings in bipartite graphs.<br>Our NP-hardness results for the latter are of independent interest in the study<br>of constrained graph matchings.<br>
Export
BibTeX
@article{KirkpatrickJMLR, TITLE = {Optimal Collusion-Free Teaching}, AUTHOR = {Kirkpatrick, David and Simon, Hans U. and Zilles, Sandra}, LANGUAGE = {eng}, ISSN = {1532-4435}, EPRINT = {1903.04012}, EPRINTTYPE = {arXiv}, PUBLISHER = {JMLR.org}, YEAR = {2022}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Formal models of learning from teachers need to respect certain criteria to<br>avoid collusion. The most commonly accepted notion of collusion-freeness was<br>proposed by Goldman and Mathias (1996), and various teaching models obeying<br>their criterion have been studied. For each model $M$ and each concept class<br>$\mathcal{C}$, a parameter $M$-$\mathrm{TD}(\mathcal{C})$ refers to the<br>teaching dimension of concept class $\mathcal{C}$ in model $M$---defined to be<br>the number of examples required for teaching a concept, in the worst case over<br>all concepts in $\mathcal{C}$.<br> This paper introduces a new model of teaching, called no-clash teaching,<br>together with the corresponding parameter $\mathrm{NCTD}(\mathcal{C})$.<br>No-clash teaching is provably optimal in the strong sense that, given any<br>concept class $\mathcal{C}$ and any model $M$ obeying Goldman and Mathias's<br>collusion-freeness criterion, one obtains $\mathrm{NCTD}(\mathcal{C})\le<br>M$-$\mathrm{TD}(\mathcal{C})$. We also study a corresponding notion<br>$\mathrm{NCTD}^+$ for the case of learning from positive data only, establish<br>useful bounds on $\mathrm{NCTD}$ and $\mathrm{NCTD}^+$, and discuss relations<br>of these parameters to the VC-dimension and to sample compression.<br> In addition to formulating an optimal model of collusion-free teaching, our<br>main results are on the computational complexity of deciding whether<br>$\mathrm{NCTD}^+(\mathcal{C})=k$ (or $\mathrm{NCTD}(\mathcal{C})=k$) for given<br>$\mathcal{C}$ and $k$. We show some such decision problems to be equivalent to<br>the existence question for certain constrained matchings in bipartite graphs.<br>Our NP-hardness results for the latter are of independent interest in the study<br>of constrained graph matchings.<br>}, JOURNAL = {Journal of Machine Learning Research}, }
Endnote
%0 Journal Article %A Kirkpatrick, David %A Simon, Hans U. %A Zilles, Sandra %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Optimal Collusion-Free Teaching : %G eng %U http://hdl.handle.net/21.11116/0000-000C-332F-7 %D 2022 %X Formal models of learning from teachers need to respect certain criteria to<br>avoid collusion. The most commonly accepted notion of collusion-freeness was<br>proposed by Goldman and Mathias (1996), and various teaching models obeying<br>their criterion have been studied. For each model $M$ and each concept class<br>$\mathcal{C}$, a parameter $M$-$\mathrm{TD}(\mathcal{C})$ refers to the<br>teaching dimension of concept class $\mathcal{C}$ in model $M$---defined to be<br>the number of examples required for teaching a concept, in the worst case over<br>all concepts in $\mathcal{C}$.<br> This paper introduces a new model of teaching, called no-clash teaching,<br>together with the corresponding parameter $\mathrm{NCTD}(\mathcal{C})$.<br>No-clash teaching is provably optimal in the strong sense that, given any<br>concept class $\mathcal{C}$ and any model $M$ obeying Goldman and Mathias's<br>collusion-freeness criterion, one obtains $\mathrm{NCTD}(\mathcal{C})\le<br>M$-$\mathrm{TD}(\mathcal{C})$. We also study a corresponding notion<br>$\mathrm{NCTD}^+$ for the case of learning from positive data only, establish<br>useful bounds on $\mathrm{NCTD}$ and $\mathrm{NCTD}^+$, and discuss relations<br>of these parameters to the VC-dimension and to sample compression.<br> In addition to formulating an optimal model of collusion-free teaching, our<br>main results are on the computational complexity of deciding whether<br>$\mathrm{NCTD}^+(\mathcal{C})=k$ (or $\mathrm{NCTD}(\mathcal{C})=k$) for given<br>$\mathcal{C}$ and $k$. We show some such decision problems to be equivalent to<br>the existence question for certain constrained matchings in bipartite graphs.<br>Our NP-hardness results for the latter are of independent interest in the study<br>of constrained graph matchings.<br> %K Computer Science, Learning, cs.LG,Statistics, Machine Learning, stat.ML %J Journal of Machine Learning Research %I JMLR.org %@ false
[93]
S. Kisfaludi-Bak, J. Nederlof, and K. Węgrzycki, “A Gap-ETH-Tight Approximation Scheme for Euclidean TSP,” in FOCS 2021, IEEE 62nd Annual Symposium on Foundations of Computer Science, Denver, CO, USA (Virtual Conference), 2022.
Export
BibTeX
@inproceedings{Kisfaludi-Bak_FOCS21, TITLE = {A {G}ap-{ETH}-Tight Approximation Scheme for {E}uclidean {TSP}}, AUTHOR = {Kisfaludi-Bak, S{\'a}ndor and Nederlof, Jesper and W{\c e}grzycki, Karol}, LANGUAGE = {eng}, ISBN = {978-1-6654-2055-6}, DOI = {10.1109/FOCS52979.2021.00043}, PUBLISHER = {IEEE}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {FOCS 2021, IEEE 62nd Annual Symposium on Foundations of Computer Science}, PAGES = {351--362}, ADDRESS = {Denver, CO, USA (Virtual Conference)}, }
Endnote
%0 Conference Proceedings %A Kisfaludi-Bak, S&#225;ndor %A Nederlof, Jesper %A W&#281;grzycki, Karol %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Gap-ETH-Tight Approximation Scheme for Euclidean TSP : %G eng %U http://hdl.handle.net/21.11116/0000-000A-C557-6 %R 10.1109/FOCS52979.2021.00043 %D 2022 %B IEEE 62nd Annual Symposium on Foundations of Computer Science %Z date of event: 2022-02-07 - 2022-02-10 %C Denver, CO, USA (Virtual Conference) %B FOCS 2021 %P 351 - 362 %I IEEE %@ 978-1-6654-2055-6
[94]
T. Kociumaka, G. Navarro, and F. Olivares, “Near-Optimal Search Time in δ-Optimal Space,” in LATIN 2022: Theoretical Informatics, Guanajuato, Mexico, 2022.
Export
BibTeX
@inproceedings{Kociumaka_LATIN22, TITLE = {Near-optimal search time in $\delta$-optimal space}, AUTHOR = {Kociumaka, Tomasz and Navarro, Gonzalo and Olivares, Francisco}, LANGUAGE = {eng}, ISBN = {978-3-031-20623-8}, DOI = {10.1007/978-3-031-20624-5_6}, PUBLISHER = {Springer}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {LATIN 2022: Theoretical Informatics}, EDITOR = {Casta{\~n}eda, Armando and Rodr{\'i}guez-Henr{\'i}quez, Francisco}, PAGES = {88--103}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {13568}, ADDRESS = {Guanajuato, Mexico}, }
Endnote
%0 Conference Proceedings %A Kociumaka, Tomasz %A Navarro, Gonzalo %A Olivares, Francisco %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Near-Optimal Search Time in &#948;-Optimal Space : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1534-2 %R 10.1007/978-3-031-20624-5_6 %D 2022 %B 5th Latin American Theoretical Informatics Symposium %Z date of event: 2022-11-07 - 2022-11-11 %C Guanajuato, Mexico %B LATIN 2022: Theoretical Informatics %E Casta&#241;eda, Armando; Rodr&#237;guez-Henr&#237;quez, Francisco %P 88 - 103 %I Springer %@ 978-3-031-20623-8 %B Lecture Notes in Computer Science %N 13568 %U https://rdcu.be/c19vn
[95]
T. Kociumaka, G. Navarro, and N. Prezza, “Towards a Definitive Compressibility Measure for Repetitive Sequences,” IEEE Transactions on Information Theory, 2022.
Export
BibTeX
@article{TIT22, TITLE = {Towards a Definitive Compressibility Measure for Repetitive Sequences}, AUTHOR = {Kociumaka, Tomasz and Navarro, Gonzalo and Prezza, Nicola}, LANGUAGE = {eng}, ISSN = {0018-9448}, DOI = {10.1109/TIT.2022.3224382}, PUBLISHER = {IEEE}, ADDRESS = {Piscataway, NJ}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, JOURNAL = {IEEE Transactions on Information Theory}, }
Endnote
%0 Journal Article %A Kociumaka, Tomasz %A Navarro, Gonzalo %A Prezza, Nicola %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Towards a Definitive Compressibility Measure for Repetitive Sequences : %G eng %U http://hdl.handle.net/21.11116/0000-000C-150A-2 %R 10.1109/TIT.2022.3224382 %7 2022 %D 2022 %J IEEE Transactions on Information Theory %I IEEE %C Piscataway, NJ %@ false
[96]
R. Krithika, R. Sharma, and P. Tale, “The Complexity of Contracting Bipartite Graphs into Small Cycles,” in Graph-Theoretic Concepts in Computer Science (WG 2022), Tübingen, Germany, 2022.
Export
BibTeX
@inproceedings{KrithikaWG22, TITLE = {The Complexity of Contracting Bipartite Graphs into Small Cycles}, AUTHOR = {Krithika, R. and Sharma, Roohani and Tale, Prafullkumar}, LANGUAGE = {eng}, ISBN = {978-3-031-15913-8}, DOI = {10.1007/978-3-031-15914-5_26}, PUBLISHER = {Springer}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, DATE = {2022}, BOOKTITLE = {Graph-Theoretic Concepts in Computer Science (WG 2022)}, EDITOR = {Bekos, Michael A. and Kaufmann, Michael}, PAGES = {356--369}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {13453}, ADDRESS = {T{\"u}bingen, Germany}, }
Endnote
%0 Conference Proceedings %A Krithika, R. %A Sharma, Roohani %A Tale, Prafullkumar %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T The Complexity of Contracting Bipartite Graphs into Small Cycles : %G eng %U http://hdl.handle.net/21.11116/0000-000B-5928-5 %R 10.1007/978-3-031-15914-5_26 %D 2022 %B 48th International Workshop on Graph-Theoretic Concepts in Computer Science %Z date of event: 2022-06-22 - 2022-06-24 %C T&#252;bingen, Germany %B Graph-Theoretic Concepts in Computer Science %E Bekos, Michael A.; Kaufmann, Michael %P 356 - 369 %I Springer %@ 978-3-031-15913-8 %B Lecture Notes in Computer Science %N 13453
[97]
R. Krithika, R. Sharma, and P. Tale, “The Complexity of Contracting Bipartite Graphs into Small Cycles,” 2022. [Online]. Available: https://arxiv.org/abs/2206.07358. (arXiv: 2206.07358)
Abstract
For a positive integer $\ell \geq 3$, the $C_\ell$-Contractibility problem<br>takes as input an undirected simple graph $G$ and determines whether $G$ can be<br>transformed into a graph isomorphic to $C_\ell$ (the induced cycle on $\ell$<br>vertices) using only edge contractions. Brouwer and Veldman [JGT 1987] showed<br>that $C_4$-Contractibility is NP-complete in general graphs. It is easy to<br>verify that $C_3$-Contractibility is polynomial-time solvable. Dabrowski and<br>Paulusma [IPL 2017] showed that $C_{\ell}$-Contractibility is \NP-complete\ on<br>bipartite graphs for $\ell = 6$ and posed as open problems the status of the<br>problem when $\ell$ is 4 or 5. In this paper, we show that both<br>$C_5$-Contractibility and $C_4$-Contractibility are NP-complete on bipartite<br>graphs.<br>
Export
BibTeX
@online{Krithika22, TITLE = {The Complexity of Contracting Bipartite Graphs into Small Cycles}, AUTHOR = {Krithika, R. and Sharma, Roohani and Tale, Prafullkumar}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2206.07358}, EPRINT = {2206.07358}, EPRINTTYPE = {arXiv}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, ABSTRACT = {For a positive integer $\ell \geq 3$, the $C_\ell$-Contractibility problem<br>takes as input an undirected simple graph $G$ and determines whether $G$ can be<br>transformed into a graph isomorphic to $C_\ell$ (the induced cycle on $\ell$<br>vertices) using only edge contractions. Brouwer and Veldman [JGT 1987] showed<br>that $C_4$-Contractibility is NP-complete in general graphs. It is easy to<br>verify that $C_3$-Contractibility is polynomial-time solvable. Dabrowski and<br>Paulusma [IPL 2017] showed that $C_{\ell}$-Contractibility is \NP-complete\ on<br>bipartite graphs for $\ell = 6$ and posed as open problems the status of the<br>problem when $\ell$ is 4 or 5. In this paper, we show that both<br>$C_5$-Contractibility and $C_4$-Contractibility are NP-complete on bipartite<br>graphs.<br>}, }
Endnote
%0 Report %A Krithika, R. %A Sharma, Roohani %A Tale, Prafullkumar %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T The Complexity of Contracting Bipartite Graphs into Small Cycles : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1DCB-0 %U https://arxiv.org/abs/2206.07358 %D 2022 %X For a positive integer $\ell \geq 3$, the $C_\ell$-Contractibility problem<br>takes as input an undirected simple graph $G$ and determines whether $G$ can be<br>transformed into a graph isomorphic to $C_\ell$ (the induced cycle on $\ell$<br>vertices) using only edge contractions. Brouwer and Veldman [JGT 1987] showed<br>that $C_4$-Contractibility is NP-complete in general graphs. It is easy to<br>verify that $C_3$-Contractibility is polynomial-time solvable. Dabrowski and<br>Paulusma [IPL 2017] showed that $C_{\ell}$-Contractibility is \NP-complete\ on<br>bipartite graphs for $\ell = 6$ and posed as open problems the status of the<br>problem when $\ell$ is 4 or 5. In this paper, we show that both<br>$C_5$-Contractibility and $C_4$-Contractibility are NP-complete on bipartite<br>graphs.<br> %K Computer Science, Computational Complexity, cs.CC
[98]
M. Künnemann and A. Nusser, “Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022), Virtual, 2022.
Export
BibTeX
@inproceedings{Kuennemann_SODA22b, TITLE = {Polygon Placement Revisited: (Degree of Freedom + 1)-{SUM} Hardness and an Improvement via Offline Dynamic Rectangle Union}, AUTHOR = {K{\"u}nnemann, Marvin and Nusser, Andr{\'e}}, LANGUAGE = {eng}, ISBN = {978-1-61197-707-3}, DOI = {10.1137/1.9781611977073}, PUBLISHER = {SIAM}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022)}, EDITOR = {Naor, Seffi and Buchbinder, Niv}, PAGES = {3181--3201}, ADDRESS = {Virtual}, }
Endnote
%0 Conference Proceedings %A K&#252;nnemann, Marvin %A Nusser, Andr&#233; %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1F8F-2 %R 10.1137/1.9781611977073 %D 2022 %B Thirty-Third Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2022-01-09 - 2022-01-12 %C Virtual %B Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms %E Naor, Seffi; Buchbinder, Niv %P 3181 - 3201 %I SIAM %@ 978-1-61197-707-3
[99]
F. Mansouri, H. U. Simon, A. Singla, and S. Zilles, “On Batch Teaching with Sample Complexity Bounded by VCD,” in Advances in Neural Information Processing Systems 35 (NeurIPS 2022), New Orleans, LO. (Accepted/in press)
Export
BibTeX
@inproceedings{Mansouri_Neurips22, TITLE = {On Batch Teaching with Sample Complexity Bounded by {VCD}}, AUTHOR = {Mansouri, Farnam and Simon, Hans U. and Singla, Adish and Zilles, Sandra}, LANGUAGE = {eng}, YEAR = {2022}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Advances in Neural Information Processing Systems 35 (NeurIPS 2022)}, ADDRESS = {New Orleans, LO}, }
Endnote
%0 Conference Proceedings %A Mansouri, Farnam %A Simon, Hans U. %A Singla, Adish %A Zilles, Sandra %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T On Batch Teaching with Sample Complexity Bounded by VCD : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1601-A %D 2022 %B 36th Conference on Neural Information Processing Systems %Z date of event: 2022-11-28 - 2022-12-09 %C New Orleans, LO %B Advances in Neural Information Processing Systems 35 %U https://openreview.net/pdf?id=wKf5dRSartn
[100]
J. Nederlof, M. Pilipczuk, and K. Węgrzycki, “Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models,” 2022. [Online]. Available: https://arxiv.org/abs/2201.09340. (arXiv: 2201.09340)
Abstract
We study Koebe orderings of planar graphs: vertex orderings obtained by<br>modelling the graph as the intersection graph of pairwise internally-disjoint<br>discs in the plane, and ordering the vertices by non-increasing radii of the<br>associated discs. We prove that for every $d\in \mathbb{N}$, any such ordering<br>has $d$-admissibility bounded by $O(d/\ln d)$ and weak $d$-coloring number<br>bounded by $O(d^4 \ln d)$. This in particular shows that the $d$-admissibility<br>of planar graphs is bounded by $O(d/\ln d)$, which asymptotically matches a<br>known lower bound due to Dvo\v{r}\'ak and Siebertz.<br>
Export
BibTeX
@online{Nederlof2201.09340, TITLE = {Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models}, AUTHOR = {Nederlof, Jesper and Pilipczuk, Micha{\l} and W{\c e}grzycki, Karol}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2201.09340}, EPRINT = {2201.09340}, EPRINTTYPE = {arXiv}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We study Koebe orderings of planar graphs: vertex orderings obtained by<br>modelling the graph as the intersection graph of pairwise internally-disjoint<br>discs in the plane, and ordering the vertices by non-increasing radii of the<br>associated discs. We prove that for every $d\in \mathbb{N}$, any such ordering<br>has $d$-admissibility bounded by $O(d/\ln d)$ and weak $d$-coloring number<br>bounded by $O(d^4 \ln d)$. This in particular shows that the $d$-admissibility<br>of planar graphs is bounded by $O(d/\ln d)$, which asymptotically matches a<br>known lower bound due to Dvo\v{r}\'ak and Siebertz.<br>}, }
Endnote
%0 Report %A Nederlof, Jesper %A Pilipczuk, Micha&#322; %A W&#281;grzycki, Karol %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1EF3-1 %U https://arxiv.org/abs/2201.09340 %D 2022 %X We study Koebe orderings of planar graphs: vertex orderings obtained by<br>modelling the graph as the intersection graph of pairwise internally-disjoint<br>discs in the plane, and ordering the vertices by non-increasing radii of the<br>associated discs. We prove that for every $d\in \mathbb{N}$, any such ordering<br>has $d$-admissibility bounded by $O(d/\ln d)$ and weak $d$-coloring number<br>bounded by $O(d^4 \ln d)$. This in particular shows that the $d$-admissibility<br>of planar graphs is bounded by $O(d/\ln d)$, which asymptotically matches a<br>known lower bound due to Dvo\v{r}\'ak and Siebertz.<br> %K Mathematics, Combinatorics, math.CO,Computer Science, Discrete Mathematics, cs.DM
[101]
J. Nederlof, M. Pilipczuk, C. M. F. Swennenhuis, and K. Węgrzycki, “Isolation Schemes for Problems on Decomposable Graphs,” in 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), Marseille, France (Virtual Conference), 2022.
Export
BibTeX
@inproceedings{Nederlof_STACS2022, TITLE = {Isolation Schemes for Problems on Decomposable Graphs}, AUTHOR = {Nederlof, Jesper and Pilipczuk, Micha{\l} and Swennenhuis, C{\'e}line M. F. and W{\c e}grzycki, Karol}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-222-8}, URL = {urn:nbn:de:0030-drops-158601}, DOI = {10.4230/LIPIcs.STACS.2022.50}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, EDITOR = {Berenbrink, Petra and Monmege, Benjamin}, PAGES = {1--20}, EID = {50}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {219}, ADDRESS = {Marseille, France (Virtual Conference)}, }
Endnote
%0 Conference Proceedings %A Nederlof, Jesper %A Pilipczuk, Micha&#322; %A Swennenhuis, C&#233;line M. F. %A W&#281;grzycki, Karol %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Isolation Schemes for Problems on Decomposable Graphs : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1EEC-A %R 10.4230/LIPIcs.STACS.2022.50 %U urn:nbn:de:0030-drops-158601 %D 2022 %B 39th International Symposium on Theoretical Aspects of Computer Science %Z date of event: 2022-03-15 - 2022-03-18 %C Marseille, France (Virtual Conference) %B 39th International Symposium on Theoretical Aspects of Computer Science %E Berenbrink, Petra; Monmege, Benjamin %P 1 - 20 %Z sequence number: 50 %I Schloss Dagstuhl %@ 978-3-95977-222-8 %B Leibniz International Proceedings in Informatics %N 219 %@ false
[102]
J. Nederlof, C. M. F. Swennenhuis, and K. Węgrzycki, “Makespan Scheduling of Unit Jobs with Precedence Constraints in O(1.995n) time,” 2022. [Online]. Available: https://arxiv.org/abs/2208.02664. (arXiv: 2208.02664)
Abstract
In a classical scheduling problem, we are given a set of $n$ jobs of unit<br>length along with precedence constraints and the goal is to find a schedule of<br>these jobs on $m$ identical machines that minimizes the makespan. This problem<br>is well-known to be NP-hard for an unbounded number of machines. Using standard<br>3-field notation, it is known as $P|\text{prec}, p_j=1|C_{\max}$.<br> We present an algorithm for this problem that runs in $O(1.995^n)$ time.<br>Before our work, even for $m=3$ machines the best known algorithms ran in<br>$O^\ast(2^n)$ time. In contrast, our algorithm works when the number of<br>machines $m$ is unbounded. A crucial ingredient of our approach is an algorithm<br>with a runtime that is only single-exponential in the vertex cover of the<br>comparability graph of the precedence constraint graph. This heavily relies on<br>insights from a classical result by Dolev and Warmuth (Journal of Algorithms<br>1984) for precedence graphs without long chains.<br>
Export
BibTeX
@online{Nederlof2208.02664, TITLE = {Makespan Scheduling of Unit Jobs with Precedence Constraints in $O(1.995^n)$ time}, AUTHOR = {Nederlof, Jesper and Swennenhuis, C{\'e}line M. F. and W{\c e}grzycki, Karol}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2208.02664}, EPRINT = {2208.02664}, EPRINTTYPE = {arXiv}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, ABSTRACT = {In a classical scheduling problem, we are given a set of $n$ jobs of unit<br>length along with precedence constraints and the goal is to find a schedule of<br>these jobs on $m$ identical machines that minimizes the makespan. This problem<br>is well-known to be NP-hard for an unbounded number of machines. Using standard<br>3-field notation, it is known as $P|\text{prec}, p_j=1|C_{\max}$.<br> We present an algorithm for this problem that runs in $O(1.995^n)$ time.<br>Before our work, even for $m=3$ machines the best known algorithms ran in<br>$O^\ast(2^n)$ time. In contrast, our algorithm works when the number of<br>machines $m$ is unbounded. A crucial ingredient of our approach is an algorithm<br>with a runtime that is only single-exponential in the vertex cover of the<br>comparability graph of the precedence constraint graph. This heavily relies on<br>insights from a classical result by Dolev and Warmuth (Journal of Algorithms<br>1984) for precedence graphs without long chains.<br>}, }
Endnote
%0 Report %A Nederlof, Jesper %A Swennenhuis, C&#233;line M. F. %A W&#281;grzycki, Karol %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Makespan Scheduling of Unit Jobs with Precedence Constraints in O(1.995n) time : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1F35-7 %U https://arxiv.org/abs/2208.02664 %D 2022 %X In a classical scheduling problem, we are given a set of $n$ jobs of unit<br>length along with precedence constraints and the goal is to find a schedule of<br>these jobs on $m$ identical machines that minimizes the makespan. This problem<br>is well-known to be NP-hard for an unbounded number of machines. Using standard<br>3-field notation, it is known as $P|\text{prec}, p_j=1|C_{\max}$.<br> We present an algorithm for this problem that runs in $O(1.995^n)$ time.<br>Before our work, even for $m=3$ machines the best known algorithms ran in<br>$O^\ast(2^n)$ time. In contrast, our algorithm works when the number of<br>machines $m$ is unbounded. A crucial ingredient of our approach is an algorithm<br>with a runtime that is only single-exponential in the vertex cover of the<br>comparability graph of the precedence constraint graph. This heavily relies on<br>insights from a classical result by Dolev and Warmuth (Journal of Algorithms<br>1984) for precedence graphs without long chains.<br> %K Computer Science, Data Structures and Algorithms, cs.DS
[103]
A. Nusser, “Fine-Grained Complexity and Algorithm Engineering of Geometric Similarity Measures,” Universität des Saarlandes, Saarbrücken, 2022.
Export
BibTeX
@phdthesis{NusserPhD22, TITLE = {Fine-Grained Complexity and Algorithm Engineering of Geometric Similarity Measures}, AUTHOR = {Nusser, Andr{\'e}}, LANGUAGE = {eng}, URL = {urn:nbn:de:bsz:291--ds-370184}, DOI = {10.22028/D291-37018}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, }
Endnote
%0 Thesis %A Nusser, Andr&#233; %Y Bringmann, Karl %A referee: Mehlhorn, Kurt %A referee: Chan, Timothy %A referee: de Ber, Mark %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society International Max Planck Research School, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Fine-Grained Complexity and Algorithm Engineering of Geometric Similarity Measures : %G eng %U http://hdl.handle.net/21.11116/0000-000C-2693-3 %R 10.22028/D291-37018 %U urn:nbn:de:bsz:291--ds-370184 %F OTHER: hdl:20.500.11880/33904 %I Universit&#228;t des Saarlandes %C Saarbr&#252;cken %D 2022 %P XIV, 210 p. %V phd %9 phd %U https://publikationen.sulb.uni-saarland.de/handle/20.500.11880/33904
[104]
B. Ray Chaudhury, Y. K. Cheung, J. Garg, N. Garg, M. Hoefer, and K. Mehlhorn, “Fair Division of Indivisible Goods for a Class of Concave Valuations,” Journal of Artificial Intelligence Research, vol. 74, 2022.
Export
BibTeX
@article{RayChaudhury22, TITLE = {Fair Division of Indivisible Goods for a Class of Concave Valuations}, AUTHOR = {Ray Chaudhury, Bhaskar and Cheung, Yun Kuen and Garg, Jugal and Garg, Naveen and Hoefer, Martin and Mehlhorn, Kurt}, LANGUAGE = {eng}, ISSN = {1076-9757}, DOI = {10.1613/jair.1.12911}, PUBLISHER = {AI Access Foundation}, ADDRESS = {S.l.}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, JOURNAL = {Journal of Artificial Intelligence Research}, VOLUME = {74}, PAGES = {111--142}, }
Endnote
%0 Journal Article %A Ray Chaudhury, Bhaskar %A Cheung, Yun Kuen %A Garg, Jugal %A Garg, Naveen %A Hoefer, Martin %A Mehlhorn, Kurt %+ External Organizations External Organizations External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Fair Division of Indivisible Goods for a Class of Concave Valuations : %G eng %U http://hdl.handle.net/21.11116/0000-000A-9DB8-6 %R 10.1613/jair.1.12911 %7 2022 %D 2022 %J Journal of Artificial Intelligence Research %V 74 %& 111 %P 111 - 142 %I AI Access Foundation %C S.l. %@ false
[105]
M. Roth, J. Schmitt, and P. Wellnitz, “Counting Small Induced Subgraphs Satisfying Monotone Properties,” SIAM Journal on Computing, 2022.
Export
BibTeX
@article{Roth22, TITLE = {Counting Small Induced Subgraphs Satisfying Monotone Properties}, AUTHOR = {Roth, Marc and Schmitt, Johannes and Wellnitz, Philip}, LANGUAGE = {eng}, ISSN = {0097-5397}, DOI = {10.1137/20M1365624}, PUBLISHER = {SIAM}, ADDRESS = {Philadelphia, PA}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, JOURNAL = {SIAM Journal on Computing}, PAGES = {FOCS20-139--FOCS20-174}, }
Endnote
%0 Journal Article %A Roth, Marc %A Schmitt, Johannes %A Wellnitz, Philip %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Counting Small Induced Subgraphs Satisfying Monotone Properties : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1EB6-6 %R 10.1137/20M1365624 %7 2022 %D 2022 %J SIAM Journal on Computing %& FOCS20-139 %P FOCS20-139 - FOCS20-174 %I SIAM %C Philadelphia, PA %@ false
[106]
H. U. Simon, “Tournaments, Johnson Graphs, and NC-Teaching.” [Online]. Available: https://arxiv.org/abs/2205.02792. (arXiv: 2205.02792)
Abstract
Quite recently a teaching model, called "No-Clash Teaching" or simply<br>"NC-Teaching", had been suggested that is provably optimal in the following<br>strong sense. First, it satisfies Goldman and Matthias' collusion-freeness<br>condition. Second, the NC-teaching dimension (= NCTD) is smaller than or equal<br>to the teaching dimension with respect to any other collusion-free teaching<br>model. It has also been shown that any concept class which has NC-teaching<br>dimension $d$ and is defined over a domain of size $n$ can have at most $2^d<br>\binom{n}{d}$ concepts. The main results in this paper are as follows. First,<br>we characterize the maximum concept classes of NC-teaching dimension $1$ as<br>classes which are induced by tournaments (= complete oriented graphs) in a very<br>natural way. Second, we show that there exists a family $(\cC_n)_{n\ge1}$ of<br>concept classes such that the well known recursive teaching dimension (= RTD)<br>of $\cC_n$ grows logarithmically in $n = |\cC_n|$ while, for every $n\ge1$, the<br>NC-teaching dimension of $\cC_n$ equals $1$. Since the recursive teaching<br>dimension of a finite concept class $\cC$ is generally bounded $\log|\cC|$, the<br>family $(\cC_n)_{n\ge1}$ separates RTD from NCTD in the most striking way. The<br>proof of existence of the family $(\cC_n)_{n\ge1}$ makes use of the<br>probabilistic method and random tournaments. Third, we improve the<br>afore-mentioned upper bound $2^d\binom{n}{d}$ by a factor of order $\sqrt{d}$.<br>The verification of the superior bound makes use of Johnson graphs and maximum<br>subgraphs not containing large narrow cliques.<br>
Export
BibTeX
@online{Simon2205.02792, TITLE = {Tournaments, Johnson Graphs, and {NC}-Teaching}, AUTHOR = {Simon, Hans U.}, URL = {https://arxiv.org/abs/2205.02792}, EPRINT = {2205.02792}, EPRINTTYPE = {arXiv}, ABSTRACT = {Quite recently a teaching model, called "No-Clash Teaching" or simply<br>"NC-Teaching", had been suggested that is provably optimal in the following<br>strong sense. First, it satisfies Goldman and Matthias' collusion-freeness<br>condition. Second, the NC-teaching dimension (= NCTD) is smaller than or equal<br>to the teaching dimension with respect to any other collusion-free teaching<br>model. It has also been shown that any concept class which has NC-teaching<br>dimension $d$ and is defined over a domain of size $n$ can have at most $2^d<br>\binom{n}{d}$ concepts. The main results in this paper are as follows. First,<br>we characterize the maximum concept classes of NC-teaching dimension $1$ as<br>classes which are induced by tournaments (= complete oriented graphs) in a very<br>natural way. Second, we show that there exists a family $(\cC_n)_{n\ge1}$ of<br>concept classes such that the well known recursive teaching dimension (= RTD)<br>of $\cC_n$ grows logarithmically in $n = |\cC_n|$ while, for every $n\ge1$, the<br>NC-teaching dimension of $\cC_n$ equals $1$. Since the recursive teaching<br>dimension of a finite concept class $\cC$ is generally bounded $\log|\cC|$, the<br>family $(\cC_n)_{n\ge1}$ separates RTD from NCTD in the most striking way. The<br>proof of existence of the family $(\cC_n)_{n\ge1}$ makes use of the<br>probabilistic method and random tournaments. Third, we improve the<br>afore-mentioned upper bound $2^d\binom{n}{d}$ by a factor of order $\sqrt{d}$.<br>The verification of the superior bound makes use of Johnson graphs and maximum<br>subgraphs not containing large narrow cliques.<br>}, }
Endnote
%0 Report %A Simon, Hans U. %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Tournaments, Johnson Graphs, and NC-Teaching : %U http://hdl.handle.net/21.11116/0000-000C-1606-5 %U https://arxiv.org/abs/2205.02792 %D 2022 %8 05.05.2022 %X Quite recently a teaching model, called "No-Clash Teaching" or simply<br>"NC-Teaching", had been suggested that is provably optimal in the following<br>strong sense. First, it satisfies Goldman and Matthias' collusion-freeness<br>condition. Second, the NC-teaching dimension (= NCTD) is smaller than or equal<br>to the teaching dimension with respect to any other collusion-free teaching<br>model. It has also been shown that any concept class which has NC-teaching<br>dimension $d$ and is defined over a domain of size $n$ can have at most $2^d<br>\binom{n}{d}$ concepts. The main results in this paper are as follows. First,<br>we characterize the maximum concept classes of NC-teaching dimension $1$ as<br>classes which are induced by tournaments (= complete oriented graphs) in a very<br>natural way. Second, we show that there exists a family $(\cC_n)_{n\ge1}$ of<br>concept classes such that the well known recursive teaching dimension (= RTD)<br>of $\cC_n$ grows logarithmically in $n = |\cC_n|$ while, for every $n\ge1$, the<br>NC-teaching dimension of $\cC_n$ equals $1$. Since the recursive teaching<br>dimension of a finite concept class $\cC$ is generally bounded $\log|\cC|$, the<br>family $(\cC_n)_{n\ge1}$ separates RTD from NCTD in the most striking way. The<br>proof of existence of the family $(\cC_n)_{n\ge1}$ makes use of the<br>probabilistic method and random tournaments. Third, we improve the<br>afore-mentioned upper bound $2^d\binom{n}{d}$ by a factor of order $\sqrt{d}$.<br>The verification of the superior bound makes use of Johnson graphs and maximum<br>subgraphs not containing large narrow cliques.<br> %K Mathematics, Combinatorics, math.CO,Computer Science, Discrete Mathematics, cs.DM
[107]
B. Wiederhake, “Pulse Propagation, Graph Cover, and Packet Forwarding,” Universität des Saarlandes, Saarbrücken, 2022.
Abstract
We study distributed systems, with a particular focus on graph problems and fault<br>tolerance.<br>Fault-tolerance in a microprocessor or even System-on-Chip can be improved by using<br>a fault-tolerant pulse propagation design. The existing design TRIX achieves this goal<br>by being a distributed system consisting of very simple nodes. We show that even in<br>the typical mode of operation without faults, TRIX performs significantly better than a<br>regular wire or clock tree: Statistical evaluation of our simulated experiments show that<br>we achieve a skew with standard deviation of O(log log H), where H is the height of the<br>TRIX grid.<br>The distance-r generalization of classic graph problems can give us insights on how<br>distance affects hardness of a problem. For the distance-r dominating set problem, we<br>present both an algorithmic upper and unconditional lower bound for any graph class<br>with certain high-girth and sparseness criteria. In particular, our algorithm achieves a<br>O(r · f(r))-approximation in time O(r), where f is the expansion function, which correlates<br>with density. For constant r, this implies a constant approximation factor, in constant<br>time. We also show that no algorithm can achieve a (2r + 1 − δ)-approximation for any<br>δ > 0 in time O(r), not even on the class of cycles of girth at least 5r. Furthermore, we<br>extend the algorithm to related graph cover problems and even to a different execution<br>model.<br>Furthermore, we investigate the problem of packet forwarding, which addresses the<br>question of how and when best to forward packets in a distributed system. These packets<br>are injected by an adversary. We build on the existing algorithm OED to handle more<br>than a single destination. In particular, we show that buffers of size O(log n) are sufficient<br>for this algorithm, in contrast to O(n) for the naive approach.
Export
BibTeX
@phdthesis{Wiederhakephd2021, TITLE = {Pulse Propagation, Graph Cover, and Packet Forwarding}, AUTHOR = {Wiederhake, Ben}, LANGUAGE = {eng}, URL = {nbn:de:bsz:291--ds-366085}, DOI = {10.22028/D291-36608}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2022}, MARGINALMARK = {$\bullet$}, DATE = {2022}, ABSTRACT = {We study distributed systems, with a particular focus on graph problems and fault<br>tolerance.<br>Fault-tolerance in a microprocessor or even System-on-Chip can be improved by using<br>a fault-tolerant pulse propagation design. The existing design TRIX achieves this goal<br>by being a distributed system consisting of very simple nodes. We show that even in<br>the typical mode of operation without faults, TRIX performs significantly better than a<br>regular wire or clock tree: Statistical evaluation of our simulated experiments show that<br>we achieve a skew with standard deviation of O(log log H), where H is the height of the<br>TRIX grid.<br>The distance-r generalization of classic graph problems can give us insights on how<br>distance affects hardness of a problem. For the distance-r dominating set problem, we<br>present both an algorithmic upper and unconditional lower bound for any graph class<br>with certain high-girth and sparseness criteria. In particular, our algorithm achieves a<br>O(r &#183; f(r))-approximation in time O(r), where f is the expansion function, which correlates<br>with density. For constant r, this implies a constant approximation factor, in constant<br>time. We also show that no algorithm can achieve a (2r + 1 {\textminus} $\delta$)-approximation for any<br>$\delta$ > 0 in time O(r), not even on the class of cycles of girth at least 5r. Furthermore, we<br>extend the algorithm to related graph cover problems and even to a different execution<br>model.<br>Furthermore, we investigate the problem of packet forwarding, which addresses the<br>question of how and when best to forward packets in a distributed system. These packets<br>are injected by an adversary. We build on the existing algorithm OED to handle more<br>than a single destination. In particular, we show that buffers of size O(log n) are sufficient<br>for this algorithm, in contrast to O(n) for the naive approach.}, }
Endnote
%0 Thesis %A Wiederhake, Ben %Y Lenzen, Christoph %A referee: Mehlhorn, Kurt %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Pulse Propagation, Graph Cover, and Packet Forwarding : %G eng %U http://hdl.handle.net/21.11116/0000-000A-CEBE-9 %R 10.22028/D291-36608 %U nbn:de:bsz:291--ds-366085 %F OTHER: hdl:20.500.11880/33316 %I Universit&#228;t des Saarlandes %C Saarbr&#252;cken %D 2022 %P 83 p. %V phd %9 phd %X We study distributed systems, with a particular focus on graph problems and fault<br>tolerance.<br>Fault-tolerance in a microprocessor or even System-on-Chip can be improved by using<br>a fault-tolerant pulse propagation design. The existing design TRIX achieves this goal<br>by being a distributed system consisting of very simple nodes. We show that even in<br>the typical mode of operation without faults, TRIX performs significantly better than a<br>regular wire or clock tree: Statistical evaluation of our simulated experiments show that<br>we achieve a skew with standard deviation of O(log log H), where H is the height of the<br>TRIX grid.<br>The distance-r generalization of classic graph problems can give us insights on how<br>distance affects hardness of a problem. For the distance-r dominating set problem, we<br>present both an algorithmic upper and unconditional lower bound for any graph class<br>with certain high-girth and sparseness criteria. In particular, our algorithm achieves a<br>O(r &#183; f(r))-approximation in time O(r), where f is the expansion function, which correlates<br>with density. For constant r, this implies a constant approximation factor, in constant<br>time. We also show that no algorithm can achieve a (2r + 1 &#8722; &#948;)-approximation for any<br>&#948; > 0 in time O(r), not even on the class of cycles of girth at least 5r. Furthermore, we<br>extend the algorithm to related graph cover problems and even to a different execution<br>model.<br>Furthermore, we investigate the problem of packet forwarding, which addresses the<br>question of how and when best to forward packets in a distributed system. These packets<br>are injected by an adversary. We build on the existing algorithm OED to handle more<br>than a single destination. In particular, we show that buffers of size O(log n) are sufficient<br>for this algorithm, in contrast to O(n) for the naive approach. %U https://publikationen.sulb.uni-saarland.de/handle/20.500.11880/33316
2021
[108]
H. Akrami, B. Ray Chaudhury, M. Hoefer, K. Mehlhorn, M. Schmalhofer, G. Shahkarami, G. Varricchio, Q. Vermande, and E. van Wijland, “Maximizing Nash Social Welfare in 2-Value Instances,” 2021. [Online]. Available: https://arxiv.org/abs/2107.08965. (arXiv: 2107.08965)
Abstract
We consider the problem of maximizing the Nash social welfare when allocating<br>a set $\mathcal{G}$ of indivisible goods to a set $\mathcal{N}$ of agents. We<br>study instances, in which all agents have 2-value additive valuations: The<br>value of every agent $i \in \mathcal{N}$ for every good $j \in \mathcal{G}$ is<br>$v_{ij} \in \{p,q\}$, for $p,q \in \mathbb{N}$, $p \le q$. Maybe surprisingly,<br>we design an algorithm to compute an optimal allocation in polynomial time if<br>$p$ divides $q$, i.e., when $p=1$ and $q \in \mathbb{N}$ after appropriate<br>scaling. The problem is \classNP-hard whenever $p$ and $q$ are coprime and $p<br>\ge 3$.<br> In terms of approximation, we present positive and negative results for<br>general $p$ and $q$. We show that our algorithm obtains an approximation ratio<br>of at most 1.0345. Moreover, we prove that the problem is \classAPX-hard, with<br>a lower bound of $1.000015$ achieved at $p/q = 4/5$.<br>
Export
BibTeX
@online{Akrami2107.08965, TITLE = {Maximizing Nash Social Welfare in 2-Value Instances}, AUTHOR = {Akrami, Hannaneh and Ray Chaudhury, Bhaskar and Hoefer, Martin and Mehlhorn, Kurt and Schmalhofer, Marco and Shahkarami, Golnoosh and Varricchio, Giovanna and Vermande, Quentin and van Wijland, Ernest}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2107.08965}, EPRINT = {2107.08965}, EPRINTTYPE = {arXiv}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We consider the problem of maximizing the Nash social welfare when allocating<br>a set $\mathcal{G}$ of indivisible goods to a set $\mathcal{N}$ of agents. We<br>study instances, in which all agents have 2-value additive valuations: The<br>value of every agent $i \in \mathcal{N}$ for every good $j \in \mathcal{G}$ is<br>$v_{ij} \in \{p,q\}$, for $p,q \in \mathbb{N}$, $p \le q$. Maybe surprisingly,<br>we design an algorithm to compute an optimal allocation in polynomial time if<br>$p$ divides $q$, i.e., when $p=1$ and $q \in \mathbb{N}$ after appropriate<br>scaling. The problem is \classNP-hard whenever $p$ and $q$ are coprime and $p<br>\ge 3$.<br> In terms of approximation, we present positive and negative results for<br>general $p$ and $q$. We show that our algorithm obtains an approximation ratio<br>of at most 1.0345. Moreover, we prove that the problem is \classAPX-hard, with<br>a lower bound of $1.000015$ achieved at $p/q = 4/5$.<br>}, }
Endnote
%0 Report %A Akrami, Hannaneh %A Ray Chaudhury, Bhaskar %A Hoefer, Martin %A Mehlhorn, Kurt %A Schmalhofer, Marco %A Shahkarami, Golnoosh %A Varricchio, Giovanna %A Vermande, Quentin %A van Wijland, Ernest %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Maximizing Nash Social Welfare in 2-Value Instances : %G eng %U http://hdl.handle.net/21.11116/0000-000C-2000-F %U https://arxiv.org/abs/2107.08965 %D 2021 %X We consider the problem of maximizing the Nash social welfare when allocating<br>a set $\mathcal{G}$ of indivisible goods to a set $\mathcal{N}$ of agents. We<br>study instances, in which all agents have 2-value additive valuations: The<br>value of every agent $i \in \mathcal{N}$ for every good $j \in \mathcal{G}$ is<br>$v_{ij} \in \{p,q\}$, for $p,q \in \mathbb{N}$, $p \le q$. Maybe surprisingly,<br>we design an algorithm to compute an optimal allocation in polynomial time if<br>$p$ divides $q$, i.e., when $p=1$ and $q \in \mathbb{N}$ after appropriate<br>scaling. The problem is \classNP-hard whenever $p$ and $q$ are coprime and $p<br>\ge 3$.<br> In terms of approximation, we present positive and negative results for<br>general $p$ and $q$. We show that our algorithm obtains an approximation ratio<br>of at most 1.0345. Moreover, we prove that the problem is \classAPX-hard, with<br>a lower bound of $1.000015$ achieved at $p/q = 4/5$.<br> %K Computer Science, Computer Science and Game Theory, cs.GT
[109]
H. Akrami, B. Ray Chaudhury, K. Mehlhorn, G. Shahkarami, and Q. Vermande, “Nash Social Welfare for 2-value Instances,” 2021. [Online]. Available: https://arxiv.org/abs/2106.14816. (arXiv: 2106.14816)
Abstract
We study the problem of allocating a set of indivisible goods among agents<br>with 2-value additive valuations. Our goal is to find an allocation with<br>maximum Nash social welfare, i.e., the geometric mean of the valuations of the<br>agents. We give a polynomial-time algorithm to find a Nash social welfare<br>maximizing allocation when the valuation functions are integrally 2-valued,<br>i.e., each agent has a value either $1$ or $p$ for each good, for some positive<br>integer $p$. We then extend our algorithm to find a better approximation factor<br>for general 2-value instances.<br>
Export
BibTeX
@online{Akrami2106.14816, TITLE = {Nash Social Welfare for 2-value Instances}, AUTHOR = {Akrami, Hannaneh and Ray Chaudhury, Bhaskar and Mehlhorn, Kurt and Shahkarami, Golnoosh and Vermande, Quentin}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2106.14816}, EPRINT = {2106.14816}, EPRINTTYPE = {arXiv}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We study the problem of allocating a set of indivisible goods among agents<br>with 2-value additive valuations. Our goal is to find an allocation with<br>maximum Nash social welfare, i.e., the geometric mean of the valuations of the<br>agents. We give a polynomial-time algorithm to find a Nash social welfare<br>maximizing allocation when the valuation functions are integrally 2-valued,<br>i.e., each agent has a value either $1$ or $p$ for each good, for some positive<br>integer $p$. We then extend our algorithm to find a better approximation factor<br>for general 2-value instances.<br>}, }
Endnote
%0 Report %A Akrami, Hannaneh %A Ray Chaudhury, Bhaskar %A Mehlhorn, Kurt %A Shahkarami, Golnoosh %A Vermande, Quentin %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Nash Social Welfare for 2-value Instances : %G eng %U http://hdl.handle.net/21.11116/0000-0008-DB45-4 %U https://arxiv.org/abs/2106.14816 %D 2021 %X We study the problem of allocating a set of indivisible goods among agents<br>with 2-value additive valuations. Our goal is to find an allocation with<br>maximum Nash social welfare, i.e., the geometric mean of the valuations of the<br>agents. We give a polynomial-time algorithm to find a Nash social welfare<br>maximizing allocation when the valuation functions are integrally 2-valued,<br>i.e., each agent has a value either $1$ or $p$ for each good, for some positive<br>integer $p$. We then extend our algorithm to find a better approximation factor<br>for general 2-value instances.<br> %K Computer Science, Computer Science and Game Theory, cs.GT
[110]
G. Amanatidis and P. Kleer, “Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals,” 2021. [Online]. Available: https://arxiv.org/abs/2110.09068. (arXiv: 2110.09068)
Abstract
The approximate uniform sampling of graphs with a given degree sequence is a<br>well-known, extensively studied problem in theoretical computer science and has<br>significant applications, e.g., in the analysis of social networks. In this<br>work we study an extension of the problem, where degree intervals are specified<br>rather than a single degree sequence. We are interested in sampling and<br>counting graphs whose degree sequences satisfy the degree interval constraints.<br>A natural scenario where this problem arises is in hypothesis testing on social<br>networks that are only partially observed.<br> In this work, we provide the first fully polynomial almost uniform sampler<br>(FPAUS) as well as the first fully polynomial randomized approximation scheme<br>(FPRAS) for sampling and counting, respectively, graphs with near-regular<br>degree intervals, in which every node $i$ has a degree from an interval not too<br>far away from a given $d \in \N$. In order to design our FPAUS, we rely on<br>various state-of-the-art tools from Markov chain theory and combinatorics. In<br>particular, we provide the first non-trivial algorithmic application of a<br>breakthrough result of Liebenau and Wormald (2017) regarding an asymptotic<br>formula for the number of graphs with a given near-regular degree sequence.<br>Furthermore, we also make use of the recent breakthrough of Anari et al. (2019)<br>on sampling a base of a matroid under a strongly log-concave probability<br>distribution.<br> As a more direct approach, we also study a natural Markov chain recently<br>introduced by Rechner, Strowick and M\"uller-Hannemann (2018), based on three<br>simple local operations: Switches, hinge flips, and additions/deletions of a<br>single edge. We obtain the first theoretical results for this Markov chain by<br>showing it is rapidly mixing for the case of near-regular degree intervals of<br>size at most one.<br>
Export
BibTeX
@online{Amanatidis_2110.09068, TITLE = {Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals}, AUTHOR = {Amanatidis, Georgios and Kleer, Pieter}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2110.09068}, EPRINT = {2110.09068}, EPRINTTYPE = {arXiv}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, ABSTRACT = {The approximate uniform sampling of graphs with a given degree sequence is a<br>well-known, extensively studied problem in theoretical computer science and has<br>significant applications, e.g., in the analysis of social networks. In this<br>work we study an extension of the problem, where degree intervals are specified<br>rather than a single degree sequence. We are interested in sampling and<br>counting graphs whose degree sequences satisfy the degree interval constraints.<br>A natural scenario where this problem arises is in hypothesis testing on social<br>networks that are only partially observed.<br> In this work, we provide the first fully polynomial almost uniform sampler<br>(FPAUS) as well as the first fully polynomial randomized approximation scheme<br>(FPRAS) for sampling and counting, respectively, graphs with near-regular<br>degree intervals, in which every node $i$ has a degree from an interval not too<br>far away from a given $d \in \N$. In order to design our FPAUS, we rely on<br>various state-of-the-art tools from Markov chain theory and combinatorics. In<br>particular, we provide the first non-trivial algorithmic application of a<br>breakthrough result of Liebenau and Wormald (2017) regarding an asymptotic<br>formula for the number of graphs with a given near-regular degree sequence.<br>Furthermore, we also make use of the recent breakthrough of Anari et al. (2019)<br>on sampling a base of a matroid under a strongly log-concave probability<br>distribution.<br> As a more direct approach, we also study a natural Markov chain recently<br>introduced by Rechner, Strowick and M\"uller-Hannemann (2018), based on three<br>simple local operations: Switches, hinge flips, and additions/deletions of a<br>single edge. We obtain the first theoretical results for this Markov chain by<br>showing it is rapidly mixing for the case of near-regular degree intervals of<br>size at most one.<br>}, }
Endnote
%0 Report %A Amanatidis, Georgios %A Kleer, Pieter %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals : %G eng %U http://hdl.handle.net/21.11116/0000-0009-B839-8 %U https://arxiv.org/abs/2110.09068 %D 2021 %X The approximate uniform sampling of graphs with a given degree sequence is a<br>well-known, extensively studied problem in theoretical computer science and has<br>significant applications, e.g., in the analysis of social networks. In this<br>work we study an extension of the problem, where degree intervals are specified<br>rather than a single degree sequence. We are interested in sampling and<br>counting graphs whose degree sequences satisfy the degree interval constraints.<br>A natural scenario where this problem arises is in hypothesis testing on social<br>networks that are only partially observed.<br> In this work, we provide the first fully polynomial almost uniform sampler<br>(FPAUS) as well as the first fully polynomial randomized approximation scheme<br>(FPRAS) for sampling and counting, respectively, graphs with near-regular<br>degree intervals, in which every node $i$ has a degree from an interval not too<br>far away from a given $d \in \N$. In order to design our FPAUS, we rely on<br>various state-of-the-art tools from Markov chain theory and combinatorics. In<br>particular, we provide the first non-trivial algorithmic application of a<br>breakthrough result of Liebenau and Wormald (2017) regarding an asymptotic<br>formula for the number of graphs with a given near-regular degree sequence.<br>Furthermore, we also make use of the recent breakthrough of Anari et al. (2019)<br>on sampling a base of a matroid under a strongly log-concave probability<br>distribution.<br> As a more direct approach, we also study a natural Markov chain recently<br>introduced by Rechner, Strowick and M\"uller-Hannemann (2018), based on three<br>simple local operations: Switches, hinge flips, and additions/deletions of a<br>single edge. We obtain the first theoretical results for this Markov chain by<br>showing it is rapidly mixing for the case of near-regular degree intervals of<br>size at most one.<br> %K Computer Science, Discrete Mathematics, cs.DM,Computer Science, Data Structures and Algorithms, cs.DS,Mathematics, Combinatorics, math.CO
[111]
I. Anagnostides, T. Gouleakis, and A. Marashian, “Robust Learning under Strong Noise via SQs,” in Proceedings of the 24th International Conference on Artificial Intelligence and Statistics (AISTATS 2021), Virtual Conference, 2021.
Export
BibTeX
@inproceedings{Anagnostides_AISTATS2020, TITLE = {Robust Learning under Strong Noise via {SQs}}, AUTHOR = {Anagnostides, Ioannis and Gouleakis, Themis and Marashian, Ali}, LANGUAGE = {eng}, URL = {https://proceedings.mlr.press/v130/anagnostides21a.html}, PUBLISHER = {PMLR}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Proceedings of the 24th International Conference on Artificial Intelligence and Statistics (AISTATS 2021)}, EDITOR = {Banerjee, Arindam and Fukumizu, Kenli}, PAGES = {3808--3816}, SERIES = {Proceedings of the Machine Learning Research}, VOLUME = {130}, ADDRESS = {Virtual Conference}, }
Endnote
%0 Conference Proceedings %A Anagnostides, Ioannis %A Gouleakis, Themis %A Marashian, Ali %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Robust Learning under Strong Noise via SQs : %G eng %U http://hdl.handle.net/21.11116/0000-0007-DBCD-C %U https://proceedings.mlr.press/v130/anagnostides21a.html %D 2021 %B 24th International Conference on Artificial Intelligence and Statistics %Z date of event: 2021-04-13 - 2021-04-15 %C Virtual Conference %B Proceedings of the 24th International Conference on Artificial Intelligence and Statistics %E Banerjee, Arindam; Fukumizu, Kenli %P 3808 - 3816 %I PMLR %B Proceedings of the Machine Learning Research %N 130
[112]
I. Anagnostides and T. Gouleakis, “Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model,” in 35th International Symposium on Distributed Computing (DISC 2021), Freiburg, Germany (Virtual Conference), 2021.
Export
BibTeX
@inproceedings{Anagnostides_DISC21, TITLE = {Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model}, AUTHOR = {Anagnostides, Ioannis and Gouleakis, Themis}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-210-5}, URL = {urn:nbn:de:0030-drops-148077}, DOI = {10.4230/LIPIcs.DISC.2021.5}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {35th International Symposium on Distributed Computing (DISC 2021)}, EDITOR = {Gilbert, Seth}, PAGES = {1--19}, EID = {5}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {209}, ADDRESS = {Freiburg, Germany (Virtual Conference)}, }
Endnote
%0 Conference Proceedings %A Anagnostides, Ioannis %A Gouleakis, Themis %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model : %G eng %U http://hdl.handle.net/21.11116/0000-000C-7306-C %R 10.4230/LIPIcs.DISC.2021.5 %U urn:nbn:de:0030-drops-148077 %D 2021 %B 35th International Symposium on Distributed Computing %Z date of event: 2021-10-04 - 2021-10-08 %C Freiburg, Germany (Virtual Conference) %B 35th International Symposium on Distributed Computing %E Gilbert, Seth %P 1 - 19 %Z sequence number: 5 %I Schloss Dagstuhl %@ 978-3-95977-210-5 %B Leibniz International Proceedings in Informatics %N 209 %@ false %U https://drops.dagstuhl.de/opus/volltexte/2021/14807/https://creativecommons.org/licenses/by/4.0/legalcode
[113]
I. Anagnostides, C. Lenzen, B. Haeupler, G. Zuzic, and T. Gouleakis, “Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts,” 2021. [Online]. Available: https://arxiv.org/abs/2109.05151. (arXiv: 2109.05151)
Abstract
In this work we refine the analysis of the distributed Laplacian solver<br>recently established by Forster, Goranci, Liu, Peng, Sun, and Ye (FOCS '21),<br>via the Ghaffari-Haeupler framework (SODA '16) of low-congestion shortcuts.<br>Specifically, if $\epsilon > 0$ represents the error of the solver, we derive<br>two main results. First, for any $n$-node graph $G$ with hop-diameter $D$ and<br>treewidth bounded by $k$, we show the existence of a Laplacian solver with<br>round complexity $O(n^{o(1)}kD \log(1/\epsilon))$ in the CONGEST model. For<br>graphs with bounded treewidth this circumvents the notorious $\Omega(\sqrt{n})$<br>lower bound for "global" problems in general graphs. Moreover, following a<br>recent line of work in distributed algorithms, we consider a hybrid<br>communication model which enhances CONGEST with very limited global power in<br>the form of the recently introduced node-capacitated clique. In this model, we<br>show the existence of a Laplacian solver with round complexity $O(n^{o(1)}<br>\log(1/\epsilon))$. The unifying thread of these results is an application of<br>accelerated distributed algorithms for a congested variant of the standard<br>part-wise aggregation problem that we introduce. This primitive constitutes the<br>primary building block for simulating "local" operations on low-congestion<br>minors, and we believe that this framework could be more generally applicable.<br>
Export
BibTeX
@online{Anagnostides_2109.05151, TITLE = {Almost Universally Optimal Distributed {L}aplacian Solvers via Low-Congestion Shortcuts}, AUTHOR = {Anagnostides, Ioannis and Lenzen, Christoph and Haeupler, Bernhard and Zuzic, Goran and Gouleakis, Themis}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2109.05151}, EPRINT = {2109.05151}, EPRINTTYPE = {arXiv}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, ABSTRACT = {In this work we refine the analysis of the distributed Laplacian solver<br>recently established by Forster, Goranci, Liu, Peng, Sun, and Ye (FOCS '21),<br>via the Ghaffari-Haeupler framework (SODA '16) of low-congestion shortcuts.<br>Specifically, if $\epsilon > 0$ represents the error of the solver, we derive<br>two main results. First, for any $n$-node graph $G$ with hop-diameter $D$ and<br>treewidth bounded by $k$, we show the existence of a Laplacian solver with<br>round complexity $O(n^{o(1)}kD \log(1/\epsilon))$ in the CONGEST model. For<br>graphs with bounded treewidth this circumvents the notorious $\Omega(\sqrt{n})$<br>lower bound for "global" problems in general graphs. Moreover, following a<br>recent line of work in distributed algorithms, we consider a hybrid<br>communication model which enhances CONGEST with very limited global power in<br>the form of the recently introduced node-capacitated clique. In this model, we<br>show the existence of a Laplacian solver with round complexity $O(n^{o(1)}<br>\log(1/\epsilon))$. The unifying thread of these results is an application of<br>accelerated distributed algorithms for a congested variant of the standard<br>part-wise aggregation problem that we introduce. This primitive constitutes the<br>primary building block for simulating "local" operations on low-congestion<br>minors, and we believe that this framework could be more generally applicable.<br>}, }
Endnote
%0 Report %A Anagnostides, Ioannis %A Lenzen, Christoph %A Haeupler, Bernhard %A Zuzic, Goran %A Gouleakis, Themis %+ External Organizations External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts : %G eng %U http://hdl.handle.net/21.11116/0000-0009-B83F-2 %U https://arxiv.org/abs/2109.05151 %D 2021 %X In this work we refine the analysis of the distributed Laplacian solver<br>recently established by Forster, Goranci, Liu, Peng, Sun, and Ye (FOCS '21),<br>via the Ghaffari-Haeupler framework (SODA '16) of low-congestion shortcuts.<br>Specifically, if $\epsilon > 0$ represents the error of the solver, we derive<br>two main results. First, for any $n$-node graph $G$ with hop-diameter $D$ and<br>treewidth bounded by $k$, we show the existence of a Laplacian solver with<br>round complexity $O(n^{o(1)}kD \log(1/\epsilon))$ in the CONGEST model. For<br>graphs with bounded treewidth this circumvents the notorious $\Omega(\sqrt{n})$<br>lower bound for "global" problems in general graphs. Moreover, following a<br>recent line of work in distributed algorithms, we consider a hybrid<br>communication model which enhances CONGEST with very limited global power in<br>the form of the recently introduced node-capacitated clique. In this model, we<br>show the existence of a Laplacian solver with round complexity $O(n^{o(1)}<br>\log(1/\epsilon))$. The unifying thread of these results is an application of<br>accelerated distributed algorithms for a congested variant of the standard<br>part-wise aggregation problem that we introduce. This primitive constitutes the<br>primary building block for simulating "local" operations on low-congestion<br>minors, and we believe that this framework could be more generally applicable.<br> %K Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC
[114]
H. An, M. Gurumukhani, R. Impagliazzo, M. Jaber, M. Künnemann, and M. P. P. Nina, “The Fine-Grained Complexity of Multi-Dimensional Ordering Properties,” in 16th International Symposium on Parameterized and Exact Computation (IPEC 2021), Lisbon, Portugal, 2021.
Export
BibTeX
@inproceedings{An_IPEC21, TITLE = {The Fine-Grained Complexity of Multi-Dimensional Ordering Properties}, AUTHOR = {An, Haozhe and Gurumukhani, Mohit and Impagliazzo, Russell and Jaber, Michael and K{\"u}nnemann, Marvin and Nina, Maria Paula Parga}, LANGUAGE = {eng}, ISBN = {978-3-95977-216-7}, URL = {urn:nbn:de:0030-drops-153869}, DOI = {10.4230/LIPIcs.IPEC.2021.3}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, EDITOR = {Golovach, Petr A. and Zehavi, Meirav}, PAGES = {1--15}, EID = {3}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {214}, ADDRESS = {Lisbon, Portugal}, }
Endnote
%0 Conference Proceedings %A An, Haozhe %A Gurumukhani, Mohit %A Impagliazzo, Russell %A Jaber, Michael %A K&#252;nnemann, Marvin %A Nina, Maria Paula Parga %+ External Organizations External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T The Fine-Grained Complexity of Multi-Dimensional Ordering Properties : %G eng %U http://hdl.handle.net/21.11116/0000-0009-CBD6-1 %R 10.4230/LIPIcs.IPEC.2021.3 %U urn:nbn:de:0030-drops-153869 %D 2021 %B 16th International Symposium on Parameterized and Exact Computation %Z date of event: 2021-09-08 - 2021-09-10 %C Lisbon, Portugal %B 16th International Symposium on Parameterized and Exact Computation %E Golovach, Petr A.; Zehavi, Meirav %P 1 - 15 %Z sequence number: 3 %I Schloss Dagstuhl %@ 978-3-95977-216-7 %B Leibniz International Proceedings in Informatics %N 214 %U https://drops.dagstuhl.de/opus/volltexte/2021/15386/https://creativecommons.org/licenses/by/4.0/legalcode
[115]
A. Antoniadis, R. Hoeksma, S. Kisfaludi-Bak, and K. Schewior, “Online Search for a Hyperplane in High-Dimensional Euclidean Space,” 2021. [Online]. Available: https://arxiv.org/abs/2109.04340. (arXiv: 2109.04340)
Abstract
We consider the online search problem in which a server starting at the<br>origin of a $d$-dimensional Euclidean space has to find an arbitrary<br>hyperplane. The best-possible competitive ratio and the length of the shortest<br>curve from which each point on the $d$-dimensional unit sphere can be seen are<br>within a constant factor of each other. We show that this length is in<br>$\Omega(d)\cap O(d^{3/2})$.<br>
Export
BibTeX
@online{Antoniadis_2109.04340, TITLE = {Online Search for a Hyperplane in High-Dimensional Euclidean Space}, AUTHOR = {Antoniadis, Antonios and Hoeksma, Ruben and Kisfaludi-Bak, S{\'a}ndor and Schewior, Kevin}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2109.04340}, EPRINT = {2109.04340}, EPRINTTYPE = {arXiv}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We consider the online search problem in which a server starting at the<br>origin of a $d$-dimensional Euclidean space has to find an arbitrary<br>hyperplane. The best-possible competitive ratio and the length of the shortest<br>curve from which each point on the $d$-dimensional unit sphere can be seen are<br>within a constant factor of each other. We show that this length is in<br>$\Omega(d)\cap O(d^{3/2})$.<br>}, }
Endnote
%0 Report %A Antoniadis, Antonios %A Hoeksma, Ruben %A Kisfaludi-Bak, S&#225;ndor %A Schewior, Kevin %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Online Search for a Hyperplane in High-Dimensional Euclidean Space : %G eng %U http://hdl.handle.net/21.11116/0000-0009-B814-1 %U https://arxiv.org/abs/2109.04340 %D 2021 %X We consider the online search problem in which a server starting at the<br>origin of a $d$-dimensional Euclidean space has to find an arbitrary<br>hyperplane. The best-possible competitive ratio and the length of the shortest<br>curve from which each point on the $d$-dimensional unit sphere can be seen are<br>within a constant factor of each other. We show that this length is in<br>$\Omega(d)\cap O(d^{3/2})$.<br> %K Computer Science, Computational Geometry, cs.CG,Computer Science, Data Structures and Algorithms, cs.DS
[116]
K. Axiotis, A. Backurs, K. Bringmann, C. Jin, V. Nakos, C. Tzamos, and H. Wu, “Fast and Simple Modular Subset Sum,” in Symposium on Simplicity in Algorithms (SOSA 2021), Alexandria, VA, USA (Virtual Conference), 2021.
Export
BibTeX
@inproceedings{Axiotis_SOSA2021, TITLE = {Fast and Simple Modular Subset Sum}, AUTHOR = {Axiotis, Kyriakos and Backurs, Arturs and Bringmann, Karl and Jin, Ce and Nakos, Vasileios and Tzamos, Christos and Wu, Hongxun}, LANGUAGE = {eng}, ISBN = {978-1-61197-649-6}, DOI = {10.1137/1.9781611976496.6}, PUBLISHER = {SIAM}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Symposium on Simplicity in Algorithms (SOSA 2021)}, EDITOR = {King, Valerie and Viet Le, Hung}, PAGES = {57--67}, ADDRESS = {Alexandria, VA, USA (Virtual Conference)}, }
Endnote
%0 Conference Proceedings %A Axiotis, Kyriakos %A Backurs, Arturs %A Bringmann, Karl %A Jin, Ce %A Nakos, Vasileios %A Tzamos, Christos %A Wu, Hongxun %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Fast and Simple Modular Subset Sum : %G eng %U http://hdl.handle.net/21.11116/0000-0007-56CF-0 %R 10.1137/1.9781611976496.6 %D 2021 %B SIAM Symposium on Simplicity in Algorithms %Z date of event: 2021-01-11 - 2021-01-12 %C Alexandria, VA, USA (Virtual Conference) %B Symposium on Simplicity in Algorithms %E King, Valerie; Viet Le, Hung %P 57 - 67 %I SIAM %@ 978-1-61197-649-6
[117]
R. Becker, S. Forster, A. Karrenbauer, and C. Lenzen, “Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models,” SIAM Journal on Computing, vol. 50, no. 3, 2021.
Export
BibTeX
@article{Becker2021, TITLE = {Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models}, AUTHOR = {Becker, Ruben and Forster, Sebastian and Karrenbauer, Andreas and Lenzen, Christoph}, LANGUAGE = {eng}, ISSN = {0097-5397}, DOI = {10.1137/19M1286955}, PUBLISHER = {SIAM}, ADDRESS = {Philadelphia}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, DATE = {2021}, JOURNAL = {SIAM Journal on Computing}, VOLUME = {50}, NUMBER = {3}, PAGES = {815--856}, }
Endnote
%0 Journal Article %A Becker, Ruben %A Forster, Sebastian %A Karrenbauer, Andreas %A Lenzen, Christoph %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models : %G eng %U http://hdl.handle.net/21.11116/0000-0008-E543-A %R 10.1137/19M1286955 %7 2021 %D 2021 %J SIAM Journal on Computing %V 50 %N 3 %& 815 %P 815 - 856 %I SIAM %C Philadelphia %@ false
[118]
B. A. Berendsohn, L. Kozma, and D. Marx, “Finding and Counting Permutations via CSPs,” Algorithmica, vol. 83, 2021.
Export
BibTeX
@article{berendsohn2021, TITLE = {Finding and Counting Permutations via {CSPs}}, AUTHOR = {Berendsohn, Benjamin Aram and Kozma, L{\'a}szl{\'o} and Marx, D{\'a}niel}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-021-00812-z}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, JOURNAL = {Algorithmica}, VOLUME = {83}, PAGES = {2552--2577}, }
Endnote
%0 Journal Article %A Berendsohn, Benjamin Aram %A Kozma, L&#225;szl&#243; %A Marx, D&#225;niel %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Finding and Counting Permutations via CSPs : %G eng %U http://hdl.handle.net/21.11116/0000-0008-3403-A %R 10.1007/s00453-021-00812-z %7 2021 %D 2021 %J Algorithmica %V 83 %& 2552 %P 2552 - 2577 %I Springer %C New York, NY %@ false
[119]
K. Bringmann and J. Slusallek, “Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal,” 2021. [Online]. Available: https://arxiv.org/abs/2105.05062. (arXiv: 2105.05062)
Abstract
The Subgraph Isomorphism problem is of considerable importance in computer<br>science. We examine the problem when the pattern graph H is of bounded<br>treewidth, as occurs in a variety of applications. This problem has a<br>well-known algorithm via color-coding that runs in time $O(n^{tw(H)+1})$ [Alon,<br>Yuster, Zwick'95], where $n$ is the number of vertices of the host graph $G$.<br>While there are pattern graphs known for which Subgraph Isomorphism can be<br>solved in an improved running time of $O(n^{tw(H)+1-\varepsilon})$ or even<br>faster (e.g. for $k$-cliques), it is not known whether such improvements are<br>possible for all patterns. The only known lower bound rules out time<br>$n^{o(tw(H) / \log(tw(H)))}$ for any class of patterns of unbounded treewidth<br>assuming the Exponential Time Hypothesis [Marx'07].<br> In this paper, we demonstrate the existence of maximally hard pattern graphs<br>$H$ that require time $n^{tw(H)+1-o(1)}$. Specifically, under the Strong<br>Exponential Time Hypothesis (SETH), a standard assumption from fine-grained<br>complexity theory, we prove the following asymptotic statement for large<br>treewidth $t$: For any $\varepsilon > 0$ there exists $t \ge 3$ and a pattern<br>graph $H$ of treewidth $t$ such that Subgraph Isomorphism on pattern $H$ has no<br>algorithm running in time $O(n^{t+1-\varepsilon})$.<br> Under the more recent 3-uniform Hyperclique hypothesis, we even obtain tight<br>lower bounds for each specific treewidth $t \ge 3$: For any $t \ge 3$ there<br>exists a pattern graph $H$ of treewidth $t$ such that for any $\varepsilon>0$<br>Subgraph Isomorphism on pattern $H$ has no algorithm running in time<br>$O(n^{t+1-\varepsilon})$.<br> In addition to these main results, we explore (1) colored and uncolored<br>problem variants (and why they are equivalent for most cases), (2) Subgraph<br>Isomorphism for $tw < 3$, (3) Subgraph Isomorphism parameterized by pathwidth,<br>and (4) a weighted problem variant.<br>
Export
BibTeX
@online{Bringmann_2105.05062, TITLE = {Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal}, AUTHOR = {Bringmann, Karl and Slusallek, Jasper}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2105.05062}, EPRINT = {2105.05062}, EPRINTTYPE = {arXiv}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, ABSTRACT = {The Subgraph Isomorphism problem is of considerable importance in computer<br>science. We examine the problem when the pattern graph H is of bounded<br>treewidth, as occurs in a variety of applications. This problem has a<br>well-known algorithm via color-coding that runs in time $O(n^{tw(H)+1})$ [Alon,<br>Yuster, Zwick'95], where $n$ is the number of vertices of the host graph $G$.<br>While there are pattern graphs known for which Subgraph Isomorphism can be<br>solved in an improved running time of $O(n^{tw(H)+1-\varepsilon})$ or even<br>faster (e.g. for $k$-cliques), it is not known whether such improvements are<br>possible for all patterns. The only known lower bound rules out time<br>$n^{o(tw(H) / \log(tw(H)))}$ for any class of patterns of unbounded treewidth<br>assuming the Exponential Time Hypothesis [Marx'07].<br> In this paper, we demonstrate the existence of maximally hard pattern graphs<br>$H$ that require time $n^{tw(H)+1-o(1)}$. Specifically, under the Strong<br>Exponential Time Hypothesis (SETH), a standard assumption from fine-grained<br>complexity theory, we prove the following asymptotic statement for large<br>treewidth $t$: For any $\varepsilon > 0$ there exists $t \ge 3$ and a pattern<br>graph $H$ of treewidth $t$ such that Subgraph Isomorphism on pattern $H$ has no<br>algorithm running in time $O(n^{t+1-\varepsilon})$.<br> Under the more recent 3-uniform Hyperclique hypothesis, we even obtain tight<br>lower bounds for each specific treewidth $t \ge 3$: For any $t \ge 3$ there<br>exists a pattern graph $H$ of treewidth $t$ such that for any $\varepsilon>0$<br>Subgraph Isomorphism on pattern $H$ has no algorithm running in time<br>$O(n^{t+1-\varepsilon})$.<br> In addition to these main results, we explore (1) colored and uncolored<br>problem variants (and why they are equivalent for most cases), (2) Subgraph<br>Isomorphism for $tw < 3$, (3) Subgraph Isomorphism parameterized by pathwidth,<br>and (4) a weighted problem variant.<br>}, }
Endnote
%0 Report %A Bringmann, Karl %A Slusallek, Jasper %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal : %G eng %U http://hdl.handle.net/21.11116/0000-0008-E25F-F %U https://arxiv.org/abs/2105.05062 %D 2021 %X The Subgraph Isomorphism problem is of considerable importance in computer<br>science. We examine the problem when the pattern graph H is of bounded<br>treewidth, as occurs in a variety of applications. This problem has a<br>well-known algorithm via color-coding that runs in time $O(n^{tw(H)+1})$ [Alon,<br>Yuster, Zwick'95], where $n$ is the number of vertices of the host graph $G$.<br>While there are pattern graphs known for which Subgraph Isomorphism can be<br>solved in an improved running time of $O(n^{tw(H)+1-\varepsilon})$ or even<br>faster (e.g. for $k$-cliques), it is not known whether such improvements are<br>possible for all patterns. The only known lower bound rules out time<br>$n^{o(tw(H) / \log(tw(H)))}$ for any class of patterns of unbounded treewidth<br>assuming the Exponential Time Hypothesis [Marx'07].<br> In this paper, we demonstrate the existence of maximally hard pattern graphs<br>$H$ that require time $n^{tw(H)+1-o(1)}$. Specifically, under the Strong<br>Exponential Time Hypothesis (SETH), a standard assumption from fine-grained<br>complexity theory, we prove the following asymptotic statement for large<br>treewidth $t$: For any $\varepsilon > 0$ there exists $t \ge 3$ and a pattern<br>graph $H$ of treewidth $t$ such that Subgraph Isomorphism on pattern $H$ has no<br>algorithm running in time $O(n^{t+1-\varepsilon})$.<br> Under the more recent 3-uniform Hyperclique hypothesis, we even obtain tight<br>lower bounds for each specific treewidth $t \ge 3$: For any $t \ge 3$ there<br>exists a pattern graph $H$ of treewidth $t$ such that for any $\varepsilon>0$<br>Subgraph Isomorphism on pattern $H$ has no algorithm running in time<br>$O(n^{t+1-\varepsilon})$.<br> In addition to these main results, we explore (1) colored and uncolored<br>problem variants (and why they are equivalent for most cases), (2) Subgraph<br>Isomorphism for $tw < 3$, (3) Subgraph Isomorphism parameterized by pathwidth,<br>and (4) a weighted problem variant.<br> %K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Computational Complexity, cs.CC,
[120]
K. Bringmann, N. Fischer, and V. Nakos, “Sparse Nonnegative Convolution is Equivalent to Dense Nonnegative Convolution,” in STOC ’21, 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual, Italy, 2021.
Export
BibTeX
@inproceedings{Bringmann_STOC2021, TITLE = {Sparse Nonnegative Convolution is Equivalent to Dense Nonnegative Convolution}, AUTHOR = {Bringmann, Karl and Fischer, Nick and Nakos, Vasileios}, LANGUAGE = {eng}, ISBN = {9781450380539}, DOI = {10.1145/3406325.3451090}, PUBLISHER = {ACM}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {STOC '21, 53rd Annual ACM SIGACT Symposium on Theory of Computing}, EDITOR = {Khuller, Samir and Vassilevska Williams, Virginia}, PAGES = {1711--1724}, ADDRESS = {Virtual, Italy}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Fischer, Nick %A Nakos, Vasileios %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Sparse Nonnegative Convolution is Equivalent to Dense Nonnegative Convolution : %G eng %U http://hdl.handle.net/21.11116/0000-0008-E23F-3 %R 10.1145/3406325.3451090 %D 2021 %B 53rd Annual ACM SIGACT Symposium on Theory of Computing %Z date of event: 2021-06-21 - 2021-06-25 %C Virtual, Italy %B STOC '21 %E Khuller, Samir; Vassilevska Williams, Virginia %P 1711 - 1724 %I ACM %@ 9781450380539
[121]
K. Bringmann, M. Künnemann, and A. Nusser, “Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance,” Journal of Computational Geometry, vol. 12, no. 1, 2021.
Export
BibTeX
@article{Bringmann21, TITLE = {Walking the Dog Fast in Practice: {A}lgorithm Engineering of the {F}r\'{e}chet Distance}, AUTHOR = {Bringmann, Karl and K{\"u}nnemann, Marvin and Nusser, Andr{\'e}}, LANGUAGE = {eng}, DOI = {10.20382/jocg.v12i1a4}, PUBLISHER = {JoCG.org}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, JOURNAL = {Journal of Computational Geometry}, VOLUME = {12}, NUMBER = {1}, PAGES = {70--108}, }
Endnote
%0 Journal Article %A Bringmann, Karl %A K&#252;nnemann, Marvin %A Nusser, Andr&#233; %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Walking the Dog Fast in Practice: Algorithm Engineering of the Fr&#233;chet Distance : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1F8A-7 %R 10.20382/jocg.v12i1a4 %7 2021 %D 2021 %J Journal of Computational Geometry %V 12 %N 1 %& 70 %P 70 - 108 %I JoCG.org
[122]
K. Bringmann, “Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry,” 2021. [Online]. Available: https://arxiv.org/abs/2110.10283. (arXiv: 2110.10283)
Abstract
Fine-grained complexity theory is the area of theoretical computer science<br>that proves conditional lower bounds based on the Strong Exponential Time<br>Hypothesis and similar conjectures. This area has been thriving in the last<br>decade, leading to conditionally best-possible algorithms for a wide variety of<br>problems on graphs, strings, numbers etc. This article is an introduction to<br>fine-grained lower bounds in computational geometry, with a focus on lower<br>bounds for polynomial-time problems based on the Orthogonal Vectors Hypothesis.<br>Specifically, we discuss conditional lower bounds for nearest neighbor search<br>under the Euclidean distance and Fr\'echet distance.<br>
Export
BibTeX
@online{Bringmann2110.10283, TITLE = {Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry}, AUTHOR = {Bringmann, Karl}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2110.10283}, EPRINT = {2110.10283}, EPRINTTYPE = {arXiv}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Fine-grained complexity theory is the area of theoretical computer science<br>that proves conditional lower bounds based on the Strong Exponential Time<br>Hypothesis and similar conjectures. This area has been thriving in the last<br>decade, leading to conditionally best-possible algorithms for a wide variety of<br>problems on graphs, strings, numbers etc. This article is an introduction to<br>fine-grained lower bounds in computational geometry, with a focus on lower<br>bounds for polynomial-time problems based on the Orthogonal Vectors Hypothesis.<br>Specifically, we discuss conditional lower bounds for nearest neighbor search<br>under the Euclidean distance and Fr\'echet distance.<br>}, }
Endnote
%0 Report %A Bringmann, Karl %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry : %G eng %U http://hdl.handle.net/21.11116/0000-0009-B42E-9 %U https://arxiv.org/abs/2110.10283 %D 2021 %X Fine-grained complexity theory is the area of theoretical computer science<br>that proves conditional lower bounds based on the Strong Exponential Time<br>Hypothesis and similar conjectures. This area has been thriving in the last<br>decade, leading to conditionally best-possible algorithms for a wide variety of<br>problems on graphs, strings, numbers etc. This article is an introduction to<br>fine-grained lower bounds in computational geometry, with a focus on lower<br>bounds for polynomial-time problems based on the Orthogonal Vectors Hypothesis.<br>Specifically, we discuss conditional lower bounds for nearest neighbor search<br>under the Euclidean distance and Fr\'echet distance.<br> %K Computer Science, Computational Geometry, cs.CG,Computer Science, Data Structures and Algorithms, cs.DS
[123]
K. Bringmann, “Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry,” in Connecting with Computability (CiE 2021), Ghent, Belgium (Virtual Event), 2021.
Export
BibTeX
@inproceedings{Bringmann_CiE21, TITLE = {Fine-Grained Complexity Theory: {C}onditional Lower Bounds for Computational Geometry}, AUTHOR = {Bringmann, Karl}, LANGUAGE = {eng}, ISBN = {978-3-030-80048-2}, DOI = {10.1007/978-3-030-80049-9_6}, PUBLISHER = {Springer}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Connecting with Computability (CiE 2021)}, EDITOR = {De Mol, Liesbeth and Weiermann, Andreas and Manea, Florin and Fern{\'a}ndez-Duque, David}, PAGES = {60--70}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {12813}, ADDRESS = {Ghent, Belgium (Virtual Event)}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry : %G eng %U http://hdl.handle.net/21.11116/0000-0009-B428-F %R 10.1007/978-3-030-80049-9_6 %D 2021 %B 17th Conference on Computability in Europe %Z date of event: 2021-07-05 - 2021-07-09 %C Ghent, Belgium (Virtual Event) %B Connecting with Computability %E De Mol, Liesbeth; Weiermann, Andreas; Manea, Florin; Fern&#225;ndez-Duque, David %P 60 - 70 %I Springer %@ 978-3-030-80048-2 %B Lecture Notes in Computer Science %N 12813
[124]
K. Bringmann and A. Nusser, “Translating Hausdorff is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under Translation,” 2021. [Online]. Available: https://arxiv.org/abs/2101.07696. (arXiv: 2101.07696)
Abstract
Computing the similarity of two point sets is a ubiquitous task in medical<br>imaging, geometric shape comparison, trajectory analysis, and many more<br>settings. Arguably the most basic distance measure for this task is the<br>Hausdorff distance, which assigns to each point from one set the closest point<br>in the other set and then evaluates the maximum distance of any assigned pair.<br>A drawback is that this distance measure is not translational invariant, that<br>is, comparing two objects just according to their shape while disregarding<br>their position in space is impossible.<br> Fortunately, there is a canonical translational invariant version, the<br>Hausdorff distance under translation, which minimizes the Hausdorff distance<br>over all translations of one of the point sets. For point sets of size $n$ and<br>$m$, the Hausdorff distance under translation can be computed in time $\tilde<br>O(nm)$ for the $L_1$ and $L_\infty$ norm [Chew, Kedem SWAT'92] and $\tilde O(nm<br>(n+m))$ for the $L_2$ norm [Huttenlocher, Kedem, Sharir DCG'93].<br> As these bounds have not been improved for over 25 years, in this paper we<br>approach the Hausdorff distance under translation from the perspective of<br>fine-grained complexity theory. We show (i) a matching lower bound of<br>$(nm)^{1-o(1)}$ for $L_1$ and $L_\infty$ assuming the Orthogonal Vectors<br>Hypothesis and (ii) a matching lower bound of $n^{2-o(1)}$ for $L_2$ in the<br>imbalanced case of $m = O(1)$ assuming the 3SUM Hypothesis.<br>
Export
BibTeX
@online{Bringmann_2101.07696, TITLE = {Translating Hausdorff is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under Translation}, AUTHOR = {Bringmann, Karl and Nusser, Andr{\'e}}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2101.07696}, EPRINT = {2101.07696}, EPRINTTYPE = {arXiv}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Computing the similarity of two point sets is a ubiquitous task in medical<br>imaging, geometric shape comparison, trajectory analysis, and many more<br>settings. Arguably the most basic distance measure for this task is the<br>Hausdorff distance, which assigns to each point from one set the closest point<br>in the other set and then evaluates the maximum distance of any assigned pair.<br>A drawback is that this distance measure is not translational invariant, that<br>is, comparing two objects just according to their shape while disregarding<br>their position in space is impossible.<br> Fortunately, there is a canonical translational invariant version, the<br>Hausdorff distance under translation, which minimizes the Hausdorff distance<br>over all translations of one of the point sets. For point sets of size $n$ and<br>$m$, the Hausdorff distance under translation can be computed in time $\tilde<br>O(nm)$ for the $L_1$ and $L_\infty$ norm [Chew, Kedem SWAT'92] and $\tilde O(nm<br>(n+m))$ for the $L_2$ norm [Huttenlocher, Kedem, Sharir DCG'93].<br> As these bounds have not been improved for over 25 years, in this paper we<br>approach the Hausdorff distance under translation from the perspective of<br>fine-grained complexity theory. We show (i) a matching lower bound of<br>$(nm)^{1-o(1)}$ for $L_1$ and $L_\infty$ assuming the Orthogonal Vectors<br>Hypothesis and (ii) a matching lower bound of $n^{2-o(1)}$ for $L_2$ in the<br>imbalanced case of $m = O(1)$ assuming the 3SUM Hypothesis.<br>}, }
Endnote
%0 Report %A Bringmann, Karl %A Nusser, Andr&#233; %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Translating Hausdorff is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under Translation : %G eng %U http://hdl.handle.net/21.11116/0000-0008-E242-E %U https://arxiv.org/abs/2101.07696 %D 2021 %X Computing the similarity of two point sets is a ubiquitous task in medical<br>imaging, geometric shape comparison, trajectory analysis, and many more<br>settings. Arguably the most basic distance measure for this task is the<br>Hausdorff distance, which assigns to each point from one set the closest point<br>in the other set and then evaluates the maximum distance of any assigned pair.<br>A drawback is that this distance measure is not translational invariant, that<br>is, comparing two objects just according to their shape while disregarding<br>their position in space is impossible.<br> Fortunately, there is a canonical translational invariant version, the<br>Hausdorff distance under translation, which minimizes the Hausdorff distance<br>over all translations of one of the point sets. For point sets of size $n$ and<br>$m$, the Hausdorff distance under translation can be computed in time $\tilde<br>O(nm)$ for the $L_1$ and $L_\infty$ norm [Chew, Kedem SWAT'92] and $\tilde O(nm<br>(n+m))$ for the $L_2$ norm [Huttenlocher, Kedem, Sharir DCG'93].<br> As these bounds have not been improved for over 25 years, in this paper we<br>approach the Hausdorff distance under translation from the perspective of<br>fine-grained complexity theory. We show (i) a matching lower bound of<br>$(nm)^{1-o(1)}$ for $L_1$ and $L_\infty$ assuming the Orthogonal Vectors<br>Hypothesis and (ii) a matching lower bound of $n^{2-o(1)}$ for $L_2$ in the<br>imbalanced case of $m = O(1)$ assuming the 3SUM Hypothesis.<br> %K Computer Science, Computational Geometry, cs.CG,Computer Science, Computational Complexity, cs.CC
[125]
K. Bringmann, M. Künnemann, and A. Nusser, “Discrete Fréchet Distance under Translation: Conditional Hardness and an Improved Algorithm,” ACM Transactions on Algorithms, vol. 17, no. 3, 2021.
Export
BibTeX
@article{Bringmann2021, TITLE = {Discrete {F}r\'{e}chet Distance under Translation: {C}onditional Hardness and an Improved Algorithm}, AUTHOR = {Bringmann, Karl and K{\"u}nnemann, Marvin and Nusser, Andr{\'e}}, LANGUAGE = {eng}, ISSN = {1549-6325}, DOI = {10.1145/3460656}, PUBLISHER = {ACM}, ADDRESS = {New York, NY}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, JOURNAL = {ACM Transactions on Algorithms}, VOLUME = {17}, NUMBER = {3}, PAGES = {1--42}, EID = {25}, }
Endnote
%0 Journal Article %A Bringmann, Karl %A K&#252;nnemann, Marvin %A Nusser, Andr&#233; %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Discrete Fr&#233;chet Distance under Translation: Conditional Hardness and an Improved Algorithm : %G eng %U http://hdl.handle.net/21.11116/0000-0009-2A8B-C %R 10.1145/3460656 %7 2021 %D 2021 %J ACM Transactions on Algorithms %V 17 %N 3 %& 1 %P 1 - 42 %Z sequence number: 25 %I ACM %C New York, NY %@ false
[126]
K. Bringmann and A. Nusser, “Translating Hausdorff is Hard: Fine-Grained Lower Bounds for Hausdorff Distance under Translation,” Journal of Computational Geometry, vol. 13, no. 2, 2021.
Export
BibTeX
@article{Bringmann22b, TITLE = {Translating {Hausdorff} is hard: {F}ine-grained lower bounds for {H}ausdorff distance under translation}, AUTHOR = {Bringmann, Karl and Nusser, Andr{\'e}}, LANGUAGE = {eng}, DOI = {10.20382/jocg.v13i2a3}, PUBLISHER = {JoCG.org}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, JOURNAL = {Journal of Computational Geometry}, VOLUME = {13}, NUMBER = {2}, PAGES = {30--50}, }
Endnote
%0 Journal Article %A Bringmann, Karl %A Nusser, Andr&#233; %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Translating Hausdorff is Hard: Fine-Grained Lower Bounds for Hausdorff Distance under Translation : %G eng %U http://hdl.handle.net/21.11116/0000-000C-2690-6 %R 10.20382/jocg.v13i2a3 %7 2021 %D 2021 %J Journal of Computational Geometry %V 13 %N 2 %& 30 %P 30 - 50 %I JoCG.org
[127]
K. Bringmann and V. Nakos, “Fast n-fold Boolean Convolution via Additive Combinatorics,” 2021. [Online]. Available: https://arxiv.org/abs/2105.03968. (arXiv: 2105.03968)
Abstract
We consider the problem of computing the Boolean convolution (with<br>wraparound) of $n$~vectors of dimension $m$, or, equivalently, the problem of<br>computing the sumset $A_1+A_2+\ldots+A_n$ for $A_1,\ldots,A_n \subseteq<br>\mathbb{Z}_m$. Boolean convolution formalizes the frequent task of combining<br>two subproblems, where the whole problem has a solution of size $k$ if for some<br>$i$ the first subproblem has a solution of size~$i$ and the second subproblem<br>has a solution of size $k-i$. Our problem formalizes a natural generalization,<br>namely combining solutions of $n$ subproblems subject to a modular constraint.<br>This simultaneously generalises Modular Subset Sum and Boolean Convolution<br>(Sumset Computation). Although nearly optimal algorithms are known for special<br>cases of this problem, not even tiny improvements are known for the general<br>case.<br> We almost resolve the computational complexity of this problem, shaving<br>essentially a factor of $n$ from the running time of previous algorithms.<br>Specifically, we present a \emph{deterministic} algorithm running in<br>\emph{almost} linear time with respect to the input plus output size $k$. We<br>also present a \emph{Las Vegas} algorithm running in \emph{nearly} linear<br>expected time with respect to the input plus output size $k$. Previously, no<br>deterministic or randomized $o(nk)$ algorithm was known.<br> At the heart of our approach lies a careful usage of Kneser's theorem from<br>Additive Combinatorics, and a new deterministic almost linear output-sensitive<br>algorithm for non-negative sparse convolution. In total, our work builds a<br>solid toolbox that could be of independent interest.<br>
Export
BibTeX
@online{Bringmann_2105.03968, TITLE = {Fast $n$-fold {B}oolean Convolution via Additive Combinatorics}, AUTHOR = {Bringmann, Karl and Nakos, Vasileios}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2105.03968}, EPRINT = {2105.03968}, EPRINTTYPE = {arXiv}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We consider the problem of computing the Boolean convolution (with<br>wraparound) of $n$~vectors of dimension $m$, or, equivalently, the problem of<br>computing the sumset $A_1+A_2+\ldots+A_n$ for $A_1,\ldots,A_n \subseteq<br>\mathbb{Z}_m$. Boolean convolution formalizes the frequent task of combining<br>two subproblems, where the whole problem has a solution of size $k$ if for some<br>$i$ the first subproblem has a solution of size~$i$ and the second subproblem<br>has a solution of size $k-i$. Our problem formalizes a natural generalization,<br>namely combining solutions of $n$ subproblems subject to a modular constraint.<br>This simultaneously generalises Modular Subset Sum and Boolean Convolution<br>(Sumset Computation). Although nearly optimal algorithms are known for special<br>cases of this problem, not even tiny improvements are known for the general<br>case.<br> We almost resolve the computational complexity of this problem, shaving<br>essentially a factor of $n$ from the running time of previous algorithms.<br>Specifically, we present a \emph{deterministic} algorithm running in<br>\emph{almost} linear time with respect to the input plus output size $k$. We<br>also present a \emph{Las Vegas} algorithm running in \emph{nearly} linear<br>expected time with respect to the input plus output size $k$. Previously, no<br>deterministic or randomized $o(nk)$ algorithm was known.<br> At the heart of our approach lies a careful usage of Kneser's theorem from<br>Additive Combinatorics, and a new deterministic almost linear output-sensitive<br>algorithm for non-negative sparse convolution. In total, our work builds a<br>solid toolbox that could be of independent interest.<br>}, }
Endnote
%0 Report %A Bringmann, Karl %A Nakos, Vasileios %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Fast n-fold Boolean Convolution via Additive Combinatorics : %G eng %U http://hdl.handle.net/21.11116/0000-0008-E25B-3 %U https://arxiv.org/abs/2105.03968 %D 2021 %X We consider the problem of computing the Boolean convolution (with<br>wraparound) of $n$~vectors of dimension $m$, or, equivalently, the problem of<br>computing the sumset $A_1+A_2+\ldots+A_n$ for $A_1,\ldots,A_n \subseteq<br>\mathbb{Z}_m$. Boolean convolution formalizes the frequent task of combining<br>two subproblems, where the whole problem has a solution of size $k$ if for some<br>$i$ the first subproblem has a solution of size~$i$ and the second subproblem<br>has a solution of size $k-i$. Our problem formalizes a natural generalization,<br>namely combining solutions of $n$ subproblems subject to a modular constraint.<br>This simultaneously generalises Modular Subset Sum and Boolean Convolution<br>(Sumset Computation). Although nearly optimal algorithms are known for special<br>cases of this problem, not even tiny improvements are known for the general<br>case.<br> We almost resolve the computational complexity of this problem, shaving<br>essentially a factor of $n$ from the running time of previous algorithms.<br>Specifically, we present a \emph{deterministic} algorithm running in<br>\emph{almost} linear time with respect to the input plus output size $k$. We<br>also present a \emph{Las Vegas} algorithm running in \emph{nearly} linear<br>expected time with respect to the input plus output size $k$. Previously, no<br>deterministic or randomized $o(nk)$ algorithm was known.<br> At the heart of our approach lies a careful usage of Kneser's theorem from<br>Additive Combinatorics, and a new deterministic almost linear output-sensitive<br>algorithm for non-negative sparse convolution. In total, our work builds a<br>solid toolbox that could be of independent interest.<br> %K Computer Science, Data Structures and Algorithms, cs.DS
[128]
K. Bringmann, A. Driemel, A. Nusser, and I. Psarros, “Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fréchet Distance,” 2021. [Online]. Available: https://arxiv.org/abs/2107.07792. (arXiv: 2107.07792)
Abstract
We study the $c$-approximate near neighbor problem under the continuous<br>Fr\'echet distance: Given a set of $n$ polygonal curves with $m$ vertices, a<br>radius $\delta > 0$, and a parameter $k \leq m$, we want to preprocess the<br>curves into a data structure that, given a query curve $q$ with $k$ vertices,<br>either returns an input curve with Fr\'echet distance at most $c\cdot \delta$<br>to $q$, or returns that there exists no input curve with Fr\'echet distance at<br>most $\delta$ to $q$. We focus on the case where the input and the queries are<br>one-dimensional polygonal curves -- also called time series -- and we give a<br>comprehensive analysis for this case. We obtain new upper bounds that provide<br>different tradeoffs between approximation factor, preprocessing time, and query<br>time.<br> Our data structures improve upon the state of the art in several ways. We<br>show that for any $0 < \varepsilon \leq 1$ an approximation factor of<br>$(1+\varepsilon)$ can be achieved within the same asymptotic time bounds as the<br>previously best result for $(2+\varepsilon)$. Moreover, we show that an<br>approximation factor of $(2+\varepsilon)$ can be obtained by using<br>preprocessing time and space $O(nm)$, which is linear in the input size, and<br>query time in $O(\frac{1}{\varepsilon})^{k+2}$, where the previously best<br>result used preprocessing time in $n \cdot O(\frac{m}{\varepsilon k})^k$ and<br>query time in $O(1)^k$. We complement our upper bounds with matching<br>conditional lower bounds based on the Orthogonal Vectors Hypothesis.<br>Interestingly, some of our lower bounds already hold for any super-constant<br>value of $k$. This is achieved by proving hardness of a one-sided sparse<br>version of the Orthogonal Vectors problem as an intermediate problem, which we<br>believe to be of independent interest.<br>
Export
BibTeX
@online{Bringmann_2107.07792, TITLE = {Tight Bounds for Approximate Near Neighbor Searching for Time Series under the {F}r\'{e}chet Distance}, AUTHOR = {Bringmann, Karl and Driemel, Anne and Nusser, Andr{\'e} and Psarros, Ioannis}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2107.07792}, EPRINT = {2107.07792}, EPRINTTYPE = {arXiv}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We study the $c$-approximate near neighbor problem under the continuous<br>Fr\'echet distance: Given a set of $n$ polygonal curves with $m$ vertices, a<br>radius $\delta > 0$, and a parameter $k \leq m$, we want to preprocess the<br>curves into a data structure that, given a query curve $q$ with $k$ vertices,<br>either returns an input curve with Fr\'echet distance at most $c\cdot \delta$<br>to $q$, or returns that there exists no input curve with Fr\'echet distance at<br>most $\delta$ to $q$. We focus on the case where the input and the queries are<br>one-dimensional polygonal curves -- also called time series -- and we give a<br>comprehensive analysis for this case. We obtain new upper bounds that provide<br>different tradeoffs between approximation factor, preprocessing time, and query<br>time.<br> Our data structures improve upon the state of the art in several ways. We<br>show that for any $0 < \varepsilon \leq 1$ an approximation factor of<br>$(1+\varepsilon)$ can be achieved within the same asymptotic time bounds as the<br>previously best result for $(2+\varepsilon)$. Moreover, we show that an<br>approximation factor of $(2+\varepsilon)$ can be obtained by using<br>preprocessing time and space $O(nm)$, which is linear in the input size, and<br>query time in $O(\frac{1}{\varepsilon})^{k+2}$, where the previously best<br>result used preprocessing time in $n \cdot O(\frac{m}{\varepsilon k})^k$ and<br>query time in $O(1)^k$. We complement our upper bounds with matching<br>conditional lower bounds based on the Orthogonal Vectors Hypothesis.<br>Interestingly, some of our lower bounds already hold for any super-constant<br>value of $k$. This is achieved by proving hardness of a one-sided sparse<br>version of the Orthogonal Vectors problem as an intermediate problem, which we<br>believe to be of independent interest.<br>}, }
Endnote
%0 Report %A Bringmann, Karl %A Driemel, Anne %A Nusser, Andr&#233; %A Psarros, Ioannis %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fr&#233;chet Distance : %G eng %U http://hdl.handle.net/21.11116/0000-0009-B43F-6 %U https://arxiv.org/abs/2107.07792 %D 2021 %X We study the $c$-approximate near neighbor problem under the continuous<br>Fr\'echet distance: Given a set of $n$ polygonal curves with $m$ vertices, a<br>radius $\delta > 0$, and a parameter $k \leq m$, we want to preprocess the<br>curves into a data structure that, given a query curve $q$ with $k$ vertices,<br>either returns an input curve with Fr\'echet distance at most $c\cdot \delta$<br>to $q$, or returns that there exists no input curve with Fr\'echet distance at<br>most $\delta$ to $q$. We focus on the case where the input and the queries are<br>one-dimensional polygonal curves -- also called time series -- and we give a<br>comprehensive analysis for this case. We obtain new upper bounds that provide<br>different tradeoffs between approximation factor, preprocessing time, and query<br>time.<br> Our data structures improve upon the state of the art in several ways. We<br>show that for any $0 < \varepsilon \leq 1$ an approximation factor of<br>$(1+\varepsilon)$ can be achieved within the same asymptotic time bounds as the<br>previously best result for $(2+\varepsilon)$. Moreover, we show that an<br>approximation factor of $(2+\varepsilon)$ can be obtained by using<br>preprocessing time and space $O(nm)$, which is linear in the input size, and<br>query time in $O(\frac{1}{\varepsilon})^{k+2}$, where the previously best<br>result used preprocessing time in $n \cdot O(\frac{m}{\varepsilon k})^k$ and<br>query time in $O(1)^k$. We complement our upper bounds with matching<br>conditional lower bounds based on the Orthogonal Vectors Hypothesis.<br>Interestingly, some of our lower bounds already hold for any super-constant<br>value of $k$. This is achieved by proving hardness of a one-sided sparse<br>version of the Orthogonal Vectors problem as an intermediate problem, which we<br>believe to be of independent interest.<br> %K Computer Science, Computational Geometry, cs.CG,Computer Science, Computational Complexity, cs.CC,Computer Science, Data Structures and Algorithms, cs.DS
[129]
K. Bringmann and J. Slusallek, “Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are Probably Optimal,” in 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Glasgow, UK (Virtual Conference), 2021.
Export
BibTeX
@inproceedings{Bringmann_ICALP2021b, TITLE = {Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are Probably Optimal}, AUTHOR = {Bringmann, Karl and Slusallek, Jasper}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-195-5}, URL = {urn:nbn:de:0030-drops-141095}, DOI = {10.4230/LIPIcs.ICALP.2021.40}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, EDITOR = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James}, PAGES = {1--16}, EID = {40}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {198}, ADDRESS = {Glasgow, UK (Virtual Conference)}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Slusallek, Jasper %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are Probably Optimal : %G eng %U http://hdl.handle.net/21.11116/0000-0008-DB85-B %R 10.4230/LIPIcs.ICALP.2021.40 %U urn:nbn:de:0030-drops-141095 %D 2021 %B 48th International Colloquium on Automata, Languages, and Programming %Z date of event: 2021-07-12 - 2020-07-16 %C Glasgow, UK (Virtual Conference) %B 48th International Colloquium on Automata, Languages, and Programming %E Bansal, Nikhil; Merelli, Emanuela; Worrell, James %P 1 - 16 %Z sequence number: 40 %I Schloss Dagstuhl %@ 978-3-95977-195-5 %B Leibniz International Proceedings in Informatics %N 198 %@ false %U https://drops.dagstuhl.de/opus/volltexte/2021/14109/https://creativecommons.org/licenses/by/4.0/legalcode
[130]
K. Bringmann and D. Das, “A Linear-Time n0.4-Approximation for Longest Common Subsequence,” in 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Glasgow, UK (Virtual Conference), 2021.
Export
BibTeX
@inproceedings{Bringmann_ICALP2021, TITLE = {A Linear-Time $n^{0.4}$-Approximation for Longest Common Subsequence}, AUTHOR = {Bringmann, Karl and Das, Debarati}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-195-5}, URL = {urn:nbn:de:0030-drops-141082}, DOI = {10.4230/LIPIcs.ICALP.2021.39}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, EDITOR = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James}, PAGES = {1--20}, EID = {39}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {198}, ADDRESS = {Glasgow, UK (Virtual Conference)}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Das, Debarati %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T A Linear-Time n0.4-Approximation for Longest Common Subsequence : %G eng %U http://hdl.handle.net/21.11116/0000-0008-DB7B-8 %R 10.4230/LIPIcs.ICALP.2021.39 %U urn:nbn:de:0030-drops-141082 %D 2021 %B 48th International Colloquium on Automata, Languages, and Programming %Z date of event: 2021-07-12 - 2020-07-16 %C Glasgow, UK (Virtual Conference) %B 48th International Colloquium on Automata, Languages, and Programming %E Bansal, Nikhil; Merelli, Emanuela; Worrell, James %P 1 - 20 %Z sequence number: 39 %I Schloss Dagstuhl %@ 978-3-95977-195-5 %B Leibniz International Proceedings in Informatics %N 198 %@ false %U https://drops.dagstuhl.de/opus/volltexte/2021/14108/https://creativecommons.org/licenses/by/4.0/legalcode
[131]
K. Bringmann, M. Kapralov, M. Makarov, V. Nakos, A. Yagudin, and A. Zandieh, “Sparse Fourier Transform by Traversing Cooley-Tukey FFT Computation Graphs,” 2021. [Online]. Available: https://arxiv.org/abs/2107.07347. (arXiv: 2107.07347)
Abstract
Computing the dominant Fourier coefficients of a vector is a common task in<br>many fields, such as signal processing, learning theory, and computational<br>complexity. In the Sparse Fast Fourier Transform (Sparse FFT) problem, one is<br>given oracle access to a $d$-dimensional vector $x$ of size $N$, and is asked<br>to compute the best $k$-term approximation of its Discrete Fourier Transform,<br>quickly and using few samples of the input vector $x$. While the sample<br>complexity of this problem is quite well understood, all previous approaches<br>either suffer from an exponential dependence of runtime on the dimension $d$ or<br>can only tolerate a trivial amount of noise. This is in sharp contrast with the<br>classical FFT algorithm of Cooley and Tukey, which is stable and completely<br>insensitive to the dimension of the input vector: its runtime is $O(N\log N)$<br>in any dimension $d$.<br> In this work, we introduce a new high-dimensional Sparse FFT toolkit and use<br>it to obtain new algorithms, both on the exact, as well as in the case of<br>bounded $\ell_2$ noise. This toolkit includes i) a new strategy for exploring a<br>pruned FFT computation tree that reduces the cost of filtering, ii) new<br>structural properties of adaptive aliasing filters recently introduced by<br>Kapralov, Velingker and Zandieh'SODA'19, and iii) a novel lazy estimation<br>argument, suited to reducing the cost of estimation in FFT tree-traversal<br>approaches. Our robust algorithm can be viewed as a highly optimized sparse,<br>stable extension of the Cooley-Tukey FFT algorithm.<br> Finally, we explain the barriers we have faced by proving a conditional<br>quadratic lower bound on the running time of the well-studied non-equispaced<br>Fourier transform problem. This resolves a natural and frequently asked<br>question in computational Fourier transforms. Lastly, we provide a preliminary<br>experimental evaluation comparing the runtime of our algorithm to FFTW and SFFT<br>2.0.<br>
Export
BibTeX
@online{Bringmann_2107.07347, TITLE = {Sparse {Fourier Transform} by Traversing {Cooley-Tukey FFT} Computation Graphs}, AUTHOR = {Bringmann, Karl and Kapralov, Michael and Makarov, Mikhail and Nakos, Vasileios and Yagudin, Amir and Zandieh, Amir}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2107.07347}, EPRINT = {2107.07347}, EPRINTTYPE = {arXiv}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Computing the dominant Fourier coefficients of a vector is a common task in<br>many fields, such as signal processing, learning theory, and computational<br>complexity. In the Sparse Fast Fourier Transform (Sparse FFT) problem, one is<br>given oracle access to a $d$-dimensional vector $x$ of size $N$, and is asked<br>to compute the best $k$-term approximation of its Discrete Fourier Transform,<br>quickly and using few samples of the input vector $x$. While the sample<br>complexity of this problem is quite well understood, all previous approaches<br>either suffer from an exponential dependence of runtime on the dimension $d$ or<br>can only tolerate a trivial amount of noise. This is in sharp contrast with the<br>classical FFT algorithm of Cooley and Tukey, which is stable and completely<br>insensitive to the dimension of the input vector: its runtime is $O(N\log N)$<br>in any dimension $d$.<br> In this work, we introduce a new high-dimensional Sparse FFT toolkit and use<br>it to obtain new algorithms, both on the exact, as well as in the case of<br>bounded $\ell_2$ noise. This toolkit includes i) a new strategy for exploring a<br>pruned FFT computation tree that reduces the cost of filtering, ii) new<br>structural properties of adaptive aliasing filters recently introduced by<br>Kapralov, Velingker and Zandieh'SODA'19, and iii) a novel lazy estimation<br>argument, suited to reducing the cost of estimation in FFT tree-traversal<br>approaches. Our robust algorithm can be viewed as a highly optimized sparse,<br>stable extension of the Cooley-Tukey FFT algorithm.<br> Finally, we explain the barriers we have faced by proving a conditional<br>quadratic lower bound on the running time of the well-studied non-equispaced<br>Fourier transform problem. This resolves a natural and frequently asked<br>question in computational Fourier transforms. Lastly, we provide a preliminary<br>experimental evaluation comparing the runtime of our algorithm to FFTW and SFFT<br>2.0.<br>}, }
Endnote
%0 Report %A Bringmann, Karl %A Kapralov, Michael %A Makarov, Mikhail %A Nakos, Vasileios %A Yagudin, Amir %A Zandieh, Amir %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Sparse Fourier Transform by Traversing Cooley-Tukey FFT Computation Graphs : %G eng %U http://hdl.handle.net/21.11116/0000-0009-B459-8 %U https://arxiv.org/abs/2107.07347 %D 2021 %X Computing the dominant Fourier coefficients of a vector is a common task in<br>many fields, such as signal processing, learning theory, and computational<br>complexity. In the Sparse Fast Fourier Transform (Sparse FFT) problem, one is<br>given oracle access to a $d$-dimensional vector $x$ of size $N$, and is asked<br>to compute the best $k$-term approximation of its Discrete Fourier Transform,<br>quickly and using few samples of the input vector $x$. While the sample<br>complexity of this problem is quite well understood, all previous approaches<br>either suffer from an exponential dependence of runtime on the dimension $d$ or<br>can only tolerate a trivial amount of noise. This is in sharp contrast with the<br>classical FFT algorithm of Cooley and Tukey, which is stable and completely<br>insensitive to the dimension of the input vector: its runtime is $O(N\log N)$<br>in any dimension $d$.<br> In this work, we introduce a new high-dimensional Sparse FFT toolkit and use<br>it to obtain new algorithms, both on the exact, as well as in the case of<br>bounded $\ell_2$ noise. This toolkit includes i) a new strategy for exploring a<br>pruned FFT computation tree that reduces the cost of filtering, ii) new<br>structural properties of adaptive aliasing filters recently introduced by<br>Kapralov, Velingker and Zandieh'SODA'19, and iii) a novel lazy estimation<br>argument, suited to reducing the cost of estimation in FFT tree-traversal<br>approaches. Our robust algorithm can be viewed as a highly optimized sparse,<br>stable extension of the Cooley-Tukey FFT algorithm.<br> Finally, we explain the barriers we have faced by proving a conditional<br>quadratic lower bound on the running time of the well-studied non-equispaced<br>Fourier transform problem. This resolves a natural and frequently asked<br>question in computational Fourier transforms. Lastly, we provide a preliminary<br>experimental evaluation comparing the runtime of our algorithm to FFTW and SFFT<br>2.0.<br> %K Computer Science, Data Structures and Algorithms, cs.DS
[132]
K. Bringmann and A. Nusser, “Translating Hausdorff Is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under Translation,” in 37th International Symposium on Computational Geometry (SoCG 2021), Buffalo, NY, USA (Virtual Conference), 2021.
Export
BibTeX
@inproceedings{Bringmann_SoCG2021, TITLE = {Translating {Hausdorff} Is Hard: {F}ine-Grained Lower Bounds for {Hausdorff} Distance Under Translation}, AUTHOR = {Bringmann, Karl and Nusser, Andr{\'e}}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-184-9}, URL = {urn:nbn:de:0030-drops-138177}, DOI = {10.4230/LIPIcs.SoCG.2021.18}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {37th International Symposium on Computational Geometry (SoCG 2021)}, EDITOR = {Buchin, Kevin and Colin de Verdi{\`e}re, {\'E}rich}, PAGES = {1--17}, EID = {18}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {189}, ADDRESS = {Buffalo, NY, USA (Virtual Conference)}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Nusser, Andr&#233; %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Translating Hausdorff Is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under Translation : %G eng %U http://hdl.handle.net/21.11116/0000-0008-DB6F-6 %R 10.4230/LIPIcs.SoCG.2021.18 %U urn:nbn:de:0030-drops-138177 %D 2021 %B 37th International Symposium on Computational Geometry %Z date of event: 2021-06-07 - 2021-06-11 %C Buffalo, NY, USA (Virtual Conference) %B 37th International Symposium on Computational Geometry %E Buchin, Kevin; Colin de Verdi&#232;re, &#201;rich %P 1 - 17 %Z sequence number: 18 %I Schloss Dagstuhl %@ 978-3-95977-184-9 %B Leibniz International Proceedings in Informatics %N 189 %@ false %U https://drops.dagstuhl.de/opus/volltexte/2021/13817/https://creativecommons.org/licenses/by/4.0/legalcode
[133]
K. Bringmann and V. Nakos, “Fast n-Fold Boolean Convolution via Additive Combinatorics,” in 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Glasgow, UK (Virtual Conference), 2021.
Export
BibTeX
@inproceedings{Bringmann_ICALP2021c, TITLE = {Fast $n$-Fold {B}oolean Convolution via Additive Combinatorics}, AUTHOR = {Bringmann, Karl and Nakos, Vasileios}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-195-5}, URL = {urn:nbn:de:0030-drops-141108}, DOI = {10.4230/LIPIcs.ICALP.2021.41}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, EDITOR = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James}, PAGES = {1--17}, EID = {41}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {198}, ADDRESS = {Glasgow, UK (Virtual Conference)}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Nakos, Vasileios %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Fast n-Fold Boolean Convolution via Additive Combinatorics : %G eng %U http://hdl.handle.net/21.11116/0000-0008-DB8E-2 %R 10.4230/LIPIcs.ICALP.2021.41 %U urn:nbn:de:0030-drops-141108 %D 2021 %B 48th International Colloquium on Automata, Languages, and Programming %Z date of event: 2021-07-12 - 2020-07-16 %C Glasgow, UK (Virtual Conference) %B 48th International Colloquium on Automata, Languages, and Programming %E Bansal, Nikhil; Merelli, Emanuela; Worrell, James %P 1 - 17 %Z sequence number: 41 %I Schloss Dagstuhl %@ 978-3-95977-195-5 %B Leibniz International Proceedings in Informatics %N 198 %@ false %U https://drops.dagstuhl.de/opus/volltexte/2021/14110/pdf/LIPIcs-ICALP-2021-41.pdfhttps://creativecommons.org/licenses/by/4.0/legalcode
[134]
K. Bringmann, N. Fischer, and V. Nakos, “Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution,” 2021. [Online]. Available: https://arxiv.org/abs/2107.07625. (arXiv: 2107.07625)
Abstract
Computing the convolution $A\star B$ of two length-$n$ integer vectors $A,B$<br>is a core problem in several disciplines. It frequently comes up in algorithms<br>for Knapsack, $k$-SUM, All-Pairs Shortest Paths, and string pattern matching<br>problems. For these applications it typically suffices to compute convolutions<br>of nonnegative vectors. This problem can be classically solved in time $O(n\log<br>n)$ using the Fast Fourier Transform.<br> However, often the involved vectors are sparse and hence one could hope for<br>output-sensitive algorithms to compute nonnegative convolutions. This question<br>was raised by Muthukrishnan and solved by Cole and Hariharan (STOC '02) by a<br>randomized algorithm running in near-linear time in the (unknown) output-size<br>$t$. Chan and Lewenstein (STOC '15) presented a deterministic algorithm with a<br>$2^{O(\sqrt{\log t\cdot\log\log n})}$ overhead in running time and the<br>additional assumption that a small superset of the output is given; this<br>assumption was later removed by Bringmann and Nakos (ICALP '21).<br> In this paper we present the first deterministic near-linear-time algorithm<br>for computing sparse nonnegative convolutions. This immediately gives improved<br>deterministic algorithms for the state-of-the-art of output-sensitive Subset<br>Sum, block-mass pattern matching, $N$-fold Boolean convolution, and others,<br>matching up to log-factors the fastest known randomized algorithms for these<br>problems. Our algorithm is a blend of algebraic and combinatorial ideas and<br>techniques.<br> Additionally, we provide two fast Las Vegas algorithms for computing sparse<br>nonnegative convolutions. In particular, we present a simple $O(t\log^2t)$ time<br>algorithm, which is an accessible alternative to Cole and Hariharan's<br>algorithm. We further refine this new algorithm to run in Las Vegas time<br>$O(t\log t\cdot\log\log t)$, matching the running time of the dense case apart<br>from the $\log\log t$ factor.<br>
Export
BibTeX
@online{Bringmann_2107.07625, TITLE = {Deterministic and {Las Vegas} Algorithms for Sparse Nonnegative Convolution}, AUTHOR = {Bringmann, Karl and Fischer, Nick and Nakos, Vasileios}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2107.07625}, EPRINT = {2107.07625}, EPRINTTYPE = {arXiv}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Computing the convolution $A\star B$ of two length-$n$ integer vectors $A,B$<br>is a core problem in several disciplines. It frequently comes up in algorithms<br>for Knapsack, $k$-SUM, All-Pairs Shortest Paths, and string pattern matching<br>problems. For these applications it typically suffices to compute convolutions<br>of nonnegative vectors. This problem can be classically solved in time $O(n\log<br>n)$ using the Fast Fourier Transform.<br> However, often the involved vectors are sparse and hence one could hope for<br>output-sensitive algorithms to compute nonnegative convolutions. This question<br>was raised by Muthukrishnan and solved by Cole and Hariharan (STOC '02) by a<br>randomized algorithm running in near-linear time in the (unknown) output-size<br>$t$. Chan and Lewenstein (STOC '15) presented a deterministic algorithm with a<br>$2^{O(\sqrt{\log t\cdot\log\log n})}$ overhead in running time and the<br>additional assumption that a small superset of the output is given; this<br>assumption was later removed by Bringmann and Nakos (ICALP '21).<br> In this paper we present the first deterministic near-linear-time algorithm<br>for computing sparse nonnegative convolutions. This immediately gives improved<br>deterministic algorithms for the state-of-the-art of output-sensitive Subset<br>Sum, block-mass pattern matching, $N$-fold Boolean convolution, and others,<br>matching up to log-factors the fastest known randomized algorithms for these<br>problems. Our algorithm is a blend of algebraic and combinatorial ideas and<br>techniques.<br> Additionally, we provide two fast Las Vegas algorithms for computing sparse<br>nonnegative convolutions. In particular, we present a simple $O(t\log^2t)$ time<br>algorithm, which is an accessible alternative to Cole and Hariharan's<br>algorithm. We further refine this new algorithm to run in Las Vegas time<br>$O(t\log t\cdot\log\log t)$, matching the running time of the dense case apart<br>from the $\log\log t$ factor.<br>}, }
Endnote
%0 Report %A Bringmann, Karl %A Fischer, Nick %A Nakos, Vasileios %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution : %G eng %U http://hdl.handle.net/21.11116/0000-0009-B454-D %U https://arxiv.org/abs/2107.07625 %D 2021 %X Computing the convolution $A\star B$ of two length-$n$ integer vectors $A,B$<br>is a core problem in several disciplines. It frequently comes up in algorithms<br>for Knapsack, $k$-SUM, All-Pairs Shortest Paths, and string pattern matching<br>problems. For these applications it typically suffices to compute convolutions<br>of nonnegative vectors. This problem can be classically solved in time $O(n\log<br>n)$ using the Fast Fourier Transform.<br> However, often the involved vectors are sparse and hence one could hope for<br>output-sensitive algorithms to compute nonnegative convolutions. This question<br>was raised by Muthukrishnan and solved by Cole and Hariharan (STOC '02) by a<br>randomized algorithm running in near-linear time in the (unknown) output-size<br>$t$. Chan and Lewenstein (STOC '15) presented a deterministic algorithm with a<br>$2^{O(\sqrt{\log t\cdot\log\log n})}$ overhead in running time and the<br>additional assumption that a small superset of the output is given; this<br>assumption was later removed by Bringmann and Nakos (ICALP '21).<br> In this paper we present the first deterministic near-linear-time algorithm<br>for computing sparse nonnegative convolutions. This immediately gives improved<br>deterministic algorithms for the state-of-the-art of output-sensitive Subset<br>Sum, block-mass pattern matching, $N$-fold Boolean convolution, and others,<br>matching up to log-factors the fastest known randomized algorithms for these<br>problems. Our algorithm is a blend of algebraic and combinatorial ideas and<br>techniques.<br> Additionally, we provide two fast Las Vegas algorithms for computing sparse<br>nonnegative convolutions. In particular, we present a simple $O(t\log^2t)$ time<br>algorithm, which is an accessible alternative to Cole and Hariharan's<br>algorithm. We further refine this new algorithm to run in Las Vegas time<br>$O(t\log t\cdot\log\log t)$, matching the running time of the dense case apart<br>from the $\log\log t$ factor.<br> %K Computer Science, Data Structures and Algorithms, cs.DS
[135]
K. Bringmann and V. Nakos, “Top-k-Convolution and the Quest for Near-Linear Output-Sensitive Subset Sum,” 2021. [Online]. Available: https://arxiv.org/abs/2107.13206. (arXiv: 2107.13206)
Abstract
In the classical Subset Sum problem we are given a set $X$ and a target $t$,<br>and the task is to decide whether there exists a subset of $X$ which sums to<br>$t$. A recent line of research has resulted in $\tilde{O}(t)$-time algorithms,<br>which are (near-)optimal under popular complexity-theoretic assumptions. On the<br>other hand, the standard dynamic programming algorithm runs in time $O(n \cdot<br>|\mathcal{S}(X,t)|)$, where $\mathcal{S}(X,t)$ is the set of all subset sums of<br>$X$ that are smaller than $t$. Furthermore, all known pseudopolynomial<br>algorithms actually solve a stronger task, since they actually compute the<br>whole set $\mathcal{S}(X,t)$.<br> As the aforementioned two running times are incomparable, in this paper we<br>ask whether one can achieve the best of both worlds: running time<br>$\tilde{O}(|\mathcal{S}(X,t)|)$. In particular, we ask whether<br>$\mathcal{S}(X,t)$ can be computed in near-linear time in the output-size.<br>Using a diverse toolkit containing techniques such as color coding, sparse<br>recovery, and sumset estimates, we make considerable progress towards this<br>question and design an algorithm running in time<br>$\tilde{O}(|\mathcal{S}(X,t)|^{4/3})$.<br> Central to our approach is the study of top-$k$-convolution, a natural<br>problem of independent interest: given sparse polynomials with non-negative<br>coefficients, compute the lowest $k$ non-zero monomials of their product. We<br>design an algorithm running in time $\tilde{O}(k^{4/3})$, by a combination of<br>sparse convolution and sumset estimates considered in Additive Combinatorics.<br>Moreover, we provide evidence that going beyond some of the barriers we have<br>faced requires either an algorithmic breakthrough or possibly new techniques<br>from Additive Combinatorics on how to pass from information on restricted<br>sumsets to information on unrestricted sumsets.<br>
Export
BibTeX
@online{Bringmann_2107.13206, TITLE = {Top-k-Convolution and the Quest for Near-Linear Output-Sensitive Subset Sum}, AUTHOR = {Bringmann, Karl and Nakos, Vasileios}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2107.13206}, EPRINT = {2107.13206}, EPRINTTYPE = {arXiv}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, ABSTRACT = {In the classical Subset Sum problem we are given a set $X$ and a target $t$,<br>and the task is to decide whether there exists a subset of $X$ which sums to<br>$t$. A recent line of research has resulted in $\tilde{O}(t)$-time algorithms,<br>which are (near-)optimal under popular complexity-theoretic assumptions. On the<br>other hand, the standard dynamic programming algorithm runs in time $O(n \cdot<br>|\mathcal{S}(X,t)|)$, where $\mathcal{S}(X,t)$ is the set of all subset sums of<br>$X$ that are smaller than $t$. Furthermore, all known pseudopolynomial<br>algorithms actually solve a stronger task, since they actually compute the<br>whole set $\mathcal{S}(X,t)$.<br> As the aforementioned two running times are incomparable, in this paper we<br>ask whether one can achieve the best of both worlds: running time<br>$\tilde{O}(|\mathcal{S}(X,t)|)$. In particular, we ask whether<br>$\mathcal{S}(X,t)$ can be computed in near-linear time in the output-size.<br>Using a diverse toolkit containing techniques such as color coding, sparse<br>recovery, and sumset estimates, we make considerable progress towards this<br>question and design an algorithm running in time<br>$\tilde{O}(|\mathcal{S}(X,t)|^{4/3})$.<br> Central to our approach is the study of top-$k$-convolution, a natural<br>problem of independent interest: given sparse polynomials with non-negative<br>coefficients, compute the lowest $k$ non-zero monomials of their product. We<br>design an algorithm running in time $\tilde{O}(k^{4/3})$, by a combination of<br>sparse convolution and sumset estimates considered in Additive Combinatorics.<br>Moreover, we provide evidence that going beyond some of the barriers we have<br>faced requires either an algorithmic breakthrough or possibly new techniques<br>from Additive Combinatorics on how to pass from information on restricted<br>sumsets to information on unrestricted sumsets.<br>}, }
Endnote
%0 Report %A Bringmann, Karl %A Nakos, Vasileios %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Top-k-Convolution and the Quest for Near-Linear Output-Sensitive Subset Sum : %G eng %U http://hdl.handle.net/21.11116/0000-0009-B434-1 %U https://arxiv.org/abs/2107.13206 %D 2021 %X In the classical Subset Sum problem we are given a set $X$ and a target $t$,<br>and the task is to decide whether there exists a subset of $X$ which sums to<br>$t$. A recent line of research has resulted in $\tilde{O}(t)$-time algorithms,<br>which are (near-)optimal under popular complexity-theoretic assumptions. On the<br>other hand, the standard dynamic programming algorithm runs in time $O(n \cdot<br>|\mathcal{S}(X,t)|)$, where $\mathcal{S}(X,t)$ is the set of all subset sums of<br>$X$ that are smaller than $t$. Furthermore, all known pseudopolynomial<br>algorithms actually solve a stronger task, since they actually compute the<br>whole set $\mathcal{S}(X,t)$.<br> As the aforementioned two running times are incomparable, in this paper we<br>ask whether one can achieve the best of both worlds: running time<br>$\tilde{O}(|\mathcal{S}(X,t)|)$. In particular, we ask whether<br>$\mathcal{S}(X,t)$ can be computed in near-linear time in the output-size.<br>Using a diverse toolkit containing techniques such as color coding, sparse<br>recovery, and sumset estimates, we make considerable progress towards this<br>question and design an algorithm running in time<br>$\tilde{O}(|\mathcal{S}(X,t)|^{4/3})$.<br> Central to our approach is the study of top-$k$-convolution, a natural<br>problem of independent interest: given sparse polynomials with non-negative<br>coefficients, compute the lowest $k$ non-zero monomials of their product. We<br>design an algorithm running in time $\tilde{O}(k^{4/3})$, by a combination of<br>sparse convolution and sumset estimates considered in Additive Combinatorics.<br>Moreover, we provide evidence that going beyond some of the barriers we have<br>faced requires either an algorithmic breakthrough or possibly new techniques<br>from Additive Combinatorics on how to pass from information on restricted<br>sumsets to information on unrestricted sumsets.<br> %K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Discrete Mathematics, cs.DM
[136]
K. Bringmann, A. Cassis, N. Fischer, and M. Künnemann, “Fine-Grained Completeness for Optimization in P,” in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021), Seattle, WA, USA, 2021.
Export
BibTeX
@inproceedings{Bringmann_APPROXRANDOM21, TITLE = {Fine-Grained Completeness for Optimization in {P}}, AUTHOR = {Bringmann, Karl and Cassis, Alejandro and Fischer, Nick and K{\"u}nnemann, Marvin}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-207-5}, URL = {urn:nbn:de:0030-drops-147024}, DOI = {10.4230/LIPIcs.APPROX/RANDOM.2021.9}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)}, EDITOR = {Wootters, Mary and Sanit{\`a}, Laura}, PAGES = {1--22}, EID = {9}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {207}, ADDRESS = {Seattle, WA, USA}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Cassis, Alejandro %A Fischer, Nick %A K&#252;nnemann, Marvin %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Fine-Grained Completeness for Optimization in P : %G eng %U http://hdl.handle.net/21.11116/0000-0009-B411-8 %R 10.4230/LIPIcs.APPROX/RANDOM.2021.9 %U urn:nbn:de:0030-drops-147024 %D 2021 %B 24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems and the 25th International Conference on Randomization and Computation %Z date of event: 2021-08-16 - 2021-08-18 %C Seattle, WA, USA %B Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques %E Wootters, Mary; Sanit&#224;, Laura %P 1 - 22 %Z sequence number: 9 %I Schloss Dagstuhl %@ 978-3-95977-207-5 %B Leibniz International Proceedings in Informatics %N 207 %@ false
[137]
K. Bringmann, A. Cassis, N. Fischer, and M. Künnemann, “Fine-Grained Completeness for Optimization in P,” 2021. [Online]. Available: https://arxiv.org/abs/2107.01721. (arXiv: 2107.01721)
Abstract
We initiate the study of fine-grained completeness theorems for exact and<br>approximate optimization in the polynomial-time regime. Inspired by the first<br>completeness results for decision problems in P (Gao, Impagliazzo, Kolokolova,<br>Williams, TALG 2019) as well as the classic class MaxSNP and<br>MaxSNP-completeness for NP optimization problems (Papadimitriou, Yannakakis,<br>JCSS 1991), we define polynomial-time analogues MaxSP and MinSP, which contain<br>a number of natural optimization problems in P, including Maximum Inner<br>Product, general forms of nearest neighbor search and optimization variants of<br>the $k$-XOR problem. Specifically, we define MaxSP as the class of problems<br>definable as $\max_{x_1,\dots,x_k} \#\{ (y_1,\dots,y_\ell) :<br>\phi(x_1,\dots,x_k, y_1,\dots,y_\ell) \}$, where $\phi$ is a quantifier-free<br>first-order property over a given relational structure (with MinSP defined<br>analogously). On $m$-sized structures, we can solve each such problem in time<br>$O(m^{k+\ell-1})$. Our results are:<br> - We determine (a sparse variant of) the Maximum/Minimum Inner Product<br>problem as complete under *deterministic* fine-grained reductions: A strongly<br>subquadratic algorithm for Maximum/Minimum Inner Product would beat the<br>baseline running time of $O(m^{k+\ell-1})$ for *all* problems in MaxSP/MinSP by<br>a polynomial factor.<br> - This completeness transfers to approximation: Maximum/Minimum Inner Product<br>is also complete in the sense that a strongly subquadratic $c$-approximation<br>would give a $(c+\varepsilon)$-approximation for all MaxSP/MinSP problems in<br>time $O(m^{k+\ell-1-\delta})$, where $\varepsilon > 0$ can be chosen<br>arbitrarily small. Combining our completeness with~(Chen, Williams, SODA 2019),<br>we obtain the perhaps surprising consequence that refuting the OV Hypothesis is<br>*equivalent* to giving a $O(1)$-approximation for all MinSP problems in<br>faster-than-$O(m^{k+\ell-1})$ time.<br>
Export
BibTeX
@online{Bringmann_2107.01721, TITLE = {Fine-Grained Completeness for Optimization in P}, AUTHOR = {Bringmann, Karl and Cassis, Alejandro and Fischer, Nick and K{\"u}nnemann, Marvin}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2107.01721}, EPRINT = {2107.01721}, EPRINTTYPE = {arXiv}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We initiate the study of fine-grained completeness theorems for exact and<br>approximate optimization in the polynomial-time regime. Inspired by the first<br>completeness results for decision problems in P (Gao, Impagliazzo, Kolokolova,<br>Williams, TALG 2019) as well as the classic class MaxSNP and<br>MaxSNP-completeness for NP optimization problems (Papadimitriou, Yannakakis,<br>JCSS 1991), we define polynomial-time analogues MaxSP and MinSP, which contain<br>a number of natural optimization problems in P, including Maximum Inner<br>Product, general forms of nearest neighbor search and optimization variants of<br>the $k$-XOR problem. Specifically, we define MaxSP as the class of problems<br>definable as $\max_{x_1,\dots,x_k} \#\{ (y_1,\dots,y_\ell) :<br>\phi(x_1,\dots,x_k, y_1,\dots,y_\ell) \}$, where $\phi$ is a quantifier-free<br>first-order property over a given relational structure (with MinSP defined<br>analogously). On $m$-sized structures, we can solve each such problem in time<br>$O(m^{k+\ell-1})$. Our results are:<br> -- We determine (a sparse variant of) the Maximum/Minimum Inner Product<br>problem as complete under *deterministic* fine-grained reductions: A strongly<br>subquadratic algorithm for Maximum/Minimum Inner Product would beat the<br>baseline running time of $O(m^{k+\ell-1})$ for *all* problems in MaxSP/MinSP by<br>a polynomial factor.<br> -- This completeness transfers to approximation: Maximum/Minimum Inner Product<br>is also complete in the sense that a strongly subquadratic $c$-approximation<br>would give a $(c+\varepsilon)$-approximation for all MaxSP/MinSP problems in<br>time $O(m^{k+\ell-1-\delta})$, where $\varepsilon > 0$ can be chosen<br>arbitrarily small. Combining our completeness with~(Chen, Williams, SODA 2019),<br>we obtain the perhaps surprising consequence that refuting the OV Hypothesis is<br>*equivalent* to giving a $O(1)$-approximation for all MinSP problems in<br>faster-than-$O(m^{k+\ell-1})$ time.<br>}, }
Endnote
%0 Report %A Bringmann, Karl %A Cassis, Alejandro %A Fischer, Nick %A K&#252;nnemann, Marvin %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Fine-Grained Completeness for Optimization in P : %G eng %U http://hdl.handle.net/21.11116/0000-0008-E26A-2 %U https://arxiv.org/abs/2107.01721 %D 2021 %X We initiate the study of fine-grained completeness theorems for exact and<br>approximate optimization in the polynomial-time regime. Inspired by the first<br>completeness results for decision problems in P (Gao, Impagliazzo, Kolokolova,<br>Williams, TALG 2019) as well as the classic class MaxSNP and<br>MaxSNP-completeness for NP optimization problems (Papadimitriou, Yannakakis,<br>JCSS 1991), we define polynomial-time analogues MaxSP and MinSP, which contain<br>a number of natural optimization problems in P, including Maximum Inner<br>Product, general forms of nearest neighbor search and optimization variants of<br>the $k$-XOR problem. Specifically, we define MaxSP as the class of problems<br>definable as $\max_{x_1,\dots,x_k} \#\{ (y_1,\dots,y_\ell) :<br>\phi(x_1,\dots,x_k, y_1,\dots,y_\ell) \}$, where $\phi$ is a quantifier-free<br>first-order property over a given relational structure (with MinSP defined<br>analogously). On $m$-sized structures, we can solve each such problem in time<br>$O(m^{k+\ell-1})$. Our results are:<br> - We determine (a sparse variant of) the Maximum/Minimum Inner Product<br>problem as complete under *deterministic* fine-grained reductions: A strongly<br>subquadratic algorithm for Maximum/Minimum Inner Product would beat the<br>baseline running time of $O(m^{k+\ell-1})$ for *all* problems in MaxSP/MinSP by<br>a polynomial factor.<br> - This completeness transfers to approximation: Maximum/Minimum Inner Product<br>is also complete in the sense that a strongly subquadratic $c$-approximation<br>would give a $(c+\varepsilon)$-approximation for all MaxSP/MinSP problems in<br>time $O(m^{k+\ell-1-\delta})$, where $\varepsilon > 0$ can be chosen<br>arbitrarily small. Combining our completeness with~(Chen, Williams, SODA 2019),<br>we obtain the perhaps surprising consequence that refuting the OV Hypothesis is<br>*equivalent* to giving a $O(1)$-approximation for all MinSP problems in<br>faster-than-$O(m^{k+\ell-1})$ time.<br> %K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Computational Complexity, cs.CC
[138]
K. Bringmann and V. Nakos, “A Fine-Grained Perspective on Approximating Subset Sum and Partition,” in Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, VA, USA (Virtual Conference), 2021.
Export
BibTeX
@inproceedings{Bringmann_SODA21b, TITLE = {A Fine-Grained Perspective on Approximating {Subset Sum} and Partition}, AUTHOR = {Bringmann, Karl and Nakos, Vasileios}, LANGUAGE = {eng}, ISBN = {978-1-61197-646-5}, DOI = {10.1137/1.9781611976465.108}, PUBLISHER = {SIAM}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, DATE = {2021}, BOOKTITLE = {Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (SODA 2021)}, EDITOR = {Marx, D{\'a}niel}, PAGES = {1797--1815}, ADDRESS = {Alexandria, VA, USA (Virtual Conference)}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Nakos, Vasileios %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Fine-Grained Perspective on Approximating Subset Sum and Partition : %G eng %U http://hdl.handle.net/21.11116/0000-0007-90DD-D %R 10.1137/1.9781611976465.108 %D 2021 %B 32nd Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2021-01-10 - 2021-01-13 %C Alexandria, VA, USA (Virtual Conference) %B Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms %E Marx, D&#225;niel %P 1797 - 1815 %I SIAM %@ 978-1-61197-646-5
[139]
K. Bringmann and P. Wellnitz, “On Near-Linear-Time Algorithms for Dense Subset Sum,” in Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, VA, USA (Virtual Conference), 2021.
Export
BibTeX
@inproceedings{Bringmann_SODA21, TITLE = {On Near-Linear-Time Algorithms for Dense {Subset Sum}}, AUTHOR = {Bringmann, Karl and Wellnitz, Philip}, LANGUAGE = {eng}, ISBN = {978-1-61197-646-5}, DOI = {10.1137/1.9781611976465.107}, PUBLISHER = {SIAM}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, DATE = {2021}, BOOKTITLE = {Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (SODA 2021)}, EDITOR = {Marx, D{\'a}niel}, PAGES = {1777--1796}, ADDRESS = {Alexandria, VA, USA (Virtual Conference)}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Wellnitz, Philip %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T On Near-Linear-Time Algorithms for Dense Subset Sum : %G eng %U http://hdl.handle.net/21.11116/0000-0007-8C7E-F %R 10.1137/1.9781611976465.107 %D 2021 %B 32nd Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2021-01-10 - 2021-01-13 %C Alexandria, VA, USA (Virtual Conference) %B Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms %E Marx, D&#225;niel %P 1777 - 1796 %I SIAM %@ 978-1-61197-646-5
[140]
K. Bringmann, N. Fischer, and V. Nakos, “Sparse Nonnegative Convolution Is Equivalent to Dense Nonnegative Convolution,” 2021. [Online]. Available: https://arxiv.org/abs/2105.05984. (arXiv: 2105.05984)
Abstract
Computing the convolution $A\star B$ of two length-$n$ vectors $A,B$ is an<br>ubiquitous computational primitive. Applications range from string problems to<br>Knapsack-type problems, and from 3SUM to All-Pairs Shortest Paths. These<br>applications often come in the form of nonnegative convolution, where the<br>entries of $A,B$ are nonnegative integers. The classical algorithm to compute<br>$A\star B$ uses the Fast Fourier Transform and runs in time $O(n\log n)$.<br> However, often $A$ and $B$ satisfy sparsity conditions, and hence one could<br>hope for significant improvements. The ideal goal is an $O(k\log k)$-time<br>algorithm, where $k$ is the number of non-zero elements in the output, i.e.,<br>the size of the support of $A\star B$. This problem is referred to as sparse<br>nonnegative convolution, and has received considerable attention in the<br>literature; the fastest algorithms to date run in time $O(k\log^2 n)$.<br> The main result of this paper is the first $O(k\log k)$-time algorithm for<br>sparse nonnegative convolution. Our algorithm is randomized and assumes that<br>the length $n$ and the largest entry of $A$ and $B$ are subexponential in $k$.<br>Surprisingly, we can phrase our algorithm as a reduction from the sparse case<br>to the dense case of nonnegative convolution, showing that, under some mild<br>assumptions, sparse nonnegative convolution is equivalent to dense nonnegative<br>convolution for constant-error randomized algorithms. Specifically, if $D(n)$<br>is the time to convolve two nonnegative length-$n$ vectors with success<br>probability $2/3$, and $S(k)$ is the time to convolve two nonnegative vectors<br>with output size $k$ with success probability $2/3$, then<br>$S(k)=O(D(k)+k(\log\log k)^2)$.<br> Our approach uses a variety of new techniques in combination with some old<br>machinery from linear sketching and structured linear algebra, as well as new<br>insights on linear hashing, the most classical hash function.<br>
Export
BibTeX
@online{Bringmann_2105.05984, TITLE = {Sparse Nonnegative Convolution Is Equivalent to Dense Nonnegative Convolution}, AUTHOR = {Bringmann, Karl and Fischer, Nick and Nakos, Vasileios}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2105.05984}, EPRINT = {2105.05984}, EPRINTTYPE = {arXiv}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Computing the convolution $A\star B$ of two length-$n$ vectors $A,B$ is an<br>ubiquitous computational primitive. Applications range from string problems to<br>Knapsack-type problems, and from 3SUM to All-Pairs Shortest Paths. These<br>applications often come in the form of nonnegative convolution, where the<br>entries of $A,B$ are nonnegative integers. The classical algorithm to compute<br>$A\star B$ uses the Fast Fourier Transform and runs in time $O(n\log n)$.<br> However, often $A$ and $B$ satisfy sparsity conditions, and hence one could<br>hope for significant improvements. The ideal goal is an $O(k\log k)$-time<br>algorithm, where $k$ is the number of non-zero elements in the output, i.e.,<br>the size of the support of $A\star B$. This problem is referred to as sparse<br>nonnegative convolution, and has received considerable attention in the<br>literature; the fastest algorithms to date run in time $O(k\log^2 n)$.<br> The main result of this paper is the first $O(k\log k)$-time algorithm for<br>sparse nonnegative convolution. Our algorithm is randomized and assumes that<br>the length $n$ and the largest entry of $A$ and $B$ are subexponential in $k$.<br>Surprisingly, we can phrase our algorithm as a reduction from the sparse case<br>to the dense case of nonnegative convolution, showing that, under some mild<br>assumptions, sparse nonnegative convolution is equivalent to dense nonnegative<br>convolution for constant-error randomized algorithms. Specifically, if $D(n)$<br>is the time to convolve two nonnegative length-$n$ vectors with success<br>probability $2/3$, and $S(k)$ is the time to convolve two nonnegative vectors<br>with output size $k$ with success probability $2/3$, then<br>$S(k)=O(D(k)+k(\log\log k)^2)$.<br> Our approach uses a variety of new techniques in combination with some old<br>machinery from linear sketching and structured linear algebra, as well as new<br>insights on linear hashing, the most classical hash function.<br>}, }
Endnote
%0 Report %A Bringmann, Karl %A Fischer, Nick %A Nakos, Vasileios %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Sparse Nonnegative Convolution Is Equivalent to Dense Nonnegative Convolution : %G eng %U http://hdl.handle.net/21.11116/0000-0008-E263-9 %U https://arxiv.org/abs/2105.05984 %D 2021 %X Computing the convolution $A\star B$ of two length-$n$ vectors $A,B$ is an<br>ubiquitous computational primitive. Applications range from string problems to<br>Knapsack-type problems, and from 3SUM to All-Pairs Shortest Paths. These<br>applications often come in the form of nonnegative convolution, where the<br>entries of $A,B$ are nonnegative integers. The classical algorithm to compute<br>$A\star B$ uses the Fast Fourier Transform and runs in time $O(n\log n)$.<br> However, often $A$ and $B$ satisfy sparsity conditions, and hence one could<br>hope for significant improvements. The ideal goal is an $O(k\log k)$-time<br>algorithm, where $k$ is the number of non-zero elements in the output, i.e.,<br>the size of the support of $A\star B$. This problem is referred to as sparse<br>nonnegative convolution, and has received considerable attention in the<br>literature; the fastest algorithms to date run in time $O(k\log^2 n)$.<br> The main result of this paper is the first $O(k\log k)$-time algorithm for<br>sparse nonnegative convolution. Our algorithm is randomized and assumes that<br>the length $n$ and the largest entry of $A$ and $B$ are subexponential in $k$.<br>Surprisingly, we can phrase our algorithm as a reduction from the sparse case<br>to the dense case of nonnegative convolution, showing that, under some mild<br>assumptions, sparse nonnegative convolution is equivalent to dense nonnegative<br>convolution for constant-error randomized algorithms. Specifically, if $D(n)$<br>is the time to convolve two nonnegative length-$n$ vectors with success<br>probability $2/3$, and $S(k)$ is the time to convolve two nonnegative vectors<br>with output size $k$ with success probability $2/3$, then<br>$S(k)=O(D(k)+k(\log\log k)^2)$.<br> Our approach uses a variety of new techniques in combination with some old<br>machinery from linear sketching and structured linear algebra, as well as new<br>insights on linear hashing, the most classical hash function.<br> %K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Computational Complexity, cs.CC
[141]
K. Bringmann, V. Cohen-Addad, and D. Das, “A Linear-Time n0.4-Approximation for Longest Common Subsequence,” 2021. [Online]. Available: https://arxiv.org/abs/2106.08195. (arXiv: 2106.08195)
Abstract
We consider the classic problem of computing the Longest Common Subsequence<br>(LCS) of two strings of length $n$. While a simple quadratic algorithm has been<br>known for the problem for more than 40 years, no faster algorithm has been<br>found despite an extensive effort. The lack of progress on the problem has<br>recently been explained by Abboud, Backurs, and Vassilevska Williams [FOCS'15]<br>and Bringmann and K\"unnemann [FOCS'15] who proved that there is no<br>subquadratic algorithm unless the Strong Exponential Time Hypothesis fails.<br>This has led the community to look for subquadratic approximation algorithms<br>for the problem.<br> Yet, unlike the edit distance problem for which a constant-factor<br>approximation in almost-linear time is known, very little progress has been<br>made on LCS, making it a notoriously difficult problem also in the realm of<br>approximation. For the general setting, only a naive<br>$O(n^{\varepsilon/2})$-approximation algorithm with running time<br>$\tilde{O}(n^{2-\varepsilon})$ has been known, for any constant $0 <<br>\varepsilon \le 1$. Recently, a breakthrough result by Hajiaghayi, Seddighin,<br>Seddighin, and Sun [SODA'19] provided a linear-time algorithm that yields a<br>$O(n^{0.497956})$-approximation in expectation; improving upon the naive<br>$O(\sqrt{n})$-approximation for the first time.<br> In this paper, we provide an algorithm that in time $O(n^{2-\varepsilon})$<br>computes an $\tilde{O}(n^{2\varepsilon/5})$-approximation with high<br>probability, for any $0 < \varepsilon \le 1$. Our result (1) gives an<br>$\tilde{O}(n^{0.4})$-approximation in linear time, improving upon the bound of<br>Hajiaghayi, Seddighin, Seddighin, and Sun, (2) provides an algorithm whose<br>approximation scales with any subquadratic running time $O(n^{2-\varepsilon})$,<br>improving upon the naive bound of $O(n^{\varepsilon/2})$ for any $\varepsilon$,<br>and (3) instead of only in expectation, succeeds with high probability.<br>
Export
BibTeX
@online{Bringmann_2106.08195, TITLE = {A Linear-Time $n^{0.4}$-Approximation for Longest Common Subsequence}, AUTHOR = {Bringmann, Karl and Cohen-Addad, Vincent and Das, Debarati}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2106.08195}, EPRINT = {2106.08195}, EPRINTTYPE = {arXiv}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We consider the classic problem of computing the Longest Common Subsequence<br>(LCS) of two strings of length $n$. While a simple quadratic algorithm has been<br>known for the problem for more than 40 years, no faster algorithm has been<br>found despite an extensive effort. The lack of progress on the problem has<br>recently been explained by Abboud, Backurs, and Vassilevska Williams [FOCS'15]<br>and Bringmann and K\"unnemann [FOCS'15] who proved that there is no<br>subquadratic algorithm unless the Strong Exponential Time Hypothesis fails.<br>This has led the community to look for subquadratic approximation algorithms<br>for the problem.<br> Yet, unlike the edit distance problem for which a constant-factor<br>approximation in almost-linear time is known, very little progress has been<br>made on LCS, making it a notoriously difficult problem also in the realm of<br>approximation. For the general setting, only a naive<br>$O(n^{\varepsilon/2})$-approximation algorithm with running time<br>$\tilde{O}(n^{2-\varepsilon})$ has been known, for any constant $0 <<br>\varepsilon \le 1$. Recently, a breakthrough result by Hajiaghayi, Seddighin,<br>Seddighin, and Sun [SODA'19] provided a linear-time algorithm that yields a<br>$O(n^{0.497956})$-approximation in expectation; improving upon the naive<br>$O(\sqrt{n})$-approximation for the first time.<br> In this paper, we provide an algorithm that in time $O(n^{2-\varepsilon})$<br>computes an $\tilde{O}(n^{2\varepsilon/5})$-approximation with high<br>probability, for any $0 < \varepsilon \le 1$. Our result (1) gives an<br>$\tilde{O}(n^{0.4})$-approximation in linear time, improving upon the bound of<br>Hajiaghayi, Seddighin, Seddighin, and Sun, (2) provides an algorithm whose<br>approximation scales with any subquadratic running time $O(n^{2-\varepsilon})$,<br>improving upon the naive bound of $O(n^{\varepsilon/2})$ for any $\varepsilon$,<br>and (3) instead of only in expectation, succeeds with high probability.<br>}, }
Endnote
%0 Report %A Bringmann, Karl %A Cohen-Addad, Vincent %A Das, Debarati %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T A Linear-Time n0.4-Approximation for Longest Common Subsequence : %G eng %U http://hdl.handle.net/21.11116/0000-0008-E267-5 %U https://arxiv.org/abs/2106.08195 %D 2021 %X We consider the classic problem of computing the Longest Common Subsequence<br>(LCS) of two strings of length $n$. While a simple quadratic algorithm has been<br>known for the problem for more than 40 years, no faster algorithm has been<br>found despite an extensive effort. The lack of progress on the problem has<br>recently been explained by Abboud, Backurs, and Vassilevska Williams [FOCS'15]<br>and Bringmann and K\"unnemann [FOCS'15] who proved that there is no<br>subquadratic algorithm unless the Strong Exponential Time Hypothesis fails.<br>This has led the community to look for subquadratic approximation algorithms<br>for the problem.<br> Yet, unlike the edit distance problem for which a constant-factor<br>approximation in almost-linear time is known, very little progress has been<br>made on LCS, making it a notoriously difficult problem also in the realm of<br>approximation. For the general setting, only a naive<br>$O(n^{\varepsilon/2})$-approximation algorithm with running time<br>$\tilde{O}(n^{2-\varepsilon})$ has been known, for any constant $0 <<br>\varepsilon \le 1$. Recently, a breakthrough result by Hajiaghayi, Seddighin,<br>Seddighin, and Sun [SODA'19] provided a linear-time algorithm that yields a<br>$O(n^{0.497956})$-approximation in expectation; improving upon the naive<br>$O(\sqrt{n})$-approximation for the first time.<br> In this paper, we provide an algorithm that in time $O(n^{2-\varepsilon})$<br>computes an $\tilde{O}(n^{2\varepsilon/5})$-approximation with high<br>probability, for any $0 < \varepsilon \le 1$. Our result (1) gives an<br>$\tilde{O}(n^{0.4})$-approximation in linear time, improving upon the bound of<br>Hajiaghayi, Seddighin, Seddighin, and Sun, (2) provides an algorithm whose<br>approximation scales with any subquadratic running time $O(n^{2-\varepsilon})$,<br>improving upon the naive bound of $O(n^{\varepsilon/2})$ for any $\varepsilon$,<br>and (3) instead of only in expectation, succeeds with high probability.<br> %K Computer Science, Data Structures and Algorithms, cs.DS,
[142]
P. Charalampopoulos, T. Kociumaka, and P. Wellnitz, “Faster Approximate Pattern Matching: A Unified Approach,” in FOCS 2020, 61st Annual IEEE Symposium on Foundations of Computer Science, Durham, NC, USA (Virtual Conference), 2021.
Export
BibTeX
@inproceedings{Charalampopoulos_FOCS2020, TITLE = {Faster Approximate Pattern Matching: {A} Unified Approach}, AUTHOR = {Charalampopoulos, Panagiotis and Kociumaka, Tomasz and Wellnitz, Philip}, LANGUAGE = {eng}, ISBN = {978-1-7281-9621-3}, DOI = {10.1109/FOCS46700.2020}, PUBLISHER = {IEEE}, YEAR = {2020}, MARGINALMARK = {$\bullet$}, DATE = {2021}, BOOKTITLE = {FOCS 2020, 61st Annual IEEE Symposium on Foundations of Computer Science}, PAGES = {978--989}, ADDRESS = {Durham, NC, USA (Virtual Conference)}, }
Endnote
%0 Conference Proceedings %A Charalampopoulos, Panagiotis %A Kociumaka, Tomasz %A Wellnitz, Philip %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Faster Approximate Pattern Matching: A Unified Approach : %G eng %U http://hdl.handle.net/21.11116/0000-0007-8C66-9 %R 10.1109/FOCS46700.2020 %D 2021 %B 61st Annual IEEE Symposium on Foundations of Computer Science %Z date of event: 2020-11-16 - 2020-11-19 %C Durham, NC, USA (Virtual Conference) %B FOCS 2020 %P 978 - 989 %I IEEE %@ 978-1-7281-9621-3
[143]
B. R. Chaudhury, “Finding Fair and Efficient Allocations,” Universität des Saarlandes, Saarbrücken, 2021.
Export
BibTeX
@phdthesis{Chaudphd2021, TITLE = {Finding Fair and Efficient Allocations}, AUTHOR = {Chaudhury, Bhaskar Ray}, LANGUAGE = {eng}, URL = {nbn:de:bsz:291--ds-345370}, DOI = {10.22028/D291-34537}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, DATE = {2021}, }
Endnote
%0 Thesis %A Chaudhury, Bhaskar Ray %Y Mehlhorn, Kurt %A referee: Bringmann, Karl %A referee: Roughgarden, Tim %A referee: Moulin, Herve %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society International Max Planck Research School, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Finding Fair and Efficient Allocations : %G eng %U http://hdl.handle.net/21.11116/0000-0009-9CC9-5 %R 10.22028/D291-34537 %U nbn:de:bsz:291--ds-345370 %F OTHER: hdl:20.500.11880/31737 %I Universit&#228;t des Saarlandes %C Saarbr&#252;cken %D 2021 %P 173 p. %V phd %9 phd %U https://publikationen.sulb.uni-saarland.de/handle/20.500.11880/31737
[144]
B. R. Chaudhury, J. Garg, K. Mehlhorn, R. Mehta, and P. Misra, “Improving EFX Guarantees through Rainbow Cycle Number,” in EC ’21, 22nd ACM Conference on Economics and Computation, Budapest, Hungary (Virtual), 2021.
Export
BibTeX
@inproceedings{Chaudhury_EC2021, TITLE = {Improving {EFX} Guarantees through Rainbow Cycle Number}, AUTHOR = {Chaudhury, Bhaskar Ray and Garg, Jugal and Mehlhorn, Kurt and Mehta, Ruta and Misra, Pranabendu}, LANGUAGE = {eng}, ISBN = {978-1-4503-8554-1}, DOI = {10.1145/3465456.3467605}, PUBLISHER = {ACM}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {EC '21, 22nd ACM Conference on Economics and Computation}, EDITOR = {Bir{\'o}, P{\'e}ter and Chawla, Shuchi and Echenique, Federico and Sodomka, Eric}, PAGES = {310--311}, ADDRESS = {Budapest, Hungary (Virtual)}, }
Endnote
%0 Conference Proceedings %A Chaudhury, Bhaskar Ray %A Garg, Jugal %A Mehlhorn, Kurt %A Mehta, Ruta %A Misra, Pranabendu %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Improving EFX Guarantees through Rainbow Cycle Number : %G eng %U http://hdl.handle.net/21.11116/0000-0009-B3F6-7 %R 10.1145/3465456.3467605 %D 2021 %B 22nd ACM Conference on Economics and Computation %Z date of event: 2021-07-18 - 2021-07-23 %C Budapest, Hungary (Virtual) %B EC '21 %E Bir&#243;, P&#233;ter; Chawla, Shuchi; Echenique, Federico; Sodomka, Eric %P 310 - 311 %I ACM %@ 978-1-4503-8554-1
[145]
M. Cheraghchi and V. Nakos, “Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time,” in FOCS 2020, 61st Annual IEEE Symposium on Foundations of Computer Science, Durham, NC, USA (Virtual Conference), 2021.
Export
BibTeX
@inproceedings{Cheraghchi_FOCS2020, TITLE = {Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time}, AUTHOR = {Cheraghchi, Mahdi and Nakos, Vasileios}, LANGUAGE = {eng}, ISBN = {978-1-7281-9621-3}, DOI = {10.1109/FOCS46700.2020}, PUBLISHER = {IEEE}, YEAR = {2020}, MARGINALMARK = {$\bullet$}, DATE = {2021}, BOOKTITLE = {FOCS 2020, 61st Annual IEEE Symposium on Foundations of Computer Science}, PAGES = {1203--1213}, ADDRESS = {Durham, NC, USA (Virtual Conference)}, }
Endnote
%0 Conference Proceedings %A Cheraghchi, Mahdi %A Nakos, Vasileios %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time : %G eng %U http://hdl.handle.net/21.11116/0000-0007-56C6-9 %R 10.1109/FOCS46700.2020 %D 2021 %B 61st Annual IEEE Symposium on Foundations of Computer Science %Z date of event: 2020-11-16 - 2020-11-19 %C Durham, NC, USA (Virtual Conference) %B FOCS 2020 %P 1203 - 1213 %I IEEE %@ 978-1-7281-9621-3
[146]
C. Coupette, J. Singh, and H. Spamann, “Simplify Your Law: Using Information Theory to Deduplicate Legal Documents,” in 21st IEEE International Conference on Data Mining Workshops (ICDMW 2021), Virtual Conference, 2021.
Export
BibTeX
@inproceedings{CoupetteICDMW21, TITLE = {Simplify Your Law: Using Information Theory to Deduplicate Legal Documents}, AUTHOR = {Coupette, Corinna and Singh, Jyotsna and Spamann, Holger}, LANGUAGE = {eng}, ISBN = {978-1-6654-2428-8}, DOI = {10.1109/ICDMW53433.2021.00083}, PUBLISHER = {IEEE}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, DATE = {2021}, BOOKTITLE = {21st IEEE International Conference on Data Mining Workshops (ICDMW 2021)}, EDITOR = {Xue, Bing and Pechenizkiy, Mykola and Koh, Yun Sing}, PAGES = {631--638}, ADDRESS = {Virtual Conference}, }
Endnote
%0 Conference Proceedings %A Coupette, Corinna %A Singh, Jyotsna %A Spamann, Holger %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Simplify Your Law: Using Information Theory to Deduplicate Legal Documents : %G eng %U http://hdl.handle.net/21.11116/0000-000A-5E10-B %R 10.1109/ICDMW53433.2021.00083 %D 2021 %B 21st IEEE International Conference on Data Mining Workshops %Z date of event: 2021-12-07 - 2021-12-10 %C Virtual Conference %B 21st IEEE International Conference on Data Mining Workshops %E Xue, Bing; Pechenizkiy, Mykola; Koh, Yun Sing %P 631 - 638 %I IEEE %@ 978-1-6654-2428-8
[147]
C. Coupette, J. Beckedorf, D. Hartung, M. Bommarito, and D. M. Katz, “Measuring Law Over Time: A Network Analytical Framework with an Application to Statutes and Regulations in the United States and Germany,” Frontiers in Physics, vol. 9, 2021.
Export
BibTeX
@article{Coupette2021, TITLE = {Measuring Law Over Time: {A} Network Analytical Framework with an Application to Statutes and Regulations in the {United States} and {Germany}}, AUTHOR = {Coupette, Corinna and Beckedorf, Janis and Hartung, Dirk and Bommarito, Michael and Katz, Daniel Martin}, LANGUAGE = {eng}, ISSN = {2296-424X}, DOI = {10.3389/fphy.2021.658463}, PUBLISHER = {Frontiers Media}, ADDRESS = {Lausanne}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, JOURNAL = {Frontiers in Physics}, VOLUME = {9}, EID = {658463}, }
Endnote
%0 Journal Article %A Coupette, Corinna %A Beckedorf, Janis %A Hartung, Dirk %A Bommarito, Michael %A Katz, Daniel Martin %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations %T Measuring Law Over Time: A Network Analytical Framework with an Application to Statutes and Regulations in the United States and Germany : %G eng %U http://hdl.handle.net/21.11116/0000-0008-D8FA-B %R 10.3389/fphy.2021.658463 %7 2021 %D 2021 %J Frontiers in Physics %V 9 %Z sequence number: 658463 %I Frontiers Media %C Lausanne %@ false
[148]
C. Coupette and J. Vreeken, “Graph Similarity Description: How Are These Graphs Similar?,” in KDD ’21, 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Virtual Event, Singapore, 2021.
Export
BibTeX
@inproceedings{Coupette_KDD2021, TITLE = {Graph Similarity Description: {H}ow Are These Graphs Similar?}, AUTHOR = {Coupette, Corinna and Vreeken, Jilles}, LANGUAGE = {eng}, ISBN = {978-1-4503-8332-5}, DOI = {10.1145/3447548.3467257}, PUBLISHER = {ACM}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {KDD '21, 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining}, EDITOR = {Zhu, Fieda and Ooi, Beng, Chin and Miao, Chunyan and Cong, Gao and Tang, Jiliang and Derr, Tyler}, PAGES = {185--195}, ADDRESS = {Virtual Event, Singapore}, }
Endnote
%0 Conference Proceedings %A Coupette, Corinna %A Vreeken, Jilles %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Graph Similarity Description: How Are These Graphs Similar? : %G eng %U http://hdl.handle.net/21.11116/0000-0009-652C-5 %R 10.1145/3447548.3467257 %D 2021 %B 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining %Z date of event: 2021-08-14 - 2021-08-18 %C Virtual Event, Singapore %B KDD '21 %E Zhu, Fieda; Ooi, Beng, Chin; Miao, Chunyan; Cong, Gao; Tang, Jiliang; Derr, Tyler %P 185 - 195 %I ACM %@ 978-1-4503-8332-5
[149]
C. Coupette and C. Lenzen, “A Breezing Proof of the KMW Bound,” in Symposium on Simplicity in Algorithms (SOSA 2021), Alexandria, VA, USA (Virtual Conference), 2021.
Export
BibTeX
@inproceedings{Coupette_SOSA2020, TITLE = {A Breezing Proof of the {KMW} Bound}, AUTHOR = {Coupette, Corinna and Lenzen, Christoph}, LANGUAGE = {eng}, ISBN = {978-1-61197-649-6}, DOI = {10.1137/1.9781611976496.21}, PUBLISHER = {SIAM}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Symposium on Simplicity in Algorithms (SOSA 2021)}, EDITOR = {King, Valerie and Viet Le, Hung}, PAGES = {184--195}, ADDRESS = {Alexandria, VA, USA (Virtual Conference)}, }
Endnote
%0 Conference Proceedings %A Coupette, Corinna %A Lenzen, Christoph %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Breezing Proof of the KMW Bound : %G eng %U http://hdl.handle.net/21.11116/0000-0007-7A44-4 %R 10.1137/1.9781611976496.21 %D 2021 %B SIAM Symposium on Simplicity in Algorithms %Z date of event: 2021-01-11 - 2021-01-12 %C Alexandria, VA, USA (Virtual Conference) %B Symposium on Simplicity in Algorithms %E King, Valerie; Viet Le, Hung %P 184 - 195 %I SIAM %@ 978-1-61197-649-6
[150]
E. Cruciani, E. Natale, A. Nusser, and G. Scornavacca, “Phase Transition of the 2-Choices Dynamics on Core-Periphery Networks,” Distributed Computing, vol. 34, 2021.
Export
BibTeX
@article{Cruciani_DC2021, TITLE = {Phase Transition of the 2-Choices Dynamics on Core-Periphery Networks}, AUTHOR = {Cruciani, Emilio and Natale, Emanuele and Nusser, Andr{\'e} and Scornavacca, Giacomo}, LANGUAGE = {eng}, ISSN = {0178-2770}, DOI = {10.1007/s00446-021-00396-5}, PUBLISHER = {Springer International}, ADDRESS = {Berlin}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, JOURNAL = {Distributed Computing}, VOLUME = {34}, PAGES = {207--225}, }
Endnote
%0 Journal Article %A Cruciani, Emilio %A Natale, Emanuele %A Nusser, Andr&#233; %A Scornavacca, Giacomo %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Phase Transition of the 2-Choices Dynamics on Core-Periphery Networks : %G eng %U http://hdl.handle.net/21.11116/0000-0008-BA11-3 %R 10.1007/s00446-021-00396-5 %7 2021 %D 2021 %J Distributed Computing %V 34 %& 207 %P 207 - 225 %I Springer International %C Berlin %@ false
[151]
O. Darwish, A. Elmasry, and J. Katajainen, “Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls,” ACM Transactions on Algorithms, vol. 17, no. 2, 2021.
Export
BibTeX
@article{Darwish2021, TITLE = {Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls}, AUTHOR = {Darwish, Omar and Elmasry, Amr and Katajainen, Jyrki}, LANGUAGE = {eng}, ISSN = {1549-6325}, DOI = {10.1145/3452938}, PUBLISHER = {ACM}, ADDRESS = {New York, NY}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, JOURNAL = {ACM Transactions on Algorithms}, VOLUME = {17}, NUMBER = {2}, EID = {18}, }
Endnote
%0 Journal Article %A Darwish, Omar %A Elmasry, Amr %A Katajainen, Jyrki %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls : %G eng %U http://hdl.handle.net/21.11116/0000-0008-D8F2-3 %R 10.1145/3452938 %7 2021 %D 2021 %J ACM Transactions on Algorithms %V 17 %N 2 %Z sequence number: 18 %I ACM %C New York, NY %@ false
[152]
N. R. Dayama, M. Shiripour, A. Oulasvirta, E. Ivanko, and A. Karrenbauer, “Foraging-based Optimization of Menu Systems,” International Journal of Human-Computer Studies, vol. 151, 2021.
Export
BibTeX
@article{Dayama2021, TITLE = {Foraging-based Optimization of Menu Systems}, AUTHOR = {Dayama, Niraj Ramesh and Shiripour, Morteza and Oulasvirta, Antti and Ivanko, Evgeny and Karrenbauer, Andreas}, LANGUAGE = {eng}, ISSN = {1071-5819}, DOI = {10.1016/j.ijhcs.2021.102624}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, DATE = {2021}, JOURNAL = {International Journal of Human-Computer Studies}, VOLUME = {151}, EID = {102624}, }
Endnote
%0 Journal Article %A Dayama, Niraj Ramesh %A Shiripour, Morteza %A Oulasvirta, Antti %A Ivanko, Evgeny %A Karrenbauer, Andreas %+ External Organizations External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Foraging-based Optimization of Menu Systems : %G eng %U http://hdl.handle.net/21.11116/0000-0008-9D57-6 %R 10.1016/j.ijhcs.2021.102624 %7 2021 %D 2021 %J International Journal of Human-Computer Studies %V 151 %Z sequence number: 102624 %I Elsevier %C Amsterdam %@ false
[153]
M. de Berg, S. Kisfaludi-Bak, M. Monemizadeh, and L. Theocharous, “Clique-Based Separators for Geometric Intersection Graphs,” in 32nd International Symposium on Algorithms and Computation (ISAAC 2021), Fukuoka, Japan, 2021.
Export
BibTeX
@inproceedings{deBerg_ISAAC21, TITLE = {Clique-Based Separators for Geometric Intersection Graphs}, AUTHOR = {de Berg, Mark and Kisfaludi-Bak, S{\'a}ndor and Monemizadeh, Morteza and Theocharous, Leonidas}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-214-3}, URL = {urn:nbn:de:0030-drops-154556}, DOI = {10.4230/LIPIcs.ISAAC.2021.22}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, EDITOR = {Ahn, Hee-Kap and Sadakane, Kunihiko}, PAGES = {1--15}, EID = {22}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {212}, ADDRESS = {Fukuoka, Japan}, }
Endnote
%0 Conference Proceedings %A de Berg, Mark %A Kisfaludi-Bak, S&#225;ndor %A Monemizadeh, Morteza %A Theocharous, Leonidas %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Clique-Based Separators for Geometric Intersection Graphs : %G eng %U http://hdl.handle.net/21.11116/0000-0009-B811-4 %R 10.4230/LIPIcs.ISAAC.2021.22 %U urn:nbn:de:0030-drops-154556 %D 2021 %B 32nd International Symposium on Algorithms and Computation %Z date of event: 2021-12-06 - 2021-12-08 %C Fukuoka, Japan %B 32nd International Symposium on Algorithms and Computation %E Ahn, Hee-Kap; Sadakane, Kunihiko %P 1 - 15 %Z sequence number: 22 %I Schloss Dagstuhl %@ 978-3-95977-214-3 %B Leibniz International Proceedings in Informatics %N 212 %@ false
[154]
I. Diakonikolas, T. Gouleakis, D. M. Kane, J. Peebles, and E. Price, “Optimal Testing of Discrete Distributions with High Probability,” in STOC ’21, 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual, Italy, 2021.
Export
BibTeX
@inproceedings{Diakonikolas_STOC2021, TITLE = {Optimal Testing of Discrete Distributions with High Probability}, AUTHOR = {Diakonikolas, Ilias and Gouleakis, Themis and Kane, Daniel M. and Peebles, John and Price, Eric}, LANGUAGE = {eng}, ISBN = {9781450380539}, DOI = {10.1145/3406325.3450997}, PUBLISHER = {ACM}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {STOC '21, 53rd Annual ACM SIGACT Symposium on Theory of Computing}, EDITOR = {Khuller, Samir and Vassilevska Williams, Virginia}, PAGES = {542--555}, ADDRESS = {Virtual, Italy}, }
Endnote
%0 Conference Proceedings %A Diakonikolas, Ilias %A Gouleakis, Themis %A Kane, Daniel M. %A Peebles, John %A Price, Eric %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Optimal Testing of Discrete Distributions with High Probability : %G eng %U http://hdl.handle.net/21.11116/0000-000A-CD4F-8 %R 10.1145/3406325.3450997 %D 2021 %B 53rd Annual ACM SIGACT Symposium on Theory of Computing %Z date of event: 2021-06-21 - 2021-06-25 %C Virtual, Italy %B STOC '21 %E Khuller, Samir; Vassilevska Williams, Virginia %P 542 - 555 %I ACM %@ 9781450380539
[155]
J. Dörfler, M. Roth, J. Schmitt, and P. Wellnitz, “Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness,” Algorithmica, 2021.
Export
BibTeX
@article{Doerfler2021, TITLE = {Counting Induced Subgraphs: {A}n Algebraic Approach to \#{W}[1]-hardness}, AUTHOR = {D{\"o}rfler, Julian and Roth, Marc and Schmitt, Johannes and Wellnitz, Philip}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-021-00894-9}, PUBLISHER = {Springer-Verlag}, ADDRESS = {New York}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, JOURNAL = {Algorithmica}, }
Endnote
%0 Journal Article %A D&#246;rfler, Julian %A Roth, Marc %A Schmitt, Johannes %A Wellnitz, Philip %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness : %G eng %U http://hdl.handle.net/21.11116/0000-0009-A583-8 %R 10.1007/s00453-021-00894-9 %7 2021 %D 2021 %J Algorithmica %I Springer-Verlag %C New York %@ false
[156]
A. Driemel, A. Nusser, J. M. Phillips, and I. Psarros, “The VC Dimension of Metric Balls under Fréchet and Hausdorff Distances,” Discrete & Computational Geometry, 2021.
Export
BibTeX
@article{Driemel21, TITLE = {The {VC} Dimension of Metric Balls under {F}r\'{e}chet and {H}ausdorff Distances}, AUTHOR = {Driemel, Anne and Nusser, Andr{\'e} and Phillips, Jeff M. and Psarros, Ioannis}, LANGUAGE = {eng}, ISSN = {0179-5376}, DOI = {10.1007/s00454-021-00318-z}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, JOURNAL = {Discrete \& Computational Geometry}, }
Endnote
%0 Journal Article %A Driemel, Anne %A Nusser, Andr&#233; %A Phillips, Jeff M. %A Psarros, Ioannis %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T The VC Dimension of Metric Balls under Fr&#233;chet and Hausdorff Distances : %G eng %U http://hdl.handle.net/21.11116/0000-0009-414C-9 %R 10.1007/s00454-021-00318-z %7 2021 %D 2021 %J Discrete & Computational Geometry %I Springer %C New York, NY %@ false
[157]
M. Dyer, C. Greenhill, P. Kleer, J. Ross, and L. Stougie, “Sampling Hypergraphs with Given Degrees,” Discrete Mathematics, vol. 344, no. 11, 2021.
Export
BibTeX
@article{Dyer2021, TITLE = {Sampling Hypergraphs with Given Degrees}, AUTHOR = {Dyer, Martin and Greenhill, Catherine and Kleer, Pieter and Ross, James and Stougie, Leen}, LANGUAGE = {eng}, ISSN = {0012-365X}, DOI = {10.1016/j.disc.2021.112566}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, DATE = {2021}, JOURNAL = {Discrete Mathematics}, VOLUME = {344}, NUMBER = {11}, EID = {112566}, }
Endnote
%0 Journal Article %A Dyer, Martin %A Greenhill, Catherine %A Kleer, Pieter %A Ross, James %A Stougie, Leen %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Sampling Hypergraphs with Given Degrees : %G eng %U http://hdl.handle.net/21.11116/0000-0009-B820-3 %R 10.1016/j.disc.2021.112566 %7 2021 %D 2021 %J Discrete Mathematics %V 344 %N 11 %Z sequence number: 112566 %I Elsevier %C Amsterdam %@ false
[158]
A. M. Feit, M. Nancel, M. John, A. Karrenbauer, D. Weir, and A. Oulasvirta, “AZERTY Amélioré: Computational Design on a National Scale,” Communications of the ACM, vol. 64, no. 2, 2021.
Export
BibTeX
@article{FNJKWO2021, TITLE = {{AZERTY} Am\'{e}lior\'{e}: {C}omputational Design on a National Scale}, AUTHOR = {Feit, Anna Maria and Nancel, Mathieu and John, Maximilian and Karrenbauer, Andreas and Weir, Daryl and Oulasvirta, Antti}, LANGUAGE = {eng}, ISSN = {0001-0782}, DOI = {10.1145/3382035}, PUBLISHER = {Association for Computing Machinery, Inc.}, ADDRESS = {New York}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, JOURNAL = {Communications of the ACM}, VOLUME = {64}, NUMBER = {2}, PAGES = {48--58}, }
Endnote
%0 Journal Article %A Feit, Anna Maria %A Nancel, Mathieu %A John, Maximilian %A Karrenbauer, Andreas %A Weir, Daryl %A Oulasvirta, Antti %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T AZERTY Am&#233;lior&#233;: Computational Design on a National Scale : %G eng %U http://hdl.handle.net/21.11116/0000-0007-E78E-5 %R 10.1145/3382035 %7 2021 %D 2021 %K {F}r\'{e}chet %J Communications of the ACM %V 64 %N 2 %& 48 %P 48 - 58 %I Association for Computing Machinery, Inc. %C New York %@ false
[159]
F. Folz, K. Mehlhorn, and G. Morigi, “Interplay of Periodic Dynamics and Noise: Insights from a Simple Adaptive System,” Physical Review E, vol. 104, no. 5, 2021.
Export
BibTeX
@article{Folz2021, TITLE = {Interplay of Periodic Dynamics and Noise: {I}nsights from a Simple Adaptive System}, AUTHOR = {Folz, Frederic and Mehlhorn, Kurt and Morigi, Giovanna}, LANGUAGE = {eng}, ISSN = {1539-3755}, DOI = {10.1103/PhysRevE.104.054215}, PUBLISHER = {American Physical Society}, ADDRESS = {Melville, NY}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, DATE = {2021}, JOURNAL = {Physical Review E}, VOLUME = {104}, NUMBER = {5}, EID = {054215}, }
Endnote
%0 Journal Article %A Folz, Frederic %A Mehlhorn, Kurt %A Morigi, Giovanna %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Interplay of Periodic Dynamics and Noise: Insights from a Simple Adaptive System : %G eng %U http://hdl.handle.net/21.11116/0000-0009-9D3F-1 %R 10.1103/PhysRevE.104.054215 %7 2021 %D 2021 %J Physical Review E %O Phys. Rev. E %V 104 %N 5 %Z sequence number: 054215 %I American Physical Society %C Melville, NY %@ false
[160]
J. Giliberti and A. Karrenbauer, “Improved Online Algorithm for Fractional Knapsack in the Random Order Model,” 2021. [Online]. Available: https://arxiv.org/abs/2109.04428. (arXiv: 2109.04428)
Abstract
The fractional knapsack problem is one of the classical problems in<br>combinatorial optimization, which is well understood in the offline setting.<br>However, the corresponding online setting has been handled only briefly in the<br>theoretical computer science literature so far, although it appears in several<br>applications. Even the previously best known guarantee for the competitive<br>ratio was worse than the best known for the integral problem in the popular<br>random order model. We show that there is an algorithm for the online<br>fractional knapsack problem that admits a competitive ratio of 4.39. Our result<br>significantly improves over the previously best known competitive ratio of 9.37<br>and surpasses the current best 6.65-competitive algorithm for the integral<br>case. Moreover, our algorithm is deterministic in contrast to the randomized<br>algorithms achieving the results mentioned above.<br>
Export
BibTeX
@online{Gilberti2109.04428, TITLE = {Improved Online Algorithm for Fractional Knapsack in the Random Order Model}, AUTHOR = {Giliberti, Jeff and Karrenbauer, Andreas}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2109.04428}, EPRINT = {2109.04428}, EPRINTTYPE = {arXiv}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, ABSTRACT = {The fractional knapsack problem is one of the classical problems in<br>combinatorial optimization, which is well understood in the offline setting.<br>However, the corresponding online setting has been handled only briefly in the<br>theoretical computer science literature so far, although it appears in several<br>applications. Even the previously best known guarantee for the competitive<br>ratio was worse than the best known for the integral problem in the popular<br>random order model. We show that there is an algorithm for the online<br>fractional knapsack problem that admits a competitive ratio of 4.39. Our result<br>significantly improves over the previously best known competitive ratio of 9.37<br>and surpasses the current best 6.65-competitive algorithm for the integral<br>case. Moreover, our algorithm is deterministic in contrast to the randomized<br>algorithms achieving the results mentioned above.<br>}, }
Endnote
%0 Report %A Giliberti, Jeff %A Karrenbauer, Andreas %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Improved Online Algorithm for Fractional Knapsack in the Random Order Model : %G eng %U http://hdl.handle.net/21.11116/0000-0009-B637-C %U https://arxiv.org/abs/2109.04428 %D 2021 %X The fractional knapsack problem is one of the classical problems in<br>combinatorial optimization, which is well understood in the offline setting.<br>However, the corresponding online setting has been handled only briefly in the<br>theoretical computer science literature so far, although it appears in several<br>applications. Even the previously best known guarantee for the competitive<br>ratio was worse than the best known for the integral problem in the popular<br>random order model. We show that there is an algorithm for the online<br>fractional knapsack problem that admits a competitive ratio of 4.39. Our result<br>significantly improves over the previously best known competitive ratio of 9.37<br>and surpasses the current best 6.65-competitive algorithm for the integral<br>case. Moreover, our algorithm is deterministic in contrast to the randomized<br>algorithms achieving the results mentioned above.<br> %K Computer Science, Data Structures and Algorithms, cs.DS
[161]
M. Grohe, D. Neuen, and D. Wiebking, “Isomorphism Testing for Graphs Excluding Small Minors,” in FOCS 2020, 61st Annual IEEE Symposium on Foundations of Computer Science, Durham, NC, USA (Virtual Conference), 2021.
Export
BibTeX
@inproceedings{Grohe_FOCS2020, TITLE = {Isomorphism Testing for Graphs Excluding Small Minors}, AUTHOR = {Grohe, Martin and Neuen, Daniel and Wiebking, Daniel}, LANGUAGE = {eng}, ISBN = {978-1-7281-9621-3}, DOI = {10.1109/FOCS46700.2020.00064}, PUBLISHER = {IEEE}, YEAR = {2020}, MARGINALMARK = {$\bullet$}, DATE = {2021}, BOOKTITLE = {FOCS 2020, 61st Annual IEEE Symposium on Foundations of Computer Science}, PAGES = {625--636}, ADDRESS = {Durham, NC, USA (Virtual Conference)}, }
Endnote
%0 Conference Proceedings %A Grohe, Martin %A Neuen, Daniel %A Wiebking, Daniel %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Isomorphism Testing for Graphs Excluding Small Minors : %G eng %U http://hdl.handle.net/21.11116/0000-0007-9947-D %R 10.1109/FOCS46700.2020.00064 %D 2021 %B 61st Annual IEEE Symposium on Foundations of Computer Science %Z date of event: 2020-11-16 - 2020-11-19 %C Durham, NC, USA (Virtual Conference) %B FOCS 2020 %P 625 - 636 %I IEEE %@ 978-1-7281-9621-3
[162]
P. Kleer and H. U. Simon, “Primal and Dual Combinatorial Dimensions,” 2021. [Online]. Available: https://arxiv.org/abs/2108.10037. (arXiv: 2108.10037)
Abstract
We give tight bounds on the relation between the primal and dual of various<br>combinatorial dimensions, such as the pseudo-dimension and fat-shattering<br>dimension, for multi-valued function classes. These dimensional notions play an<br>important role in the area of learning theory. We first review some (folklore)<br>results that bound the dual dimension of a function class in terms of its<br>primal, and after that give (almost) matching lower bounds. In particular, we<br>give an appropriate generalization to multi-valued function classes of a<br>well-known bound due to Assouad (1983), that relates the primal and dual<br>VC-dimension of a binary function class.<br>
Export
BibTeX
@online{Kleer_2108.10037, TITLE = {Primal and Dual Combinatorial Dimensions}, AUTHOR = {Kleer, Pieter and Simon, Hans Ulrich}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2108.10037}, EPRINT = {2108.10037}, EPRINTTYPE = {arXiv}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We give tight bounds on the relation between the primal and dual of various<br>combinatorial dimensions, such as the pseudo-dimension and fat-shattering<br>dimension, for multi-valued function classes. These dimensional notions play an<br>important role in the area of learning theory. We first review some (folklore)<br>results that bound the dual dimension of a function class in terms of its<br>primal, and after that give (almost) matching lower bounds. In particular, we<br>give an appropriate generalization to multi-valued function classes of a<br>well-known bound due to Assouad (1983), that relates the primal and dual<br>VC-dimension of a binary function class.<br>}, }
Endnote
%0 Report %A Kleer, Pieter %A Simon, Hans Ulrich %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Primal and Dual Combinatorial Dimensions : %G eng %U http://hdl.handle.net/21.11116/0000-0009-B834-D %U https://arxiv.org/abs/2108.10037 %D 2021 %X We give tight bounds on the relation between the primal and dual of various<br>combinatorial dimensions, such as the pseudo-dimension and fat-shattering<br>dimension, for multi-valued function classes. These dimensional notions play an<br>important role in the area of learning theory. We first review some (folklore)<br>results that bound the dual dimension of a function class in terms of its<br>primal, and after that give (almost) matching lower bounds. In particular, we<br>give an appropriate generalization to multi-valued function classes of a<br>well-known bound due to Assouad (1983), that relates the primal and dual<br>VC-dimension of a binary function class.<br> %K Mathematics, Combinatorics, math.CO,Computer Science, Discrete Mathematics, cs.DM,Computer Science, Learning, cs.LG
[163]
P. Kleer, “Sampling from the Gibbs Distribution in Congestion Games,” in EC ’21, 22nd ACM Conference on Economics and Computation, Budapest, Hungary (Virtual), 2021.
Export
BibTeX
@inproceedings{Kleer_EC2021, TITLE = {Sampling from the {G}ibbs Distribution in Congestion Games}, AUTHOR = {Kleer, Pieter}, LANGUAGE = {eng}, ISBN = {978-1-4503-8554-1}, DOI = {10.1145/3465456.3467597}, PUBLISHER = {ACM}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {EC '21, 22nd ACM Conference on Economics and Computation}, EDITOR = {Bir{\'o}, P{\'e}ter and Chawla, Shuchi and Echenique, Federico and Sodomka, Eric}, PAGES = {679--680}, ADDRESS = {Budapest, Hungary (Virtual)}, }
Endnote
%0 Conference Proceedings %A Kleer, Pieter %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Sampling from the Gibbs Distribution in Congestion Games : %G eng %U http://hdl.handle.net/21.11116/0000-0009-B3F8-5 %R 10.1145/3465456.3467597 %D 2021 %B 22nd ACM Conference on Economics and Computation %Z date of event: 2021-07-18 - 2021-07-23 %C Budapest, Hungary (Virtual) %B EC '21 %E Bir&#243;, P&#233;ter; Chawla, Shuchi; Echenique, Federico; Sodomka, Eric %P 679 - 680 %I ACM %@ 978-1-4503-8554-1
[164]
P. Kleer, “Sampling from the Gibbs Distribution in Congestion Games,” 2021. [Online]. Available: https://arxiv.org/abs/2105.12982. (arXiv: 2105.12982)
Abstract
Logit dynamics is a form of randomized game dynamics where players have a<br>bias towards strategic deviations that give a higher improvement in cost. It is<br>used extensively in practice. In congestion (or potential) games, the dynamics<br>converges to the so-called Gibbs distribution over the set of all strategy<br>profiles, when interpreted as a Markov chain. In general, logit dynamics might<br>converge slowly to the Gibbs distribution, but beyond that, not much is known<br>about their algorithmic aspects, nor that of the Gibbs distribution. In this<br>work, we are interested in the following two questions for congestion games: i)<br>Is there an efficient algorithm for sampling from the Gibbs distribution? ii)<br>If yes, do there also exist natural randomized dynamics that converges quickly<br>to the Gibbs distribution?<br> We first study these questions in extension parallel congestion games, a<br>well-studied special case of symmetric network congestion games. As our main<br>result, we show that there is a simple variation on the logit dynamics (in<br>which we in addition are allowed to randomly interchange the strategies of two<br>players) that converges quickly to the Gibbs distribution in such games. This<br>answers both questions above affirmatively. We also address the first question<br>for the class of so-called capacitated $k$-uniform congestion games.<br> To prove our results, we rely on the recent breakthrough work of Anari, Liu,<br>Oveis-Gharan and Vinzant (2019) concerning the approximate sampling of the base<br>of a matroid according to strongly log-concave probability distribution.<br>
Export
BibTeX
@online{Kleer_2105.12982, TITLE = {Sampling from the {G}ibbs Distribution in Congestion Games}, AUTHOR = {Kleer, Pieter}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2105.12982}, EPRINT = {2105.12982}, EPRINTTYPE = {arXiv}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Logit dynamics is a form of randomized game dynamics where players have a<br>bias towards strategic deviations that give a higher improvement in cost. It is<br>used extensively in practice. In congestion (or potential) games, the dynamics<br>converges to the so-called Gibbs distribution over the set of all strategy<br>profiles, when interpreted as a Markov chain. In general, logit dynamics might<br>converge slowly to the Gibbs distribution, but beyond that, not much is known<br>about their algorithmic aspects, nor that of the Gibbs distribution. In this<br>work, we are interested in the following two questions for congestion games: i)<br>Is there an efficient algorithm for sampling from the Gibbs distribution? ii)<br>If yes, do there also exist natural randomized dynamics that converges quickly<br>to the Gibbs distribution?<br> We first study these questions in extension parallel congestion games, a<br>well-studied special case of symmetric network congestion games. As our main<br>result, we show that there is a simple variation on the logit dynamics (in<br>which we in addition are allowed to randomly interchange the strategies of two<br>players) that converges quickly to the Gibbs distribution in such games. This<br>answers both questions above affirmatively. We also address the first question<br>for the class of so-called capacitated $k$-uniform congestion games.<br> To prove our results, we rely on the recent breakthrough work of Anari, Liu,<br>Oveis-Gharan and Vinzant (2019) concerning the approximate sampling of the base<br>of a matroid according to strongly log-concave probability distribution.<br>}, }
Endnote
%0 Report %A Kleer, Pieter %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Sampling from the Gibbs Distribution in Congestion Games : %G eng %U http://hdl.handle.net/21.11116/0000-0008-E54C-1 %U https://arxiv.org/abs/2105.12982 %D 2021 %X Logit dynamics is a form of randomized game dynamics where players have a<br>bias towards strategic deviations that give a higher improvement in cost. It is<br>used extensively in practice. In congestion (or potential) games, the dynamics<br>converges to the so-called Gibbs distribution over the set of all strategy<br>profiles, when interpreted as a Markov chain. In general, logit dynamics might<br>converge slowly to the Gibbs distribution, but beyond that, not much is known<br>about their algorithmic aspects, nor that of the Gibbs distribution. In this<br>work, we are interested in the following two questions for congestion games: i)<br>Is there an efficient algorithm for sampling from the Gibbs distribution? ii)<br>If yes, do there also exist natural randomized dynamics that converges quickly<br>to the Gibbs distribution?<br> We first study these questions in extension parallel congestion games, a<br>well-studied special case of symmetric network congestion games. As our main<br>result, we show that there is a simple variation on the logit dynamics (in<br>which we in addition are allowed to randomly interchange the strategies of two<br>players) that converges quickly to the Gibbs distribution in such games. This<br>answers both questions above affirmatively. We also address the first question<br>for the class of so-called capacitated $k$-uniform congestion games.<br> To prove our results, we rely on the recent breakthrough work of Anari, Liu,<br>Oveis-Gharan and Vinzant (2019) concerning the approximate sampling of the base<br>of a matroid according to strongly log-concave probability distribution.<br> %K Computer Science, Computer Science and Game Theory, cs.GT,Computer Science, Discrete Mathematics, cs.DM,Computer Science, Data Structures and Algorithms, cs.DS
[165]
P. Kleer and G. Schäfer, “Computation and Efficiency of Potential Function Minimizers of Combinatorial Congestion Games,” Mathematical Programming, vol. 190, no. 1, 2021.
Export
BibTeX
@article{Kleer2020, TITLE = {Computation and Efficiency of Potential Function Minimizers of Combinatorial Congestion Games}, AUTHOR = {Kleer, Pieter and Sch{\"a}fer, Guido}, LANGUAGE = {eng}, DOI = {10.1007/s10107-020-01546-6}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, DATE = {2021}, JOURNAL = {Mathematical Programming}, VOLUME = {190}, NUMBER = {1}, PAGES = {523--560}, }
Endnote
%0 Journal Article %A Kleer, Pieter %A Sch&#228;fer, Guido %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Computation and Efficiency of Potential Function Minimizers of Combinatorial Congestion Games : %G eng %U http://hdl.handle.net/21.11116/0000-0006-F285-2 %R 10.1007/s10107-020-01546-6 %7 2020 %D 2021 %J Mathematical Programming %V 190 %N 1 %& 523 %P 523 - 560 %I Springer %C New York, NY
[166]
M. Künnemann and A. Nusser, “Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union,” 2021. [Online]. Available: https://arxiv.org/abs/2111.02544. (arXiv: 2111.02544)
Abstract
We revisit the classical problem of determining the largest copy of a simple<br>polygon $P$ that can be placed into a simple polygon $Q$. Despite significant<br>effort, known algorithms require high polynomial running times. (Barequet and<br>Har-Peled, 2001) give a lower bound of $n^{2-o(1)}$ under the 3SUM conjecture<br>when $P$ and $Q$ are (convex) polygons with $\Theta(n)$ vertices each. This<br>leaves open whether we can establish (1) hardness beyond quadratic time and (2)<br>any superlinear bound for constant-sized $P$ or $Q$.<br> In this paper, we affirmatively answer these questions under the $k$SUM<br>conjecture, proving natural hardness results that increase with each degree of<br>freedom (scaling, $x$-translation, $y$-translation, rotation): (1) Finding the<br>largest copy of $P$ that can be $x$-translated into $Q$ requires time<br>$n^{2-o(1)}$ under the 3SUM conjecture. (2) Finding the largest copy of $P$<br>that can be arbitrarily translated into $Q$ requires time $n^{2-o(1)}$ under<br>the 4SUM conjecture. (3) The above lower bounds are almost tight when one of<br>the polygons is of constant size: we obtain an $\tilde O((pq)^{2.5})$-time<br>algorithm for orthogonal polygons $P,Q$ with $p$ and $q$ vertices,<br>respectively. (4) Finding the largest copy of $P$ that can be arbitrarily<br>rotated and translated into $Q$ requires time $n^{3-o(1)}$ under the 5SUM<br>conjecture.<br> We are not aware of any other such natural $($degree of freedom $+ 1)$-SUM<br>hardness for a geometric optimization problem.<br>
Export
BibTeX
@online{Kuennemann_2111.02544, TITLE = {Polygon Placement Revisited: (Degree of Freedom + 1)-{SUM} Hardness and an Improvement via Offline Dynamic Rectangle Union}, AUTHOR = {K{\"u}nnemann, Marvin and Nusser, Andr{\'e}}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2111.02544}, EPRINT = {2111.02544}, EPRINTTYPE = {arXiv}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We revisit the classical problem of determining the largest copy of a simple<br>polygon $P$ that can be placed into a simple polygon $Q$. Despite significant<br>effort, known algorithms require high polynomial running times. (Barequet and<br>Har-Peled, 2001) give a lower bound of $n^{2-o(1)}$ under the 3SUM conjecture<br>when $P$ and $Q$ are (convex) polygons with $\Theta(n)$ vertices each. This<br>leaves open whether we can establish (1) hardness beyond quadratic time and (2)<br>any superlinear bound for constant-sized $P$ or $Q$.<br> In this paper, we affirmatively answer these questions under the $k$SUM<br>conjecture, proving natural hardness results that increase with each degree of<br>freedom (scaling, $x$-translation, $y$-translation, rotation): (1) Finding the<br>largest copy of $P$ that can be $x$-translated into $Q$ requires time<br>$n^{2-o(1)}$ under the 3SUM conjecture. (2) Finding the largest copy of $P$<br>that can be arbitrarily translated into $Q$ requires time $n^{2-o(1)}$ under<br>the 4SUM conjecture. (3) The above lower bounds are almost tight when one of<br>the polygons is of constant size: we obtain an $\tilde O((pq)^{2.5})$-time<br>algorithm for orthogonal polygons $P,Q$ with $p$ and $q$ vertices,<br>respectively. (4) Finding the largest copy of $P$ that can be arbitrarily<br>rotated and translated into $Q$ requires time $n^{3-o(1)}$ under the 5SUM<br>conjecture.<br> We are not aware of any other such natural $($degree of freedom $+ 1)$-SUM<br>hardness for a geometric optimization problem.<br>}, }
Endnote
%0 Report %A K&#252;nnemann, Marvin %A Nusser, Andr&#233; %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union : %G eng %U http://hdl.handle.net/21.11116/0000-0009-B462-D %U https://arxiv.org/abs/2111.02544 %D 2021 %X We revisit the classical problem of determining the largest copy of a simple<br>polygon $P$ that can be placed into a simple polygon $Q$. Despite significant<br>effort, known algorithms require high polynomial running times. (Barequet and<br>Har-Peled, 2001) give a lower bound of $n^{2-o(1)}$ under the 3SUM conjecture<br>when $P$ and $Q$ are (convex) polygons with $\Theta(n)$ vertices each. This<br>leaves open whether we can establish (1) hardness beyond quadratic time and (2)<br>any superlinear bound for constant-sized $P$ or $Q$.<br> In this paper, we affirmatively answer these questions under the $k$SUM<br>conjecture, proving natural hardness results that increase with each degree of<br>freedom (scaling, $x$-translation, $y$-translation, rotation): (1) Finding the<br>largest copy of $P$ that can be $x$-translated into $Q$ requires time<br>$n^{2-o(1)}$ under the 3SUM conjecture. (2) Finding the largest copy of $P$<br>that can be arbitrarily translated into $Q$ requires time $n^{2-o(1)}$ under<br>the 4SUM conjecture. (3) The above lower bounds are almost tight when one of<br>the polygons is of constant size: we obtain an $\tilde O((pq)^{2.5})$-time<br>algorithm for orthogonal polygons $P,Q$ with $p$ and $q$ vertices,<br>respectively. (4) Finding the largest copy of $P$ that can be arbitrarily<br>rotated and translated into $Q$ requires time $n^{3-o(1)}$ under the 5SUM<br>conjecture.<br> We are not aware of any other such natural $($degree of freedom $+ 1)$-SUM<br>hardness for a geometric optimization problem.<br> %K Computer Science, Computational Geometry, cs.CG,Computer Science, Computational Complexity, cs.CC,Computer Science, Data Structures and Algorithms, cs.DS
[167]
C. Lenzen and H. Vahidi, “Approximate Minimum Directed Spanning Trees Under Congestion,” in Structural Information and Communication Complexity (SIROCCO 2021), Wrocław, Poland (Online), 2021.
Export
BibTeX
@inproceedings{Lenzen_SIROCCO21, TITLE = {Approximate Minimum Directed Spanning Trees Under Congestion}, AUTHOR = {Lenzen, Christoph and Vahidi, Hossein}, LANGUAGE = {eng}, ISBN = {978-3-030-79526-9}, DOI = {10.1007/978-3-030-79527-6_20}, PUBLISHER = {Springer}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, DATE = {2021}, BOOKTITLE = {Structural Information and Communication Complexity (SIROCCO 2021)}, EDITOR = {Jurdzi{\'n}ski, Tomasz and Schmid, Stefan}, PAGES = {352--369}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {12810}, ADDRESS = {Wroc{\l}aw, Poland (Online)}, }
Endnote
%0 Conference Proceedings %A Lenzen, Christoph %A Vahidi, Hossein %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Approximate Minimum Directed Spanning Trees Under Congestion : %G eng %U http://hdl.handle.net/21.11116/0000-0008-E553-8 %R 10.1007/978-3-030-79527-6_20 %D 2021 %B 28th International Colloquium on Structural Information and Communication Complexity %Z date of event: 2021-06-28 - 2021-07-01 %C Wroc&#322;aw, Poland (Online) %B Structural Information and Communication Complexity %E Jurdzi&#324;ski, Tomasz; Schmid, Stefan %P 352 - 369 %I Springer %@ 978-3-030-79526-9 %B Lecture Notes in Computer Science %N 12810
[168]
D. Lokshtanov, P. Misra, J. Mukherjee, F. Panolan, G. Philip, and S. Saurabh, “2-Approximating Feedback Vertex Set in Tournaments,” ACM Transactions on Algorithms, vol. 17, no. 2, 2021.
Export
BibTeX
@article{Lokshtanov2021, TITLE = {2-Approximating Feedback Vertex Set in Tournaments}, AUTHOR = {Lokshtanov, Daniel and Misra, Pranabendu and Mukherjee, Joydeep and Panolan, Fahad and Philip, Geevarghese and Saurabh, Saket}, LANGUAGE = {eng}, ISSN = {1549-6325}, DOI = {10.1145/3446969}, PUBLISHER = {ACM}, ADDRESS = {New York, NY}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, JOURNAL = {ACM Transactions on Algorithms}, VOLUME = {17}, NUMBER = {2}, EID = {11}, }
Endnote
%0 Journal Article %A Lokshtanov, Daniel %A Misra, Pranabendu %A Mukherjee, Joydeep %A Panolan, Fahad %A Philip, Geevarghese %A Saurabh, Saket %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations %T 2-Approximating Feedback Vertex Set in Tournaments : %G eng %U http://hdl.handle.net/21.11116/0000-0008-D8F8-D %R 10.1145/3446969 %7 2021 %D 2021 %J ACM Transactions on Algorithms %V 17 %N 2 %Z sequence number: 11 %I ACM %C New York, NY %@ false
[169]
D. Lokshtanov, P. Misra, M. S. Ramanujan, S. Saurabh, and M. Zehavi, “FPT-approximation for FPT Problems,” in Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, VA, USA (Virtual Conference), 2021.
Export
BibTeX
@inproceedings{FPTApprox21, TITLE = {{FPT}-approximation for {FPT} Problems}, AUTHOR = {Lokshtanov, Daniel and Misra, Pranabendu and Ramanujan, M. S. and Saurabh, Saket and Zehavi, Meirav}, LANGUAGE = {eng}, ISBN = {978-1-61197-646-5}, DOI = {10.1137/1.9781611976465.14}, PUBLISHER = {SIAM}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, DATE = {2021}, BOOKTITLE = {Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (SODA 2021)}, EDITOR = {Marx, D{\'a}niel}, PAGES = {199--218}, ADDRESS = {Alexandria, VA, USA (Virtual Conference)}, }
Endnote
%0 Conference Proceedings %A Lokshtanov, Daniel %A Misra, Pranabendu %A Ramanujan, M. S. %A Saurabh, Saket %A Zehavi, Meirav %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T FPT-approximation for FPT Problems : %G eng %U http://hdl.handle.net/21.11116/0000-0007-D2AE-8 %R 10.1137/1.9781611976465.14 %D 2021 %B 32nd Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2021-01-10 - 2021-01-13 %C Alexandria, VA, USA (Virtual Conference) %B Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms %E Marx, D&#225;niel %P 199 - 218 %I SIAM %@ 978-1-61197-646-5
[170]
J. Madathil, R. Sharma, and M. Zehavi, “A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs,” Algorithmica, 2021.
Export
BibTeX
@article{Madathil2021, TITLE = {A Sub-exponential {FPT} Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs}, AUTHOR = {Madathil, Jayakrishnan and Sharma, Roohani and Zehavi, Meirav}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-021-00806-x}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, JOURNAL = {Algorithmica}, }
Endnote
%0 Journal Article %A Madathil, Jayakrishnan %A Sharma, Roohani %A Zehavi, Meirav %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs : %G eng %U http://hdl.handle.net/21.11116/0000-0008-2C54-9 %R 10.1007/s00453-021-00806-x %7 2021 %D 2021 %J Algorithmica %I Springer %C New York, NY %@ false
[171]
J. Nederlof and K. Węgrzycki, “Improving Schroeppel and Shamir’s Algorithm for Subset Sum via Orthogonal Vectors,” in STOC ’21, 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual, Italy, 2021.
Export
BibTeX
@inproceedings{Nederlof_STOC2021, TITLE = {Improving {S}chroeppel and {S}hamir's Algorithm for Subset Sum via Orthogonal Vectors}, AUTHOR = {Nederlof, Jesper and W{\c e}grzycki, Karol}, LANGUAGE = {eng}, ISBN = {9781450380539}, DOI = {10.1145/3406325.3451024}, PUBLISHER = {ACM}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {STOC '21, 53rd Annual ACM SIGACT Symposium on Theory of Computing}, EDITOR = {Khuller, Samir and Vassilevska Williams, Virginia}, PAGES = {1670--1683}, ADDRESS = {Virtual, Italy}, }
Endnote
%0 Conference Proceedings %A Nederlof, Jesper %A W&#281;grzycki, Karol %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Improving Schroeppel and Shamir's Algorithm for Subset Sum via Orthogonal Vectors : %G eng %U http://hdl.handle.net/21.11116/0000-000A-CD68-B %R 10.1145/3406325.3451024 %D 2021 %B 53rd Annual ACM SIGACT Symposium on Theory of Computing %Z date of event: 2021-06-21 - 2021-06-25 %C Virtual, Italy %B STOC '21 %E Khuller, Samir; Vassilevska Williams, Virginia %P 1670 - 1683 %I ACM %@ 9781450380539
[172]
A. S. Nittala, A. Karrenbauer, A. Khan, T. Kraus, and J. Steimle, “Computational Design and Optimization of Electro-physiological Sensors,” Nature Communications, vol. 12, no. 1, 2021.
Export
BibTeX
@article{Nittala2021, TITLE = {Computational Design and Optimization of Electro-physiological Sensors}, AUTHOR = {Nittala, Aditya Shekhar and Karrenbauer, Andreas and Khan, Arshad and Kraus, Tobias and Steimle, J{\"u}rgen}, LANGUAGE = {eng}, ISSN = {2041-1723}, DOI = {10.1038/s41467-021-26442-1}, PUBLISHER = {Nature Publishing Group}, ADDRESS = {London}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, DATE = {2021}, JOURNAL = {Nature Communications}, VOLUME = {12}, NUMBER = {1}, EID = {6351}, }
Endnote
%0 Journal Article %A Nittala, Aditya Shekhar %A Karrenbauer, Andreas %A Khan, Arshad %A Kraus, Tobias %A Steimle, J&#252;rgen %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Computational Design and Optimization of Electro-physiological Sensors : %G eng %U http://hdl.handle.net/21.11116/0000-0009-7E62-C %R 10.1038/s41467-021-26442-1 %7 2021 %D 2021 %J Nature Communications %O Nat. Commun. %V 12 %N 1 %Z sequence number: 6351 %I Nature Publishing Group %C London %@ false
[173]
A. Pandey, “Variety Membership Testing in Algebraic Complexity Theory,” Universität des Saarlandes, Saarbrücken, 2021.
Export
BibTeX
@phdthesis{Pandeyphd2021, TITLE = {Variety Membership Testing in Algebraic Complexity Theory}, AUTHOR = {Pandey, Anurag}, LANGUAGE = {eng}, URL = {urn:nbn:de:bsz:291--ds-342440}, DOI = {10.22028/D291-34244}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, DATE = {2021}, }
Endnote
%0 Thesis %A Pandey, Anurag %Y Bl&#228;ser, Markus %A referee: Ikenmeyer, Christian %A referee: Mahajan, Meena %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society International Max Planck Research School, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Variety Membership Testing in Algebraic Complexity Theory : %G eng %U http://hdl.handle.net/21.11116/0000-0008-E9F5-D %R 10.22028/D291-34244 %F OTHER: hdl:20.500.11880/31479 %U urn:nbn:de:bsz:291--ds-342440 %I Universit&#228;t des Saarlandes %C Saarbr&#252;cken %D 2021 %P 128 p. %V phd %9 phd %U https://publikationen.sulb.uni-saarland.de/handle/20.500.11880/31479
[174]
A. Polak, L. Rohwedder, and K. Węgrzycki, “Knapsack and Subset Sum with Small Items,” in 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Glasgow, UK (Virtual Conference), 2021.
Export
BibTeX
@inproceedings{Polak_ICALP2021, TITLE = {Knapsack and Subset Sum with Small Items}, AUTHOR = {Polak, Adam and Rohwedder, Lars and W{\c e}grzycki, Karol}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-195-5}, URL = {urn:nbn:de:0030-drops-141752; https://drops.dagstuhl.de/opus/volltexte/2021/14175/}, DOI = {10.4230/LIPIcs.ICALP.2021.106}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, EDITOR = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James}, PAGES = {1--19}, EID = {106}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {198}, ADDRESS = {Glasgow, UK (Virtual Conference)}, }
Endnote
%0 Conference Proceedings %A Polak, Adam %A Rohwedder, Lars %A W&#281;grzycki, Karol %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Knapsack and Subset Sum with Small Items : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1EEF-7 %R 10.4230/LIPIcs.ICALP.2021.106 %U urn:nbn:de:0030-drops-141752 %U https://drops.dagstuhl.de/opus/volltexte/2021/14175/ %D 2021 %B 48th International Colloquium on Automata, Languages, and Programming %Z date of event: 2021-07-12 - 2020-07-16 %C Glasgow, UK (Virtual Conference) %B 48th International Colloquium on Automata, Languages, and Programming %E Bansal, Nikhil; Merelli, Emanuela; Worrell, James %P 1 - 19 %Z sequence number: 106 %I Schloss Dagstuhl %@ 978-3-95977-195-5 %B Leibniz International Proceedings in Informatics %N 198 %@ false
[175]
B. Ray Chaudhury, J. Garg, and R. Mehta, “Fair and Efficient Allocations under Subadditive Valuations,” in AAAI Technical Track on Game Theory and Economic Paradigms, Virtual Conference, 2021.
Export
BibTeX
@inproceedings{Chaudhury_AAAI21, TITLE = {Fair and Efficient Allocations under Subadditive Valuations}, AUTHOR = {Ray Chaudhury, Bhaskar and Garg, Jugal and Mehta, Ruta}, LANGUAGE = {eng}, ISBN = {978-1-57735-866-4}, URL = {https://ojs.aaai.org/index.php/AAAI/article/view/16665}, PUBLISHER = {AAAI}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {AAAI Technical Track on Game Theory and Economic Paradigms}, PAGES = {5269--5276}, ADDRESS = {Virtual Conference}, }
Endnote
%0 Conference Proceedings %A Ray Chaudhury, Bhaskar %A Garg, Jugal %A Mehta, Ruta %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Fair and Efficient Allocations under Subadditive Valuations : %G eng %U http://hdl.handle.net/21.11116/0000-0007-9370-4 %U https://ojs.aaai.org/index.php/AAAI/article/view/16665 %D 2021 %B Thirty-Fifth AAAI Conference on Artificial Intelligence %Z date of event: 2021-02-02 - 2021-02-09 %C Virtual Conference %B AAAI Technical Track on Game Theory and Economic Paradigms %P 5269 - 5276 %I AAAI %@ 978-1-57735-866-4 %U https://ojs.aaai.org/index.php/AAAI/article/view/16665
[176]
B. Ray Chaudhury, J. Garg, K. Mehlhorn, R. Mehta, and P. Misra, “Improving EFX Guarantees through Rainbow Cycle Number,” 2021. [Online]. Available: https://arxiv.org/abs/2103.01628. (arXiv: 2103.01628)
Abstract
We study the problem of fairly allocating a set of indivisible goods among<br>$n$ agents with additive valuations. Envy-freeness up to any good (EFX) is<br>arguably the most compelling fairness notion in this context. However, the<br>existence of EFX allocations has not been settled and is one of the most<br>important problems in fair division. Towards resolving this problem, many<br>impressive results show the existence of its relaxations, e.g., the existence<br>of $0.618$-EFX allocations, and the existence of EFX at most $n-1$ unallocated<br>goods. The latter result was recently improved for three agents, in which the<br>two unallocated goods are allocated through an involved procedure. Reducing the<br>number of unallocated goods for arbitrary number of agents is a systematic way<br>to settle the big question. In this paper, we develop a new approach, and show<br>that for every $\varepsilon \in (0,1/2]$, there always exists a<br>$(1-\varepsilon)$-EFX allocation with sublinear number of unallocated goods and<br>high Nash welfare.<br> For this, we reduce the EFX problem to a novel problem in extremal graph<br>theory. We introduce the notion of rainbow cycle number $R(\cdot)$. For all $d<br>\in \mathbb{N}$, $R(d)$ is the largest $k$ such that there exists a $k$-partite<br>digraph $G =(\cup_{i \in [k]} V_i, E)$, in which<br> 1) each part has at most $d$ vertices, i.e., $\lvert V_i \rvert \leq d$ for<br>all $i \in [k]$,<br> 2) for any two parts $V_i$ and $V_j$, each vertex in $V_i$ has an incoming<br>edge from some vertex in $V_j$ and vice-versa, and<br> 3) there exists no cycle in $G$ that contains at most one vertex from each<br>part.<br> We show that any upper bound on $R(d)$ directly translates to a sublinear<br>bound on the number of unallocated goods. We establish a polynomial upper bound<br>on $R(d)$, yielding our main result. Furthermore, our approach is constructive,<br>which also gives a polynomial-time algorithm for finding such an allocation.<br>
Export
BibTeX
@online{RayChaudhury2103.01628, TITLE = {Improving {EFX} Guarantees through Rainbow Cycle Number}, AUTHOR = {Ray Chaudhury, Bhaskar and Garg, Jugal and Mehlhorn, Kurt and Mehta, Ruta and Misra, Pranabendu}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2103.01628}, EPRINT = {2103.01628}, EPRINTTYPE = {arXiv}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We study the problem of fairly allocating a set of indivisible goods among<br>$n$ agents with additive valuations. Envy-freeness up to any good (EFX) is<br>arguably the most compelling fairness notion in this context. However, the<br>existence of EFX allocations has not been settled and is one of the most<br>important problems in fair division. Towards resolving this problem, many<br>impressive results show the existence of its relaxations, e.g., the existence<br>of $0.618$-EFX allocations, and the existence of EFX at most $n-1$ unallocated<br>goods. The latter result was recently improved for three agents, in which the<br>two unallocated goods are allocated through an involved procedure. Reducing the<br>number of unallocated goods for arbitrary number of agents is a systematic way<br>to settle the big question. In this paper, we develop a new approach, and show<br>that for every $\varepsilon \in (0,1/2]$, there always exists a<br>$(1-\varepsilon)$-EFX allocation with sublinear number of unallocated goods and<br>high Nash welfare.<br> For this, we reduce the EFX problem to a novel problem in extremal graph<br>theory. We introduce the notion of rainbow cycle number $R(\cdot)$. For all $d<br>\in \mathbb{N}$, $R(d)$ is the largest $k$ such that there exists a $k$-partite<br>digraph $G =(\cup_{i \in [k]} V_i, E)$, in which<br> 1) each part has at most $d$ vertices, i.e., $\lvert V_i \rvert \leq d$ for<br>all $i \in [k]$,<br> 2) for any two parts $V_i$ and $V_j$, each vertex in $V_i$ has an incoming<br>edge from some vertex in $V_j$ and vice-versa, and<br> 3) there exists no cycle in $G$ that contains at most one vertex from each<br>part.<br> We show that any upper bound on $R(d)$ directly translates to a sublinear<br>bound on the number of unallocated goods. We establish a polynomial upper bound<br>on $R(d)$, yielding our main result. Furthermore, our approach is constructive,<br>which also gives a polynomial-time algorithm for finding such an allocation.<br>}, }
Endnote
%0 Report %A Ray Chaudhury, Bhaskar %A Garg, Jugal %A Mehlhorn, Kurt %A Mehta, Ruta %A Misra, Pranabendu %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Improving EFX Guarantees through Rainbow Cycle Number : %G eng %U http://hdl.handle.net/21.11116/0000-0008-DB40-9 %U https://arxiv.org/abs/2103.01628 %D 2021 %X We study the problem of fairly allocating a set of indivisible goods among<br>$n$ agents with additive valuations. Envy-freeness up to any good (EFX) is<br>arguably the most compelling fairness notion in this context. However, the<br>existence of EFX allocations has not been settled and is one of the most<br>important problems in fair division. Towards resolving this problem, many<br>impressive results show the existence of its relaxations, e.g., the existence<br>of $0.618$-EFX allocations, and the existence of EFX at most $n-1$ unallocated<br>goods. The latter result was recently improved for three agents, in which the<br>two unallocated goods are allocated through an involved procedure. Reducing the<br>number of unallocated goods for arbitrary number of agents is a systematic way<br>to settle the big question. In this paper, we develop a new approach, and show<br>that for every $\varepsilon \in (0,1/2]$, there always exists a<br>$(1-\varepsilon)$-EFX allocation with sublinear number of unallocated goods and<br>high Nash welfare.<br> For this, we reduce the EFX problem to a novel problem in extremal graph<br>theory. We introduce the notion of rainbow cycle number $R(\cdot)$. For all $d<br>\in \mathbb{N}$, $R(d)$ is the largest $k$ such that there exists a $k$-partite<br>digraph $G =(\cup_{i \in [k]} V_i, E)$, in which<br> 1) each part has at most $d$ vertices, i.e., $\lvert V_i \rvert \leq d$ for<br>all $i \in [k]$,<br> 2) for any two parts $V_i$ and $V_j$, each vertex in $V_i$ has an incoming<br>edge from some vertex in $V_j$ and vice-versa, and<br> 3) there exists no cycle in $G$ that contains at most one vertex from each<br>part.<br> We show that any upper bound on $R(d)$ directly translates to a sublinear<br>bound on the number of unallocated goods. We establish a polynomial upper bound<br>on $R(d)$, yielding our main result. Furthermore, our approach is constructive,<br>which also gives a polynomial-time algorithm for finding such an allocation.<br> %K Computer Science, Computer Science and Game Theory, cs.GT,Computer Science, Data Structures and Algorithms, cs.DS
[177]
B. Ray Chaudhury, J. Garg, P. McGlaughlin, and R. Mehta, “Competitive Allocation of a Mixed Manna,” in Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, VA, USA (Virtual Conference), 2021.
Export
BibTeX
@inproceedings{Chaudhury_SODA21, TITLE = {Competitive Allocation of a Mixed Manna}, AUTHOR = {Ray Chaudhury, Bhaskar and Garg, Jugal and McGlaughlin, Peter and Mehta, Ruta}, LANGUAGE = {eng}, ISBN = {978-1-61197-646-5}, DOI = {10.1137/1.9781611976465.85}, PUBLISHER = {SIAM}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, DATE = {2021}, BOOKTITLE = {Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (SODA 2021)}, EDITOR = {Marx, D{\'a}niel}, PAGES = {1405--1424}, ADDRESS = {Alexandria, VA, USA (Virtual Conference)}, }
Endnote
%0 Conference Proceedings %A Ray Chaudhury, Bhaskar %A Garg, Jugal %A McGlaughlin, Peter %A Mehta, Ruta %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Competitive Allocation of a Mixed Manna : %G eng %U http://hdl.handle.net/21.11116/0000-0007-9365-1 %R 10.1137/1.9781611976465.85 %D 2021 %B 32nd Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2021-01-10 - 2021-01-13 %C Alexandria, VA, USA (Virtual Conference) %B Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms %E Marx, D&#225;niel %P 1405 - 1424 %I SIAM %@ 978-1-61197-646-5
[178]
B. Ray Chaudhury, T. Kavitha, K. Mehlhorn, and A. Sgouritsa, “A Little Charity Guarantees Almost Envy-Freeness,” SIAM Journal on Computing, vol. 50, no. 4, 2021.
Export
BibTeX
@article{RayChaudhury21, TITLE = {A Little Charity Guarantees Almost Envy-Freeness}, AUTHOR = {Ray Chaudhury, Bhaskar and Kavitha, Telikepalli and Mehlhorn, Kurt and Sgouritsa, Alkmini}, LANGUAGE = {eng}, ISSN = {0097-5397}, DOI = {10.1137/20M1359134}, PUBLISHER = {SIAM}, ADDRESS = {Philadelphia, PA}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, JOURNAL = {SIAM Journal on Computing}, VOLUME = {50}, NUMBER = {4}, PAGES = {1336--1358}, }
Endnote
%0 Journal Article %A Ray Chaudhury, Bhaskar %A Kavitha, Telikepalli %A Mehlhorn, Kurt %A Sgouritsa, Alkmini %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T A Little Charity Guarantees Almost Envy-Freeness : %G eng %U http://hdl.handle.net/21.11116/0000-0009-2B38-9 %R 10.1137/20M1359134 %7 2021 %D 2021 %J SIAM Journal on Computing %V 50 %N 4 %& 1336 %P 1336 - 1358 %I SIAM %C Philadelphia, PA %@ false
[179]
M. Roth, J. Schmitt, and P. Wellnitz, “Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders,” in 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Glasgow, UK (Virtual Conference), 2021.
Export
BibTeX
@inproceedings{Roth_ICALP2021, TITLE = {Detecting and Counting Small Subgraphs, and Evaluating a Parameterized {Tutte} Polynomial: {L}ower Bounds via {Toroidal} Grids and {Cayley} Graph Expanders}, AUTHOR = {Roth, Marc and Schmitt, Johannes and Wellnitz, Philip}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-195-5}, URL = {urn:nbn:de:0030-drops-141778}, DOI = {10.4230/LIPIcs.ICALP.2021.108}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, EDITOR = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James}, PAGES = {1--16}, EID = {108}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {198}, ADDRESS = {Glasgow, UK (Virtual Conference)}, }
Endnote
%0 Conference Proceedings %A Roth, Marc %A Schmitt, Johannes %A Wellnitz, Philip %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders : %G eng %U http://hdl.handle.net/21.11116/0000-0009-AFBF-C %R 10.4230/LIPIcs.ICALP.2021.108 %U urn:nbn:de:0030-drops-141778 %D 2021 %B 48th International Colloquium on Automata, Languages, and Programming %Z date of event: 2021-07-12 - 2020-07-16 %C Glasgow, UK (Virtual Conference) %B 48th International Colloquium on Automata, Languages, and Programming %E Bansal, Nikhil; Merelli, Emanuela; Worrell, James %P 1 - 16 %Z sequence number: 108 %I Schloss Dagstuhl %@ 978-3-95977-195-5 %B Leibniz International Proceedings in Informatics %N 198 %@ false %U https://drops.dagstuhl.de/opus/volltexte/2021/14177/
[180]
M. Roth, J. Schmitt, and P. Wellnitz, “Counting Small Induced Subgraphs Satisfying Monotone Properties,” in FOCS 2020, 61st Annual IEEE Symposium on Foundations of Computer Science, Durham, NC, USA (Virtual Conference), 2021.
Export
BibTeX
@inproceedings{Roth_FOCS2020, TITLE = {Counting Small Induced Subgraphs Satisfying Monotone Properties}, AUTHOR = {Roth, Marc and Schmitt, Johannes and Wellnitz, Philip}, LANGUAGE = {eng}, ISBN = {978-1-7281-9621-3}, DOI = {10.1109/FOCS46700.2020}, PUBLISHER = {IEEE}, YEAR = {2020}, MARGINALMARK = {$\bullet$}, DATE = {2021}, BOOKTITLE = {FOCS 2020, 61st Annual IEEE Symposium on Foundations of Computer Science}, PAGES = {1356--1367}, ADDRESS = {Durham, NC, USA (Virtual Conference)}, }
Endnote
%0 Conference Proceedings %A Roth, Marc %A Schmitt, Johannes %A Wellnitz, Philip %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Counting Small Induced Subgraphs Satisfying Monotone Properties : %G eng %U http://hdl.handle.net/21.11116/0000-0007-8C5E-3 %R 10.1109/FOCS46700.2020 %D 2021 %B 61st Annual IEEE Symposium on Foundations of Computer Science %Z date of event: 2020-11-16 - 2020-11-19 %C Durham, NC, USA (Virtual Conference) %B FOCS 2020 %P 1356 - 1367 %I IEEE %@ 978-1-7281-9621-3
[181]
K. Vitting Klinkby, P. Misra, and S. Saurabh, “Strong Connectivity Augmentation is FPT,” in Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, VA, USA (Virtual Conference), 2021.
Export
BibTeX
@inproceedings{SCAug21, TITLE = {Strong Connectivity Augmentation is {FPT}}, AUTHOR = {Vitting Klinkby, Kristine and Misra, Pranabendu and Saurabh, Saket}, LANGUAGE = {eng}, ISBN = {978-1-61197-646-5}, DOI = {10.1137/1.9781611976465.15}, PUBLISHER = {SIAM}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, DATE = {2021}, BOOKTITLE = {Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms (SODA 2021)}, EDITOR = {Marx, D{\'a}niel}, PAGES = {219--234}, ADDRESS = {Alexandria, VA, USA (Virtual Conference)}, }
Endnote
%0 Conference Proceedings %A Vitting Klinkby, Kristine %A Misra, Pranabendu %A Saurabh, Saket %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Strong Connectivity Augmentation is FPT : %G eng %U http://hdl.handle.net/21.11116/0000-0007-D2A6-0 %R 10.1137/1.9781611976465.15 %D 2021 %B 32nd Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2021-01-10 - 2021-01-13 %C Alexandria, VA, USA (Virtual Conference) %B Proceedings of the Thirty-Second ACM-SIAM Symposium on Discrete Algorithms %E Marx, D&#225;niel %P 219 - 234 %I SIAM %@ 978-1-61197-646-5
[182]
P. Wellnitz, “Counting Patterns in Strings and Graphs,” Universität des Saarlandes, Saarbrücken, 2021.
Export
BibTeX
@phdthesis{WellnitzPhD21, TITLE = {Counting Patterns in Strings and Graphs}, AUTHOR = {Wellnitz, Philip}, LANGUAGE = {eng}, URL = {urn:nbn:de:bsz:291--ds-350981}, DOI = {10.22028/D291-35098}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2021}, MARGINALMARK = {$\bullet$}, DATE = {2021}, }
Endnote
%0 Thesis %A Wellnitz, Philip %Y Mehlhorn, Kurt %A referee: Landau, Gad M. %A referee: Grohe, Martin %A referee: Bringmann, Karl %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society International Max Planck Research School, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Counting Patterns in Strings and Graphs : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1ED8-0 %R 10.22028/D291-35098 %U urn:nbn:de:bsz:291--ds-350981 %F OTHER: hdl:20.500.11880/32103 %I Universit&#228;t des Saarlandes %C Saarbr&#252;cken %D 2021 %P 253 p. %V phd %9 phd %U https://publikationen.sulb.uni-saarland.de/handle/20.500.11880/32103
2020
[183]
A. Abboud, A. Backurs, K. Bringmann, and M. Künnemann, “Impossibility Results for Grammar-Compressed Linear Algebra,” in Advances in Neural Information Processing Systems 33 (NeurIPS 2020), Virtual Event, 2020.
Export
BibTeX
@inproceedings{Abboud_NeurIPS20, TITLE = {Impossibility Results for Grammar-Compressed Linear Algebra}, AUTHOR = {Abboud, Amir and Backurs, Arturs and Bringmann, Karl and K{\"u}nnemann, Marvin}, LANGUAGE = {eng}, PUBLISHER = {Curran Associates, Inc.}, YEAR = {2020}, BOOKTITLE = {Advances in Neural Information Processing Systems 33 (NeurIPS 2020)}, EDITOR = {Larochelle, H. and Ranzato, M. and Hadsell, R. and Balcan, M. F. and Lin, H.}, ADDRESS = {Virtual Event}, }
Endnote
%0 Conference Proceedings %A Abboud, Amir %A Backurs, Arturs %A Bringmann, Karl %A K&#252;nnemann, Marvin %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Impossibility Results for Grammar-Compressed Linear Algebra : %G eng %U http://hdl.handle.net/21.11116/0000-0007-90DF-B %D 2020 %B 34th Conference on Neural Information Processing Systems %Z date of event: 2020-12-06 - 2020-12-12 %C Virtual Event %B Advances in Neural Information Processing Systems 33 %E Larochelle, H.; Ranzato, M.; Hadsell, R.; Balcan, M. F.; Lin, H. %I Curran Associates, Inc. %U https://proceedings.neurips.cc/paper/2020/hash/645e6bfdd05d1a69c5e47b20f0a91d46-Abstract.html
[184]
A. Abboud, K. Bringmann, D. Hermelin, and D. Shabtay, “Scheduling Lower Bounds via AND Subset Sum,” in 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Saarbrücken, Germany (Virtual Conference), 2020.
Export
BibTeX
@inproceedings{Abboud_ICALP2020, TITLE = {Scheduling Lower Bounds via {AND} Subset Sum}, AUTHOR = {Abboud, Amir and Bringmann, Karl and Hermelin, Danny and Shabtay, Dvir}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-138-2}, URL = {urn:nbn:de:0030-drops-124119}, DOI = {10.4230/LIPIcs.ICALP.2020.4}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2020}, BOOKTITLE = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)}, EDITOR = {Czumaj, Artur and Dawa, Anuj and Merelli, Emanuela}, EID = {4}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {168}, ADDRESS = {Saarbr{\"u}cken, Germany (Virtual Conference)}, }
Endnote
%0 Conference Proceedings %A Abboud, Amir %A Bringmann, Karl %A Hermelin, Danny %A Shabtay, Dvir %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Scheduling Lower Bounds via AND Subset Sum : %G eng %U http://hdl.handle.net/21.11116/0000-0007-2826-2 %R 10.4230/LIPIcs.ICALP.2020.4 %U urn:nbn:de:0030-drops-124119 %D 2020 %B 47th International Colloquium on Automata, Languages, and Programming %Z date of event: 2020-07-08 - 2020-07-11 %C Saarbr&#252;cken, Germany (Virtual Conference) %B 47th International Colloquium on Automata, Languages, and Programming %E Czumaj, Artur; Dawa, Anuj; Merelli, Emanuela %Z sequence number: 4 %I Schloss Dagstuhl %@ 978-3-95977-138-2 %B Leibniz International Proceedings in Informatics %N 168 %@ false %U https://drops.dagstuhl.de/opus/volltexte/2020/12411/https://creativecommons.org/licenses/by/3.0/legalcode
[185]
A. Abboud, K. Censor-Hillel, S. Khoury, and C. Lenzen, “Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion,” Distributed Computing, vol. 33, 2020.
Export
BibTeX
@article{Abboud2020, TITLE = {Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion}, AUTHOR = {Abboud, Amir and Censor-Hillel, Keren and Khoury, Seri and Lenzen, Christoph}, LANGUAGE = {eng}, ISSN = {0178-2770}, DOI = {10.1007/s00446-020-00373-4}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2020}, JOURNAL = {Distributed Computing}, VOLUME = {33}, PAGES = {545--559}, }
Endnote
%0 Journal Article %A Abboud, Amir %A Censor-Hillel, Keren %A Khoury, Seri %A Lenzen, Christoph %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion : %G eng %U http://hdl.handle.net/21.11116/0000-0006-F28E-9 %R 10.1007/s00446-020-00373-4 %7 2020 %D 2020 %J Distributed Computing %V 33 %& 545 %P 545 - 559 %I Springer %C New York, NY %@ false
[186]
A. Abboud, K. Bringmann, D. Hermelin, and D. Shabtay, “Scheduling Lower Bounds via AND Subset Sum,” 2020. [Online]. Available: https://arxiv.org/abs/2003.07113. (arXiv: 2003.07113)
Abstract
Given $N$ instances $(X_1,t_1),\ldots,(X_N,t_N)$ of Subset Sum, the AND<br>Subset Sum problem asks to determine whether all of these instances are<br>yes-instances; that is, whether each set of integers $X_i$ has a subset that<br>sums up to the target integer $t_i$. We prove that this problem cannot be<br>solved in time $\tilde{O}((N \cdot t_{max})^{1-\epsilon})$, for $t_{max}=\max_i<br>t_i$ and any $\epsilon > 0$, assuming the $\forall \exists$ Strong Exponential<br>Time Hypothesis ($\forall \exists$-SETH). We then use this result to exclude<br>$\tilde{O}(n+P_{max} \cdot n^{1-\epsilon})$-time algorithms for several<br>scheduling problems on $n$ jobs with maximum processing time $P_{max}$, based<br>on $\forall \exists$-SETH. These include classical problems such as $1||\sum<br>w_jU_j$, the problem of minimizing the total weight of tardy jobs on a single<br>machine, and $P_2||\sum U_j$, the problem of minimizing the number of tardy<br>jobs on two identical parallel machines.<br>
Export
BibTeX
@online{Abboud_arXIv2003.07113, TITLE = {Scheduling Lower Bounds via {AND} Subset Sum}, AUTHOR = {Abboud, Amir and Bringmann, Karl and Hermelin, Danny and Shabtay, Dvir}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2003.07113}, EPRINT = {2003.07113}, EPRINTTYPE = {arXiv}, YEAR = {2020}, ABSTRACT = {Given $N$ instances $(X_1,t_1),\ldots,(X_N,t_N)$ of Subset Sum, the AND<br>Subset Sum problem asks to determine whether all of these instances are<br>yes-instances; that is, whether each set of integers $X_i$ has a subset that<br>sums up to the target integer $t_i$. We prove that this problem cannot be<br>solved in time $\tilde{O}((N \cdot t_{max})^{1-\epsilon})$, for $t_{max}=\max_i<br>t_i$ and any $\epsilon > 0$, assuming the $\forall \exists$ Strong Exponential<br>Time Hypothesis ($\forall \exists$-SETH). We then use this result to exclude<br>$\tilde{O}(n+P_{max} \cdot n^{1-\epsilon})$-time algorithms for several<br>scheduling problems on $n$ jobs with maximum processing time $P_{max}$, based<br>on $\forall \exists$-SETH. These include classical problems such as $1||\sum<br>w_jU_j$, the problem of minimizing the total weight of tardy jobs on a single<br>machine, and $P_2||\sum U_j$, the problem of minimizing the number of tardy<br>jobs on two identical parallel machines.<br>}, }
Endnote
%0 Report %A Abboud, Amir %A Bringmann, Karl %A Hermelin, Danny %A Shabtay, Dvir %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Scheduling Lower Bounds via AND Subset Sum : %G eng %U http://hdl.handle.net/21.11116/0000-0007-2A52-E %U https://arxiv.org/abs/2003.07113 %D 2020 %X Given $N$ instances $(X_1,t_1),\ldots,(X_N,t_N)$ of Subset Sum, the AND<br>Subset Sum problem asks to determine whether all of these instances are<br>yes-instances; that is, whether each set of integers $X_i$ has a subset that<br>sums up to the target integer $t_i$. We prove that this problem cannot be<br>solved in time $\tilde{O}((N \cdot t_{max})^{1-\epsilon})$, for $t_{max}=\max_i<br>t_i$ and any $\epsilon > 0$, assuming the $\forall \exists$ Strong Exponential<br>Time Hypothesis ($\forall \exists$-SETH). We then use this result to exclude<br>$\tilde{O}(n+P_{max} \cdot n^{1-\epsilon})$-time algorithms for several<br>scheduling problems on $n$ jobs with maximum processing time $P_{max}$, based<br>on $\forall \exists$-SETH. These include classical problems such as $1||\sum<br>w_jU_j$, the problem of minimizing the total weight of tardy jobs on a single<br>machine, and $P_2||\sum U_j$, the problem of minimizing the number of tardy<br>jobs on two identical parallel machines.<br> %K Computer Science, Data Structures and Algorithms, cs.DS
[187]
D. Achlioptas, T. Gouleakis, and F. Iliopoulos, “Simple Local Computation Algorithms for the General Lovász Local Lemma,” in SPAA ’20, 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, 2020.
Export
BibTeX
@inproceedings{Achlioptas_SPAA20, TITLE = {Simple Local Computation Algorithms for the General {Lov\'{a}sz} {Local Lemma}}, AUTHOR = {Achlioptas, Dimitris and Gouleakis, Themis and Iliopoulos, Fotis}, LANGUAGE = {eng}, ISBN = {9781450369350}, DOI = {10.1145/3350755.3400250}, PUBLISHER = {ACM}, YEAR = {2020}, BOOKTITLE = {SPAA '20, 32nd ACM Symposium on Parallelism in Algorithms and Architectures}, PAGES = {1--10}, ADDRESS = {Virtual Event, USA}, }
Endnote
%0 Conference Proceedings %A Achlioptas, Dimitris %A Gouleakis, Themis %A Iliopoulos, Fotis %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Simple Local Computation Algorithms for the General Lov&#225;sz Local Lemma : %G eng %U http://hdl.handle.net/21.11116/0000-0007-8B6D-3 %R 10.1145/3350755.3400250 %D 2020 %B 32nd ACM Symposium on Parallelism in Algorithms and Architectures %Z date of event: 2020-07-15 - 2020-07-17 %C Virtual Event, USA %B SPAA '20 %P 1 - 10 %I ACM %@ 9781450369350
[188]
A. Agrawal, D. Lokshtanov, P. Misra, S. Saurabh, and M. Zehavi, “Polylogarithmic Approximation Algorithms for Weighted-F-deletion Problems,” ACM Transactions on Algorithms, vol. 16, no. 4, 2020.
Export
BibTeX
@article{Agrawal2020, TITLE = {Polylogarithmic Approximation Algorithms for Weighted-{$\mathcal{F}$}-deletion Problems}, AUTHOR = {Agrawal, Akanksha and Lokshtanov, Daniel and Misra, Pranabendu and Saurabh, Saket and Zehavi, Meirav}, LANGUAGE = {eng}, ISSN = {1549-6325}, DOI = {10.1145/3389338}, PUBLISHER = {ACM}, ADDRESS = {New York, NY}, YEAR = {2020}, JOURNAL = {ACM Transactions on Algorithms}, VOLUME = {16}, NUMBER = {4}, EID = {51}, }
Endnote
%0 Journal Article %A Agrawal, Akanksha %A Lokshtanov, Daniel %A Misra, Pranabendu %A Saurabh, Saket %A Zehavi, Meirav %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Polylogarithmic Approximation Algorithms for Weighted-F-deletion Problems : %G eng %U http://hdl.handle.net/21.11116/0000-0007-4903-4 %R 10.1145/3389338 %7 2020 %D 2020 %J ACM Transactions on Algorithms %V 16 %N 4 %Z sequence number: 51 %I ACM %C New York, NY %@ false
[189]
A. Agrawal, M. Kundu, A. Sahu, S. Saurabh, and P. Tale, “Parameterized Complexity of MAXIMUM EDGE COLORABLE SUBGRAPH,” in Computing and Combinatorics (COCOON 2020), Atlanta, GA, USA, 2020.
Export
BibTeX
@inproceedings{DBLP:conf/cocoon/AgrawalKS0T20, TITLE = {{MAXIMUM EDGE COLORABLE SUBGRAPH}}, AUTHOR = {Agrawal, Akanksha and Kundu, Madhumita and Sahu, Abhishek and Saurabh, Saket and Tale, Prafullkumar}, LANGUAGE = {eng}, ISBN = {978-3-030-58149-7}, DOI = {10.1007/978-3-030-58150-3_50}, PUBLISHER = {Springer}, YEAR = {2020}, DATE = {2020}, BOOKTITLE = {Computing and Combinatorics (COCOON 2020)}, EDITOR = {Kim, Donghyun and Uma, R. N. and Cai, Zhipeng and Lee, Dong Hoon}, PAGES = {615--626}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {12273}, ADDRESS = {Atlanta, GA, USA}, }
Endnote
%0 Conference Proceedings %A Agrawal, Akanksha %A Kundu, Madhumita %A Sahu, Abhishek %A Saurabh, Saket %A Tale, Prafullkumar %+ External Organizations External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Parameterized Complexity of MAXIMUM EDGE COLORABLE SUBGRAPH : %G eng %U http://hdl.handle.net/21.11116/0000-0007-D2A4-2 %R 10.1007/978-3-030-58150-3_50 %D 2020 %B 26th International Conference on Computing and Combinatorics %Z date of event: 2020-08-29 - 2020-08-31 %C Atlanta, GA, USA %B Computing and Combinatorics %E Kim, Donghyun; Uma, R. N.; Cai, Zhipeng; Lee, Dong Hoon %P 615 - 626 %I Springer %@ 978-3-030-58149-7 %B Lecture Notes in Computer Science %N 12273
[190]
H. Alkema, M. de Berg, and S. Kisfaludi-Bak, “Euclidean TSP in Narrow Strips,” in 36th International Symposium on Computational Geometry (SoCG 2020), Zürich, Switzerland (Virtual Conference), 2020.
Export
BibTeX
@inproceedings{AlkemaBK20, TITLE = {Euclidean {TSP} in Narrow Strips}, AUTHOR = {Alkema, Henk and de Berg, Mark and Kisfaludi-Bak, S{\'a}ndor}, LANGUAGE = {eng}, ISBN = {978-3-95977-143-6}, URL = {urn:nbn:de:0030-drops-121628}, DOI = {10.4230/LIPIcs.SoCG.2020.4}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2020}, BOOKTITLE = {36th International Symposium on Computational Geometry (SoCG 2020)}, EDITOR = {Cabello, Sergio and Chen, Danny Z.}, PAGES = {1--16}, EID = {4}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {164}, ADDRESS = {Z{\"u}rich, Switzerland (Virtual Conference)}, }
Endnote
%0 Conference Proceedings %A Alkema, Henk %A de Berg, Mark %A Kisfaludi-Bak, S&#225;ndor %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Euclidean TSP in Narrow Strips : %G eng %U http://hdl.handle.net/21.11116/0000-0007-76E5-2 %R 10.4230/LIPIcs.SoCG.2020.4 %U urn:nbn:de:0030-drops-121628 %D 2020 %B 36th International Symposium on Computational Geometry %Z date of event: 2020-06-23 - 2020-06-26 %C Z&#252;rich, Switzerland (Virtual Conference) %B 36th International Symposium on Computational Geometry %E Cabello, Sergio; Chen, Danny Z. %P 1 - 16 %Z sequence number: 4 %I Schloss Dagstuhl %@ 978-3-95977-143-6 %B Leibniz International Proceedings in Informatics %N 164 %U https://drops.dagstuhl.de/opus/volltexte/2020/12162/https://creativecommons.org/licenses/by/3.0/legalcode
[191]
H. Alkema, M. de Berg, and S. Kisfaludi-Bak, “Euclidean TSP in Narrow Strips,” 2020. [Online]. Available: https://arxiv.org/abs/2003.09948. (arXiv: 2003.09948)
Abstract
We investigate how the complexity of Euclidean TSP for point sets $P$ inside<br>the strip $(-\infty,+\infty)\times [0,\delta]$ depends on the strip width<br>$\delta$. We obtain two main results. First, for the case where the points have<br>distinct integer $x$-coordinates, we prove that a shortest bitonic tour (which<br>can be computed in $O(n\log^2 n)$ time using an existing algorithm) is<br>guaranteed to be a shortest tour overall when $\delta\leq 2\sqrt{2}$, a bound<br>which is best possible. Second, we present an algorithm that is fixed-parameter<br>tractable with respect to $\delta$. More precisely, our algorithm has running<br>time $2^{O(\sqrt{\delta})} n^2$ for sparse point sets, where each<br>$1\times\delta$ rectangle inside the strip contains $O(1)$ points. For random<br>point sets, where the points are chosen uniformly at random from the<br>rectangle~$[0,n]\times [0,\delta]$, it has an expected running time of<br>$2^{O(\sqrt{\delta})} n^2 + O(n^3)$.<br>
Export
BibTeX
@online{Alkema_arXiv2003.09948, TITLE = {Euclidean {TSP} in Narrow Strips}, AUTHOR = {Alkema, Henk and de Berg, Mark and Kisfaludi-Bak, S{\'a}ndor}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2003.09948}, EPRINT = {2003.09948}, EPRINTTYPE = {arXiv}, YEAR = {2020}, ABSTRACT = {We investigate how the complexity of Euclidean TSP for point sets $P$ inside<br>the strip $(-\infty,+\infty)\times [0,\delta]$ depends on the strip width<br>$\delta$. We obtain two main results. First, for the case where the points have<br>distinct integer $x$-coordinates, we prove that a shortest bitonic tour (which<br>can be computed in $O(n\log^2 n)$ time using an existing algorithm) is<br>guaranteed to be a shortest tour overall when $\delta\leq 2\sqrt{2}$, a bound<br>which is best possible. Second, we present an algorithm that is fixed-parameter<br>tractable with respect to $\delta$. More precisely, our algorithm has running<br>time $2^{O(\sqrt{\delta})} n^2$ for sparse point sets, where each<br>$1\times\delta$ rectangle inside the strip contains $O(1)$ points. For random<br>point sets, where the points are chosen uniformly at random from the<br>rectangle~$[0,n]\times [0,\delta]$, it has an expected running time of<br>$2^{O(\sqrt{\delta})} n^2 + O(n^3)$.<br>}, }
Endnote
%0 Report %A Alkema, Henk %A de Berg, Mark %A Kisfaludi-Bak, S&#225;ndor %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Euclidean TSP in Narrow Strips : %G eng %U http://hdl.handle.net/21.11116/0000-0007-77A3-B %U https://arxiv.org/abs/2003.09948 %D 2020 %X We investigate how the complexity of Euclidean TSP for point sets $P$ inside<br>the strip $(-\infty,+\infty)\times [0,\delta]$ depends on the strip width<br>$\delta$. We obtain two main results. First, for the case where the points have<br>distinct integer $x$-coordinates, we prove that a shortest bitonic tour (which<br>can be computed in $O(n\log^2 n)$ time using an existing algorithm) is<br>guaranteed to be a shortest tour overall when $\delta\leq 2\sqrt{2}$, a bound<br>which is best possible. Second, we present an algorithm that is fixed-parameter<br>tractable with respect to $\delta$. More precisely, our algorithm has running<br>time $2^{O(\sqrt{\delta})} n^2$ for sparse point sets, where each<br>$1\times\delta$ rectangle inside the strip contains $O(1)$ points. For random<br>point sets, where the points are chosen uniformly at random from the<br>rectangle~$[0,n]\times [0,\delta]$, it has an expected running time of<br>$2^{O(\sqrt{\delta})} n^2 + O(n^3)$.<br> %K Computer Science, Computational Geometry, cs.CG
[192]
G. Amanatidis and P. Kleer, “Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences,” Random Structures and Algorithms, vol. 57, no. 3, 2020.
Export
BibTeX
@article{Amanatidis2020, TITLE = {Rapid mixing of the switch {M}arkov chain for strongly stable degree sequences}, AUTHOR = {Amanatidis, Georgios and Kleer, Pieter}, LANGUAGE = {eng}, ISSN = {1042-9832}, DOI = {10.1002/rsa.20949}, PUBLISHER = {Wiley}, ADDRESS = {New York, N.Y.}, YEAR = {2020}, DATE = {2020}, JOURNAL = {Random Structures and Algorithms}, VOLUME = {57}, NUMBER = {3}, PAGES = {637--657}, }
Endnote
%0 Journal Article %A Amanatidis, Georgios %A Kleer, Pieter %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences : %G eng %U http://hdl.handle.net/21.11116/0000-0006-DC7A-A %R 10.1002/rsa.20949 %7 2020 %D 2020 %J Random Structures and Algorithms %V 57 %N 3 %& 637 %P 637 - 657 %I Wiley %C New York, N.Y. %@ false
[193]
S. A. Amiri, A. Popa, M. Roghani, G. Shahkarami, R. Soltani, and H. Vahidi, “Complexity of Computing the Anti-Ramsey Numbers for Paths,” in 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), Prague, Czech Republic (Virtual Event), 2020.
Export
BibTeX
@inproceedings{Amiri_MFCS20, TITLE = {Complexity of Computing the Anti-{Ramsey} Numbers for Paths}, AUTHOR = {Amiri, Saeed Akhoondian and Popa, Alexandru and Roghani, Mohammad and Shahkarami, Golnoosh and Soltani, Reza and Vahidi, Hossein}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-159-7}, URL = {urn:nbn:de:0030-drops-126781}, DOI = {10.4230/LIPIcs.MFCS.2020.6}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2020}, BOOKTITLE = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, EDITOR = {Esparza, Javier and Kr{\`a}l', Daniel}, EID = {6}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {170}, ADDRESS = {Prague, Czech Republic (Virtual Event)}, }
Endnote
%0 Conference Proceedings %A Amiri, Saeed Akhoondian %A Popa, Alexandru %A Roghani, Mohammad %A Shahkarami, Golnoosh %A Soltani, Reza %A Vahidi, Hossein %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Complexity of Computing the Anti-Ramsey Numbers for Paths : %G eng %U http://hdl.handle.net/21.11116/0000-0007-9422-B %R 10.4230/LIPIcs.MFCS.2020.6 %U urn:nbn:de:0030-drops-126781 %D 2020 %B 45th International Symposium on Mathematical Foundations of Computer Science %Z date of event: 2020-08-25 - 2020-08-26 %C Prague, Czech Republic (Virtual Event) %B 45th International Symposium on Mathematical Foundations of Computer Science %E Esparza, Javier; Kr&#224;l', Daniel %Z sequence number: 6 %I Schloss Dagstuhl %@ 978-3-95977-159-7 %B Leibniz International Proceedings in Informatics %N 170 %@ false %U https://drops.dagstuhl.de/opus/volltexte/2020/12678/https://creativecommons.org/licenses/by/3.0/legalcode
[194]
S. A. Amiri and B. Wiederhake, “Distributed Distance-r Dominating Set on Sparse High-Girth Graphs,” 2020. [Online]. Available: https://arxiv.org/abs/1910.02794. (arXiv: 1910.02794)
Abstract
The dominating set problem and its generalization, the distance-$r$<br>dominating set problem, are among the well-studied problems in the sequential<br>settings. In distributed models of computation, unlike for domination, not much<br>is known about distance-r domination. This is actually the case for other<br>important closely-related covering problem, namely, the distance-$r$<br>independent set problem. By result of Kuhn et al. we know the distributed<br>domination problem is hard on high girth graphs; we study the problem on a<br>slightly restricted subclass of these graphs: graphs of bounded expansion with<br>high girth, i.e. their girth should be at least $4r + 3$. We show that in such<br>graphs, for every constant $r$, a simple greedy CONGEST algorithm provides a<br>constant-factor approximation of the minimum distance-$r$ dominating set<br>problem, in a constant number of rounds. More precisely, our constants are<br>dependent to $r$, not to the size of the graph. This is the first algorithm<br>that shows there are non-trivial constant factor approximations in constant<br>number of rounds for any distance $r$-covering problem in distributed settings.<br>To show the dependency on r is inevitable, we provide an unconditional lower<br>bound showing the same problem is hard already on rings. We also show that our<br>analysis of the algorithm is relatively tight, that is any significant<br>improvement to the approximation factor requires new algorithmic ideas.<br>
Export
BibTeX
@online{Amiri_arXiv1910.02794, TITLE = {Distributed Distance-$r$ Dominating Set on Sparse High-Girth Graphs}, AUTHOR = {Amiri, Saeed Akhoondian and Wiederhake, Ben}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/1910.02794}, EPRINT = {1910.02794}, EPRINTTYPE = {arXiv}, YEAR = {2020}, ABSTRACT = {The dominating set problem and its generalization, the distance-$r$<br>dominating set problem, are among the well-studied problems in the sequential<br>settings. In distributed models of computation, unlike for domination, not much<br>is known about distance-r domination. This is actually the case for other<br>important closely-related covering problem, namely, the distance-$r$<br>independent set problem. By result of Kuhn et al. we know the distributed<br>domination problem is hard on high girth graphs; we study the problem on a<br>slightly restricted subclass of these graphs: graphs of bounded expansion with<br>high girth, i.e. their girth should be at least $4r + 3$. We show that in such<br>graphs, for every constant $r$, a simple greedy CONGEST algorithm provides a<br>constant-factor approximation of the minimum distance-$r$ dominating set<br>problem, in a constant number of rounds. More precisely, our constants are<br>dependent to $r$, not to the size of the graph. This is the first algorithm<br>that shows there are non-trivial constant factor approximations in constant<br>number of rounds for any distance $r$-covering problem in distributed settings.<br>To show the dependency on r is inevitable, we provide an unconditional lower<br>bound showing the same problem is hard already on rings. We also show that our<br>analysis of the algorithm is relatively tight, that is any significant<br>improvement to the approximation factor requires new algorithmic ideas.<br>}, }
Endnote
%0 Report %A Amiri, Saeed Akhoondian %A Wiederhake, Ben %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Distributed Distance-r Dominating Set on Sparse High-Girth Graphs : %G eng %U http://hdl.handle.net/21.11116/0000-0007-905B-0 %U https://arxiv.org/abs/1910.02794 %D 2020 %X The dominating set problem and its generalization, the distance-$r$<br>dominating set problem, are among the well-studied problems in the sequential<br>settings. In distributed models of computation, unlike for domination, not much<br>is known about distance-r domination. This is actually the case for other<br>important closely-related covering problem, namely, the distance-$r$<br>independent set problem. By result of Kuhn et al. we know the distributed<br>domination problem is hard on high girth graphs; we study the problem on a<br>slightly restricted subclass of these graphs: graphs of bounded expansion with<br>high girth, i.e. their girth should be at least $4r + 3$. We show that in such<br>graphs, for every constant $r$, a simple greedy CONGEST algorithm provides a<br>constant-factor approximation of the minimum distance-$r$ dominating set<br>problem, in a constant number of rounds. More precisely, our constants are<br>dependent to $r$, not to the size of the graph. This is the first algorithm<br>that shows there are non-trivial constant factor approximations in constant<br>number of rounds for any distance $r$-covering problem in distributed settings.<br>To show the dependency on r is inevitable, we provide an unconditional lower<br>bound showing the same problem is hard already on rings. We also show that our<br>analysis of the algorithm is relatively tight, that is any significant<br>improvement to the approximation factor requires new algorithmic ideas.<br> %K Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC,Computer Science, Discrete Mathematics, cs.DM,Mathematics, Combinatorics, math.CO
[195]
S. A. Amiri, K.-T. Foerster, and S. Schmid, “Walking Through Waypoints,” Algorithmica, vol. 82, no. 7, 2020.
Export
BibTeX
@article{Amiri_Walking20, TITLE = {Walking Through Waypoints}, AUTHOR = {Amiri, Saeed Akhoondian and Foerster, Klaus-Tycho and Schmid, Stefan}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-020-00672-z}, PUBLISHER = {Springer-Verlag}, ADDRESS = {New York}, YEAR = {2020}, DATE = {2020}, JOURNAL = {Algorithmica}, VOLUME = {82}, NUMBER = {7}, PAGES = {1784--1812}, }
Endnote
%0 Journal Article %A Amiri, Saeed Akhoondian %A Foerster, Klaus-Tycho %A Schmid, Stefan %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Walking Through Waypoints : %G eng %U http://hdl.handle.net/21.11116/0000-0007-EDEF-2 %R 10.1007/s00453-020-00672-z %7 2020 %D 2020 %J Algorithmica %V 82 %N 7 %& 1784 %P 1784 - 1812 %I Springer-Verlag %C New York %@ false
[196]
I. Anagnostides, T. Gouleakis, and A. Marashian, “Robust Learning under Strong Noise via SQs,” 2020. [Online]. Available: https://arxiv.org/abs/2010.09106. (arXiv: 2010.09106)
Abstract
This work provides several new insights on the robustness of Kearns'<br>statistical query framework against challenging label-noise models. First, we<br>build on a recent result by \cite{DBLP:journals/corr/abs-2006-04787} that<br>showed noise tolerance of distribution-independently evolvable concept classes<br>under Massart noise. Specifically, we extend their characterization to more<br>general noise models, including the Tsybakov model which considerably<br>generalizes the Massart condition by allowing the flipping probability to be<br>arbitrarily close to $\frac{1}{2}$ for a subset of the domain. As a corollary,<br>we employ an evolutionary algorithm by \cite{DBLP:conf/colt/KanadeVV10} to<br>obtain the first polynomial time algorithm with arbitrarily small excess error<br>for learning linear threshold functions over any spherically symmetric<br>distribution in the presence of spherically symmetric Tsybakov noise. Moreover,<br>we posit access to a stronger oracle, in which for every labeled example we<br>additionally obtain its flipping probability. In this model, we show that every<br>SQ learnable class admits an efficient learning algorithm with OPT + $\epsilon$<br>misclassification error for a broad class of noise models. This setting<br>substantially generalizes the widely-studied problem of classification under<br>RCN with known noise rate, and corresponds to a non-convex optimization problem<br>even when the noise function -- i.e. the flipping probabilities of all points<br>-- is known in advance.<br>
Export
BibTeX
@online{Anagnostides_arXiv2010.09106, TITLE = {Robust Learning under Strong Noise via {SQs}}, AUTHOR = {Anagnostides, Ioannis and Gouleakis, Themis and Marashian, Ali}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2010.09106}, EPRINT = {2010.09106}, EPRINTTYPE = {arXiv}, YEAR = {2020}, ABSTRACT = {This work provides several new insights on the robustness of Kearns'<br>statistical query framework against challenging label-noise models. First, we<br>build on a recent result by \cite{DBLP:journals/corr/abs-2006-04787} that<br>showed noise tolerance of distribution-independently evolvable concept classes<br>under Massart noise. Specifically, we extend their characterization to more<br>general noise models, including the Tsybakov model which considerably<br>generalizes the Massart condition by allowing the flipping probability to be<br>arbitrarily close to $\frac{1}{2}$ for a subset of the domain. As a corollary,<br>we employ an evolutionary algorithm by \cite{DBLP:conf/colt/KanadeVV10} to<br>obtain the first polynomial time algorithm with arbitrarily small excess error<br>for learning linear threshold functions over any spherically symmetric<br>distribution in the presence of spherically symmetric Tsybakov noise. Moreover,<br>we posit access to a stronger oracle, in which for every labeled example we<br>additionally obtain its flipping probability. In this model, we show that every<br>SQ learnable class admits an efficient learning algorithm with OPT + $\epsilon$<br>misclassification error for a broad class of noise models. This setting<br>substantially generalizes the widely-studied problem of classification under<br>RCN with known noise rate, and corresponds to a non-convex optimization problem<br>even when the noise function -- i.e. the flipping probabilities of all points<br>-- is known in advance.<br>}, }
Endnote
%0 Report %A Anagnostides, Ioannis %A Gouleakis, Themis %A Marashian, Ali %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Robust Learning under Strong Noise via SQs : %G eng %U http://hdl.handle.net/21.11116/0000-0007-8B5D-5 %U https://arxiv.org/abs/2010.09106 %D 2020 %X This work provides several new insights on the robustness of Kearns'<br>statistical query framework against challenging label-noise models. First, we<br>build on a recent result by \cite{DBLP:journals/corr/abs-2006-04787} that<br>showed noise tolerance of distribution-independently evolvable concept classes<br>under Massart noise. Specifically, we extend their characterization to more<br>general noise models, including the Tsybakov model which considerably<br>generalizes the Massart condition by allowing the flipping probability to be<br>arbitrarily close to $\frac{1}{2}$ for a subset of the domain. As a corollary,<br>we employ an evolutionary algorithm by \cite{DBLP:conf/colt/KanadeVV10} to<br>obtain the first polynomial time algorithm with arbitrarily small excess error<br>for learning linear threshold functions over any spherically symmetric<br>distribution in the presence of spherically symmetric Tsybakov noise. Moreover,<br>we posit access to a stronger oracle, in which for every labeled example we<br>additionally obtain its flipping probability. In this model, we show that every<br>SQ learnable class admits an efficient learning algorithm with OPT + $\epsilon$<br>misclassification error for a broad class of noise models. This setting<br>substantially generalizes the widely-studied problem of classification under<br>RCN with known noise rate, and corresponds to a non-convex optimization problem<br>even when the noise function -- i.e. the flipping probabilities of all points<br>-- is known in advance.<br> %K Statistics, Machine Learning, stat.ML,Computer Science, Learning, cs.LG
[197]
A. Antoniadis, T. Gouleakis, P. Kleer, and P. Kolev, “Secretary and Online Matching Problems with Machine Learned Advice,” in Advances in Neural Information Processing Systems 33 (NeurIPS 2020), Virtual Event, 2020.
Export
BibTeX
@inproceedings{Antoniadis_NeurIPS20, TITLE = {Secretary and Online Matching Problems with Machine Learned Advice}, AUTHOR = {Antoniadis, Antonios and Gouleakis, Themis and Kleer, Pieter and Kolev, Pavel}, LANGUAGE = {eng}, PUBLISHER = {Curran Associates, Inc.}, YEAR = {2020}, BOOKTITLE = {Advances in Neural Information Processing Systems 33 (NeurIPS 2020)}, EDITOR = {Larochelle, H. and Ranzato, M. and Hadsell, R. and Balcan, M. F. and Lin, H.}, ADDRESS = {Virtual Event}, }
Endnote
%0 Conference Proceedings %A Antoniadis, Antonios %A Gouleakis, Themis %A Kleer, Pieter %A Kolev, Pavel %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Secretary and Online Matching Problems with Machine Learned Advice : %G eng %U http://hdl.handle.net/21.11116/0000-0007-93CA-F %D 2020 %B 34th Conference on Neural Information Processing Systems %Z date of event: 2020-12-06 - 2020-12-12 %C Virtual Event %B Advances in Neural Information Processing Systems 33 %E Larochelle, H.; Ranzato, M.; Hadsell, R.; Balcan, M. F.; Lin, H. %I Curran Associates, Inc.
[198]
A. Antoniadis, S. Kisfaludi-Bak, B. Laekhanukit, and D. Vaz, “On the Approximability of the Traveling Salesman Problem with Line Neighborhoods,” 2020. [Online]. Available: https://arxiv.org/abs/2008.12075. (arXiv: 2008.12075)
Abstract
We study the variant of the Euclidean Traveling Salesman problem where<br>instead of a set of points, we are given a set of lines as input, and the goal<br>is to find the shortest tour that visits each line. The best known upper and<br>lower bounds for the problem in $\mathbb{R}^d$, with $d\ge 3$, are<br>$\mathrm{NP}$-hardness and an $O(\log^3 n)$-approximation algorithm which is<br>based on a reduction to the group Steiner tree problem.<br> We show that TSP with lines in $\mathbb{R}^d$ is APX-hard for any $d\ge 3$.<br>More generally, this implies that TSP with $k$-dimensional flats does not admit<br>a PTAS for any $1\le k \leq d-2$ unless $\mathrm{P}=\mathrm{NP}$, which gives a<br>complete classification of the approximability of these problems, as there are<br>known PTASes for $k=0$ (i.e., points) and $k=d-1$ (hyperplanes). We are able to<br>give a stronger inapproximability factor for $d=O(\log n)$ by showing that TSP<br>with lines does not admit a $(2-\epsilon)$-approximation in $d$ dimensions<br>under the unique games conjecture. On the positive side, we leverage recent<br>results on restricted variants of the group Steiner tree problem in order to<br>give an $O(\log^2 n)$-approximation algorithm for the problem, albeit with a<br>running time of $n^{O(\log\log n)}$.<br>
Export
BibTeX
@online{Antoniadis_arXiv2008.12075, TITLE = {On the Approximability of the Traveling Salesman Problem with Line Neighborhoods}, AUTHOR = {Antoniadis, Antonios and Kisfaludi-Bak, S{\'a}ndor and Laekhanukit, Bundit and Vaz, Daniel}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2008.12075}, EPRINT = {2008.12075}, EPRINTTYPE = {arXiv}, YEAR = {2020}, ABSTRACT = {We study the variant of the Euclidean Traveling Salesman problem where<br>instead of a set of points, we are given a set of lines as input, and the goal<br>is to find the shortest tour that visits each line. The best known upper and<br>lower bounds for the problem in $\mathbb{R}^d$, with $d\ge 3$, are<br>$\mathrm{NP}$-hardness and an $O(\log^3 n)$-approximation algorithm which is<br>based on a reduction to the group Steiner tree problem.<br> We show that TSP with lines in $\mathbb{R}^d$ is APX-hard for any $d\ge 3$.<br>More generally, this implies that TSP with $k$-dimensional flats does not admit<br>a PTAS for any $1\le k \leq d-2$ unless $\mathrm{P}=\mathrm{NP}$, which gives a<br>complete classification of the approximability of these problems, as there are<br>known PTASes for $k=0$ (i.e., points) and $k=d-1$ (hyperplanes). We are able to<br>give a stronger inapproximability factor for $d=O(\log n)$ by showing that TSP<br>with lines does not admit a $(2-\epsilon)$-approximation in $d$ dimensions<br>under the unique games conjecture. On the positive side, we leverage recent<br>results on restricted variants of the group Steiner tree problem in order to<br>give an $O(\log^2 n)$-approximation algorithm for the problem, albeit with a<br>running time of $n^{O(\log\log n)}$.<br>}, }
Endnote
%0 Report %A Antoniadis, Antonios %A Kisfaludi-Bak, S&#225;ndor %A Laekhanukit, Bundit %A Vaz, Daniel %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T On the Approximability of the Traveling Salesman Problem with Line Neighborhoods : %G eng %U http://hdl.handle.net/21.11116/0000-0007-77AD-1 %U https://arxiv.org/abs/2008.12075 %D 2020 %X We study the variant of the Euclidean Traveling Salesman problem where<br>instead of a set of points, we are given a set of lines as input, and the goal<br>is to find the shortest tour that visits each line. The best known upper and<br>lower bounds for the problem in $\mathbb{R}^d$, with $d\ge 3$, are<br>$\mathrm{NP}$-hardness and an $O(\log^3 n)$-approximation algorithm which is<br>based on a reduction to the group Steiner tree problem.<br> We show that TSP with lines in $\mathbb{R}^d$ is APX-hard for any $d\ge 3$.<br>More generally, this implies that TSP with $k$-dimensional flats does not admit<br>a PTAS for any $1\le k \leq d-2$ unless $\mathrm{P}=\mathrm{NP}$, which gives a<br>complete classification of the approximability of these problems, as there are<br>known PTASes for $k=0$ (i.e., points) and $k=d-1$ (hyperplanes). We are able to<br>give a stronger inapproximability factor for $d=O(\log n)$ by showing that TSP<br>with lines does not admit a $(2-\epsilon)$-approximation in $d$ dimensions<br>under the unique games conjecture. On the positive side, we leverage recent<br>results on restricted variants of the group Steiner tree problem in order to<br>give an $O(\log^2 n)$-approximation algorithm for the problem, albeit with a<br>running time of $n^{O(\log\log n)}$.<br> %K Computer Science, Data Structures and Algorithms, cs.DS
[199]
A. Antoniadis, K. Fleszar, R. Hoeksma, and K. Schewior, “A PTAS for Euclidean TSP with Hyperplane Neighborhoods,” ACM Transactions on Algorithms, vol. 16, no. 3, 2020.
Export
BibTeX
@article{AntoniadisTOA2020, TITLE = {A {PTAS} for {Euclidean} {TSP} with Hyperplane Neighborhoods}, AUTHOR = {Antoniadis, Antonios and Fleszar, Krzysztof and Hoeksma, Ruben and Schewior, Kevin}, LANGUAGE = {eng}, ISSN = {1549-6325}, DOI = {10.1145/3383466}, PUBLISHER = {ACM}, ADDRESS = {New York, NY}, YEAR = {2020}, JOURNAL = {ACM Transactions on Algorithms}, VOLUME = {16}, NUMBER = {3}, EID = {38}, }
Endnote
%0 Journal Article %A Antoniadis, Antonios %A Fleszar, Krzysztof %A Hoeksma, Ruben %A Schewior, Kevin %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T A PTAS for Euclidean TSP with Hyperplane Neighborhoods : %G eng %U http://hdl.handle.net/21.11116/0000-0008-0723-9 %R 10.1145/3383466 %7 2020 %D 2020 %J ACM Transactions on Algorithms %V 16 %N 3 %Z sequence number: 38 %I ACM %C New York, NY %@ false
[200]
A. Antoniadis, N. Garg, G. Kumar, and N. Kumar, “Parallel Machine Scheduling to Minimize Energy Consumption,” in Proceedings of the Thirty-First ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), Salt Lake City, UT, USA, 2020.
Export
BibTeX
@inproceedings{Antoniadis_SODA20, TITLE = {Parallel Machine Scheduling to Minimize Energy Consumption}, AUTHOR = {Antoniadis, Antonios and Garg, Naveen and Kumar, Gunjan and Kumar, Nikhil}, LANGUAGE = {eng}, ISBN = {978-1-61197-599-4}, DOI = {10.5555/3381089.3381257}, PUBLISHER = {SIAM}, YEAR = {2020}, BOOKTITLE = {Proceedings of the Thirty-First ACM-SIAM Symposium on Discrete Algorithms (SODA 2020)}, EDITOR = {Chawla, Shuchi}, PAGES = {2758--2769}, ADDRESS = {Salt Lake City, UT, USA}, }
Endnote
%0 Conference Proceedings %A Antoniadis, Antonios %A Garg, Naveen %A Kumar, Gunjan %A Kumar, Nikhil %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Parallel Machine Scheduling to Minimize Energy Consumption : %G eng %U http://hdl.handle.net/21.11116/0000-0006-F26A-2 %R 10.5555/3381089.3381257 %D 2020 %B 31st Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2020-01-05 - 2020-01-08 %C Salt Lake City, UT, USA %B Proceedings of the Thirty-First ACM-SIAM Symposium on Discrete Algorithms %E Chawla, Shuchi %P 2758 - 2769 %I SIAM %@ 978-1-61197-599-4
[201]
A. Antoniadis, C. Coester, M. Elias, A. Polak, and B. Simon, “Online Metric Algorithms with Untrusted Predictions,” in Proceedings of the 37th International Conference on Machine Learning (ICML 2020), Virtual Conference, 2020.
Export
BibTeX
@inproceedings{Antoniadis_ICML2020, TITLE = {Online Metric Algorithms with Untrusted Predictions}, AUTHOR = {Antoniadis, Antonios and Coester, Christian and Elias, Marek and Polak, Adam and Simon, Bertrand}, LANGUAGE = {eng}, ISSN = {2640-3498}, PUBLISHER = {MLResearchPress}, YEAR = {2020}, BOOKTITLE = {Proceedings of the 37th International Conference on Machine Learning (ICML 2020)}, EDITOR = {Daum{\'e}, Hal and Singh, Aarti}, PAGES = {345--355}, SERIES = {Proceedings of Machine Learning Research}, VOLUME = {119}, ADDRESS = {Virtual Conference}, }
Endnote
%0 Conference Proceedings %A Antoniadis, Antonios %A Coester, Christian %A Elias, Marek %A Polak, Adam %A Simon, Bertrand %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations %T Online Metric Algorithms with Untrusted Predictions : %G eng %U http://hdl.handle.net/21.11116/0000-0007-93BF-C %D 2020 %B 37th International Conference on Machine Learning %Z date of event: 2020-07-13 - 2020-07-18 %C Virtual Conference %B Proceedings of the 37th International Conference on Machine Learning %E Daum&#233;, Hal; Singh, Aarti %P 345 - 355 %I MLResearchPress %B Proceedings of Machine Learning Research %N 119 %@ false %U http://proceedings.mlr.press/v119/antoniadis20a/antoniadis20a.pdf
[202]
A. Antoniadis, A. Cristi, T. Oosterwijk, and A. Sgouritsa, “A General Framework for Energy-Efficient Cloud Computing Mechanisms,” in AAMAS’20, 19th International Conference on Autonomous Agents and MultiAgent Systems, Auckland, New Zealand (Virtual), 2020.
Export
BibTeX
@inproceedings{Antoniadis_AAMAS20, TITLE = {A General Framework for Energy-Efficient Cloud Computing Mechanisms}, AUTHOR = {Antoniadis, Antonios and Cristi, Andr{\'e}s and Oosterwijk, Tim and Sgouritsa, Alkmini}, LANGUAGE = {eng}, ISBN = {978-1-4503-7518-4}, URL = {https://dl.acm.org/doi/10.5555/3398761.3398775}, PUBLISHER = {ACM}, YEAR = {2020}, BOOKTITLE = {AAMAS'20, 19th International Conference on Autonomous Agents and MultiAgent Systems}, EDITOR = {El Fallah Seghruchni, Amal and Sukthankr, Gita and An, Bo and Yorke-Smith, Neil}, PAGES = {70--78}, ADDRESS = {Auckland, New Zealand (Virtual)}, }
Endnote
%0 Conference Proceedings %A Antoniadis, Antonios %A Cristi, Andr&#233;s %A Oosterwijk, Tim %A Sgouritsa, Alkmini %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T A General Framework for Energy-Efficient Cloud Computing Mechanisms : %G eng %U http://hdl.handle.net/21.11116/0000-0007-93A5-8 %U https://dl.acm.org/doi/10.5555/3398761.3398775 %D 2020 %B 19th International Conference on Autonomous Agents and MultiAgent Systems %Z date of event: 2020-05-09 - 2020-05-13 %C Auckland, New Zealand (Virtual) %B AAMAS'20 %E El Fallah Seghruchni, Amal; Sukthankr, Gita; An, Bo; Yorke-Smith, Neil %P 70 - 78 %I ACM %@ 978-1-4503-7518-4
[203]
A. Antoniadis, T. Gouleakis, P. Kleer, and P. Kolev, “Secretary and Online Matching Problems with Machine Learned Advice,” 2020. [Online]. Available: https://arxiv.org/abs/2006.01026. (arXiv: 2006.01026)
Abstract
The classical analysis of online algorithms, due to its worst-case nature,<br>can be quite pessimistic when the input instance at hand is far from<br>worst-case. Often this is not an issue with machine learning approaches, which<br>shine in exploiting patterns in past inputs in order to predict the future.<br>However, such predictions, although usually accurate, can be arbitrarily poor.<br>Inspired by a recent line of work, we augment three well-known online settings<br>with machine learned predictions about the future, and develop algorithms that<br>take them into account. In particular, we study the following online selection<br>problems: (i) the classical secretary problem, (ii) online bipartite matching<br>and (iii) the graphic matroid secretary problem. Our algorithms still come with<br>a worst-case performance guarantee in the case that predictions are subpar<br>while obtaining an improved competitive ratio (over the best-known classical<br>online algorithm for each problem) when the predictions are sufficiently<br>accurate. For each algorithm, we establish a trade-off between the competitive<br>ratios obtained in the two respective cases.<br>
Export
BibTeX
@online{Antoniadis_arXiv2006.01026, TITLE = {Secretary and Online Matching Problems with Machine Learned Advice}, AUTHOR = {Antoniadis, Antonios and Gouleakis, Themis and Kleer, Pieter and Kolev, Pavel}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2006.01026}, EPRINT = {2006.01026}, EPRINTTYPE = {arXiv}, YEAR = {2020}, ABSTRACT = {The classical analysis of online algorithms, due to its worst-case nature,<br>can be quite pessimistic when the input instance at hand is far from<br>worst-case. Often this is not an issue with machine learning approaches, which<br>shine in exploiting patterns in past inputs in order to predict the future.<br>However, such predictions, although usually accurate, can be arbitrarily poor.<br>Inspired by a recent line of work, we augment three well-known online settings<br>with machine learned predictions about the future, and develop algorithms that<br>take them into account. In particular, we study the following online selection<br>problems: (i) the classical secretary problem, (ii) online bipartite matching<br>and (iii) the graphic matroid secretary problem. Our algorithms still come with<br>a worst-case performance guarantee in the case that predictions are subpar<br>while obtaining an improved competitive ratio (over the best-known classical<br>online algorithm for each problem) when the predictions are sufficiently<br>accurate. For each algorithm, we establish a trade-off between the competitive<br>ratios obtained in the two respective cases.<br>}, }
Endnote
%0 Report %A Antoniadis, Antonios %A Gouleakis, Themis %A Kleer, Pieter %A Kolev, Pavel %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Secretary and Online Matching Problems with Machine Learned Advice : %G eng %U http://hdl.handle.net/21.11116/0000-0007-8B7A-4 %U https://arxiv.org/abs/2006.01026 %D 2020 %X The classical analysis of online algorithms, due to its worst-case nature,<br>can be quite pessimistic when the input instance at hand is far from<br>worst-case. Often this is not an issue with machine learning approaches, which<br>shine in exploiting patterns in past inputs in order to predict the future.<br>However, such predictions, although usually accurate, can be arbitrarily poor.<br>Inspired by a recent line of work, we augment three well-known online settings<br>with machine learned predictions about the future, and develop algorithms that<br>take them into account. In particular, we study the following online selection<br>problems: (i) the classical secretary problem, (ii) online bipartite matching<br>and (iii) the graphic matroid secretary problem. Our algorithms still come with<br>a worst-case performance guarantee in the case that predictions are subpar<br>while obtaining an improved competitive ratio (over the best-known classical<br>online algorithm for each problem) when the predictions are sufficiently<br>accurate. For each algorithm, we establish a trade-off between the competitive<br>ratios obtained in the two respective cases.<br> %K Computer Science, Data Structures and Algorithms, cs.DS
[204]
S. Arunachalam, S. Chakraborty, M. Koucký, N. Saurabh, and R. de Wolf, “Improved Bounds on Fourier Entropy and Min-entropy,” in 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), Montpellier, France, 2020.
Export
BibTeX
@inproceedings{Arunachalam_STACS2020, TITLE = {Improved Bounds on {Fourier} Entropy and Min-entropy}, AUTHOR = {Arunachalam, Srinivasan and Chakraborty, Sourav and Kouck{\'y}, Michal and Saurabh, Nitin and de Wolf, Ronald}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-140-5}, URL = {urn:nbn:de:0030-drops-119062}, DOI = {10.4230/LIPIcs.STACS.2020.45}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2020}, BOOKTITLE = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, EDITOR = {Paul, Christophe and Bl{\"a}ser, Markus}, PAGES = {1--19}, EID = {45}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {154}, ADDRESS = {Montpellier, France}, }
Endnote
%0 Conference Proceedings %A Arunachalam, Srinivasan %A Chakraborty, Sourav %A Kouck&#253;, Michal %A Saurabh, Nitin %A de Wolf, Ronald %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Improved Bounds on Fourier Entropy and Min-entropy : %G eng %U http://hdl.handle.net/21.11116/0000-0006-97AB-F %R 10.4230/LIPIcs.STACS.2020.45 %U urn:nbn:de:0030-drops-119062 %D 2020 %B 37th International Symposium on Theoretical Aspects of Computer Science %Z date of event: 2020-03-10 - 2020-03-13 %C Montpellier, France %B 37th International Symposium on Theoretical Aspects of Computer Science %E Paul, Christophe; Bl&#228;ser, Markus %P 1 - 19 %Z sequence number: 45 %I Schloss Dagstuhl %@ 978-3-95977-140-5 %B Leibniz International Proceedings in Informatics %N 154 %@ false %U https://drops.dagstuhl.de/opus/volltexte/2020/11906/
[205]
K. Axiotis, A. Backurs, K. Bringmann, C. Jin, V. Nakos, C. Tzamos, and H. Wu, “Fast and Simple Modular Subset Sum,” 2020. [Online]. Available: https://arxiv.org/abs/2008.10577. (arXiv: 2008.10577)
Abstract
We revisit the Subset Sum problem over the finite cyclic group $\mathbb{Z}_m$<br>for some given integer $m$. A series of recent works has provided<br>asymptotically optimal algorithms for this problem under the Strong Exponential<br>Time Hypothesis. Koiliaris and Xu (SODA'17, TALG'19) gave a deterministic<br>algorithm running in time $\tilde{O}(m^{5/4})$, which was later improved to<br>$O(m \log^7 m)$ randomized time by Axiotis et al. (SODA'19). In this work, we<br>present two simple algorithms for the Modular Subset Sum problem running in<br>near-linear time in $m$, both efficiently implementing Bellman's iteration over<br>$\mathbb{Z}_m$. The first one is a randomized algorithm running in time<br>$O(m\log^2 m)$, that is based solely on rolling hash and an elementary<br>data-structure for prefix sums; to illustrate its simplicity we provide a short<br>and efficient implementation of the algorithm in Python. Our second solution is<br>a deterministic algorithm running in time $O(m\ \mathrm{polylog}\ m)$, that<br>uses dynamic data structures for string manipulation. We further show that the<br>techniques developed in this work can also lead to simple algorithms for the<br>All Pairs Non-Decreasing Paths Problem (APNP) on undirected graphs, matching<br>the asymptotically optimal running time of $\tilde{O}(n^2)$ provided in the<br>recent work of Duan et al. (ICALP'19).<br>
Export
BibTeX
@online{Axiotis_arXiv2008.10577, TITLE = {Fast and Simple Modular Subset Sum}, AUTHOR = {Axiotis, Kyriakos and Backurs, Arturs and Bringmann, Karl and Jin, Ce and Nakos, Vasileios and Tzamos, Christos and Wu, Hongxun}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2008.10577}, EPRINT = {2008.10577}, EPRINTTYPE = {arXiv}, YEAR = {2020}, ABSTRACT = {We revisit the Subset Sum problem over the finite cyclic group $\mathbb{Z}_m$<br>for some given integer $m$. A series of recent works has provided<br>asymptotically optimal algorithms for this problem under the Strong Exponential<br>Time Hypothesis. Koiliaris and Xu (SODA'17, TALG'19) gave a deterministic<br>algorithm running in time $\tilde{O}(m^{5/4})$, which was later improved to<br>$O(m \log^7 m)$ randomized time by Axiotis et al. (SODA'19). In this work, we<br>present two simple algorithms for the Modular Subset Sum problem running in<br>near-linear time in $m$, both efficiently implementing Bellman's iteration over<br>$\mathbb{Z}_m$. The first one is a randomized algorithm running in time<br>$O(m\log^2 m)$, that is based solely on rolling hash and an elementary<br>data-structure for prefix sums; to illustrate its simplicity we provide a short<br>and efficient implementation of the algorithm in Python. Our second solution is<br>a deterministic algorithm running in time $O(m\ \mathrm{polylog}\ m)$, that<br>uses dynamic data structures for string manipulation. We further show that the<br>techniques developed in this work can also lead to simple algorithms for the<br>All Pairs Non-Decreasing Paths Problem (APNP) on undirected graphs, matching<br>the asymptotically optimal running time of $\tilde{O}(n^2)$ provided in the<br>recent work of Duan et al. (ICALP'19).<br>}, }
Endnote
%0 Report %A Axiotis, Kyriakos %A Backurs, Arturs %A Bringmann, Karl %A Jin, Ce %A Nakos, Vasileios %A Tzamos, Christos %A Wu, Hongxun %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Fast and Simple Modular Subset Sum : %G eng %U http://hdl.handle.net/21.11116/0000-0007-2A5B-5 %U https://arxiv.org/abs/2008.10577 %D 2020 %X We revisit the Subset Sum problem over the finite cyclic group $\mathbb{Z}_m$<br>for some given integer $m$. A series of recent works has provided<br>asymptotically optimal algorithms for this problem under the Strong Exponential<br>Time Hypothesis. Koiliaris and Xu (SODA'17, TALG'19) gave a deterministic<br>algorithm running in time $\tilde{O}(m^{5/4})$, which was later improved to<br>$O(m \log^7 m)$ randomized time by Axiotis et al. (SODA'19). In this work, we<br>present two simple algorithms for the Modular Subset Sum problem running in<br>near-linear time in $m$, both efficiently implementing Bellman's iteration over<br>$\mathbb{Z}_m$. The first one is a randomized algorithm running in time<br>$O(m\log^2 m)$, that is based solely on rolling hash and an elementary<br>data-structure for prefix sums; to illustrate its simplicity we provide a short<br>and efficient implementation of the algorithm in Python. Our second solution is<br>a deterministic algorithm running in time $O(m\ \mathrm{polylog}\ m)$, that<br>uses dynamic data structures for string manipulation. We further show that the<br>techniques developed in this work can also lead to simple algorithms for the<br>All Pairs Non-Decreasing Paths Problem (APNP) on undirected graphs, matching<br>the asymptotically optimal running time of $\tilde{O}(n^2)$ provided in the<br>recent work of Duan et al. (ICALP'19).<br> %K Computer Science, Data Structures and Algorithms, cs.DS
[206]
R. Becker, Y. Emek, and C. Lenzen, “Low Diameter Graph Decompositions by Approximate Distance Computation,” in 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), Seattle, WA, USA, 2020.
Export
BibTeX
@inproceedings{Becker_ITCS2020, TITLE = {Low Diameter Graph Decompositions by Approximate Distance Computation}, AUTHOR = {Becker, Ruben and Emek, Yuval and Lenzen, Christoph}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-134-4}, URL = {urn:nbn:de:0030-drops-117355}, DOI = {10.4230/LIPIcs.ITCS.2020.50}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2020}, BOOKTITLE = {11th Innovations in Theoretical Computer Science Conference (ITCS 2020)}, EDITOR = {Vidick, Thomas}, EID = {50}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {151}, ADDRESS = {Seattle, WA, USA}, }
Endnote
%0 Conference Proceedings %A Becker, Ruben %A Emek, Yuval %A Lenzen, Christoph %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Low Diameter Graph Decompositions by Approximate Distance Computation : %G eng %U http://hdl.handle.net/21.11116/0000-0005-A7A7-2 %R 10.4230/LIPIcs.ITCS.2020.50 %U urn:nbn:de:0030-drops-117355 %D 2020 %B 11th Innovations in Theoretical Computer Science Conference %Z date of event: 2020-01-12 - 2020-01-14 %C Seattle, WA, USA %B 11th Innovations in Theoretical Computer Science Conference %E Vidick, Thomas %Z sequence number: 50 %I Schloss Dagstuhl %@ 978-3-95977-134-4 %B Leibniz International Proceedings in Informatics %N 151 %@ false %U https://drops.dagstuhl.de/opus/volltexte/2020/11735/https://drops.dagstuhl.de/doku/urheberrecht1.html
[207]
D. Bilò, L. Gualà, S. Leucci, and G. Proietti, “Tracking Routes in Communication Networks,” Theoretical Computer Science, vol. 844, 2020.
Export
BibTeX
@article{Bilo_2020, TITLE = {Tracking Routes in Communication Networks}, AUTHOR = {Bil{\`o}, Davide and Gual{\`a}, Luciano and Leucci, Stefano and Proietti, Guido}, LANGUAGE = {eng}, ISSN = {0304-3975}, DOI = {10.1016/j.tcs.2020.07.012}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2020}, DATE = {2020}, JOURNAL = {Theoretical Computer Science}, VOLUME = {844}, PAGES = {1--15}, }
Endnote
%0 Journal Article %A Bil&#242;, Davide %A Gual&#224;, Luciano %A Leucci, Stefano %A Proietti, Guido %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Tracking Routes in Communication Networks : %G eng %U http://hdl.handle.net/21.11116/0000-0007-72EF-C %R 10.1016/j.tcs.2020.07.012 %7 2020 %D 2020 %J Theoretical Computer Science %V 844 %& 1 %P 1 - 15 %I Elsevier %C Amsterdam %@ false
[208]
V. Bonifaci, E. Facca, F. Folz, A. Karrenbauer, P. Kolev, K. Mehlhorn, G. Morigi, G. Shahkarami, and Q. Vermande, “Physarum Multi-Commodity Flow Dynamics,” 2020. [Online]. Available: https://arxiv.org/abs/2009.01498. (arXiv: 2009.01498)
Abstract
In wet-lab experiments \cite{Nakagaki-Yamada-Toth,Tero-Takagi-etal}, the<br>slime mold Physarum polycephalum has demonstrated its ability to solve shortest<br>path problems and to design efficient networks, see Figure \ref{Wet-Lab<br>Experiments} for illustrations. Physarum polycephalum is a slime mold in the<br>Mycetozoa group. For the shortest path problem, a mathematical model for the<br>evolution of the slime was proposed in \cite{Tero-Kobayashi-Nakagaki} and its<br>biological relevance was argued. The model was shown to solve shortest path<br>problems, first in computer simulations and then by mathematical proof. It was<br>later shown that the slime mold dynamics can solve more general linear programs<br>and that many variants of the dynamics have similar convergence behavior. In<br>this paper, we introduce a dynamics for the network design problem. We<br>formulate network design as the problem of constructing a network that<br>efficiently supports a multi-commodity flow problem. We investigate the<br>dynamics in computer simulations and analytically. The simulations show that<br>the dynamics is able to construct efficient and elegant networks. In the<br>theoretical part we show that the dynamics minimizes an objective combining the<br>cost of the network and the cost of routing the demands through the network. We<br>also give alternative characterization of the optimum solution.<br>
Export
BibTeX
@online{Bonifaci_arXiv2009.01498, TITLE = {Physarum Multi-Commodity Flow Dynamics}, AUTHOR = {Bonifaci, Vincenzo and Facca, Enrico and Folz, Frederic and Karrenbauer, Andreas and Kolev, Pavel and Mehlhorn, Kurt and Morigi, Giovanna and Shahkarami, Golnoosh and Vermande, Quentin}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2009.01498}, EPRINT = {2009.01498}, EPRINTTYPE = {arXiv}, YEAR = {2020}, ABSTRACT = {In wet-lab experiments \cite{Nakagaki-Yamada-Toth,Tero-Takagi-etal}, the<br>slime mold Physarum polycephalum has demonstrated its ability to solve shortest<br>path problems and to design efficient networks, see Figure \ref{Wet-Lab<br>Experiments} for illustrations. Physarum polycephalum is a slime mold in the<br>Mycetozoa group. For the shortest path problem, a mathematical model for the<br>evolution of the slime was proposed in \cite{Tero-Kobayashi-Nakagaki} and its<br>biological relevance was argued. The model was shown to solve shortest path<br>problems, first in computer simulations and then by mathematical proof. It was<br>later shown that the slime mold dynamics can solve more general linear programs<br>and that many variants of the dynamics have similar convergence behavior. In<br>this paper, we introduce a dynamics for the network design problem. We<br>formulate network design as the problem of constructing a network that<br>efficiently supports a multi-commodity flow problem. We investigate the<br>dynamics in computer simulations and analytically. The simulations show that<br>the dynamics is able to construct efficient and elegant networks. In the<br>theoretical part we show that the dynamics minimizes an objective combining the<br>cost of the network and the cost of routing the demands through the network. We<br>also give alternative characterization of the optimum solution.<br>}, }
Endnote
%0 Report %A Bonifaci, Vincenzo %A Facca, Enrico %A Folz, Frederic %A Karrenbauer, Andreas %A Kolev, Pavel %A Mehlhorn, Kurt %A Morigi, Giovanna %A Shahkarami, Golnoosh %A Vermande, Quentin %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Physarum Multi-Commodity Flow Dynamics : %G eng %U http://hdl.handle.net/21.11116/0000-0007-2312-D %U https://arxiv.org/abs/2009.01498 %D 2020 %X In wet-lab experiments \cite{Nakagaki-Yamada-Toth,Tero-Takagi-etal}, the<br>slime mold Physarum polycephalum has demonstrated its ability to solve shortest<br>path problems and to design efficient networks, see Figure \ref{Wet-Lab<br>Experiments} for illustrations. Physarum polycephalum is a slime mold in the<br>Mycetozoa group. For the shortest path problem, a mathematical model for the<br>evolution of the slime was proposed in \cite{Tero-Kobayashi-Nakagaki} and its<br>biological relevance was argued. The model was shown to solve shortest path<br>problems, first in computer simulations and then by mathematical proof. It was<br>later shown that the slime mold dynamics can solve more general linear programs<br>and that many variants of the dynamics have similar convergence behavior. In<br>this paper, we introduce a dynamics for the network design problem. We<br>formulate network design as the problem of constructing a network that<br>efficiently supports a multi-commodity flow problem. We investigate the<br>dynamics in computer simulations and analytically. The simulations show that<br>the dynamics is able to construct efficient and elegant networks. In the<br>theoretical part we show that the dynamics minimizes an objective combining the<br>cost of the network and the cost of routing the demands through the network. We<br>also give alternative characterization of the optimum solution.<br> %K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Neural and Evolutionary Computing, cs.NE
[209]
M. Brankovic, K. Buchin, K. Klaren, A. Nusser, A. Popov, and S. Wong, “(k, l)-Medians Clustering of Trajectories Using Continuous Dynamic Time Warpin,” in 28th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL GIS 2020), Seattle, WA, USA (Online), 2020.
Export
BibTeX
@inproceedings{Brankovic_._SIGSPATIAL2020, TITLE = {{(k, l)}-Medians Clustering of Trajectories Using Continuous Dynamic Time Warpin}, AUTHOR = {Brankovic, Milutin and Buchin, Kevin and Klaren, Koen and Nusser, Andr{\'e} and Popov, Aleksandr and Wong, Sampson}, LANGUAGE = {eng}, ISBN = {9781450380195}, DOI = {0.1145/3397536.3422245}, PUBLISHER = {ACM}, YEAR = {2020}, BOOKTITLE = {28th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL GIS 2020)}, EDITOR = {Lu, Chang-Tien and Wag, Fusheng and Trajcevski, Goce and Huang, Yan and Newsam, Shawn and Xiong, Li}, PAGES = {99--110}, ADDRESS = {Seattle, WA, USA (Online)}, }
Endnote
%0 Conference Proceedings %A Brankovic, Milutin %A Buchin, Kevin %A Klaren, Koen %A Nusser, Andr&#233; %A Popov, Aleksandr %A Wong, Sampson %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T (k, l)-Medians Clustering of Trajectories Using Continuous Dynamic Time Warpin : %G eng %U http://hdl.handle.net/21.11116/0000-0007-9068-1 %R 0.1145/3397536.3422245 %D 2020 %B 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems %Z date of event: 2020-11-03 - 2020-11-06 %C Seattle, WA, USA (Online) %B 28th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems %E Lu, Chang-Tien; Wag, Fusheng; Trajcevski, Goce; Huang, Yan; Newsam, Shawn; Xiong, Li %P 99 - 110 %I ACM %@ 9781450380195
[210]
K. Bringmann, M. Künnemann, and A. Nusser, “When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation,” 2020. [Online]. Available: https://arxiv.org/abs/2008.07510. (arXiv: 2008.07510)
Abstract
Consider the natural question of how to measure the similarity of curves in<br>the plane by a quantity that is invariant under translations of the curves.<br>Such a measure is justified whenever we aim to quantify the similarity of the<br>curves' shapes rather than their positioning in the plane, e.g., to compare the<br>similarity of handwritten characters. Perhaps the most natural such notion is<br>the (discrete) Fr\'echet distance under translation. Unfortunately, the<br>algorithmic literature on this problem yields a very pessimistic view: On<br>polygonal curves with $n$ vertices, the fastest algorithm runs in time<br>$O(n^{4.667})$ and cannot be improved below $n^{4-o(1)}$ unless the Strong<br>Exponential Time Hypothesis fails. Can we still obtain an implementation that<br>is efficient on realistic datasets?<br> Spurred by the surprising performance of recent implementations for the<br>Fr\'echet distance, we perform algorithm engineering for the Fr\'echet distance<br>under translation. Our solution combines fast, but inexact tools from<br>continuous optimization (specifically, branch-and-bound algorithms for global<br>Lipschitz optimization) with exact, but expensive algorithms from computational<br>geometry (specifically, problem-specific algorithms based on an arrangement<br>construction). We combine these two ingredients to obtain an exact decision<br>algorithm for the Fr\'echet distance under translation. For the related task of<br>computing the distance value up to a desired precision, we engineer and compare<br>different methods. On a benchmark set involving handwritten characters and<br>route trajectories, our implementation answers a typical query for either task<br>in the range of a few milliseconds up to a second on standard desktop hardware.<br> We believe that our implementation will enable the use of the Fr\'echet<br>distance under translation in applications, whereas previous approaches would<br>have been computationally infeasible.<br>
Export
BibTeX
@online{Bringmann_arXiv2008.07510, TITLE = {When {L}ipschitz Walks Your Dog: {A}lgorithm Engineering of the Discrete {F}r\'{e}chet Distance Under Translation}, AUTHOR = {Bringmann, Karl and K{\"u}nnemann, Marvin and Nusser, Andr{\'e}}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2008.07510}, EPRINT = {2008.07510}, EPRINTTYPE = {arXiv}, YEAR = {2020}, ABSTRACT = {Consider the natural question of how to measure the similarity of curves in<br>the plane by a quantity that is invariant under translations of the curves.<br>Such a measure is justified whenever we aim to quantify the similarity of the<br>curves' shapes rather than their positioning in the plane, e.g., to compare the<br>similarity of handwritten characters. Perhaps the most natural such notion is<br>the (discrete) Fr\'echet distance under translation. Unfortunately, the<br>algorithmic literature on this problem yields a very pessimistic view: On<br>polygonal curves with $n$ vertices, the fastest algorithm runs in time<br>$O(n^{4.667})$ and cannot be improved below $n^{4-o(1)}$ unless the Strong<br>Exponential Time Hypothesis fails. Can we still obtain an implementation that<br>is efficient on realistic datasets?<br> Spurred by the surprising performance of recent implementations for the<br>Fr\'echet distance, we perform algorithm engineering for the Fr\'echet distance<br>under translation. Our solution combines fast, but inexact tools from<br>continuous optimization (specifically, branch-and-bound algorithms for global<br>Lipschitz optimization) with exact, but expensive algorithms from computational<br>geometry (specifically, problem-specific algorithms based on an arrangement<br>construction). We combine these two ingredients to obtain an exact decision<br>algorithm for the Fr\'echet distance under translation. For the related task of<br>computing the distance value up to a desired precision, we engineer and compare<br>different methods. On a benchmark set involving handwritten characters and<br>route trajectories, our implementation answers a typical query for either task<br>in the range of a few milliseconds up to a second on standard desktop hardware.<br> We believe that our implementation will enable the use of the Fr\'echet<br>distance under translation in applications, whereas previous approaches would<br>have been computationally infeasible.<br>}, }
Endnote
%0 Report %A Bringmann, Karl %A K&#252;nnemann, Marvin %A Nusser, Andr&#233; %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fr&#233;chet Distance under Translation : %G eng %U http://hdl.handle.net/21.11116/0000-0007-2A56-A %U https://arxiv.org/abs/2008.07510 %D 2020 %X Consider the natural question of how to measure the similarity of curves in<br>the plane by a quantity that is invariant under translations of the curves.<br>Such a measure is justified whenever we aim to quantify the similarity of the<br>curves' shapes rather than their positioning in the plane, e.g., to compare the<br>similarity of handwritten characters. Perhaps the most natural such notion is<br>the (discrete) Fr\'echet distance under translation. Unfortunately, the<br>algorithmic literature on this problem yields a very pessimistic view: On<br>polygonal curves with $n$ vertices, the fastest algorithm runs in time<br>$O(n^{4.667})$ and cannot be improved below $n^{4-o(1)}$ unless the Strong<br>Exponential Time Hypothesis fails. Can we still obtain an implementation that<br>is efficient on realistic datasets?<br> Spurred by the surprising performance of recent implementations for the<br>Fr\'echet distance, we perform algorithm engineering for the Fr\'echet distance<br>under translation. Our solution combines fast, but inexact tools from<br>continuous optimization (specifically, branch-and-bound algorithms for global<br>Lipschitz optimization) with exact, but expensive algorithms from computational<br>geometry (specifically, problem-specific algorithms based on an arrangement<br>construction). We combine these two ingredients to obtain an exact decision<br>algorithm for the Fr\'echet distance under translation. For the related task of<br>computing the distance value up to a desired precision, we engineer and compare<br>different methods. On a benchmark set involving handwritten characters and<br>route trajectories, our implementation answers a typical query for either task<br>in the range of a few milliseconds up to a second on standard desktop hardware.<br> We believe that our implementation will enable the use of the Fr\'echet<br>distance under translation in applications, whereas previous approaches would<br>have been computationally infeasible.<br> %K Computer Science, Computational Geometry, cs.CG,Computer Science, Data Structures and Algorithms, cs.DS
[211]
K. Bringmann and V. Nakos, “Top-k-convolution and the Quest for Near-linear Output-sensitive Subset Sum,” in STOC ’20, 52nd Annual ACM SIGACT Symposium on Theory of Computing, Chicago, IL, USA, 2020.
Export
BibTeX
@inproceedings{Bringmann_STOC2020, TITLE = {Top-$k$-convolution and the Quest for Near-linear Output-sensitive Subset Sum}, AUTHOR = {Bringmann, Karl and Nakos, Vasileios}, LANGUAGE = {eng}, ISBN = {978-1-4503-6979-4}, DOI = {10.1145/3357713.3384308}, PUBLISHER = {ACM}, YEAR = {2020}, BOOKTITLE = {STOC '20, 52nd Annual ACM SIGACT Symposium on Theory of Computing}, EDITOR = {Makarychev, Konstantin and Makarychev, Yury and Tulsiani, Madhur and Kamath, Gautam and Chuzhoy, Julia}, PAGES = {982--995}, ADDRESS = {Chicago, IL, USA}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Nakos, Vasileios %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Top-k-convolution and the Quest for Near-linear Output-sensitive Subset Sum : %G eng %U http://hdl.handle.net/21.11116/0000-0007-299D-B %R 10.1145/3357713.3384308 %D 2020 %B 52nd Annual ACM SIGACT Symposium on Theory of Computing %Z date of event: 2020-06-22 - 2020-06-26 %C Chicago, IL, USA %B STOC '20 %E Makarychev, Konstantin; Makarychev, Yury; Tulsiani, Madhur; Kamath, Gautam; Chuzhoy, Julia %P 982 - 995 %I ACM %@ 978-1-4503-6979-4
[212]
K. Bringmann, N. Fischer, D. Hermelin, D. Shabtay, and P. Wellnitz, “Faster Minimization of Tardy Processing Time on a Single Machine,” in 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Saarbrücken, Germany (Virtual Conference), 2020.
Export
BibTeX
@inproceedings{Bringmann_ICALP2020, TITLE = {Faster Minimization of Tardy Processing Time on a Single Machine}, AUTHOR = {Bringmann, Karl and Fischer, Nick and Hermelin, Danny and Shabtay, Dvir and Wellnitz, Philip}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-138-2}, URL = {urn:nbn:de:0030-drops-124269}, DOI = {10.4230/LIPIcs.ICALP.2020.19}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2020}, BOOKTITLE = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)}, EDITOR = {Czumaj, Artur and Dawa, Anuj and Merelli, Emanuela}, EID = {19}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {168}, ADDRESS = {Saarbr{\"u}cken, Germany (Virtual Conference)}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Fischer, Nick %A Hermelin, Danny %A Shabtay, Dvir %A Wellnitz, Philip %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Faster Minimization of Tardy Processing Time on a Single Machine : %G eng %U http://hdl.handle.net/21.11116/0000-0007-287E-0 %R 10.4230/LIPIcs.ICALP.2020.19 %U urn:nbn:de:0030-drops-124269 %D 2020 %B 47th International Colloquium on Automata, Languages, and Programming %Z date of event: 2020-07-08 - 2020-07-11 %C Saarbr&#252;cken, Germany (Virtual Conference) %B 47th International Colloquium on Automata, Languages, and Programming %E Czumaj, Artur; Dawa, Anuj; Merelli, Emanuela %Z sequence number: 19 %I Schloss Dagstuhl %@ 978-3-95977-138-2 %B Leibniz International Proceedings in Informatics %N 168 %@ false %U https://drops.dagstuhl.de/opus/volltexte/2020/12426/https://creativecommons.org/licenses/by/3.0/legalcode
[213]
K. Bringmann, M. Künnemann, and A. Nusser, “When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance Under Translation,” in 28th Annual European Symposium on Algorithms (ESA 2020), Pisa, Italy (Virtual Conference), 2020.
Export
BibTeX
@inproceedings{Bringmann_ESA2020, TITLE = {When {L}ipschitz Walks Your Dog: {A}lgorithm Engineering of the Discrete {F}r\'{e}chet Distance Under Translation}, AUTHOR = {Bringmann, Karl and K{\"u}nnemann, Marvin and Nusser, Andr{\'e}}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-162-7}, URL = {urn:nbn:de:0030-drops-128912}, DOI = {10.4230/LIPIcs.ESA.2020.25}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2020}, BOOKTITLE = {28th Annual European Symposium on Algorithms (ESA 2020)}, EDITOR = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, EID = {25}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {173}, ADDRESS = {Pisa, Italy (Virtual Conference)}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A K&#252;nnemann, Marvin %A Nusser, Andr&#233; %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fr&#233;chet Distance Under Translation : %G eng %U http://hdl.handle.net/21.11116/0000-0007-2791-9 %R 10.4230/LIPIcs.ESA.2020.25 %U urn:nbn:de:0030-drops-128912 %D 2020 %B 28th Annual European Symposium on Algorithms %Z date of event: 2020-09-07 - 2020-09-09 %C Pisa, Italy (Virtual Conference) %B 28th Annual European Symposium on Algorithms %E Grandoni, Fabrizio; Herman, Grzegorz; Sanders, Peter %Z sequence number: 25 %I Schloss Dagstuhl %@ 978-3-95977-162-7 %B Leibniz International Proceedings in Informatics %N 173 %@ false %U https://drops.dagstuhl.de/opus/volltexte/2020/12891/https://creativecommons.org/licenses/by/3.0/legalcodehttps://gitlab.com/anusser/frechet_distance_under_translation
[214]
K. Bringmann, N. Fischer, D. Hermelin, D. Shabtay, and P. Wellnitz, “Faster Minimization of Tardy Processing Time on a Single Machine,” 2020. [Online]. Available: https://arxiv.org/abs/2003.07104. (arXiv: 2003.07104)
Abstract
This paper is concerned with the $1||\sum p_jU_j$ problem, the problem of<br>minimizing the total processing time of tardy jobs on a single machine. This is<br>not only a fundamental scheduling problem, but also a very important problem<br>from a theoretical point of view as it generalizes the Subset Sum problem and<br>is closely related to the 0/1-Knapsack problem. The problem is well-known to be<br>NP-hard, but only in a weak sense, meaning it admits pseudo-polynomial time<br>algorithms. The fastest known pseudo-polynomial time algorithm for the problem<br>is the famous Lawler and Moore algorithm which runs in $O(P \cdot n)$ time,<br>where $P$ is the total processing time of all $n$ jobs in the input. This<br>algorithm has been developed in the late 60s, and has yet to be improved to<br>date.<br> In this paper we develop two new algorithms for $1||\sum p_jU_j$, each<br>improving on Lawler and Moore's algorithm in a different scenario. Both<br>algorithms rely on basic primitive operations between sets of integers and<br>vectors of integers for the speedup in their running times. The second<br>algorithm relies on fast polynomial multiplication as its main engine, while<br>for the first algorithm we define a new "skewed" version of<br>$(\max,\min)$-convolution which is interesting in its own right.<br>
Export
BibTeX
@online{Bringmann_arXiv2003.07104, TITLE = {Faster Minimization of Tardy Processing Time on a Single Machine}, AUTHOR = {Bringmann, Karl and Fischer, Nick and Hermelin, Danny and Shabtay, Dvir and Wellnitz, Philip}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2003.07104}, EPRINT = {2003.07104}, EPRINTTYPE = {arXiv}, YEAR = {2020}, ABSTRACT = {This paper is concerned with the $1||\sum p_jU_j$ problem, the problem of<br>minimizing the total processing time of tardy jobs on a single machine. This is<br>not only a fundamental scheduling problem, but also a very important problem<br>from a theoretical point of view as it generalizes the Subset Sum problem and<br>is closely related to the 0/1-Knapsack problem. The problem is well-known to be<br>NP-hard, but only in a weak sense, meaning it admits pseudo-polynomial time<br>algorithms. The fastest known pseudo-polynomial time algorithm for the problem<br>is the famous Lawler and Moore algorithm which runs in $O(P \cdot n)$ time,<br>where $P$ is the total processing time of all $n$ jobs in the input. This<br>algorithm has been developed in the late 60s, and has yet to be improved to<br>date.<br> In this paper we develop two new algorithms for $1||\sum p_jU_j$, each<br>improving on Lawler and Moore's algorithm in a different scenario. Both<br>algorithms rely on basic primitive operations between sets of integers and<br>vectors of integers for the speedup in their running times. The second<br>algorithm relies on fast polynomial multiplication as its main engine, while<br>for the first algorithm we define a new "skewed" version of<br>$(\max,\min)$-convolution which is interesting in its own right.<br>}, }
Endnote
%0 Report %A Bringmann, Karl %A Fischer, Nick %A Hermelin, Danny %A Shabtay, Dvir %A Wellnitz, Philip %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Faster Minimization of Tardy Processing Time on a Single Machine : %G eng %U http://hdl.handle.net/21.11116/0000-0007-2A4E-4 %U https://arxiv.org/abs/2003.07104 %D 2020 %X This paper is concerned with the $1||\sum p_jU_j$ problem, the problem of<br>minimizing the total processing time of tardy jobs on a single machine. This is<br>not only a fundamental scheduling problem, but also a very important problem<br>from a theoretical point of view as it generalizes the Subset Sum problem and<br>is closely related to the 0/1-Knapsack problem. The problem is well-known to be<br>NP-hard, but only in a weak sense, meaning it admits pseudo-polynomial time<br>algorithms. The fastest known pseudo-polynomial time algorithm for the problem<br>is the famous Lawler and Moore algorithm which runs in $O(P \cdot n)$ time,<br>where $P$ is the total processing time of all $n$ jobs in the input. This<br>algorithm has been developed in the late 60s, and has yet to be improved to<br>date.<br> In this paper we develop two new algorithms for $1||\sum p_jU_j$, each<br>improving on Lawler and Moore's algorithm in a different scenario. Both<br>algorithms rely on basic primitive operations between sets of integers and<br>vectors of integers for the speedup in their running times. The second<br>algorithm relies on fast polynomial multiplication as its main engine, while<br>for the first algorithm we define a new "skewed" version of<br>$(\max,\min)$-convolution which is interesting in its own right.<br> %K Computer Science, Data Structures and Algorithms, cs.DS
[215]
K. Bringmann, P. Gawrychowski, S. Mozes, and O. Weimann, “Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can),” ACM Transactions on Algorithms, vol. 16, no. 4, 2020.
Export
BibTeX
@article{Bringmann_ToA2020, TITLE = {Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless {APSP} can)}, AUTHOR = {Bringmann, Karl and Gawrychowski, Pawe{\l} and Mozes, Shay and Weimann, Oren}, LANGUAGE = {eng}, ISSN = {1549-6325}, DOI = {10.1145/3381878}, PUBLISHER = {ACM}, ADDRESS = {New York, NY}, YEAR = {2020}, JOURNAL = {ACM Transactions on Algorithms}, VOLUME = {16}, NUMBER = {4}, EID = {48}, }
Endnote
%0 Journal Article %A Bringmann, Karl %A Gawrychowski, Pawe&#322; %A Mozes, Shay %A Weimann, Oren %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can) : %G eng %U http://hdl.handle.net/21.11116/0000-0007-2502-D %R 10.1145/3381878 %7 2020 %D 2020 %J ACM Transactions on Algorithms %V 16 %N 4 %Z sequence number: 48 %I ACM %C New York, NY %@ false
[216]
K. Bringmann, T. Husfeldt, and M. Magnusson, “Multivariate Analysis of Orthogonal Range Searching and Graph Distances Parameterized by Treewidth,” Algorithmica, vol. 82, no. 8, 2020.
Export
BibTeX
@article{Bringmann_2020a, TITLE = {Multivariate Analysis of Orthogonal Range Searching and Graph Distances Parameterized by Treewidth}, AUTHOR = {Bringmann, Karl and Husfeldt, Thore and Magnusson, M{\aa}ns}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-020-00680-z}, PUBLISHER = {Springer}, ADDRESS = {New York}, YEAR = {2020}, DATE = {2020}, JOURNAL = {Algorithmica}, VOLUME = {82}, NUMBER = {8}, PAGES = {2292--2315}, }
Endnote
%0 Journal Article %A Bringmann, Karl %A Husfeldt, Thore %A Magnusson, M&#229;ns %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Multivariate Analysis of Orthogonal Range Searching and Graph Distances Parameterized by Treewidth : %G eng %U http://hdl.handle.net/21.11116/0000-0006-F289-E %R 10.1007/s00453-020-00680-z %7 2020 %D 2020 %J Algorithmica %V 82 %N 8 %& 2292 %P 2292 - 2315 %I Springer %C New York %@ false
[217]
K. Bringmann and P. Wellnitz, “On Near-Linear-Time Algorithms for Dense Subset Sum,” 2020. [Online]. Available: https://arxiv.org/abs/2010.09096. (arXiv: 2010.09096)
Abstract
In the Subset Sum problem we are given a set of $n$ positive integers $X$ and<br>a target $t$ and are asked whether some subset of $X$ sums to $t$. Natural<br>parameters for this problem that have been studied in the literature are $n$<br>and $t$ as well as the maximum input number $\rm{mx}_X$ and the sum of all<br>input numbers $\Sigma_X$. In this paper we study the dense case of Subset Sum,<br>where all these parameters are polynomial in $n$. In this regime, standard<br>pseudo-polynomial algorithms solve Subset Sum in polynomial time $n^{O(1)}$.<br> Our main question is: When can dense Subset Sum be solved in near-linear time<br>$\tilde{O}(n)$? We provide an essentially complete dichotomy by designing<br>improved algorithms and proving conditional lower bounds, thereby determining<br>essentially all settings of the parameters $n,t,\rm{mx}_X,\Sigma_X$ for which<br>dense Subset Sum is in time $\tilde{O}(n)$. For notational convenience we<br>assume without loss of generality that $t \ge \rm{mx}_X$ (as larger numbers can<br>be ignored) and $t \le \Sigma_X/2$ (using symmetry). Then our dichotomy reads<br>as follows:<br> - By reviving and improving an additive-combinatorics-based approach by Galil<br>and Margalit [SICOMP'91], we show that Subset Sum is in near-linear time<br>$\tilde{O}(n)$ if $t \gg \rm{mx}_X \Sigma_X/n^2$.<br> - We prove a matching conditional lower bound: If Subset Sum is in<br>near-linear time for any setting with $t \ll \rm{mx}_X \Sigma_X/n^2$, then the<br>Strong Exponential Time Hypothesis and the Strong k-Sum Hypothesis fail.<br> We also generalize our algorithm from sets to multi-sets, albeit with<br>non-matching upper and lower bounds.<br>
Export
BibTeX
@online{Bringmann_arXiv2010.09096, TITLE = {On Near-Linear-Time Algorithms for Dense Subset Sum}, AUTHOR = {Bringmann, Karl and Wellnitz, Philip}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2010.09096}, EPRINT = {2010.09096}, EPRINTTYPE = {arXiv}, YEAR = {2020}, ABSTRACT = {In the Subset Sum problem we are given a set of $n$ positive integers $X$ and<br>a target $t$ and are asked whether some subset of $X$ sums to $t$. Natural<br>parameters for this problem that have been studied in the literature are $n$<br>and $t$ as well as the maximum input number $\rm{mx}_X$ and the sum of all<br>input numbers $\Sigma_X$. In this paper we study the dense case of Subset Sum,<br>where all these parameters are polynomial in $n$. In this regime, standard<br>pseudo-polynomial algorithms solve Subset Sum in polynomial time $n^{O(1)}$.<br> Our main question is: When can dense Subset Sum be solved in near-linear time<br>$\tilde{O}(n)$? We provide an essentially complete dichotomy by designing<br>improved algorithms and proving conditional lower bounds, thereby determining<br>essentially all settings of the parameters $n,t,\rm{mx}_X,\Sigma_X$ for which<br>dense Subset Sum is in time $\tilde{O}(n)$. For notational convenience we<br>assume without loss of generality that $t \ge \rm{mx}_X$ (as larger numbers can<br>be ignored) and $t \le \Sigma_X/2$ (using symmetry). Then our dichotomy reads<br>as follows:<br> -- By reviving and improving an additive-combinatorics-based approach by Galil<br>and Margalit [SICOMP'91], we show that Subset Sum is in near-linear time<br>$\tilde{O}(n)$ if $t \gg \rm{mx}_X \Sigma_X/n^2$.<br> -- We prove a matching conditional lower bound: If Subset Sum is in<br>near-linear time for any setting with $t \ll \rm{mx}_X \Sigma_X/n^2$, then the<br>Strong Exponential Time Hypothesis and the Strong k-Sum Hypothesis fail.<br> We also generalize our algorithm from sets to multi-sets, albeit with<br>non-matching upper and lower bounds.<br>}, }
Endnote
%0 Report %A Bringmann, Karl %A Wellnitz, Philip %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T On Near-Linear-Time Algorithms for Dense Subset Sum : %G eng %U http://hdl.handle.net/21.11116/0000-0007-8C97-1 %U https://arxiv.org/abs/2010.09096 %D 2020 %X In the Subset Sum problem we are given a set of $n$ positive integers $X$ and<br>a target $t$ and are asked whether some subset of $X$ sums to $t$. Natural<br>parameters for this problem that have been studied in the literature are $n$<br>and $t$ as well as the maximum input number $\rm{mx}_X$ and the sum of all<br>input numbers $\Sigma_X$. In this paper we study the dense case of Subset Sum,<br>where all these parameters are polynomial in $n$. In this regime, standard<br>pseudo-polynomial algorithms solve Subset Sum in polynomial time $n^{O(1)}$.<br> Our main question is: When can dense Subset Sum be solved in near-linear time<br>$\tilde{O}(n)$? We provide an essentially complete dichotomy by designing<br>improved algorithms and proving conditional lower bounds, thereby determining<br>essentially all settings of the parameters $n,t,\rm{mx}_X,\Sigma_X$ for which<br>dense Subset Sum is in time $\tilde{O}(n)$. For notational convenience we<br>assume without loss of generality that $t \ge \rm{mx}_X$ (as larger numbers can<br>be ignored) and $t \le \Sigma_X/2$ (using symmetry). Then our dichotomy reads<br>as follows:<br> - By reviving and improving an additive-combinatorics-based approach by Galil<br>and Margalit [SICOMP'91], we show that Subset Sum is in near-linear time<br>$\tilde{O}(n)$ if $t \gg \rm{mx}_X \Sigma_X/n^2$.<br> - We prove a matching conditional lower bound: If Subset Sum is in<br>near-linear time for any setting with $t \ll \rm{mx}_X \Sigma_X/n^2$, then the<br>Strong Exponential Time Hypothesis and the Strong k-Sum Hypothesis fail.<br> We also generalize our algorithm from sets to multi-sets, albeit with<br>non-matching upper and lower bounds.<br> %K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Discrete Mathematics, cs.DM
[218]
J. Bund, M. Fugger, C. Lenzen, and M. Medina, “Synchronizer-Free Digital Link Controller,” IEEE Transactions on Circuits and Systems / I, Regular Papers, vol. 27, no. 10, 2020.
Export
BibTeX
@article{Bund2020, TITLE = {Synchronizer-Free Digital Link Controller}, AUTHOR = {Bund, Johannes and Fugger, Matthias and Lenzen, Christoph and Medina, Moti}, LANGUAGE = {eng}, ISSN = {1057-7122}, DOI = {10.1109/TCSI.2020.2989552}, PUBLISHER = {Institute of Electrical and Electronics Engineers}, ADDRESS = {Piscataway, NJ}, YEAR = {2020}, DATE = {2020}, JOURNAL = {IEEE Transactions on Circuits and Systems / I, Regular Papers}, VOLUME = {27}, NUMBER = {10}, PAGES = {3562--3573}, }
Endnote
%0 Journal Article %A Bund, Johannes %A Fugger, Matthias %A Lenzen, Christoph %A Medina, Moti %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Synchronizer-Free Digital Link Controller : %G eng %U http://hdl.handle.net/21.11116/0000-0007-35FE-0 %R 10.1109/TCSI.2020.2989552 %7 2020 %D 2020 %J IEEE Transactions on Circuits and Systems / I, Regular Papers %V 27 %N 10 %& 3562 %P 3562 - 3573 %I Institute of Electrical and Electronics Engineers %C Piscataway, NJ %@ false
[219]
J. Bund, M. Függer, C. Lenzen, M. Medina, and W. Rosenbaum, “PALS: Plesiochronous and Locally Synchronous Systems,” 2020. [Online]. Available: https://arxiv.org/abs/2003.05542. (arXiv: 2003.05542)
Abstract
Consider an arbitrary network of communicating modules on a chip, each<br>requiring a local signal telling it when to execute a computational step. There<br>are three common solutions to generating such a local clock signal: (i) by<br>deriving it from a single, central clock source, (ii) by local, free-running<br>oscillators, or (iii) by handshaking between neighboring modules. Conceptually,<br>each of these solutions is the result of a perceived dichotomy in which<br>(sub)systems are either clocked or fully asynchronous, suggesting that the<br>designer's choice is limited to deciding where to draw the line between<br>synchronous and asynchronous design. In contrast, we take the view that the<br>better question to ask is how synchronous the system can and should be. Based<br>on a distributed clock synchronization algorithm, we present a novel design<br>providing modules with local clocks whose frequency bounds are almost as good<br>as those of corresponding free-running oscillators, yet neighboring modules are<br>guaranteed to have a phase offset substantially smaller than one clock cycle.<br>Concretely, parameters obtained from a 15nm ASIC implementation running at 2GHz<br>yield mathematical worst-case bounds of 30ps on phase offset for a 32x32 node<br>grid network.<br>
Export
BibTeX
@online{Bund_arXiv2003.05542, TITLE = {{PALS}: Plesiochronous and Locally Synchronous Systems}, AUTHOR = {Bund, Johannes and F{\"u}gger, Matthias and Lenzen, Christoph and Medina, Moti and Rosenbaum, Will}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2003.05542}, EPRINT = {2003.05542}, EPRINTTYPE = {arXiv}, YEAR = {2020}, ABSTRACT = {Consider an arbitrary network of communicating modules on a chip, each<br>requiring a local signal telling it when to execute a computational step. There<br>are three common solutions to generating such a local clock signal: (i) by<br>deriving it from a single, central clock source, (ii) by local, free-running<br>oscillators, or (iii) by handshaking between neighboring modules. Conceptually,<br>each of these solutions is the result of a perceived dichotomy in which<br>(sub)systems are either clocked or fully asynchronous, suggesting that the<br>designer's choice is limited to deciding where to draw the line between<br>synchronous and asynchronous design. In contrast, we take the view that the<br>better question to ask is how synchronous the system can and should be. Based<br>on a distributed clock synchronization algorithm, we present a novel design<br>providing modules with local clocks whose frequency bounds are almost as good<br>as those of corresponding free-running oscillators, yet neighboring modules are<br>guaranteed to have a phase offset substantially smaller than one clock cycle.<br>Concretely, parameters obtained from a 15nm ASIC implementation running at 2GHz<br>yield mathematical worst-case bounds of 30ps on phase offset for a 32x32 node<br>grid network.<br>}, }
Endnote
%0 Report %A Bund, Johannes %A F&#252;gger, Matthias %A Lenzen, Christoph %A Medina, Moti %A Rosenbaum, Will %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T PALS: Plesiochronous and Locally Synchronous Systems : %G eng %U http://hdl.handle.net/21.11116/0000-0007-475C-3 %U https://arxiv.org/abs/2003.05542 %D 2020 %X Consider an arbitrary network of communicating modules on a chip, each<br>requiring a local signal telling it when to execute a computational step. There<br>are three common solutions to generating such a local clock signal: (i) by<br>deriving it from a single, central clock source, (ii) by local, free-running<br>oscillators, or (iii) by handshaking between neighboring modules. Conceptually,<br>each of these solutions is the result of a perceived dichotomy in which<br>(sub)systems are either clocked or fully asynchronous, suggesting that the<br>designer's choice is limited to deciding where to draw the line between<br>synchronous and asynchronous design. In contrast, we take the view that the<br>better question to ask is how synchronous the system can and should be. Based<br>on a distributed clock synchronization algorithm, we present a novel design<br>providing modules with local clocks whose frequency bounds are almost as good<br>as those of corresponding free-running oscillators, yet neighboring modules are<br>guaranteed to have a phase offset substantially smaller than one clock cycle.<br>Concretely, parameters obtained from a 15nm ASIC implementation running at 2GHz<br>yield mathematical worst-case bounds of 30ps on phase offset for a 32x32 node<br>grid network.<br> %K Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC
[220]
J. Bund, M. Függer, C. Lenzen, M. Medina, and W. Rosenbaum, “PALS: Plesiochronous and Locally Synchronous Systems,” in 26th IEEE International Symposium on Asynchronous Circuits and Systems, Salt Lake City, UT, USA, 2020.
Export
BibTeX
@inproceedings{Bund_ASYNC2020, TITLE = {{PALS}: {P}lesiochronous and Locally Synchronous Systems}, AUTHOR = {Bund, Johannes and F{\"u}gger, Matthias and Lenzen, Christoph and Medina, Moti and Rosenbaum, Will}, LANGUAGE = {eng}, ISBN = {978-1-7281-5495-4}, DOI = {10.1109/ASYNC49171.2020.00013}, PUBLISHER = {IEEE}, YEAR = {2020}, BOOKTITLE = {26th IEEE International Symposium on Asynchronous Circuits and Systems}, PAGES = {36--43}, ADDRESS = {Salt Lake City, UT, USA}, }
Endnote
%0 Conference Proceedings %A Bund, Johannes %A F&#252;gger, Matthias %A Lenzen, Christoph %A Medina, Moti %A Rosenbaum, Will %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organ