Publications

2019
[1]
A. Abboud, K. Bringmann, D. Hermelin, and D. Shabtay, “SETH-Based Lower Bounds for Subset Sum and Bicriteria Path,” in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), San Diego, CA, USA, 2019.
Export
BibTeX
@inproceedings{Abboud_SODA19b, 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}, ISBN = {978-1-61197-548-2}, DOI = {10.1137/1.9781611975482.3}, PUBLISHER = {SIAM}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, BOOKTITLE = {Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019)}, EDITOR = {Chan, Timothy M.}, PAGES = {41--57}, ADDRESS = {San Diego, CA, USA}, }
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 SETH-Based Lower Bounds for Subset Sum and Bicriteria Path : %G eng %U http://hdl.handle.net/21.11116/0000-0002-9E12-8 %R 10.1137/1.9781611975482.3 %D 2019 %B 30th Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2019-01-06 - 2019-01-09 %C San Diego, CA, USA %B Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms %E Chan, Timothy M. %P 41 - 57 %I SIAM %@ 978-1-61197-548-2
[2]
P. Afshani, M. Agrawal, B. Doerr, C. Doerr, K. G. Larsen, and K. Mehlhorn, “The Query Complexity of a Permutation-based Variant of Mastermind,” Discrete Applied Mathematics, vol. 260, 2019.
Export
BibTeX
@article{AFSHANI2019, TITLE = {The query complexity of a permutation-based variant of {M}astermind}, AUTHOR = {Afshani, Peyman and Agrawal, Manindra and Doerr, Benjamin and Doerr, Carola and Larsen, Kasper Green and Mehlhorn, Kurt}, LANGUAGE = {eng}, ISSN = {0166-218X}, DOI = {10.1016/j.dam.2019.01.007}, PUBLISHER = {North-Holland}, ADDRESS = {Amsterdam}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, JOURNAL = {Discrete Applied Mathematics}, VOLUME = {260}, PAGES = {28--50}, }
Endnote
%0 Journal Article %A Afshani, Peyman %A Agrawal, Manindra %A Doerr, Benjamin %A Doerr, Carola %A Larsen, Kasper Green %A Mehlhorn, Kurt %+ External Organizations External Organizations External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T The Query Complexity of a Permutation-based Variant of Mastermind : %G eng %U http://hdl.handle.net/21.11116/0000-0002-FE83-C %R 10.1016/j.dam.2019.01.007 %7 2019 %D 2019 %J Discrete Applied Mathematics %V 260 %& 28 %P 28 - 50 %I North-Holland %C Amsterdam %@ false
[3]
H.-K. Ahn, T. Ahn, S. W. Bae, J. Choi, M. Kim, E. Oh, C.-S. Shin, and S. D. Yoon, “Minimum-width Annulus with Outliers: Circular, Square, and Rectangular Cases,” Information Processing Letters, vol. 145, 2019.
Export
BibTeX
@article{Ahn2019, TITLE = {Minimum-width Annulus with Outliers: {C}ircular, Square, and Rectangular Cases}, AUTHOR = {Ahn, Hee-Kap and Ahn, Taehoon and Bae, Sang Won and Choi, Jongmin and Kim, Mincheol and Oh, Eunjin and Shin, Chan-Su and Yoon, Sang Duk}, LANGUAGE = {eng}, ISSN = {0020-0190}, DOI = {10.1016/j.ipl.2019.01.004}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, JOURNAL = {Information Processing Letters}, VOLUME = {145}, PAGES = {16--23}, }
Endnote
%0 Journal Article %A Ahn, Hee-Kap %A Ahn, Taehoon %A Bae, Sang Won %A Choi, Jongmin %A Kim, Mincheol %A Oh, Eunjin %A Shin, Chan-Su %A Yoon, Sang Duk %+ External Organizations External Organizations External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Minimum-width Annulus with Outliers: Circular, Square, and Rectangular Cases : %G eng %U http://hdl.handle.net/21.11116/0000-0003-4FD4-6 %R 10.1016/j.ipl.2019.01.004 %7 2019 %D 2019 %J Information Processing Letters %V 145 %& 16 %P 16 - 23 %I Elsevier %C Amsterdam %@ false
[4]
H. Akrami, K. Mehlhorn, and T. Odland, “Ratio-Balanced Maximum Flows,” 2019. [Online]. Available: http://arxiv.org/abs/1902.11047. (arXiv: 1902.11047)
Abstract
When a loan is approved for a person or company, the bank is subject to \emph{credit risk}; the risk that the lender defaults. To mitigate this risk, a bank will require some form of \emph{security}, which will be collected if the lender defaults. Accounts can be secured by several securities and a security can be used for several accounts. The goal is to fractionally assign the securities to the accounts so as to balance the risk. This situation can be modelled by a bipartite graph. We have a set $S$ of securities and a set $A$ of accounts. Each security has a \emph{value} $v_i$ and each account has an \emph{exposure} $e_j$. If a security $i$ can be used to secure an account $j$, we have an edge from $i$ to $j$. Let $f_{ij}$ be part of security $i$'s value used to secure account $j$. We are searching for a maximum flow that send at most $v_i$ units out of node $i \in S$ and at most $e_j$ units into node $j \in A$. Then $s_j = e_j - \sum_i f_{ij}$ is the unsecured part of account $j$. We are searching for the maximum flow that minimizes $\sum_j s_j^2/e_j$.
Export
BibTeX
@online{Akrami_arXiv1902.11047, TITLE = {Ratio-Balanced Maximum Flows}, AUTHOR = {Akrami, Hannaneh and Mehlhorn, Kurt and Odland, Tommy}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1902.11047}, EPRINT = {1902.11047}, EPRINTTYPE = {arXiv}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, ABSTRACT = {When a loan is approved for a person or company, the bank is subject to \emph{credit risk}; the risk that the lender defaults. To mitigate this risk, a bank will require some form of \emph{security}, which will be collected if the lender defaults. Accounts can be secured by several securities and a security can be used for several accounts. The goal is to fractionally assign the securities to the accounts so as to balance the risk. This situation can be modelled by a bipartite graph. We have a set $S$ of securities and a set $A$ of accounts. Each security has a \emph{value} $v_i$ and each account has an \emph{exposure} $e_j$. If a security $i$ can be used to secure an account $j$, we have an edge from $i$ to $j$. Let $f_{ij}$ be part of security $i$'s value used to secure account $j$. We are searching for a maximum flow that send at most $v_i$ units out of node $i \in S$ and at most $e_j$ units into node $j \in A$. Then $s_j = e_j -- \sum_i f_{ij}$ is the unsecured part of account $j$. We are searching for the maximum flow that minimizes $\sum_j s_j^2/e_j$.}, }
Endnote
%0 Report %A Akrami, Hannaneh %A Mehlhorn, Kurt %A Odland, Tommy %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Ratio-Balanced Maximum Flows : %G eng %U http://hdl.handle.net/21.11116/0000-0003-B2FE-6 %U http://arxiv.org/abs/1902.11047 %D 2019 %X When a loan is approved for a person or company, the bank is subject to \emph{credit risk}; the risk that the lender defaults. To mitigate this risk, a bank will require some form of \emph{security}, which will be collected if the lender defaults. Accounts can be secured by several securities and a security can be used for several accounts. The goal is to fractionally assign the securities to the accounts so as to balance the risk. This situation can be modelled by a bipartite graph. We have a set $S$ of securities and a set $A$ of accounts. Each security has a \emph{value} $v_i$ and each account has an \emph{exposure} $e_j$. If a security $i$ can be used to secure an account $j$, we have an edge from $i$ to $j$. Let $f_{ij}$ be part of security $i$'s value used to secure account $j$. We are searching for a maximum flow that send at most $v_i$ units out of node $i \in S$ and at most $e_j$ units into node $j \in A$. Then $s_j = e_j - \sum_i f_{ij}$ is the unsecured part of account $j$. We are searching for the maximum flow that minimizes $\sum_j s_j^2/e_j$. %K Computer Science, Data Structures and Algorithms, cs.DS
[5]
A. Antoniadis, K. Fleszar, R. Hoeksma, and K. Schewior, “A PTAS for Euclidean TSP with Hyperplane Neighborhoods,” in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), San Diego, CA, USA, 2019.
Export
BibTeX
@inproceedings{Antoniadis_SODA19, TITLE = {A {PTAS} for {E}uclidean {TSP} with Hyperplane Neighborhoods}, AUTHOR = {Antoniadis, Antonios and Fleszar, Krzysztof and Hoeksma, Ruben and Schewior, Kevin}, LANGUAGE = {eng}, ISBN = {978-1-61197-548-2}, DOI = {10.1137/1.9781611975482.67}, PUBLISHER = {SIAM}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, BOOKTITLE = {Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019)}, EDITOR = {Chan, Timothy M.}, PAGES = {1089--1105}, ADDRESS = {San Diego, CA, USA}, }
Endnote
%0 Conference Proceedings %A Antoniadis, Antonios %A Fleszar, Krzysztof %A Hoeksma, Ruben %A Schewior, Kevin %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T A PTAS for Euclidean TSP with Hyperplane Neighborhoods : %G eng %U http://hdl.handle.net/21.11116/0000-0002-9F3A-B %R 10.1137/1.9781611975482.67 %D 2019 %B 30th Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2019-01-06 - 2019-01-09 %C San Diego, CA, USA %B Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms %E Chan, Timothy M. %P 1089 - 1105 %I SIAM %@ 978-1-61197-548-2
[6]
A. Antoniadis, N. Barcelo, M. Nugent, K. Pruhs, and M. Scquizzato, “A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line,” Algorithmica, vol. 81, no. 7, 2019.
Export
BibTeX
@article{Antoniadis2019, TITLE = {A $o(n)$-Competitive Deterministic Algorithm for Online Matching on a Line}, AUTHOR = {Antoniadis, Antonios and Barcelo, Neal and Nugent, Michael and Pruhs, Kirk and Scquizzato, Michele}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-019-00565-w}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, JOURNAL = {Algorithmica}, VOLUME = {81}, NUMBER = {7}, PAGES = {2917--2933}, }
Endnote
%0 Journal Article %A Antoniadis, Antonios %A Barcelo, Neal %A Nugent, Michael %A Pruhs, Kirk %A Scquizzato, Michele %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations %T A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line : %G eng %U http://hdl.handle.net/21.11116/0000-0003-A7DA-B %R 10.1007/s00453-019-00565-w %7 2019 %D 2019 %J Algorithmica %V 81 %N 7 %& 2917 %P 2917 - 2933 %I Springer %C New York, NY %@ false
[7]
G. Ballard, C. Ikenmeyer, J. M. Landsberg, and N. Ryder, “The Geometry of Rank Decompositions of Matrix Multiplication II: 3 x 3 Matrices,” Journal of Pure and Applied Algebra, vol. 223, no. 8, 2019.
Export
BibTeX
@article{Ballard2018, TITLE = {The geometry of rank decompositions of matrix multiplication II: $3\times 3$ matrices}, AUTHOR = {Ballard, Grey and Ikenmeyer, Christian and Landsberg, J. M. and Ryder, Nick}, LANGUAGE = {eng}, ISSN = {0022-4049}, DOI = {10.1016/j.jpaa.2018.10.014}, PUBLISHER = {North-Holland}, ADDRESS = {Amsterdam}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, JOURNAL = {Journal of Pure and Applied Algebra}, VOLUME = {223}, NUMBER = {8}, PAGES = {3205--3224}, }
Endnote
%0 Journal Article %A Ballard, Grey %A Ikenmeyer, Christian %A Landsberg, J. M. %A Ryder, Nick %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T The Geometry of Rank Decompositions of Matrix Multiplication II: 3 x 3 Matrices : %G eng %U http://hdl.handle.net/21.11116/0000-0002-AB17-4 %R 10.1016/j.jpaa.2018.10.014 %7 2018 %D 2019 %J Journal of Pure and Applied Algebra %O J. Pure Appl. Algebra %V 223 %N 8 %& 3205 %P 3205 - 3224 %I North-Holland %C Amsterdam %@ false
[8]
A. Balliu, J. Hirvonen, C. Lenzen, D. Olivetti, and J. Suomela, “Locality of Not-So-Weak Coloring,” 2019. [Online]. Available: http://arxiv.org/abs/1904.05627. (arXiv: 1904.05627)
Abstract
Many graph problems are locally checkable: a solution is globally feasible if it looks valid in all constant-radius neighborhoods. This idea is formalized in the concept of locally checkable labelings (LCLs), introduced by Naor and Stockmeyer (1995). Recently, Chang et al. (2016) showed that in bounded-degree graphs, every LCL problem belongs to one of the following classes: - "Easy": solvable in $O(\log^* n)$ rounds with both deterministic and randomized distributed algorithms. - "Hard": requires at least $\Omega(\log n)$ rounds with deterministic and $\Omega(\log \log n)$ rounds with randomized distributed algorithms. Hence for any parameterized LCL problem, when we move from local problems towards global problems, there is some point at which complexity suddenly jumps from easy to hard. For example, for vertex coloring in $d$-regular graphs it is now known that this jump is at precisely $d$ colors: coloring with $d+1$ colors is easy, while coloring with $d$ colors is hard. However, it is currently poorly understood where this jump takes place when one looks at defective colorings. To study this question, we define $k$-partial $c$-coloring as follows: nodes are labeled with numbers between $1$ and $c$, and every node is incident to at least $k$ properly colored edges. It is known that $1$-partial $2$-coloring (a.k.a. weak $2$-coloring) is easy for any $d \ge 1$. As our main result, we show that $k$-partial $2$-coloring becomes hard as soon as $k \ge 2$, no matter how large a $d$ we have. We also show that this is fundamentally different from $k$-partial $3$-coloring: no matter which $k \ge 3$ we choose, the problem is always hard for $d = k$ but it becomes easy when $d \gg k$. The same was known previously for partial $c$-coloring with $c \ge 4$, but the case of $c < 4$ was open.
Export
BibTeX
@online{Balliu_arXiv1904.05627, TITLE = {Locality of Not-So-Weak Coloring}, AUTHOR = {Balliu, Alkida and Hirvonen, Juho and Lenzen, Christoph and Olivetti, Dennis and Suomela, Jukka}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1904.05627}, EPRINT = {1904.05627}, EPRINTTYPE = {arXiv}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Many graph problems are locally checkable: a solution is globally feasible if it looks valid in all constant-radius neighborhoods. This idea is formalized in the concept of locally checkable labelings (LCLs), introduced by Naor and Stockmeyer (1995). Recently, Chang et al. (2016) showed that in bounded-degree graphs, every LCL problem belongs to one of the following classes: -- "Easy": solvable in $O(\log^* n)$ rounds with both deterministic and randomized distributed algorithms. -- "Hard": requires at least $\Omega(\log n)$ rounds with deterministic and $\Omega(\log \log n)$ rounds with randomized distributed algorithms. Hence for any parameterized LCL problem, when we move from local problems towards global problems, there is some point at which complexity suddenly jumps from easy to hard. For example, for vertex coloring in $d$-regular graphs it is now known that this jump is at precisely $d$ colors: coloring with $d+1$ colors is easy, while coloring with $d$ colors is hard. However, it is currently poorly understood where this jump takes place when one looks at defective colorings. To study this question, we define $k$-partial $c$-coloring as follows: nodes are labeled with numbers between $1$ and $c$, and every node is incident to at least $k$ properly colored edges. It is known that $1$-partial $2$-coloring (a.k.a. weak $2$-coloring) is easy for any $d \ge 1$. As our main result, we show that $k$-partial $2$-coloring becomes hard as soon as $k \ge 2$, no matter how large a $d$ we have. We also show that this is fundamentally different from $k$-partial $3$-coloring: no matter which $k \ge 3$ we choose, the problem is always hard for $d = k$ but it becomes easy when $d \gg k$. The same was known previously for partial $c$-coloring with $c \ge 4$, but the case of $c < 4$ was open.}, }
Endnote
%0 Report %A Balliu, Alkida %A Hirvonen, Juho %A Lenzen, Christoph %A Olivetti, Dennis %A Suomela, Jukka %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Locality of Not-So-Weak Coloring : %G eng %U http://hdl.handle.net/21.11116/0000-0003-B39F-0 %U http://arxiv.org/abs/1904.05627 %D 2019 %X Many graph problems are locally checkable: a solution is globally feasible if it looks valid in all constant-radius neighborhoods. This idea is formalized in the concept of locally checkable labelings (LCLs), introduced by Naor and Stockmeyer (1995). Recently, Chang et al. (2016) showed that in bounded-degree graphs, every LCL problem belongs to one of the following classes: - "Easy": solvable in $O(\log^* n)$ rounds with both deterministic and randomized distributed algorithms. - "Hard": requires at least $\Omega(\log n)$ rounds with deterministic and $\Omega(\log \log n)$ rounds with randomized distributed algorithms. Hence for any parameterized LCL problem, when we move from local problems towards global problems, there is some point at which complexity suddenly jumps from easy to hard. For example, for vertex coloring in $d$-regular graphs it is now known that this jump is at precisely $d$ colors: coloring with $d+1$ colors is easy, while coloring with $d$ colors is hard. However, it is currently poorly understood where this jump takes place when one looks at defective colorings. To study this question, we define $k$-partial $c$-coloring as follows: nodes are labeled with numbers between $1$ and $c$, and every node is incident to at least $k$ properly colored edges. It is known that $1$-partial $2$-coloring (a.k.a. weak $2$-coloring) is easy for any $d \ge 1$. As our main result, we show that $k$-partial $2$-coloring becomes hard as soon as $k \ge 2$, no matter how large a $d$ we have. We also show that this is fundamentally different from $k$-partial $3$-coloring: no matter which $k \ge 3$ we choose, the problem is always hard for $d = k$ but it becomes easy when $d \gg k$. The same was known previously for partial $c$-coloring with $c \ge 4$, but the case of $c < 4$ was open. %K Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC,Computer Science, Computational Complexity, cs.CC
[9]
F. Ban, V. Bhattiprolu, K. Bringmann, P. Kolev, E. Lee, and D. Woodruff, “A PTAS for l_p-Low Rank Approximation,” in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), San Diego, CA, USA, 2019.
Export
BibTeX
@inproceedings{Ban_SODA19a, TITLE = {A {PTAS} for $\ell_p$-Low Rank Approximation}, AUTHOR = {Ban, Frank and Bhattiprolu, Vijay and Bringmann, Karl and Kolev, Pavel and Lee, Euiwoong and Woodruff, David}, LANGUAGE = {eng}, ISBN = {978-1-61197-548-2}, DOI = {10.1137/1.9781611975482.47}, PUBLISHER = {SIAM}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, BOOKTITLE = {Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019)}, EDITOR = {Chan, Timothy M.}, PAGES = {747--766}, ADDRESS = {San Diego, CA, USA}, }
Endnote
%0 Conference Proceedings %A Ban, Frank %A Bhattiprolu, Vijay %A Bringmann, Karl %A Kolev, Pavel %A Lee, Euiwoong %A Woodruff, David %+ 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 A PTAS for l_p-Low Rank Approximation : %G eng %U http://hdl.handle.net/21.11116/0000-0002-9E0E-E %R 10.1137/1.9781611975482.47 %D 2019 %B 30th Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2019-01-06 - 2019-01-09 %C San Diego, CA, USA %B Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms %E Chan, Timothy M. %P 747 - 766 %I SIAM %@ 978-1-61197-548-2
[10]
L. Becchetti, A. Clementi, E. Natale, F. Pasquale, and G. Posta, “Self-Stabilizing Repeated Balls-into-Bins,” Distributed Computing, vol. 32, no. 1, 2019.
Export
BibTeX
@article{Becchetti2019, TITLE = {Self-Stabilizing Repeated Balls-into-Bins}, AUTHOR = {Becchetti, Luca and Clementi, Andrea and Natale, Emanuele and Pasquale, Francesco and Posta, Gustavo}, LANGUAGE = {eng}, ISSN = {0178-2770}, DOI = {10.1007/s00446-017-0320-4}, PUBLISHER = {Springer International}, ADDRESS = {Berlin}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, JOURNAL = {Distributed Computing}, VOLUME = {32}, NUMBER = {1}, PAGES = {59--68}, }
Endnote
%0 Journal Article %A Becchetti, Luca %A Clementi, Andrea %A Natale, Emanuele %A Pasquale, Francesco %A Posta, Gustavo %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Self-Stabilizing Repeated Balls-into-Bins : %G eng %U http://hdl.handle.net/21.11116/0000-0002-F6C1-E %R 10.1007/s00446-017-0320-4 %7 2017 %D 2019 %J Distributed Computing %V 32 %N 1 %& 59 %P 59 - 68 %I Springer International %C Berlin %@ false
[11]
R. Becker, V. Bonifaci, A. Karrenbauer, P. Kolev, and K. Mehlhorn, “Two Results on Slime Mold Computations,” Theoretical Computer Science, vol. 773, 2019.
Abstract
In this paper, we present two results on slime mold computations. The first one treats a biologically-grounded model, originally proposed by biologists analyzing the behavior of the slime mold Physarum polycephalum. This primitive organism was empirically shown by Nakagaki et al. to solve shortest path problems in wet-lab experiments (Nature'00). We show that the proposed simple mathematical model actually generalizes to a much wider class of problems, namely undirected linear programs with a non-negative cost vector. For our second result, we consider the discretization of a biologically-inspired model. This model is a directed variant of the biologically-grounded one and was never claimed to describe the behavior of a biological system. Straszak and Vishnoi showed that it can $\epsilon$-approximately solve flow problems (SODA'16) and even general linear programs with positive cost vector (ITCS'16) within a finite number of steps. We give a refined convergence analysis that improves the dependence on $\epsilon$ from polynomial to logarithmic and simultaneously allows to choose a step size that is independent of $\epsilon$. Furthermore, we show that the dynamics can be initialized with a more general set of (infeasible) starting points.
Export
BibTeX
@article{BBKKM2018, TITLE = {Two Results on Slime Mold Computations}, AUTHOR = {Becker, Ruben and Bonifaci, Vincenzo and Karrenbauer, Andreas and Kolev, Pavel and Mehlhorn, Kurt}, LANGUAGE = {eng}, ISSN = {0304-3975}, DOI = {10.1016/j.tcs.2018.08.027}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, ABSTRACT = {In this paper, we present two results on slime mold computations. The first one treats a biologically-grounded model, originally proposed by biologists analyzing the behavior of the slime mold Physarum polycephalum. This primitive organism was empirically shown by Nakagaki et al. to solve shortest path problems in wet-lab experiments (Nature'00). We show that the proposed simple mathematical model actually generalizes to a much wider class of problems, namely undirected linear programs with a non-negative cost vector. For our second result, we consider the discretization of a biologically-inspired model. This model is a directed variant of the biologically-grounded one and was never claimed to describe the behavior of a biological system. Straszak and Vishnoi showed that it can $\epsilon$-approximately solve flow problems (SODA'16) and even general linear programs with positive cost vector (ITCS'16) within a finite number of steps. We give a refined convergence analysis that improves the dependence on $\epsilon$ from polynomial to logarithmic and simultaneously allows to choose a step size that is independent of $\epsilon$. Furthermore, we show that the dynamics can be initialized with a more general set of (infeasible) starting points.}, JOURNAL = {Theoretical Computer Science}, VOLUME = {773}, PAGES = {79--106}, }
Endnote
%0 Journal Article %A Becker, Ruben %A Bonifaci, Vincenzo %A Karrenbauer, Andreas %A Kolev, Pavel %A Mehlhorn, Kurt %+ 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 Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Two Results on Slime Mold Computations : %G eng %U http://hdl.handle.net/21.11116/0000-0002-A3AE-2 %R 10.1016/j.tcs.2018.08.027 %7 2018 %D 2019 %X In this paper, we present two results on slime mold computations. The first one treats a biologically-grounded model, originally proposed by biologists analyzing the behavior of the slime mold Physarum polycephalum. This primitive organism was empirically shown by Nakagaki et al. to solve shortest path problems in wet-lab experiments (Nature'00). We show that the proposed simple mathematical model actually generalizes to a much wider class of problems, namely undirected linear programs with a non-negative cost vector. For our second result, we consider the discretization of a biologically-inspired model. This model is a directed variant of the biologically-grounded one and was never claimed to describe the behavior of a biological system. Straszak and Vishnoi showed that it can $\epsilon$-approximately solve flow problems (SODA'16) and even general linear programs with positive cost vector (ITCS'16) within a finite number of steps. We give a refined convergence analysis that improves the dependence on $\epsilon$ from polynomial to logarithmic and simultaneously allows to choose a step size that is independent of $\epsilon$. Furthermore, we show that the dynamics can be initialized with a more general set of (infeasible) starting points. %K Computer Science, Data Structures and Algorithms, cs.DS,Mathematics, Dynamical Systems, math.DS,Mathematics, Optimization and Control, math.OC, Physics, Biological Physics, physics.bio-ph %J Theoretical Computer Science %V 773 %& 79 %P 79 - 106 %I Elsevier %C Amsterdam %@ false
[12]
V. Bhargava, M. Bläser, G. Jindal, and A. Pandey, “A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials,” in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), San Diego, CA, USA, 2019.
Export
BibTeX
@inproceedings{Bhargava_SODA19d, TITLE = {A Deterministic {PTAS} for the Algebraic Rank of Bounded Degree Polynomials}, AUTHOR = {Bhargava, Vishwas and Bl{\"a}ser, Markus and Jindal, Gorav and Pandey, Anurag}, LANGUAGE = {eng}, ISBN = {978-1-61197-548-2}, DOI = {10.1137/1.9781611975482.41}, PUBLISHER = {SIAM}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, BOOKTITLE = {Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019)}, EDITOR = {Chan, Timothy M.}, PAGES = {647--661}, ADDRESS = {San Diego, CA, USA}, }
Endnote
%0 Conference Proceedings %A Bhargava, Vishwas %A Bl&#228;ser, Markus %A Jindal, Gorav %A Pandey, Anurag %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials : %G eng %U http://hdl.handle.net/21.11116/0000-0002-ABAD-B %R 10.1137/1.9781611975482.41 %D 2019 %B 30th Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2019-01-06 - 2019-01-09 %C San Diego, CA, USA %B Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms %E Chan, Timothy M. %P 647 - 661 %I SIAM %@ 978-1-61197-548-2
[13]
L. Boczkowski, A. Korman, and E. Natale, “Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits,” Distributed Computing, vol. 32, no. 3, 2019.
Export
BibTeX
@article{Boczkowski2019, TITLE = {Minimizing Message Size in Stochastic Communication Patterns: {F}ast Self-Stabilizing Protocols with 3 bits}, AUTHOR = {Boczkowski, Lucas and Korman, Amos and Natale, Emanuele}, LANGUAGE = {eng}, ISSN = {0178-2770}, DOI = {10.1007/s00446-018-0330-x}, PUBLISHER = {Springer International}, ADDRESS = {Berlin}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, JOURNAL = {Distributed Computing}, VOLUME = {32}, NUMBER = {3}, PAGES = {173--191}, }
Endnote
%0 Journal Article %A Boczkowski, Lucas %A Korman, Amos %A Natale, Emanuele %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits : %G eng %U http://hdl.handle.net/21.11116/0000-0003-B2F2-2 %R 10.1007/s00446-018-0330-x %7 2018 %D 2019 %J Distributed Computing %V 32 %N 3 %& 173 %P 173 - 191 %I Springer International %C Berlin %@ false
[14]
M. Borassi and E. Natale, “KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation,” Journal of Experimental Algorithmics, vol. 24, no. 1, 2019.
Export
BibTeX
@article{Borassi2019, TITLE = {{KADABRA} is an {ADaptive} Algorithm for Betweenness via Random Approximation}, AUTHOR = {Borassi, Michele and Natale, Emanuele}, LANGUAGE = {eng}, ISSN = {1084-6654}, DOI = {10.1145/3284359}, PUBLISHER = {ACM}, ADDRESS = {New York, NY}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, JOURNAL = {Journal of Experimental Algorithmics}, VOLUME = {24}, NUMBER = {1}, EID = {1.2}, }
Endnote
%0 Journal Article %A Borassi, Michele %A Natale, Emanuele %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation : %G eng %U http://hdl.handle.net/21.11116/0000-0003-7A10-2 %R 10.1145/3284359 %7 2019 %D 2019 %J Journal of Experimental Algorithmics %V 24 %N 1 %Z sequence number: 1.2 %I ACM %C New York, NY %@ false
[15]
K. Bringmann, T. Husfeldt, and M. Magnusson, “Multivariate Analysis of Orthogonal Range Searching and Graph Distances Parameterized by Treewidth,” in 13th International Symposium on Parameterized and Exact Computation (IPEC 2018), Helsinki, Finland, 2019.
Export
BibTeX
@inproceedings{Bringmann_IPEC2018, 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}, ISBN = {978-3-95977-084-2}, URL = {urn:nbn:de:0030-drops-102050}, DOI = {10.4230/LIPIcs.IPEC.2018.4}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, EDITOR = {Paul, Christophe and Pilipczuk, Michal}, PAGES = {1--13}, EID = {4}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {115}, ADDRESS = {Helsinki, Finland}, }
Endnote
%0 Conference Proceedings %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-0002-9CFE-1 %R 10.4230/LIPIcs.IPEC.2018.4 %U urn:nbn:de:0030-drops-102050 %D 2019 %B 13th International Symposium on Parameterized and Exact Computation %Z date of event: 2018-08-20 - 2018-08-24 %C Helsinki, Finland %B 13th International Symposium on Parameterized and Exact Computation %E Paul, Christophe; Pilipczuk, Michal %P 1 - 13 %Z sequence number: 4 %I Schloss Dagstuhl %@ 978-3-95977-084-2 %B Leibniz International Proceedings in Informatics %N 115 %U http://drops.dagstuhl.de/opus/volltexte/2019/10205/http://drops.dagstuhl.de/doku/urheberrecht1.html
[16]
K. Bringmann, M. Künnemann, and P. Wellnitz, “Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts,” in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), San Diego, CA, USA, 2019.
Export
BibTeX
@inproceedings{Bringmann_SODA19c, TITLE = {Few Matches or Almost Periodicity: {F}aster Pattern Matching with Mismatches in Compressed Texts}, AUTHOR = {Bringmann, Karl and K{\"u}nnemann, Marvin and Wellnitz, Philip}, LANGUAGE = {eng}, ISBN = {978-1-61197-548-2}, DOI = {10.1137/1.9781611975482.69}, PUBLISHER = {SIAM}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, BOOKTITLE = {Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019)}, EDITOR = {Chan, Timothy M.}, PAGES = {1126--1145}, ADDRESS = {San Diego, CA, USA}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A K&#252;nnemann, Marvin %A Wellnitz, Philip %+ 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 Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts : %G eng %U http://hdl.handle.net/21.11116/0000-0002-9E1F-B %R 10.1137/1.9781611975482.69 %D 2019 %B 30th Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2019-01-06 - 2019-01-09 %C San Diego, CA, USA %B Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms %E Chan, Timothy M. %P 1126 - 1145 %I SIAM %@ 978-1-61197-548-2
[17]
K. Bringmann, M. Künnemann, and A. Nusser, “Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability,” in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), San Diego, CA, USA, 2019.
Export
BibTeX
@inproceedings{Bringmann_SODA19d, TITLE = {{F}r\'{e}chet Distance Under Translation: {C}onditional Hardness and an Algorithm via Offline Dynamic Grid Reachability}, AUTHOR = {Bringmann, Karl and K{\"u}nnemann, Marvin and Nusser, Andr{\'e}}, LANGUAGE = {eng}, ISBN = {978-1-61197-548-2}, DOI = {10.1137/1.9781611975482.180}, PUBLISHER = {SIAM}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, BOOKTITLE = {Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019)}, EDITOR = {Chan, Timothy M.}, PAGES = {2902--2921}, ADDRESS = {San Diego, CA, USA}, }
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 Fr&#233;chet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability : %G eng %U http://hdl.handle.net/21.11116/0000-0002-9E29-F %R 10.1137/1.9781611975482.180 %D 2019 %B 30th Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2019-01-06 - 2019-01-09 %C San Diego, CA, USA %B Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms %E Chan, Timothy M. %P 2902 - 2921 %I SIAM %@ 978-1-61197-548-2
[18]
K. Bringmann, M. Künnemann, and K. Węgrzycki, “Approximating APSP without Scaling: Equivalence of Approximate Min-Plus and Exact Min-Max,” in STOC’19, 51st Annual ACM Symposium on the Theory of Computing, Phoenix, AZ, USA. (Accepted/in press)
Export
BibTeX
@inproceedings{Bringmann_STOC2019, TITLE = {Approximating {APSP} without Scaling: Equivalence of Approximate Min-Plus and Exact Min-Max}, AUTHOR = {Bringmann, Karl and K{\"u}nnemann, Marvin and W{\c e}grzycki, Karol}, LANGUAGE = {eng}, PUBLISHER = {ACM}, YEAR = {2019}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {STOC'19, 51st Annual ACM Symposium on the Theory of Computing}, ADDRESS = {Phoenix, AZ, USA}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A K&#252;nnemann, Marvin %A W&#281;grzycki, Karol %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Approximating APSP without Scaling: Equivalence of Approximate Min-Plus and Exact Min-Max : %G eng %U http://hdl.handle.net/21.11116/0000-0002-FC7A-A %D 2019 %B 51st Annual ACM Symposium on the Theory of Computing %Z date of event: 2019-06-23 - 2019-06-26 %C Phoenix, AZ, USA %B STOC'19 %I ACM
[19]
K. Bringmann, R. Keusch, and J. Lengler, “Geometric Inhomogeneous Random Graphs,” Theoretical Computer Science, vol. 760, 2019.
Export
BibTeX
@article{BringmannTCS2019, TITLE = {Geometric Inhomogeneous Random Graphs}, AUTHOR = {Bringmann, Karl and Keusch, Ralph and Lengler, Johannes}, LANGUAGE = {eng}, ISSN = {0304-3975}, DOI = {10.1016/j.tcs.2018.08.014}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, JOURNAL = {Theoretical Computer Science}, VOLUME = {760}, PAGES = {35--54}, }
Endnote
%0 Journal Article %A Bringmann, Karl %A Keusch, Ralph %A Lengler, Johannes %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Geometric Inhomogeneous Random Graphs : %G eng %U http://hdl.handle.net/21.11116/0000-0003-0B00-1 %R 10.1016/j.tcs.2018.08.014 %7 2018 %D 2019 %J Theoretical Computer Science %V 760 %& 35 %P 35 - 54 %I Elsevier %C Amsterdam %@ false
[20]
K. Bringmann, M. Künnemann, and A. Nusser, “Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance,” in 35th International Symposium on Computational Geometry (SoCG 2019), Portland, OR, USA. (Accepted/in press)
Export
BibTeX
@inproceedings{Bringmann_SoCG2019, 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}, YEAR = {2019}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {35th International Symposium on Computational Geometry (SoCG 2019)}, ADDRESS = {Portland, OR, USA}, }
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 Walking the Dog Fast in Practice: Algorithm Engineering of the Fr&#233;chet Distance : %G eng %U http://hdl.handle.net/21.11116/0000-0003-65C1-1 %D 2019 %B 35th International Symposium on Computational Geometry %Z date of event: 2019-06-18 - 2019-06-21 %C Portland, OR, USA %B 35th International Symposium on Computational Geometry
[21]
K. Bringmann and B. Ray Chaudhury, “Polyline Simplification has Cubic Complexity,” in 35th International Symposium on Computational Geometry (SoCG 2019), Portland, OR, USA. (Accepted/in press)
Export
BibTeX
@inproceedings{Bringmann_SoCG2019b, TITLE = {Polyline Simplification has Cubic Complexity}, AUTHOR = {Bringmann, Karl and Ray Chaudhury, Bhaskar}, LANGUAGE = {eng}, YEAR = {2019}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {35th International Symposium on Computational Geometry (SoCG 2019)}, ADDRESS = {Portland, OR, USA}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Ray Chaudhury, Bhaskar %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Polyline Simplification has Cubic Complexity : %G eng %U http://hdl.handle.net/21.11116/0000-0003-65C8-A %D 2019 %B 35th International Symposium on Computational Geometry %Z date of event: 2019-06-18 - 2019-06-21 %C Portland, OR, USA %B 35th International Symposium on Computational Geometry
[22]
K. Bringmann, F. Grandoni, B. Saha, and V. Vassilevska Williams, “Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product,” SIAM Journal on Computing, vol. 48, no. 2, 2019.
Export
BibTeX
@article{Bringmann_Truly2019, TITLE = {Truly Subcubic Algorithms for Language Edit Distance and {RNA} Folding via Fast Bounded-Difference Min-Plus Product}, AUTHOR = {Bringmann, Karl and Grandoni, Fabrizio and Saha, Barna and Vassilevska Williams, Virginia}, LANGUAGE = {eng}, ISSN = {0097-5397}, DOI = {10.1137/17M112720X}, PUBLISHER = {SIAM}, ADDRESS = {Philadelphia, PA}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, JOURNAL = {SIAM Journal on Computing}, VOLUME = {48}, NUMBER = {2}, PAGES = {481--512}, }
Endnote
%0 Journal Article %A Bringmann, Karl %A Grandoni, Fabrizio %A Saha, Barna %A Vassilevska Williams, Virginia %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product : %G eng %U http://hdl.handle.net/21.11116/0000-0003-A7E4-F %R 10.1137/17M112720X %7 2019 %D 2019 %J SIAM Journal on Computing %V 48 %N 2 %& 481 %P 481 - 512 %I SIAM %C Philadelphia, PA %@ false
[23]
K. Bringmann, “Fine-Grained Complexity Theory (Tutorial),” in 36th Symposium on Theoretical Aspects of Computer Science (STACS 2019), Berlin, Germany, 2019.
Export
BibTeX
@inproceedings{Bringmann_STACS2019, TITLE = {Fine-Grained Complexity Theory (Tutorial)}, AUTHOR = {Bringmann, Karl}, LANGUAGE = {eng}, ISBN = {978-3-95977-100-9}, DOI = {10.4230/LIPIcs.STACS.2019.4}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {36th Symposium on Theoretical Aspects of Computer Science (STACS 2019)}, EDITOR = {Niedermeier, Rolf and Paul, Christophe}, PAGES = {1--7}, EID = {4}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {126}, ADDRESS = {Berlin, Germany}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Fine-Grained Complexity Theory (Tutorial) : %G eng %U http://hdl.handle.net/21.11116/0000-0003-B36E-8 %R 10.4230/LIPIcs.STACS.2019.4 %D 2019 %B 36th Symposium on Theoretical Aspects of Computer Science %Z date of event: 2019-03-13 - 2019-03-16 %C Berlin, Germany %B 36th Symposium on Theoretical Aspects of Computer Science %E Niedermeier, Rolf; Paul, Christophe %P 1 - 7 %Z sequence number: 4 %I Schloss Dagstuhl %@ 978-3-95977-100-9 %B Leibniz International Proceedings in Informatics %N 126 %U http://drops.dagstuhl.de/opus/volltexte/2019/10243/http://drops.dagstuhl.de/doku/urheberrecht1.html
[24]
J. Bund, C. Lenzen, and W. Rosenbaum, “Fault Tolerant Gradient Clock Synchronization,” 2019. [Online]. Available: http://arxiv.org/abs/1902.08042. (arXiv: 1902.08042)
Abstract
Synchronizing clocks in distributed systems is well-understood, both in terms of fault-tolerance in fully connected systems and the dependence of local and global worst-case skews (i.e., maximum clock difference between neighbors and arbitrary pairs of nodes, respectively) on the diameter of fault-free systems. However, so far nothing non-trivial is known about the local skew that can be achieved in topologies that are not fully connected even under a single Byzantine fault. Put simply, in this work we show that the most powerful known techniques for fault-tolerant and gradient clock synchronization are compatible, in the sense that the best of both worlds can be achieved simultaneously. Concretely, we combine the Lynch-Welch algorithm [Welch1988] for synchronizing a clique of $n$ nodes despite up to $f<n/3$ Byzantine faults with the gradient clock synchronization (GCS) algorithm by Lenzen et al. [Lenzen2010] in order to render the latter resilient to faults. As this is not possible on general graphs, we augment an input graph $\mathcal{G}$ by replacing each node by $3f+1$ fully connected copies, which execute an instance of the Lynch-Welch algorithm. We then interpret these clusters as supernodes executing the GCS algorithm, where for each cluster its correct nodes' Lynch-Welch clocks provide estimates of the logical clock of the supernode in the GCS algorithm. By connecting clusters corresponding to neighbors in $\mathcal{G}$ in a fully bipartite manner, supernodes can inform each other about (estimates of) their logical clock values. This way, we achieve asymptotically optimal local skew, granted that no cluster contains more than $f$ faulty nodes, at factor $O(f)$ and $O(f^2)$ overheads in terms of nodes and edges, respectively. Note that tolerating $f$ faulty neighbors trivially requires degree larger than $f$, so this is asymptotically optimal as well.
Export
BibTeX
@online{Bund_arXiv1902.08042, TITLE = {Fault Tolerant Gradient Clock Synchronization}, AUTHOR = {Bund, Johannes and Lenzen, Christoph and Rosenbaum, Will}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1902.08042}, EPRINT = {1902.08042}, EPRINTTYPE = {arXiv}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Synchronizing clocks in distributed systems is well-understood, both in terms of fault-tolerance in fully connected systems and the dependence of local and global worst-case skews (i.e., maximum clock difference between neighbors and arbitrary pairs of nodes, respectively) on the diameter of fault-free systems. However, so far nothing non-trivial is known about the local skew that can be achieved in topologies that are not fully connected even under a single Byzantine fault. Put simply, in this work we show that the most powerful known techniques for fault-tolerant and gradient clock synchronization are compatible, in the sense that the best of both worlds can be achieved simultaneously. Concretely, we combine the Lynch-Welch algorithm [Welch1988] for synchronizing a clique of $n$ nodes despite up to $f<n/3$ Byzantine faults with the gradient clock synchronization (GCS) algorithm by Lenzen et al. [Lenzen2010] in order to render the latter resilient to faults. As this is not possible on general graphs, we augment an input graph $\mathcal{G}$ by replacing each node by $3f+1$ fully connected copies, which execute an instance of the Lynch-Welch algorithm. We then interpret these clusters as supernodes executing the GCS algorithm, where for each cluster its correct nodes' Lynch-Welch clocks provide estimates of the logical clock of the supernode in the GCS algorithm. By connecting clusters corresponding to neighbors in $\mathcal{G}$ in a fully bipartite manner, supernodes can inform each other about (estimates of) their logical clock values. This way, we achieve asymptotically optimal local skew, granted that no cluster contains more than $f$ faulty nodes, at factor $O(f)$ and $O(f^2)$ overheads in terms of nodes and edges, respectively. Note that tolerating $f$ faulty neighbors trivially requires degree larger than $f$, so this is asymptotically optimal as well.}, }
Endnote
%0 Report %A Bund, Johannes %A Lenzen, Christoph %A Rosenbaum, Will %+ 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 Fault Tolerant Gradient Clock Synchronization : %G eng %U http://hdl.handle.net/21.11116/0000-0003-0CD6-F %U http://arxiv.org/abs/1902.08042 %D 2019 %X Synchronizing clocks in distributed systems is well-understood, both in terms of fault-tolerance in fully connected systems and the dependence of local and global worst-case skews (i.e., maximum clock difference between neighbors and arbitrary pairs of nodes, respectively) on the diameter of fault-free systems. However, so far nothing non-trivial is known about the local skew that can be achieved in topologies that are not fully connected even under a single Byzantine fault. Put simply, in this work we show that the most powerful known techniques for fault-tolerant and gradient clock synchronization are compatible, in the sense that the best of both worlds can be achieved simultaneously. Concretely, we combine the Lynch-Welch algorithm [Welch1988] for synchronizing a clique of $n$ nodes despite up to $f<n/3$ Byzantine faults with the gradient clock synchronization (GCS) algorithm by Lenzen et al. [Lenzen2010] in order to render the latter resilient to faults. As this is not possible on general graphs, we augment an input graph $\mathcal{G}$ by replacing each node by $3f+1$ fully connected copies, which execute an instance of the Lynch-Welch algorithm. We then interpret these clusters as supernodes executing the GCS algorithm, where for each cluster its correct nodes' Lynch-Welch clocks provide estimates of the logical clock of the supernode in the GCS algorithm. By connecting clusters corresponding to neighbors in $\mathcal{G}$ in a fully bipartite manner, supernodes can inform each other about (estimates of) their logical clock values. This way, we achieve asymptotically optimal local skew, granted that no cluster contains more than $f$ faulty nodes, at factor $O(f)$ and $O(f^2)$ overheads in terms of nodes and edges, respectively. Note that tolerating $f$ faulty neighbors trivially requires degree larger than $f$, so this is asymptotically optimal as well. %K Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC,Computer Science, Data Structures and Algorithms, cs.DS
[25]
P. Bürgisser, C. Ikenmeyer, and G. Panova, “No Occurrence Obstructions in Geometric Complexity Theory,” Journal of the American Mathematical Society, vol. 32, 2019.
Export
BibTeX
@article{Buergisser2019, TITLE = {No Occurrence Obstructions in Geometric Complexity Theory}, AUTHOR = {B{\"u}rgisser, Peter and Ikenmeyer, Christian and Panova, Greta}, LANGUAGE = {eng}, ISSN = {0894-0347}, DOI = {10.1090/jams/908}, PUBLISHER = {The Society}, ADDRESS = {Providence, R.I.}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, JOURNAL = {Journal of the American Mathematical Society}, VOLUME = {32}, PAGES = {163--193}, }
Endnote
%0 Journal Article %A B&#252;rgisser, Peter %A Ikenmeyer, Christian %A Panova, Greta %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T No Occurrence Obstructions in Geometric Complexity Theory : %G eng %U http://hdl.handle.net/21.11116/0000-0002-72B9-D %R 10.1090/jams/908 %7 2018 %D 2019 %J Journal of the American Mathematical Society %O J. Amer. Math. Soc. %V 32 %& 163 %P 163 - 193 %I The Society %C Providence, R.I. %@ false
[26]
P. Chalermsook, A. Schmid, and S. Uniyal, “A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs,” in 36th Symposium on Theoretical Aspects of Computer Science (STACS 2019), Berlin, Germany, 2019.
Export
BibTeX
@inproceedings{Chalermsook_STACS2019, TITLE = {A Tight Extremal Bound on the {Lov\'{a}sz} Cactus Number in Planar Graphs}, AUTHOR = {Chalermsook, Parinya and Schmid, Andreas and Uniyal, Sumedha}, LANGUAGE = {eng}, ISBN = {978-3-95977-100-9}, DOI = {10.4230/LIPIcs.STACS.2019.19}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {36th Symposium on Theoretical Aspects of Computer Science (STACS 2019)}, EDITOR = {Niedermeier, Rolf and Paul, Christophe}, PAGES = {1--14}, EID = {19}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {126}, ADDRESS = {Berlin, Germany}, }
Endnote
%0 Conference Proceedings %A Chalermsook, Parinya %A Schmid, Andreas %A Uniyal, Sumedha %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T A Tight Extremal Bound on the Lov&#225;sz Cactus Number in Planar Graphs : %G eng %U http://hdl.handle.net/21.11116/0000-0002-E5D6-A %R 10.4230/LIPIcs.STACS.2019.19 %D 2019 %B 36th Symposium on Theoretical Aspects of Computer Science %Z date of event: 2019-03-13 - 2019-03-16 %C Berlin, Germany %B 36th Symposium on Theoretical Aspects of Computer Science %E Niedermeier, Rolf; Paul, Christophe %P 1 - 14 %Z sequence number: 19 %I Schloss Dagstuhl %@ 978-3-95977-100-9 %B Leibniz International Proceedings in Informatics %N 126 %U http://drops.dagstuhl.de/doku/urheberrecht1.htmlhttp://drops.dagstuhl.de/opus/volltexte/2019/10258/
[27]
L. S. Chandran, D. Issac, and S. Zhou, “Hadwiger’s Conjecture for Squares of 2-Trees,” European Journal of Combinatorics, vol. 76, 2019.
Export
BibTeX
@article{CHANDRAN2019hadwiger, TITLE = {Hadwiger's Conjecture for Squares of 2-Trees}, AUTHOR = {Chandran, L. Sunil and Issac, Davis and Zhou, Sanming}, LANGUAGE = {eng}, ISSN = {0195-6698}, DOI = {10.1016/j.ejc.2018.10.003}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, JOURNAL = {European Journal of Combinatorics}, VOLUME = {76}, PAGES = {159--174}, }
Endnote
%0 Journal Article %A Chandran, L. Sunil %A Issac, Davis %A Zhou, Sanming %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Hadwiger's Conjecture for Squares of 2-Trees : %G eng %U http://hdl.handle.net/21.11116/0000-0002-9E5B-7 %R 10.1016/j.ejc.2018.10.003 %7 2018 %D 2019 %J European Journal of Combinatorics %V 76 %& 159 %P 159 - 174 %I Elsevier %C Amsterdam %@ false
[28]
L. Chen, F. Eberle, N. Megow, K. Schewior, and C. Stein, “A General Framework for Handling Commitment in Online Admission Control,” in Integer Programming and Combinatorial Optimization (IPCO 2019), Ann Arbor, MI, USA. (Accepted/in press)
Export
BibTeX
@inproceedings{SchewiorIPCO2019, TITLE = {A General Framework for Handling Commitment in Online Admission Control}, AUTHOR = {Chen, Lin and Eberle, Franziska and Megow, Nicole and Schewior, Kevin and Stein, Clifford}, LANGUAGE = {eng}, PUBLISHER = {Springer}, YEAR = {2019}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Integer Programming and Combinatorial Optimization (IPCO 2019)}, ADDRESS = {Ann Arbor, MI, USA}, }
Endnote
%0 Conference Proceedings %A Chen, Lin %A Eberle, Franziska %A Megow, Nicole %A Schewior, Kevin %A Stein, Clifford %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T A General Framework for Handling Commitment in Online Admission Control : %G eng %U http://hdl.handle.net/21.11116/0000-0002-F4CC-5 %D 2019 %B 20th Conference on Integer Programming and Combinatorial Optimization %Z date of event: 2019-05-22 - 2019-05-24 %C Ann Arbor, MI, USA %B Integer Programming and Combinatorial Optimization %I Springer
[29]
Y. K. Cheung, M. Hoefer, and P. Nakhe, “Tracing Equilibrium in Dynamic Markets via Distributed Adaptation,” in International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2019), Montreal, Canada. (Accepted/in press)
Export
BibTeX
@inproceedings{aamas19-CHN, TITLE = {Tracing Equilibrium in Dynamic Markets via Distributed Adaptation}, AUTHOR = {Cheung, Yun Kuen and Hoefer, Martin and Nakhe, Paresh}, LANGUAGE = {eng}, YEAR = {2019}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2019)}, ADDRESS = {Montreal, Canada}, }
Endnote
%0 Conference Proceedings %A Cheung, Yun Kuen %A Hoefer, Martin %A Nakhe, Paresh %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Tracing Equilibrium in Dynamic Markets via Distributed Adaptation : %G eng %U http://hdl.handle.net/21.11116/0000-0002-E5FE-E %D 2019 %B International Conference on Autonomous Agents and Multiagent Systems %Z date of event: 2019-05-13 - 2019-05-17 %C Montreal, Canada %B International Conference on Autonomous Agents and Multiagent Systems
[30]
A. Choudhary and A. Ghosh, “Delaunay Simplices in Diagonally Distorted Lattices,” Computational Geometry: Theory and Applications. (Accepted/in press)
Export
BibTeX
@article{Choudhary-diagonal, TITLE = {Delaunay Simplices in Diagonally Distorted Lattices}, AUTHOR = {Choudhary, Aruni and Ghosh, Arijit}, LANGUAGE = {eng}, ISSN = {0925-7721}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2019}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, JOURNAL = {Computational Geometry: Theory and Applications}, }
Endnote
%0 Journal Article %A Choudhary, Aruni %A Ghosh, Arijit %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Delaunay Simplices in Diagonally Distorted Lattices : %G eng %U http://hdl.handle.net/21.11116/0000-0002-E5C1-1 %D 2019 %J Computational Geometry: Theory and Applications %I Elsevier %C Amsterdam %@ false
[31]
A. Choudhary, M. Kerber, and S. Raghvendra, “Improved Topological Approximations by Digitization,” in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), San Diego, CA, USA, 2019.
Export
BibTeX
@inproceedings{Choudhary-digital, TITLE = {Improved Topological Approximations by Digitization}, AUTHOR = {Choudhary, Aruni and Kerber, Michael and Raghvendra, Sharath}, LANGUAGE = {eng}, ISBN = {978-1-61197-548-2}, DOI = {10.1137/1.9781611975482.166}, PUBLISHER = {SIAM}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, BOOKTITLE = {Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019)}, EDITOR = {Chan, Timothy M.}, PAGES = {2675--2688}, ADDRESS = {San Diego, CA, USA}, }
Endnote
%0 Conference Proceedings %A Choudhary, Aruni %A Kerber, Michael %A Raghvendra, Sharath %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Improved Topological Approximations by Digitization : %G eng %U http://hdl.handle.net/21.11116/0000-0002-E5BC-8 %R 10.1137/1.9781611975482.166 %D 2019 %B 30th Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2019-01-06 - 2019-01-09 %C San Diego, CA, USA %B Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms %E Chan, Timothy M. %P 2675 - 2688 %I SIAM %@ 978-1-61197-548-2
[32]
A. Choudhary, M. Kerber, and S. Raghvendra, “Polynomial-Sized Topological Approximations Using the Permutahedron,” Discrete & Computational Geometry, vol. 61, no. 1, 2019.
Export
BibTeX
@article{Choudhary-polynomial-dcg, TITLE = {Polynomial-Sized Topological Approximations Using the Permutahedron}, AUTHOR = {Choudhary, Aruni and Kerber, Michael and Raghvendra, Sharat}, LANGUAGE = {eng}, ISSN = {0179-5376}, DOI = {10.1007/s00454-017-9951-2}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, JOURNAL = {Discrete \& Computational Geometry}, VOLUME = {61}, NUMBER = {1}, PAGES = {42--80}, }
Endnote
%0 Journal Article %A Choudhary, Aruni %A Kerber, Michael %A Raghvendra, Sharat %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Polynomial-Sized Topological Approximations Using the Permutahedron : %G eng %U http://hdl.handle.net/21.11116/0000-0002-E5B6-E %R 10.1007/s00454-017-9951-2 %7 2017 %D 2019 %J Discrete & Computational Geometry %V 61 %N 1 %& 42 %P 42 - 80 %I Springer %C New York, NY %@ false
[33]
J. Correa, P. Foncea, R. Hoeksma, T. Oosterwijk, and T. Vredeveld, “Recent Developments in Prophet Inequalities,” ACM SIGecom Exchanges, vol. 17, no. 1, 2019.
Export
BibTeX
@article{Correa2018, TITLE = {Recent Developments in Prophet Inequalities}, AUTHOR = {Correa, Jos{\'e} and Foncea, Patricio and Hoeksma, Ruben and Oosterwijk, Tim and Vredeveld, Tjark}, LANGUAGE = {eng}, ISSN = {1551-9031}, PUBLISHER = {ACM}, ADDRESS = {New York, NY}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, JOURNAL = {ACM SIGecom Exchanges}, VOLUME = {17}, NUMBER = {1}, PAGES = {60--61}, }
Endnote
%0 Journal Article %A Correa, Jos&#233; %A Foncea, Patricio %A Hoeksma, Ruben %A Oosterwijk, Tim %A Vredeveld, Tjark %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Recent Developments in Prophet Inequalities : %G eng %U http://hdl.handle.net/21.11116/0000-0002-9E6F-1 %7 2019 %D 2019 %J ACM SIGecom Exchanges %V 17 %N 1 %& 60 %P 60 - 61 %I ACM %C New York, NY %@ false %U http://www.sigecom.org/exchanges/volume_17/1/CORREA.pdf
[34]
E. Cruciani, E. Natale, and G. Scornavacca, “Rigorous Analysis of a Label Propagation Algorithm for Distributed Community Detection,” in Thirty-Third AAAI Conference on Artificial Intelligence, Honolulu, HI, USA. (Accepted/in press)
Export
BibTeX
@inproceedings{Cruciani_aaai18, TITLE = {Rigorous Analysis of a Label Propagation Algorithm for Distributed Community Detection}, AUTHOR = {Cruciani, Emilio and Natale, Emanuele and Scornavacca, Giacomo}, LANGUAGE = {eng}, PUBLISHER = {AAAI}, YEAR = {2019}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Thirty-Third AAAI Conference on Artificial Intelligence}, ADDRESS = {Honolulu, HI, USA}, }
Endnote
%0 Conference Proceedings %A Cruciani, Emilio %A Natale, Emanuele %A Scornavacca, Giacomo %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Rigorous Analysis of a Label Propagation Algorithm for Distributed Community Detection : %G eng %U http://hdl.handle.net/21.11116/0000-0002-A985-9 %D 2018 %B Thirty-Third AAAI Conference on Artificial Intelligence %Z date of event: 2019-01-27 - 2019-02-01 %C Honolulu, HI, USA %B Thirty-Third AAAI Conference on Artificial Intelligence %I AAAI
[35]
J. Dörfler, C. Ikenmeyer, and G. Panova, “On Geometric Complexity Theory: Multiplicity Obstructions are Stronger than Occurrence Obstructions,” 2019. [Online]. Available: http://arxiv.org/abs/1901.04576. (arXiv: 1901.04576)
Abstract
Geometric Complexity Theory as initiated by Mulmuley and Sohoni in two papers (SIAM J Comput 2001, 2008) aims to separate algebraic complexity classes via representation theoretic multiplicities in coordinate rings of specific group varieties. The papers also conjecture that the vanishing behavior of these multiplicities would be sufficient to separate complexity classes (so-called occurrence obstructions). The existence of such strong occurrence obstructions has been recently disproven in 2016 in two successive papers, Ikenmeyer-Panova (Adv. Math.) and B\"urgisser-Ikenmeyer-Panova (J. AMS). This raises the question whether separating group varieties via representation theoretic multiplicities is stronger than separating them via occurrences. This paper provides for the first time a setting where separating with multiplicities can be achieved, while the separation with occurrences is provably impossible. Our setting is surprisingly simple and natural: We study the variety of products of homogeneous linear forms (the so-called Chow variety) and the variety of polynomials of bounded border Waring rank (i.e. a higher secant variety of the Veronese variety). As a side result we prove a slight generalization of Hermite's reciprocity theorem, which proves Foulkes' conjecture for a new infinite family of cases.
Export
BibTeX
@online{Doerfler_arXiv1901.04576, TITLE = {On Geometric Complexity Theory: {M}ultiplicity Obstructions are Stronger than Occurrence Obstructions}, AUTHOR = {D{\"o}rfler, Julian and Ikenmeyer, Christian and Panova, Greta}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1901.04576}, EPRINT = {1901.04576}, EPRINTTYPE = {arXiv}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Geometric Complexity Theory as initiated by Mulmuley and Sohoni in two papers (SIAM J Comput 2001, 2008) aims to separate algebraic complexity classes via representation theoretic multiplicities in coordinate rings of specific group varieties. The papers also conjecture that the vanishing behavior of these multiplicities would be sufficient to separate complexity classes (so-called occurrence obstructions). The existence of such strong occurrence obstructions has been recently disproven in 2016 in two successive papers, Ikenmeyer-Panova (Adv. Math.) and B\"urgisser-Ikenmeyer-Panova (J. AMS). This raises the question whether separating group varieties via representation theoretic multiplicities is stronger than separating them via occurrences. This paper provides for the first time a setting where separating with multiplicities can be achieved, while the separation with occurrences is provably impossible. Our setting is surprisingly simple and natural: We study the variety of products of homogeneous linear forms (the so-called Chow variety) and the variety of polynomials of bounded border Waring rank (i.e. a higher secant variety of the Veronese variety). As a side result we prove a slight generalization of Hermite's reciprocity theorem, which proves Foulkes' conjecture for a new infinite family of cases.}, }
Endnote
%0 Report %A D&#246;rfler, Julian %A Ikenmeyer, Christian %A Panova, Greta %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T On Geometric Complexity Theory: Multiplicity Obstructions are Stronger than Occurrence Obstructions : %G eng %U http://hdl.handle.net/21.11116/0000-0003-B393-C %U http://arxiv.org/abs/1901.04576 %D 2019 %X Geometric Complexity Theory as initiated by Mulmuley and Sohoni in two papers (SIAM J Comput 2001, 2008) aims to separate algebraic complexity classes via representation theoretic multiplicities in coordinate rings of specific group varieties. The papers also conjecture that the vanishing behavior of these multiplicities would be sufficient to separate complexity classes (so-called occurrence obstructions). The existence of such strong occurrence obstructions has been recently disproven in 2016 in two successive papers, Ikenmeyer-Panova (Adv. Math.) and B\"urgisser-Ikenmeyer-Panova (J. AMS). This raises the question whether separating group varieties via representation theoretic multiplicities is stronger than separating them via occurrences. This paper provides for the first time a setting where separating with multiplicities can be achieved, while the separation with occurrences is provably impossible. Our setting is surprisingly simple and natural: We study the variety of products of homogeneous linear forms (the so-called Chow variety) and the variety of polynomials of bounded border Waring rank (i.e. a higher secant variety of the Veronese variety). As a side result we prove a slight generalization of Hermite's reciprocity theorem, which proves Foulkes' conjecture for a new infinite family of cases. %K Computer Science, Computational Complexity, cs.CC,Mathematics, Algebraic Geometry, math.AG,Mathematics, Combinatorics, math.CO,Mathematics, Representation Theory, math.RT,
[36]
T. Eden, D. Ron, and W. Rosenbaum, “The Arboricity Captures the Complexity of Sampling Edges,” 2019. [Online]. Available: http://arxiv.org/abs/1902.08086. (arXiv: 1902.08086)
Abstract
In this paper, we revisit the problem of sampling edges in an unknown graph $G = (V, E)$ from a distribution that is (pointwise) almost uniform over $E$. We consider the case where there is some a priori upper bound on the arboriciy of $G$. Given query access to a graph $G$ over $n$ vertices and of average degree $d$ and arboricity at most $\alpha$, we design an algorithm that performs $O\!\left(\frac{\alpha}{d} \cdot \frac{\log^3 n}{\varepsilon}\right)$ queries in expectation and returns an edge in the graph such that every edge $e \in E$ is sampled with probability $(1 \pm \varepsilon)/m$. The algorithm performs two types of queries: degree queries and neighbor queries. We show that the upper bound is tight (up to poly-logarithmic factors and the dependence in $\varepsilon$), as $\Omega\!\left(\frac{\alpha}{d} \right)$ queries are necessary for the easier task of sampling edges from any distribution over $E$ that is close to uniform in total variational distance. We also prove that even if $G$ is a tree (i.e., $\alpha = 1$ so that $\frac{\alpha}{d}=\Theta(1)$), $\Omega\left(\frac{\log n}{\log\log n}\right)$ queries are necessary to sample an edge from any distribution that is pointwise close to uniform, thus establishing that a $\mathrm{poly}(\log n)$ factor is necessary for constant $\alpha$. Finally we show how our algorithm can be applied to obtain a new result on approximately counting subgraphs, based on the recent work of Assadi, Kapralov, and Khanna (ITCS, 2019).
Export
BibTeX
@online{Eden_arXiv1902.08086, TITLE = {The Arboricity Captures the Complexity of Sampling Edges}, AUTHOR = {Eden, Talya and Ron, Dana and Rosenbaum, Will}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1902.08086}, EPRINT = {1902.08086}, EPRINTTYPE = {arXiv}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, ABSTRACT = {In this paper, we revisit the problem of sampling edges in an unknown graph $G = (V, E)$ from a distribution that is (pointwise) almost uniform over $E$. We consider the case where there is some a priori upper bound on the arboriciy of $G$. Given query access to a graph $G$ over $n$ vertices and of average degree $d$ and arboricity at most $\alpha$, we design an algorithm that performs $O\!\left(\frac{\alpha}{d} \cdot \frac{\log^3 n}{\varepsilon}\right)$ queries in expectation and returns an edge in the graph such that every edge $e \in E$ is sampled with probability $(1 \pm \varepsilon)/m$. The algorithm performs two types of queries: degree queries and neighbor queries. We show that the upper bound is tight (up to poly-logarithmic factors and the dependence in $\varepsilon$), as $\Omega\!\left(\frac{\alpha}{d} \right)$ queries are necessary for the easier task of sampling edges from any distribution over $E$ that is close to uniform in total variational distance. We also prove that even if $G$ is a tree (i.e., $\alpha = 1$ so that $\frac{\alpha}{d}=\Theta(1)$), $\Omega\left(\frac{\log n}{\log\log n}\right)$ queries are necessary to sample an edge from any distribution that is pointwise close to uniform, thus establishing that a $\mathrm{poly}(\log n)$ factor is necessary for constant $\alpha$. Finally we show how our algorithm can be applied to obtain a new result on approximately counting subgraphs, based on the recent work of Assadi, Kapralov, and Khanna (ITCS, 2019).}, }
Endnote
%0 Report %A Eden, Talya %A Ron, Dana %A Rosenbaum, Will %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T The Arboricity Captures the Complexity of Sampling Edges : %G eng %U http://hdl.handle.net/21.11116/0000-0003-0CD0-5 %U http://arxiv.org/abs/1902.08086 %D 2019 %X In this paper, we revisit the problem of sampling edges in an unknown graph $G = (V, E)$ from a distribution that is (pointwise) almost uniform over $E$. We consider the case where there is some a priori upper bound on the arboriciy of $G$. Given query access to a graph $G$ over $n$ vertices and of average degree $d$ and arboricity at most $\alpha$, we design an algorithm that performs $O\!\left(\frac{\alpha}{d} \cdot \frac{\log^3 n}{\varepsilon}\right)$ queries in expectation and returns an edge in the graph such that every edge $e \in E$ is sampled with probability $(1 \pm \varepsilon)/m$. The algorithm performs two types of queries: degree queries and neighbor queries. We show that the upper bound is tight (up to poly-logarithmic factors and the dependence in $\varepsilon$), as $\Omega\!\left(\frac{\alpha}{d} \right)$ queries are necessary for the easier task of sampling edges from any distribution over $E$ that is close to uniform in total variational distance. We also prove that even if $G$ is a tree (i.e., $\alpha = 1$ so that $\frac{\alpha}{d}=\Theta(1)$), $\Omega\left(\frac{\log n}{\log\log n}\right)$ queries are necessary to sample an edge from any distribution that is pointwise close to uniform, thus establishing that a $\mathrm{poly}(\log n)$ factor is necessary for constant $\alpha$. Finally we show how our algorithm can be applied to obtain a new result on approximately counting subgraphs, based on the recent work of Assadi, Kapralov, and Khanna (ITCS, 2019). %K Computer Science, Computational Complexity, cs.CC,Computer Science, Data Structures and Algorithms, cs.DS
[37]
F. Grandoni, B. Laekhanukit, and S. Li, “O(log 2 k/ log log k)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm,” in STOC’19, 51st Annual ACM Symposium on the Theory of Computing, Phoenix, AZ, USA. (Accepted/in press)
Export
BibTeX
@inproceedings{Grandoni_STOC2019, TITLE = {{$O(\log^2k/\log\log{k})$}-Approximation Algorithm for Directed {S}teiner Tree: A Tight Quasi-Polynomial-Time Algorithm}, AUTHOR = {Grandoni, Fabrizio and Laekhanukit, Bundit and Li, Shi}, LANGUAGE = {eng}, PUBLISHER = {ACM}, YEAR = {2019}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {STOC'19, 51st Annual ACM Symposium on the Theory of Computing}, ADDRESS = {Phoenix, AZ, USA}, }
Endnote
%0 Conference Proceedings %A Grandoni, Fabrizio %A Laekhanukit, Bundit %A Li, Shi %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T O(log 2 k/ log log k)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm : %G eng %U http://hdl.handle.net/21.11116/0000-0003-1625-B %D 2019 %B 51st Annual ACM Symposium on the Theory of Computing %Z date of event: 2019-06-23 - 2019-06-26 %C Phoenix, AZ, USA %B STOC'19 %I ACM
[38]
Y. Ibrahim, M. Riedewald, G. Weikum, and D. Zeinalipour-Yazti, “Bridging Quantities in Tables and Text,” in ICDE 2019, 35th IEEE International Conference on Data Engineering, Macau, China. (Accepted/in press)
Export
BibTeX
@inproceedings{Ibrahim_ICDE2019, TITLE = {Bridging Quantities in Tables and Text}, AUTHOR = {Ibrahim, Yusra and Riedewald, Mirek and Weikum, Gerhard and Zeinalipour-Yazti, Demetrios}, LANGUAGE = {eng}, PUBLISHER = {IEEE}, YEAR = {2019}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {ICDE 2019, 35th IEEE International Conference on Data Engineering}, ADDRESS = {Macau, China}, }
Endnote
%0 Conference Proceedings %A Ibrahim, Yusra %A Riedewald, Mirek %A Weikum, Gerhard %A Zeinalipour-Yazti, Demetrios %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Bridging Quantities in Tables and Text : %G eng %U http://hdl.handle.net/21.11116/0000-0003-01AB-B %D 2019 %B 35th IEEE International Conference on Data Engineering %Z date of event: 2019-04-08 - 2019-04-12 %C Macau, China %B ICDE 2019 %I IEEE
[39]
G. Jindal and M. Bläser, “On the Complexity of Symmetric Polynomials,” in 10th Innovations in Theoretical Computer Science (ITCS 2019), San Diego, CA, USA, 2019.
Export
BibTeX
@inproceedings{Jindal_ITCS2019, TITLE = {On the Complexity of Symmetric Polynomials}, AUTHOR = {Jindal, Gorav and Bl{\"a}ser, Markus}, LANGUAGE = {eng}, ISBN = {978-3-95977-095-8}, URL = {urn:nbn:de:0030-drops-101402}, DOI = {10.4230/LIPIcs.ITCS.2019.47}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {10th Innovations in Theoretical Computer Science (ITCS 2019)}, EDITOR = {Blum, Avrim}, PAGES = {1--14}, EID = {47}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {124}, ADDRESS = {San Diego, CA, USA}, }
Endnote
%0 Conference Proceedings %A Jindal, Gorav %A Bl&#228;ser, Markus %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T On the Complexity of Symmetric Polynomials : %G eng %U http://hdl.handle.net/21.11116/0000-0002-ABCC-8 %R 10.4230/LIPIcs.ITCS.2019.47 %U urn:nbn:de:0030-drops-101402 %D 2019 %B 10th Innovations in Theoretical Computer Science %Z date of event: 2019-01-10 - 2019-01-12 %C San Diego, CA, USA %B 10th Innovations in Theoretical Computer Science %E Blum, Avrim %P 1 - 14 %Z sequence number: 47 %I Schloss Dagstuhl %@ 978-3-95977-095-8 %B Leibniz International Proceedings in Informatics %N 124 %U http://drops.dagstuhl.de/opus/volltexte/2018/10140/http://drops.dagstuhl.de/doku/urheberrecht1.html
[40]
A. Karrenbauer, P. Kolev, and K. Mehlhorn, “Convergence of the Non-Uniform Physarum Dynamics,” 2019. [Online]. Available: http://arxiv.org/abs/1901.07231. (arXiv: 1901.07231)
Abstract
Let $c \in \mathbb{Z}^m_{> 0}$, $A \in \mathbb{Z}^{n\times m}$, and $b \in \mathbb{Z}^n$. We show under fairly general conditions that the non-uniform Physarum dynamics \[ \dot{x}_e = a_e(x,t) \left(|q_e| - x_e\right) \] converges to the optimum solution $x^*$ of the weighted basis pursuit problem minimize $c^T x$ subject to $A f = b$ and $|f| \le x$. Here, $f$ and $x$ are $m$-vectors of real variables, $q$ minimizes the energy $\sum_e (c_e/x_e) q_e^2$ subject to the constraints $A q = b$ and $\mathrm{supp}(q) \subseteq \mathrm{supp}(x)$, and $a_e(x,t) > 0$ is the reactivity of edge $e$ to the difference $|q_e| - x_e$ at time $t$ and in state $x$. Previously convergence was only shown for the uniform case $a_e(x,t) = 1$ for all $e$, $x$, and $t$. We also show convergence for the dynamics \[ \dot{x}_e = x_e \cdot \left( g_e \left(\frac{|q_e|}{x_e}\right) - 1\right),\] where $g_e$ is an increasing differentiable function with $g_e(1) = 1$. Previously convergence was only shown for the special case of the shortest path problem on a graph consisting of two nodes connected by parallel edges.
Export
BibTeX
@online{DBLP:journals/corr/abs-1901-07231, TITLE = {Convergence of the Non-Uniform Physarum Dynamics}, AUTHOR = {Karrenbauer, Andreas and Kolev, Pavel and Mehlhorn, Kurt}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1901.07231}, EPRINT = {1901.07231}, EPRINTTYPE = {arXiv}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Let $c \in \mathbb{Z}^m_{> 0}$, $A \in \mathbb{Z}^{n\times m}$, and $b \in \mathbb{Z}^n$. We show under fairly general conditions that the non-uniform Physarum dynamics \[ \dot{x}_e = a_e(x,t) \left(|q_e| -- x_e\right) \] converges to the optimum solution $x^*$ of the weighted basis pursuit problem minimize $c^T x$ subject to $A f = b$ and $|f| \le x$. Here, $f$ and $x$ are $m$-vectors of real variables, $q$ minimizes the energy $\sum_e (c_e/x_e) q_e^2$ subject to the constraints $A q = b$ and $\mathrm{supp}(q) \subseteq \mathrm{supp}(x)$, and $a_e(x,t) > 0$ is the reactivity of edge $e$ to the difference $|q_e| - x_e$ at time $t$ and in state $x$. Previously convergence was only shown for the uniform case $a_e(x,t) = 1$ for all $e$, $x$, and $t$. We also show convergence for the dynamics \[ \dot{x}_e = x_e \cdot \left( g_e \left(\frac{|q_e|}{x_e}\right) -- 1\right),\] where $g_e$ is an increasing differentiable function with $g_e(1) = 1$. Previously convergence was only shown for the special case of the shortest path problem on a graph consisting of two nodes connected by parallel edges.}, }
Endnote
%0 Report %A Karrenbauer, Andreas %A Kolev, Pavel %A 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 Convergence of the Non-Uniform Physarum Dynamics : %G eng %U http://hdl.handle.net/21.11116/0000-0002-F39F-9 %U http://arxiv.org/abs/1901.07231 %D 2019 %X Let $c \in \mathbb{Z}^m_{> 0}$, $A \in \mathbb{Z}^{n\times m}$, and $b \in \mathbb{Z}^n$. We show under fairly general conditions that the non-uniform Physarum dynamics \[ \dot{x}_e = a_e(x,t) \left(|q_e| - x_e\right) \] converges to the optimum solution $x^*$ of the weighted basis pursuit problem minimize $c^T x$ subject to $A f = b$ and $|f| \le x$. Here, $f$ and $x$ are $m$-vectors of real variables, $q$ minimizes the energy $\sum_e (c_e/x_e) q_e^2$ subject to the constraints $A q = b$ and $\mathrm{supp}(q) \subseteq \mathrm{supp}(x)$, and $a_e(x,t) > 0$ is the reactivity of edge $e$ to the difference $|q_e| - x_e$ at time $t$ and in state $x$. Previously convergence was only shown for the uniform case $a_e(x,t) = 1$ for all $e$, $x$, and $t$. We also show convergence for the dynamics \[ \dot{x}_e = x_e \cdot \left( g_e \left(\frac{|q_e|}{x_e}\right) - 1\right),\] where $g_e$ is an increasing differentiable function with $g_e(1) = 1$. Previously convergence was only shown for the special case of the shortest path problem on a graph consisting of two nodes connected by parallel edges. %K Computer Science, Data Structures and Algorithms, cs.DS
[41]
P. Khanchandani and C. Lenzen, “Self-Stabilizing Byzantine Clock Synchronization with Optimal Precision,” Theory of Computing Systems, vol. 63, no. 2, 2019.
Export
BibTeX
@article{Khanchandani2018, TITLE = {Self-Stabilizing {B}yzantine Clock Synchronization with Optimal Precision}, AUTHOR = {Khanchandani, Pankaj and Lenzen, Christoph}, LANGUAGE = {eng}, ISSN = {1432-4350}, DOI = {10.1007/s00224-017-9840-3}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, JOURNAL = {Theory of Computing Systems}, VOLUME = {63}, NUMBER = {2}, PAGES = {261--305}, }
Endnote
%0 Journal Article %A Khanchandani, Pankaj %A Lenzen, Christoph %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Self-Stabilizing Byzantine Clock Synchronization with Optimal Precision : %G eng %U http://hdl.handle.net/21.11116/0000-0000-73AC-D %R 10.1007/s00224-017-9840-3 %7 2018-01-20 %D 2019 %J Theory of Computing Systems %V 63 %N 2 %& 261 %P 261 - 305 %I Springer %C New York, NY %@ false
[42]
A. Kinali, “A Physical Sine-to-Square Converter Noise Model,” in IEEE International Frequency Control Symposium (IFCS 2018), Olympic Valley, CA, USA, 2019.
Export
BibTeX
@inproceedings{Kinali_IFCS2018, TITLE = {A Physical Sine-to-Square Converter Noise Model}, AUTHOR = {Kinali, Attila}, LANGUAGE = {eng}, ISBN = {978-1-5386-3214-7}, DOI = {10.1109/FCS.2018.8597525}, PUBLISHER = {IEEE}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {IEEE International Frequency Control Symposium (IFCS 2018)}, PAGES = {383--388}, ADDRESS = {Olympic Valley, CA, USA}, }
Endnote
%0 Conference Proceedings %A Kinali, Attila %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Physical Sine-to-Square Converter Noise Model : %G eng %U http://hdl.handle.net/21.11116/0000-0002-AC39-D %R 10.1109/FCS.2018.8597525 %D 2019 %B IEEE International Frequency Control Symposium %Z date of event: 2018-05-21 - 2018-05-24 %C Olympic Valley, CA, USA %B IEEE International Frequency Control Symposium %P 383 - 388 %I IEEE %@ 978-1-5386-3214-7
[43]
M. Künnemann, D. Moeller, R. Paturi, and S. Schneider, “Subquadratic Algorithms for Succinct Stable Matching,” Algorithmica, vol. 81, no. 7, 2019.
Export
BibTeX
@article{Kuennemann2019, TITLE = {Subquadratic Algorithms for Succinct Stable Matching}, AUTHOR = {K{\"u}nnemann, Marvin and Moeller, Daniel and Paturi, Ramamohan and Schneider, Stefan}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-019-00564-x}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, JOURNAL = {Algorithmica}, VOLUME = {81}, NUMBER = {7}, PAGES = {2991--3024}, }
Endnote
%0 Journal Article %A K&#252;nnemann, Marvin %A Moeller, Daniel %A Paturi, Ramamohan %A Schneider, Stefan %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Subquadratic Algorithms for Succinct Stable Matching : %G eng %U http://hdl.handle.net/21.11116/0000-0003-A7E0-3 %R 10.1007/s00453-019-00564-x %7 2019 %D 2019 %J Algorithmica %V 81 %N 7 %& 2991 %P 2991 - 3024 %I Springer %C New York, NY %@ false
[44]
C. Lenzen, B. Patt-Shamir, and D. Peleg, “Distributed Distance Computation and Routing with Small Messages,” Distributed Computing, vol. 32, no. 2, 2019.
Export
BibTeX
@article{Lenzen_DC2018, TITLE = {Distributed Distance Computation and Routing with Small Messages}, AUTHOR = {Lenzen, Christoph and Patt-Shamir, Boaz and Peleg, David}, LANGUAGE = {eng}, ISSN = {0178-2770}, DOI = {10.1007/s00446-018-0326-6}, PUBLISHER = {Springer International}, ADDRESS = {Berlin}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, JOURNAL = {Distributed Computing}, VOLUME = {32}, NUMBER = {2}, PAGES = {133--157}, }
Endnote
%0 Journal Article %A Lenzen, Christoph %A Patt-Shamir, Boaz %A Peleg, David %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Distributed Distance Computation and Routing with Small Messages : %G eng %U http://hdl.handle.net/21.11116/0000-0002-6CD1-9 %R 10.1007/s00446-018-0326-6 %7 2018 %D 2019 %J Distributed Computing %V 32 %N 2 %& 133 %P 133 - 157 %I Springer International %C Berlin %@ false
[45]
C. Lenzen, M. Parter, and E. Yogev, “Parallel Balanced Allocations: The Heavily Loaded Case,” in SPAA’19, 31st ACM Symposium on Parallelism in Algorithms and Architectures, Phoenix, AZ, USA. (Accepted/in press)
Export
BibTeX
@inproceedings{Lenzen_SPAA2019, TITLE = {Parallel Balanced Allocations: {T}he Heavily Loaded Case}, AUTHOR = {Lenzen, Christoph and Parter, Merav and Yogev, Eylon}, LANGUAGE = {eng}, PUBLISHER = {ACM}, YEAR = {2019}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {SPAA'19, 31st ACM Symposium on Parallelism in Algorithms and Architectures}, ADDRESS = {Phoenix, AZ, USA}, }
Endnote
%0 Conference Proceedings %A Lenzen, Christoph %A Parter, Merav %A Yogev, Eylon %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Parallel Balanced Allocations: The Heavily Loaded Case : %G eng %U http://hdl.handle.net/21.11116/0000-0003-6593-5 %D 2019 %B 31st ACM Symposium on Parallelism in Algorithms and Architectures %Z date of event: 2019-06-22 - 2019-06-24 %C Phoenix, AZ, USA %B SPAA'19 %I ACM
[46]
C. Lenzen, M. Parter, and E. Yogev, “Parallel Balanced Allocations: The Heavily Loaded Case,” 2019. [Online]. Available: http://arxiv.org/abs/1904.07532. (arXiv: 1904.07532)
Abstract
We study parallel algorithms for the classical balls-into-bins problem, in which $m$ balls acting in parallel as separate agents are placed into $n$ bins. Algorithms operate in synchronous rounds, in each of which balls and bins exchange messages once. The goal is to minimize the maximal load over all bins using a small number of rounds and few messages. While the case of $m=n$ balls has been extensively studied, little is known about the heavily loaded case. In this work, we consider parallel algorithms for this somewhat neglected regime of $m\gg n$. The naive solution of allocating each ball to a bin chosen uniformly and independently at random results in maximal load $m/n+\Theta(\sqrt{m/n\cdot \log n})$ (for $m\geq n \log n$) w.h.p. In contrast, for the sequential setting Berenbrink et al (SIAM J. Comput 2006) showed that letting each ball join the least loaded bin of two randomly selected bins reduces the maximal load to $m/n+O(\log\log m)$ w.h.p. To date, no parallel variant of such a result is known. We present a simple parallel threshold algorithm that obtains a maximal load of $m/n+O(1)$ w.h.p. within $O(\log\log (m/n)+\log^* n)$ rounds. The algorithm is symmetric (balls and bins all "look the same"), and balls send $O(1)$ messages in expectation per round. The additive term of $O(\log^* n)$ in the complexity is known to be tight for such algorithms (Lenzen and Wattenhofer Distributed Computing 2016). We also prove that our analysis is tight, i.e., algorithms of the type we provide must run for $\Omega(\min\{\log\log (m/n),n\})$ rounds w.h.p. Finally, we give a simple asymmetric algorithm (i.e., balls are aware of a common labeling of the bins) that achieves a maximal load of $m/n + O(1)$ in a constant number of rounds w.h.p. Again, balls send only a single message per round, and bins receive $(1+o(1))m/n+O(\log n)$ messages w.h.p.
Export
BibTeX
@online{Lenzen_arXiv1904.07532, TITLE = {Parallel Balanced Allocations: {T}he Heavily Loaded Case}, AUTHOR = {Lenzen, Christoph and Parter, Merav and Yogev, Eylon}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1904.07532}, EPRINT = {1904.07532}, EPRINTTYPE = {arXiv}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We study parallel algorithms for the classical balls-into-bins problem, in which $m$ balls acting in parallel as separate agents are placed into $n$ bins. Algorithms operate in synchronous rounds, in each of which balls and bins exchange messages once. The goal is to minimize the maximal load over all bins using a small number of rounds and few messages. While the case of $m=n$ balls has been extensively studied, little is known about the heavily loaded case. In this work, we consider parallel algorithms for this somewhat neglected regime of $m\gg n$. The naive solution of allocating each ball to a bin chosen uniformly and independently at random results in maximal load $m/n+\Theta(\sqrt{m/n\cdot \log n})$ (for $m\geq n \log n$) w.h.p. In contrast, for the sequential setting Berenbrink et al (SIAM J. Comput 2006) showed that letting each ball join the least loaded bin of two randomly selected bins reduces the maximal load to $m/n+O(\log\log m)$ w.h.p. To date, no parallel variant of such a result is known. We present a simple parallel threshold algorithm that obtains a maximal load of $m/n+O(1)$ w.h.p. within $O(\log\log (m/n)+\log^* n)$ rounds. The algorithm is symmetric (balls and bins all "look the same"), and balls send $O(1)$ messages in expectation per round. The additive term of $O(\log^* n)$ in the complexity is known to be tight for such algorithms (Lenzen and Wattenhofer Distributed Computing 2016). We also prove that our analysis is tight, i.e., algorithms of the type we provide must run for $\Omega(\min\{\log\log (m/n),n\})$ rounds w.h.p. Finally, we give a simple asymmetric algorithm (i.e., balls are aware of a common labeling of the bins) that achieves a maximal load of $m/n + O(1)$ in a constant number of rounds w.h.p. Again, balls send only a single message per round, and bins receive $(1+o(1))m/n+O(\log n)$ messages w.h.p.}, }
Endnote
%0 Report %A Lenzen, Christoph %A Parter, Merav %A Yogev, Eylon %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Parallel Balanced Allocations: The Heavily Loaded Case : %G eng %U http://hdl.handle.net/21.11116/0000-0003-B3A4-9 %U http://arxiv.org/abs/1904.07532 %D 2019 %X We study parallel algorithms for the classical balls-into-bins problem, in which $m$ balls acting in parallel as separate agents are placed into $n$ bins. Algorithms operate in synchronous rounds, in each of which balls and bins exchange messages once. The goal is to minimize the maximal load over all bins using a small number of rounds and few messages. While the case of $m=n$ balls has been extensively studied, little is known about the heavily loaded case. In this work, we consider parallel algorithms for this somewhat neglected regime of $m\gg n$. The naive solution of allocating each ball to a bin chosen uniformly and independently at random results in maximal load $m/n+\Theta(\sqrt{m/n\cdot \log n})$ (for $m\geq n \log n$) w.h.p. In contrast, for the sequential setting Berenbrink et al (SIAM J. Comput 2006) showed that letting each ball join the least loaded bin of two randomly selected bins reduces the maximal load to $m/n+O(\log\log m)$ w.h.p. To date, no parallel variant of such a result is known. We present a simple parallel threshold algorithm that obtains a maximal load of $m/n+O(1)$ w.h.p. within $O(\log\log (m/n)+\log^* n)$ rounds. The algorithm is symmetric (balls and bins all "look the same"), and balls send $O(1)$ messages in expectation per round. The additive term of $O(\log^* n)$ in the complexity is known to be tight for such algorithms (Lenzen and Wattenhofer Distributed Computing 2016). We also prove that our analysis is tight, i.e., algorithms of the type we provide must run for $\Omega(\min\{\log\log (m/n),n\})$ rounds w.h.p. Finally, we give a simple asymmetric algorithm (i.e., balls are aware of a common labeling of the bins) that achieves a maximal load of $m/n + O(1)$ in a constant number of rounds w.h.p. Again, balls send only a single message per round, and bins receive $(1+o(1))m/n+O(\log n)$ messages w.h.p. %K Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC
[47]
A. Miller, B. Patt-Shamir, and W. Rosenbaum, “With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing,” 2019. [Online]. Available: http://arxiv.org/abs/1902.08069. (arXiv: 1902.08069)
Abstract
We consider the Adversarial Queuing Theory (AQT) model, where packet arrivals are subject to a maximum average rate $0\le\rho\le1$ and burstiness $\sigma\ge0$. In this model, we analyze the size of buffers required to avoid overflows in the basic case of a path. Our main results characterize the space required by the average rate and the number of distinct destinations: we show that $O(k d^{1/k})$ space suffice, where $d$ is the number of distinct destinations and $k=\lfloor 1/\rho \rfloor$; and we show that $\Omega(\frac 1 k d^{1/k})$ space is necessary. For directed trees, we describe an algorithm whose buffer space requirement is at most $1 + d' + \sigma$ where $d'$ is the maximum number of destinations on any root-leaf path.
Export
BibTeX
@online{Miller_arXiv1902.08069, TITLE = {With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing}, AUTHOR = {Miller, Avery and Patt-Shamir, Boaz and Rosenbaum, Will}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1902.08069}, EPRINT = {1902.08069}, EPRINTTYPE = {arXiv}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We consider the Adversarial Queuing Theory (AQT) model, where packet arrivals are subject to a maximum average rate $0\le\rho\le1$ and burstiness $\sigma\ge0$. In this model, we analyze the size of buffers required to avoid overflows in the basic case of a path. Our main results characterize the space required by the average rate and the number of distinct destinations: we show that $O(k d^{1/k})$ space suffice, where $d$ is the number of distinct destinations and $k=\lfloor 1/\rho \rfloor$; and we show that $\Omega(\frac 1 k d^{1/k})$ space is necessary. For directed trees, we describe an algorithm whose buffer space requirement is at most $1 + d' + \sigma$ where $d'$ is the maximum number of destinations on any root-leaf path.}, }
Endnote
%0 Report %A Miller, Avery %A Patt-Shamir, Boaz %A Rosenbaum, Will %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing : %G eng %U http://hdl.handle.net/21.11116/0000-0003-0CD3-2 %U http://arxiv.org/abs/1902.08069 %D 2019 %X We consider the Adversarial Queuing Theory (AQT) model, where packet arrivals are subject to a maximum average rate $0\le\rho\le1$ and burstiness $\sigma\ge0$. In this model, we analyze the size of buffers required to avoid overflows in the basic case of a path. Our main results characterize the space required by the average rate and the number of distinct destinations: we show that $O(k d^{1/k})$ space suffice, where $d$ is the number of distinct destinations and $k=\lfloor 1/\rho \rfloor$; and we show that $\Omega(\frac 1 k d^{1/k})$ space is necessary. For directed trees, we describe an algorithm whose buffer space requirement is at most $1 + d' + \sigma$ where $d'$ is the maximum number of destinations on any root-leaf path. %K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC
[48]
E. Oh, “Optimal Algorithm for Geodesic Nearest-point Voronoi Diagrams in Simple Polygons,” in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), San Diego, CA, USA, 2019.
Export
BibTeX
@inproceedings{Oh_SODA19d, TITLE = {Optimal Algorithm for Geodesic Nearest-point {V}oronoi Diagrams in Simple Polygons}, AUTHOR = {Oh, Eunjin}, LANGUAGE = {eng}, ISBN = {978-1-61197-548-2}, DOI = {10.1137/1.9781611975482.25}, PUBLISHER = {SIAM}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, BOOKTITLE = {Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019)}, EDITOR = {Chan, Timothy M.}, PAGES = {391--409}, ADDRESS = {San Diego, CA, USA}, }
Endnote
%0 Conference Proceedings %A Oh, Eunjin %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Optimal Algorithm for Geodesic Nearest-point Voronoi Diagrams in Simple Polygons : %G eng %U http://hdl.handle.net/21.11116/0000-0002-AA78-8 %R 10.1137/1.9781611975482.25 %D 2019 %B 30th Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2019-01-06 - 2019-01-09 %C San Diego, CA, USA %B Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms %E Chan, Timothy M. %P 391 - 409 %I SIAM %@ 978-1-61197-548-2
[49]
E. Oh and H.-K. Ahn, “A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-Off Algorithms,” Algorithmica, vol. 81, no. 7, 2019.
Export
BibTeX
@article{Oh2019, TITLE = {A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-Off Algorithms}, AUTHOR = {Oh, Eunjin and Ahn, Hee-Kap}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-019-00558-9}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, JOURNAL = {Algorithmica}, VOLUME = {81}, NUMBER = {7}, PAGES = {2829--2856}, }
Endnote
%0 Journal Article %A Oh, Eunjin %A Ahn, Hee-Kap %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-Off Algorithms : %G eng %U http://hdl.handle.net/21.11116/0000-0003-A7DE-7 %R 10.1007/s00453-019-00558-9 %7 2019 %D 2019 %J Algorithmica %V 81 %N 7 %& 2829 %P 2829 - 2856 %I Springer %C New York, NY %@ false
[50]
E. Oh and H.-K. Ahn, “Assigning Weights to Minimize the Covering Radius in the Plane,” Computational Geometry: Theory and Applications, vol. 81, 2019.
Export
BibTeX
@article{Oh2019, TITLE = {Assigning Weights to Minimize the Covering Radius in the Plane}, AUTHOR = {Oh, Eunjin and Ahn, Hee-Kap}, LANGUAGE = {eng}, ISSN = {0925-7721}, DOI = {10.1016/j.comgeo.2018.10.007}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, JOURNAL = {Computational Geometry: Theory and Applications}, VOLUME = {81}, PAGES = {22--32}, }
Endnote
%0 Journal Article %A Oh, Eunjin %A Ahn, Hee-Kap %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Assigning Weights to Minimize the Covering Radius in the Plane : %G eng %U http://hdl.handle.net/21.11116/0000-0003-C34C-C %R 10.1016/j.comgeo.2018.10.007 %7 2019 %D 2019 %J Computational Geometry: Theory and Applications %V 81 %& 22 %P 22 - 32 %I Elsevier %C Amsterdam %@ false
2018
[51]
A. Abboud, A. Backurs, K. Bringmann, and M. Künnemann, “Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-And-Solve,” 2018. [Online]. Available: http://arxiv.org/abs/1803.00796. (arXiv: 1803.00796)
Abstract
Can we analyze data without decompressing it? As our data keeps growing, understanding the time complexity of problems on compressed inputs, rather than in convenient uncompressed forms, becomes more and more relevant. Suppose we are given a compression of size $n$ of data that originally has size $N$, and we want to solve a problem with time complexity $T(\cdot)$. The naive strategy of "decompress-and-solve" gives time $T(N)$, whereas "the gold standard" is time $T(n)$: to analyze the compression as efficiently as if the original data was small. We restrict our attention to data in the form of a string (text, files, genomes, etc.) and study the most ubiquitous tasks. While the challenge might seem to depend heavily on the specific compression scheme, most methods of practical relevance (Lempel-Ziv-family, dictionary methods, and others) can be unified under the elegant notion of Grammar Compressions. A vast literature, across many disciplines, established this as an influential notion for Algorithm design. We introduce a framework for proving (conditional) lower bounds in this field, allowing us to assess whether decompress-and-solve can be improved, and by how much. Our main results are: - The $O(nN\sqrt{\log{N/n}})$ bound for LCS and the $O(\min\{N \log N, nM\})$ bound for Pattern Matching with Wildcards are optimal up to $N^{o(1)}$ factors, under the Strong Exponential Time Hypothesis. (Here, $M$ denotes the uncompressed length of the compressed pattern.) - Decompress-and-solve is essentially optimal for Context-Free Grammar Parsing and RNA Folding, under the $k$-Clique conjecture. - We give an algorithm showing that decompress-and-solve is not optimal for Disjointness.
Export
BibTeX
@online{Abboud_arXiv1803.00796, TITLE = {Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-And-Solve}, AUTHOR = {Abboud, Amir and Backurs, Arturs and Bringmann, Karl and K{\"u}nnemann, Marvin}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1803.00796}, EPRINT = {1803.00796}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Can we analyze data without decompressing it? As our data keeps growing, understanding the time complexity of problems on compressed inputs, rather than in convenient uncompressed forms, becomes more and more relevant. Suppose we are given a compression of size $n$ of data that originally has size $N$, and we want to solve a problem with time complexity $T(\cdot)$. The naive strategy of "decompress-and-solve" gives time $T(N)$, whereas "the gold standard" is time $T(n)$: to analyze the compression as efficiently as if the original data was small. We restrict our attention to data in the form of a string (text, files, genomes, etc.) and study the most ubiquitous tasks. While the challenge might seem to depend heavily on the specific compression scheme, most methods of practical relevance (Lempel-Ziv-family, dictionary methods, and others) can be unified under the elegant notion of Grammar Compressions. A vast literature, across many disciplines, established this as an influential notion for Algorithm design. We introduce a framework for proving (conditional) lower bounds in this field, allowing us to assess whether decompress-and-solve can be improved, and by how much. Our main results are: -- The $O(nN\sqrt{\log{N/n}})$ bound for LCS and the $O(\min\{N \log N, nM\})$ bound for Pattern Matching with Wildcards are optimal up to $N^{o(1)}$ factors, under the Strong Exponential Time Hypothesis. (Here, $M$ denotes the uncompressed length of the compressed pattern.) -- Decompress-and-solve is essentially optimal for Context-Free Grammar Parsing and RNA Folding, under the $k$-Clique conjecture. -- We give an algorithm showing that decompress-and-solve is not optimal for Disjointness.}, }
Endnote
%0 Report %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 Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-And-Solve : %G eng %U http://hdl.handle.net/21.11116/0000-0001-3E38-C %U http://arxiv.org/abs/1803.00796 %D 2018 %X Can we analyze data without decompressing it? As our data keeps growing, understanding the time complexity of problems on compressed inputs, rather than in convenient uncompressed forms, becomes more and more relevant. Suppose we are given a compression of size $n$ of data that originally has size $N$, and we want to solve a problem with time complexity $T(\cdot)$. The naive strategy of "decompress-and-solve" gives time $T(N)$, whereas "the gold standard" is time $T(n)$: to analyze the compression as efficiently as if the original data was small. We restrict our attention to data in the form of a string (text, files, genomes, etc.) and study the most ubiquitous tasks. While the challenge might seem to depend heavily on the specific compression scheme, most methods of practical relevance (Lempel-Ziv-family, dictionary methods, and others) can be unified under the elegant notion of Grammar Compressions. A vast literature, across many disciplines, established this as an influential notion for Algorithm design. We introduce a framework for proving (conditional) lower bounds in this field, allowing us to assess whether decompress-and-solve can be improved, and by how much. Our main results are: - The $O(nN\sqrt{\log{N/n}})$ bound for LCS and the $O(\min\{N \log N, nM\})$ bound for Pattern Matching with Wildcards are optimal up to $N^{o(1)}$ factors, under the Strong Exponential Time Hypothesis. (Here, $M$ denotes the uncompressed length of the compressed pattern.) - Decompress-and-solve is essentially optimal for Context-Free Grammar Parsing and RNA Folding, under the $k$-Clique conjecture. - We give an algorithm showing that decompress-and-solve is not optimal for Disjointness. %K Computer Science, Computational Complexity, cs.CC,Computer Science, Data Structures and Algorithms, cs.DS
[52]
A. Abboud, K. Bringmann, H. Dell, and J. Nederlof, “More Consequences of Falsifying SETH and the Orthogonal Vectors Conjecture,” in STOC’18, 50th Annual ACM SIGACT Symposium on Theory of Computing, Los Angeles, CA, USA, 2018.
Export
BibTeX
@inproceedings{Abboud_STOC2018, TITLE = {More Consequences of Falsifying {SETH} and the Orthogonal Vectors Conjecture}, AUTHOR = {Abboud, Amir and Bringmann, Karl and Dell, Holger and Nederlof, Jesper}, LANGUAGE = {eng}, ISBN = {978-1-4503-5559-9}, DOI = {10.1145/3188745.3188938}, PUBLISHER = {ACM}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, BOOKTITLE = {STOC'18, 50th Annual ACM SIGACT Symposium on Theory of Computing}, PAGES = {253--266}, ADDRESS = {Los Angeles, CA, USA}, }
Endnote
%0 Conference Proceedings %A Abboud, Amir %A Bringmann, Karl %A Dell, Holger %A Nederlof, Jesper %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T More Consequences of Falsifying SETH and the Orthogonal Vectors Conjecture : %G eng %U http://hdl.handle.net/21.11116/0000-0002-1707-D %R 10.1145/3188745.3188938 %D 2018 %B 50th Annual ACM SIGACT Symposium on Theory of Computing %Z date of event: 2018-06-25 - 2017-06-29 %C Los Angeles, CA, USA %B STOC'18 %P 253 - 266 %I ACM %@ 978-1-4503-5559-9
[53]
A. Abboud and K. Bringmann, “Tighter Connections Between Formula-SAT and Shaving Logs,” in 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Prague, Czech Republic, 2018.
Export
BibTeX
@inproceedings{Abboud_ICALP2018, TITLE = {Tighter Connections Between Formula-{SAT} and Shaving Logs}, AUTHOR = {Abboud, Amir and Bringmann, Karl}, LANGUAGE = {eng}, ISBN = {978-3-95977-076-7}, URL = {urn:nbn:de:0030-drops-90129}, DOI = {10.4230/LIPIcs.ICALP.2018.8}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, EDITOR = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D{\'a}niel and Sannella, Donald}, PAGES = {1--18}, EID = {8}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {107}, ADDRESS = {Prague, Czech Republic}, }
Endnote
%0 Conference Proceedings %A Abboud, Amir %A Bringmann, Karl %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Tighter Connections Between Formula-SAT and Shaving Logs : %G eng %U http://hdl.handle.net/21.11116/0000-0002-16FB-B %R 10.4230/LIPIcs.ICALP.2018.8 %U urn:nbn:de:0030-drops-90129 %D 2018 %B 45th International Colloquium on Automata, Languages, and Programming %Z date of event: 2018-07-09 - 2018-07-13 %C Prague, Czech Republic %B 45th International Colloquium on Automata, Languages, and Programming %E Chatzigiannakis, Ioannis; Kaklamanis, Christos; Marx, D&#225;niel; Sannella, Donald %P 1 - 18 %Z sequence number: 8 %I Schloss Dagstuhl %@ 978-3-95977-076-7 %B Leibniz International Proceedings in Informatics %N 107 %U http://drops.dagstuhl.de/opus/volltexte/2018/9012/http://drops.dagstuhl.de/doku/urheberrecht1.html
[54]
A. Abboud and K. Bringmann, “Tighter Connections Between Formula-SAT and Shaving Logs,” 2018. [Online]. Available: http://arxiv.org/abs/1804.08978. (arXiv: 1804.08978)
Abstract
A noticeable fraction of Algorithms papers in the last few decades improve the running time of well-known algorithms for fundamental problems by logarithmic factors. For example, the $O(n^2)$ dynamic programming solution to the Longest Common Subsequence problem (LCS) was improved to $O(n^2/\log^2 n)$ in several ways and using a variety of ingenious tricks. This line of research, also known as "the art of shaving log factors", lacks a tool for proving negative results. Specifically, how can we show that it is unlikely that LCS can be solved in time $O(n^2/\log^3 n)$? Perhaps the only approach for such results was suggested in a recent paper of Abboud, Hansen, Vassilevska W. and Williams (STOC'16). The authors blame the hardness of shaving logs on the hardness of solving satisfiability on Boolean formulas (Formula-SAT) faster than exhaustive search. They show that an $O(n^2/\log^{1000} n)$ algorithm for LCS would imply a major advance in circuit lower bounds. Whether this approach can lead to tighter barriers was unclear. In this paper, we push this approach to its limit and, in particular, prove that a well-known barrier from complexity theory stands in the way for shaving five additional log factors for fundamental combinatorial problems. For LCS, regular expression pattern matching, as well as the Fr\'echet distance problem from Computational Geometry, we show that an $O(n^2/\log^{7+\varepsilon} n)$ runtime would imply new Formula-SAT algorithms. Our main result is a reduction from SAT on formulas of size $s$ over $n$ variables to LCS on sequences of length $N=2^{n/2} \cdot s^{1+o(1)}$. Our reduction is essentially as efficient as possible, and it greatly improves the previously known reduction for LCS with $N=2^{n/2} \cdot s^c$, for some $c \geq 100$.
Export
BibTeX
@online{Abboud_arXiv1804.08978, TITLE = {Tighter Connections Between Formula-{SAT} and Shaving Logs}, AUTHOR = {Abboud, Amir and Bringmann, Karl}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1804.08978}, EPRINT = {1804.08978}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {A noticeable fraction of Algorithms papers in the last few decades improve the running time of well-known algorithms for fundamental problems by logarithmic factors. For example, the $O(n^2)$ dynamic programming solution to the Longest Common Subsequence problem (LCS) was improved to $O(n^2/\log^2 n)$ in several ways and using a variety of ingenious tricks. This line of research, also known as "the art of shaving log factors", lacks a tool for proving negative results. Specifically, how can we show that it is unlikely that LCS can be solved in time $O(n^2/\log^3 n)$? Perhaps the only approach for such results was suggested in a recent paper of Abboud, Hansen, Vassilevska W. and Williams (STOC'16). The authors blame the hardness of shaving logs on the hardness of solving satisfiability on Boolean formulas (Formula-SAT) faster than exhaustive search. They show that an $O(n^2/\log^{1000} n)$ algorithm for LCS would imply a major advance in circuit lower bounds. Whether this approach can lead to tighter barriers was unclear. In this paper, we push this approach to its limit and, in particular, prove that a well-known barrier from complexity theory stands in the way for shaving five additional log factors for fundamental combinatorial problems. For LCS, regular expression pattern matching, as well as the Fr\'echet distance problem from Computational Geometry, we show that an $O(n^2/\log^{7+\varepsilon} n)$ runtime would imply new Formula-SAT algorithms. Our main result is a reduction from SAT on formulas of size $s$ over $n$ variables to LCS on sequences of length $N=2^{n/2} \cdot s^{1+o(1)}$. Our reduction is essentially as efficient as possible, and it greatly improves the previously known reduction for LCS with $N=2^{n/2} \cdot s^c$, for some $c \geq 100$.}, }
Endnote
%0 Report %A Abboud, Amir %A Bringmann, Karl %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Tighter Connections Between Formula-SAT and Shaving Logs : %G eng %U http://hdl.handle.net/21.11116/0000-0001-3DF7-5 %U http://arxiv.org/abs/1804.08978 %D 2018 %X A noticeable fraction of Algorithms papers in the last few decades improve the running time of well-known algorithms for fundamental problems by logarithmic factors. For example, the $O(n^2)$ dynamic programming solution to the Longest Common Subsequence problem (LCS) was improved to $O(n^2/\log^2 n)$ in several ways and using a variety of ingenious tricks. This line of research, also known as "the art of shaving log factors", lacks a tool for proving negative results. Specifically, how can we show that it is unlikely that LCS can be solved in time $O(n^2/\log^3 n)$? Perhaps the only approach for such results was suggested in a recent paper of Abboud, Hansen, Vassilevska W. and Williams (STOC'16). The authors blame the hardness of shaving logs on the hardness of solving satisfiability on Boolean formulas (Formula-SAT) faster than exhaustive search. They show that an $O(n^2/\log^{1000} n)$ algorithm for LCS would imply a major advance in circuit lower bounds. Whether this approach can lead to tighter barriers was unclear. In this paper, we push this approach to its limit and, in particular, prove that a well-known barrier from complexity theory stands in the way for shaving five additional log factors for fundamental combinatorial problems. For LCS, regular expression pattern matching, as well as the Fr\'echet distance problem from Computational Geometry, we show that an $O(n^2/\log^{7+\varepsilon} n)$ runtime would imply new Formula-SAT algorithms. Our main result is a reduction from SAT on formulas of size $s$ over $n$ variables to LCS on sequences of length $N=2^{n/2} \cdot s^{1+o(1)}$. Our reduction is essentially as efficient as possible, and it greatly improves the previously known reduction for LCS with $N=2^{n/2} \cdot s^c$, for some $c \geq 100$. %K Computer Science, Computational Complexity, cs.CC,Computer Science, Data Structures and Algorithms, cs.DS
[55]
A. Abboud, K. Bringmann, D. Hermelin, and D. Shabtay, “SETH-Based Lower Bounds for Subset Sum and Bicriteria Path,” 2018. [Online]. Available: http://arxiv.org/abs/1704.04546. (arXiv: 1704.04546)
Abstract
Subset-Sum and k-SAT are two of the most extensively studied problems in computer science, and conjectures about their hardness are among the cornerstones of fine-grained complexity. One of the most intriguing open problems in this area is to base the hardness of one of these problems on the other. Our main result is a tight reduction from k-SAT to Subset-Sum on dense instances, proving that Bellman's 1962 pseudo-polynomial $O^{*}(T)$-time algorithm for Subset-Sum on $n$ numbers and target $T$ cannot be improved to time $T^{1-\varepsilon}\cdot 2^{o(n)}$ for any $\varepsilon>0$, unless the Strong Exponential Time Hypothesis (SETH) fails. This is one of the strongest known connections between any two of the core problems of fine-grained complexity. As a corollary, we prove a "Direct-OR" theorem for Subset-Sum under SETH, offering a new tool for proving conditional lower bounds: It is now possible to assume that deciding whether one out of $N$ given instances of Subset-Sum is a YES instance requires time $(N T)^{1-o(1)}$. As an application of this corollary, we prove a tight SETH-based lower bound for the classical Bicriteria s,t-Path problem, which is extensively studied in Operations Research. We separate its complexity from that of Subset-Sum: On graphs with $m$ edges and edge lengths bounded by $L$, we show that the $O(Lm)$ pseudo-polynomial time algorithm by Joksch from 1966 cannot be improved to $\tilde{O}(L+m)$, in contrast to a recent improvement for Subset Sum (Bringmann, SODA 2017).
Export
BibTeX
@online{Abboud_arXiv1704.04546, 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}, URL = {http://arxiv.org/abs/1704.04546}, EPRINT = {1704.04546}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Subset-Sum and k-SAT are two of the most extensively studied problems in computer science, and conjectures about their hardness are among the cornerstones of fine-grained complexity. One of the most intriguing open problems in this area is to base the hardness of one of these problems on the other. Our main result is a tight reduction from k-SAT to Subset-Sum on dense instances, proving that Bellman's 1962 pseudo-polynomial $O^{*}(T)$-time algorithm for Subset-Sum on $n$ numbers and target $T$ cannot be improved to time $T^{1-\varepsilon}\cdot 2^{o(n)}$ for any $\varepsilon>0$, unless the Strong Exponential Time Hypothesis (SETH) fails. This is one of the strongest known connections between any two of the core problems of fine-grained complexity. As a corollary, we prove a "Direct-OR" theorem for Subset-Sum under SETH, offering a new tool for proving conditional lower bounds: It is now possible to assume that deciding whether one out of $N$ given instances of Subset-Sum is a YES instance requires time $(N T)^{1-o(1)}$. As an application of this corollary, we prove a tight SETH-based lower bound for the classical Bicriteria s,t-Path problem, which is extensively studied in Operations Research. We separate its complexity from that of Subset-Sum: On graphs with $m$ edges and edge lengths bounded by $L$, we show that the $O(Lm)$ pseudo-polynomial time algorithm by Joksch from 1966 cannot be improved to $\tilde{O}(L+m)$, in contrast to a recent improvement for Subset Sum (Bringmann, SODA 2017).}, }
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 SETH-Based Lower Bounds for Subset Sum and Bicriteria Path : %G eng %U http://hdl.handle.net/21.11116/0000-0002-9E17-3 %U http://arxiv.org/abs/1704.04546 %D 2018 %X Subset-Sum and k-SAT are two of the most extensively studied problems in computer science, and conjectures about their hardness are among the cornerstones of fine-grained complexity. One of the most intriguing open problems in this area is to base the hardness of one of these problems on the other. Our main result is a tight reduction from k-SAT to Subset-Sum on dense instances, proving that Bellman's 1962 pseudo-polynomial $O^{*}(T)$-time algorithm for Subset-Sum on $n$ numbers and target $T$ cannot be improved to time $T^{1-\varepsilon}\cdot 2^{o(n)}$ for any $\varepsilon>0$, unless the Strong Exponential Time Hypothesis (SETH) fails. This is one of the strongest known connections between any two of the core problems of fine-grained complexity. As a corollary, we prove a "Direct-OR" theorem for Subset-Sum under SETH, offering a new tool for proving conditional lower bounds: It is now possible to assume that deciding whether one out of $N$ given instances of Subset-Sum is a YES instance requires time $(N T)^{1-o(1)}$. As an application of this corollary, we prove a tight SETH-based lower bound for the classical Bicriteria s,t-Path problem, which is extensively studied in Operations Research. We separate its complexity from that of Subset-Sum: On graphs with $m$ edges and edge lengths bounded by $L$, we show that the $O(Lm)$ pseudo-polynomial time algorithm by Joksch from 1966 cannot be improved to $\tilde{O}(L+m)$, in contrast to a recent improvement for Subset Sum (Bringmann, SODA 2017). %K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Computational Complexity, cs.CC
[56]
M. Abrahamsen, A. Adamaszek, K. Bringmann, V. Cohen-Addad, M. Mehr, E. Rotenberg, A. Roytman, and M. Thorup, “Fast Fencing,” 2018. [Online]. Available: http://arxiv.org/abs/1804.00101. (arXiv: 1804.00101)
Abstract
We consider very natural "fence enclosure" problems studied by Capoyleas, Rote, and Woeginger and Arkin, Khuller, and Mitchell in the early 90s. Given a set $S$ of $n$ points in the plane, we aim at finding a set of closed curves such that (1) each point is enclosed by a curve and (2) the total length of the curves is minimized. We consider two main variants. In the first variant, we pay a unit cost per curve in addition to the total length of the curves. An equivalent formulation of this version is that we have to enclose $n$ unit disks, paying only the total length of the enclosing curves. In the other variant, we are allowed to use at most $k$ closed curves and pay no cost per curve. For the variant with at most $k$ closed curves, we present an algorithm that is polynomial in both $n$ and $k$. For the variant with unit cost per curve, or unit disks, we present a near-linear time algorithm. Capoyleas, Rote, and Woeginger solved the problem with at most $k$ curves in $n^{O(k)}$ time. Arkin, Khuller, and Mitchell used this to solve the unit cost per curve version in exponential time. At the time, they conjectured that the problem with $k$ curves is NP-hard for general $k$. Our polynomial time algorithm refutes this unless P equals NP.
Export
BibTeX
@online{Abrahamsen_arXiv1804.00101, TITLE = {Fast Fencing}, AUTHOR = {Abrahamsen, Mikkel and Adamaszek, Anna and Bringmann, Karl and Cohen-Addad, Vincent and Mehr, Mehran and Rotenberg, Eva and Roytman, Alan and Thorup, Mikkel}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1804.00101}, EPRINT = {1804.00101}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We consider very natural "fence enclosure" problems studied by Capoyleas, Rote, and Woeginger and Arkin, Khuller, and Mitchell in the early 90s. Given a set $S$ of $n$ points in the plane, we aim at finding a set of closed curves such that (1) each point is enclosed by a curve and (2) the total length of the curves is minimized. We consider two main variants. In the first variant, we pay a unit cost per curve in addition to the total length of the curves. An equivalent formulation of this version is that we have to enclose $n$ unit disks, paying only the total length of the enclosing curves. In the other variant, we are allowed to use at most $k$ closed curves and pay no cost per curve. For the variant with at most $k$ closed curves, we present an algorithm that is polynomial in both $n$ and $k$. For the variant with unit cost per curve, or unit disks, we present a near-linear time algorithm. Capoyleas, Rote, and Woeginger solved the problem with at most $k$ curves in $n^{O(k)}$ time. Arkin, Khuller, and Mitchell used this to solve the unit cost per curve version in exponential time. At the time, they conjectured that the problem with $k$ curves is NP-hard for general $k$. Our polynomial time algorithm refutes this unless P equals NP.}, }
Endnote
%0 Report %A Abrahamsen, Mikkel %A Adamaszek, Anna %A Bringmann, Karl %A Cohen-Addad, Vincent %A Mehr, Mehran %A Rotenberg, Eva %A Roytman, Alan %A Thorup, Mikkel %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations External Organizations %T Fast Fencing : %G eng %U http://hdl.handle.net/21.11116/0000-0001-3DFE-E %U http://arxiv.org/abs/1804.00101 %D 2018 %X We consider very natural "fence enclosure" problems studied by Capoyleas, Rote, and Woeginger and Arkin, Khuller, and Mitchell in the early 90s. Given a set $S$ of $n$ points in the plane, we aim at finding a set of closed curves such that (1) each point is enclosed by a curve and (2) the total length of the curves is minimized. We consider two main variants. In the first variant, we pay a unit cost per curve in addition to the total length of the curves. An equivalent formulation of this version is that we have to enclose $n$ unit disks, paying only the total length of the enclosing curves. In the other variant, we are allowed to use at most $k$ closed curves and pay no cost per curve. For the variant with at most $k$ closed curves, we present an algorithm that is polynomial in both $n$ and $k$. For the variant with unit cost per curve, or unit disks, we present a near-linear time algorithm. Capoyleas, Rote, and Woeginger solved the problem with at most $k$ curves in $n^{O(k)}$ time. Arkin, Khuller, and Mitchell used this to solve the unit cost per curve version in exponential time. At the time, they conjectured that the problem with $k$ curves is NP-hard for general $k$. Our polynomial time algorithm refutes this unless P equals NP. %K Computer Science, Computational Geometry, cs.CG
[57]
M. Abrahamsen, A. Adamaszek, K. Bringmann, V. Cohen-Addad, M. Mehr, E. Rotenberg, A. Roytman, and M. Thorup, “Fast Fencing,” in STOC’18, 50th Annual ACM SIGACT Symposium on Theory of Computing, Los Angeles, CA, USA, 2018.
Export
BibTeX
@inproceedings{Abrahamsen_STOC2018, TITLE = {Fast Fencing}, AUTHOR = {Abrahamsen, Mikkel and Adamaszek, Anna and Bringmann, Karl and Cohen-Addad, Vincent and Mehr, Mehran and Rotenberg, Eva and Roytman, Alan and Thorup, Mikkel}, LANGUAGE = {eng}, ISBN = {978-1-4503-5559-9}, DOI = {10.1145/3188745.3188878}, PUBLISHER = {ACM}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, BOOKTITLE = {STOC'18, 50th Annual ACM SIGACT Symposium on Theory of Computing}, PAGES = {564--573}, ADDRESS = {Los Angeles, CA, USA}, }
Endnote
%0 Conference Proceedings %A Abrahamsen, Mikkel %A Adamaszek, Anna %A Bringmann, Karl %A Cohen-Addad, Vincent %A Mehr, Mehran %A Rotenberg, Eva %A Roytman, Alan %A Thorup, Mikkel %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations External Organizations %T Fast Fencing : %G eng %U http://hdl.handle.net/21.11116/0000-0002-171F-3 %R 10.1145/3188745.3188878 %D 2018 %B 50th Annual ACM SIGACT Symposium on Theory of Computing %Z date of event: 2018-06-25 - 2017-06-29 %C Los Angeles, CA, USA %B STOC'18 %P 564 - 573 %I ACM %@ 978-1-4503-5559-9
[58]
A. Adamaszek, P. Chalermsook, A. Ene, and A. Wiese, “Submodular Unsplittable Flow on Trees,” Mathematical Programming / B, vol. 172, no. 1–2, 2018.
Export
BibTeX
@article{Adamaszek2018, TITLE = {Submodular Unsplittable Flow on Trees}, AUTHOR = {Adamaszek, Anna and Chalermsook, Parinya and Ene, Alina and Wiese, Andreas}, LANGUAGE = {eng}, ISSN = {0025-5610}, DOI = {10.1007/s10107-017-1218-4}, PUBLISHER = {Springer}, ADDRESS = {Berlin}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, JOURNAL = {Mathematical Programming / B}, VOLUME = {172}, NUMBER = {1-2}, PAGES = {565--589}, }
Endnote
%0 Journal Article %A Adamaszek, Anna %A Chalermsook, Parinya %A Ene, Alina %A Wiese, Andreas %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Submodular Unsplittable Flow on Trees : %G eng %U http://hdl.handle.net/21.11116/0000-0000-73B6-1 %R 10.1007/s10107-017-1218-4 %7 2018-01-17 %D 2018 %J Mathematical Programming / B %V 172 %N 1-2 %& 565 %P 565 - 589 %I Springer %C Berlin %@ false
[59]
A. Adamaszek, A. Antoniadis, A. Kumar, and T. Mömke, “Approximating Airports and Railways,” in 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), Caen, France, 2018.
Export
BibTeX
@inproceedings{Adamaszek_STACS2018, TITLE = {Approximating Airports and Railways}, AUTHOR = {Adamaszek, Anna and Antoniadis, Antonios and Kumar, Amit and M{\"o}mke, Tobias}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-062-0}, URL = {urn:nbn:de:0030-drops-85183}, DOI = {10.4230/LIPIcs.STACS.2018.5}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)}, EDITOR = {Niedermeier, Rolf and Vall{\'e}e, Brigitte}, PAGES = {1--13}, EID = {5}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {96}, ADDRESS = {Caen, France}, }
Endnote
%0 Conference Proceedings %A Adamaszek, Anna %A Antoniadis, Antonios %A Kumar, Amit %A M&#246;mke, Tobias %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Approximating Airports and Railways : %G eng %U http://hdl.handle.net/21.11116/0000-0002-9F43-0 %R 10.4230/LIPIcs.STACS.2018.5 %U urn:nbn:de:0030-drops-85183 %D 2018 %B 35th Symposium on Theoretical Aspects of Computer Science %Z date of event: 2018-02-28 - 2018-03-03 %C Caen, France %B 35th Symposium on Theoretical Aspects of Computer Science %E Niedermeier, Rolf; Vall&#233;e, Brigitte %P 1 - 13 %Z sequence number: 5 %I Schloss Dagstuhl %@ 978-3-95977-062-0 %B Leibniz International Proceedings in Informatics %N 96 %@ false %U http://drops.dagstuhl.de/opus/volltexte/2018/8518/http://drops.dagstuhl.de/doku/urheberrecht1.html
[60]
S. A. Amiri, K.-T. Foerster, and S. Schmid, “Walking Through Waypoints,” in LATIN 2018: Theoretical Informatics, Buenos Aires, Argentinia, 2018.
Export
BibTeX
@inproceedings{Amiri_LATIN2018, TITLE = {Walking Through Waypoints}, AUTHOR = {Amiri, Saeed Akhoondian and Foerster, Klaus-Tycho and Schmid, Stefan}, LANGUAGE = {eng}, ISBN = {978-3-319-77403-9}, DOI = {10.1007/978-3-319-77404-6_4}, PUBLISHER = {Springer}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, BOOKTITLE = {LATIN 2018: Theoretical Informatics}, EDITOR = {Bender, Michael A. and Farach-Colton, Mart{\'i}n and Mosteiro, Miguel A.}, PAGES = {37--51}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {10807}, ADDRESS = {Buenos Aires, Argentinia}, }
Endnote
%0 Conference Proceedings %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-0002-5765-B %R 10.1007/978-3-319-77404-6_4 %D 2018 %B 13th Latin American Theoretical Informatics Symposium %Z date of event: 2018-04-16 - 2018-04-19 %C Buenos Aires, Argentinia %B LATIN 2018: Theoretical Informatics %E Bender, Michael A.; Farach-Colton, Mart&#237;n; Mosteiro, Miguel A. %P 37 - 51 %I Springer %@ 978-3-319-77403-9 %B Lecture Notes in Computer Science %N 10807
[61]
S. A. Amiri, S. Dudycz, S. Schmid, and S. Wiederrecht, “Congestion-Free Rerouting of Flows on DAGs,” in 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Prague, Czech Republic, 2018.
Export
BibTeX
@inproceedings{Amiri_ICALP2018, TITLE = {Congestion-Free Rerouting of Flows on {DAGs}}, AUTHOR = {Amiri, Saeed Akhoondian and Dudycz, Szymon and Schmid, Stefan and Wiederrecht, Sebastian}, LANGUAGE = {eng}, ISBN = {978-3-95977-076-7}, URL = {urn:nbn:de:0030-drops-91471}, DOI = {10.4230/LIPIcs.ICALP.2018.143}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, EDITOR = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D{\'a}niel and Sannella, Donald}, PAGES = {1--13}, EID = {143}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {107}, ADDRESS = {Prague, Czech Republic}, }
Endnote
%0 Conference Proceedings %A Amiri, Saeed Akhoondian %A Dudycz, Szymon %A Schmid, Stefan %A Wiederrecht, Sebastian %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Congestion-Free Rerouting of Flows on DAGs : %G eng %U http://hdl.handle.net/21.11116/0000-0002-707F-2 %R 10.4230/LIPIcs.ICALP.2018.143 %U urn:nbn:de:0030-drops-91471 %D 2018 %B 45th International Colloquium on Automata, Languages, and Programming %Z date of event: 2018-07-09 - 2018-07-13 %C Prague, Czech Republic %B 45th International Colloquium on Automata, Languages, and Programming %E Chatzigiannakis, Ioannis; Kaklamanis, Christos; Marx, D&#225;niel; Sannella, Donald %P 1 - 13 %Z sequence number: 143 %I Schloss Dagstuhl %@ 978-3-95977-076-7 %B Leibniz International Proceedings in Informatics %N 107 %U http://drops.dagstuhl.de/opus/volltexte/2018/9147/http://drops.dagstuhl.de/doku/urheberrecht1.html
[62]
S. A. Amiri, K.-T. Foerster, R. Jacob, and S. Schmid, “Charting the Algorithmic Complexity of Waypoint Routing,” ACM SIGCOMM Computer Communication Review, vol. 48, no. 1, 2018.
Export
BibTeX
@article{Amiri_CCR2018, TITLE = {Charting the Algorithmic Complexity of Waypoint Routing}, AUTHOR = {Amiri, Saeed Akhoondian and Foerster, Klaus-Tycho and Jacob, Riko and Schmid, Stefan}, LANGUAGE = {eng}, ISSN = {0146-4833}, DOI = {10.1145/3211852.3211859}, PUBLISHER = {ACM}, ADDRESS = {New York, NY}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, JOURNAL = {ACM SIGCOMM Computer Communication Review}, VOLUME = {48}, NUMBER = {1}, PAGES = {42--48}, }
Endnote
%0 Journal Article %A Amiri, Saeed Akhoondian %A Foerster, Klaus-Tycho %A Jacob, Riko %A Schmid, Stefan %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Charting the Algorithmic Complexity of Waypoint Routing : %G eng %U http://hdl.handle.net/21.11116/0000-0002-7083-B %R 10.1145/3211852.3211859 %7 2018 %D 2018 %J ACM SIGCOMM Computer Communication Review %V 48 %N 1 %& 42 %P 42 - 48 %I ACM %C New York, NY %@ false
[63]
S. A. Amiri, P. Ossona de Mendez, R. Rabinovich, and S. Siebertz, “Distributed Domination on Graph Classes of Bounded Expansion,” in SPAA’18, 30th ACM Symposium on Parallelism in Algorithms and Architectures, Vienna, Austria, 2018.
Export
BibTeX
@inproceedings{Amiri_SPAA2018, TITLE = {Distributed Domination on Graph Classes of Bounded Expansion}, AUTHOR = {Amiri, Saeed Akhoondian and Ossona de Mendez, Patrice and Rabinovich, Roman and Siebertz, Sebastian}, LANGUAGE = {eng}, ISBN = {978-1-4503-5799-9}, DOI = {10.1145/3210377.3210383}, PUBLISHER = {ACM}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, BOOKTITLE = {SPAA'18, 30th ACM Symposium on Parallelism in Algorithms and Architectures}, PAGES = {143--151}, ADDRESS = {Vienna, Austria}, }
Endnote
%0 Conference Proceedings %A Amiri, Saeed Akhoondian %A Ossona de Mendez, Patrice %A Rabinovich, Roman %A Siebertz, Sebastian %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Distributed Domination on Graph Classes of Bounded Expansion : %G eng %U http://hdl.handle.net/21.11116/0000-0002-7081-D %R 10.1145/3210377.3210383 %D 2018 %B 30th ACM Symposium on Parallelism in Algorithms and Architectures %Z date of event: 2018-07-16 - 2018-07-18 %C Vienna, Austria %B SPAA'18 %P 143 - 151 %I ACM %@ 978-1-4503-5799-9
[64]
A. Antoniadis, C. Fischer, and A. Tonnis, “A Collection of Lower Bounds for Online Matching on the Line,” in LATIN 2018: Theoretical Informatics, Buenos Aires, Argentinia, 2018.
Export
BibTeX
@inproceedings{AntoniadisLATIN2018, TITLE = {A Collection of Lower Bounds for Online Matching on the Line}, AUTHOR = {Antoniadis, Antonios and Fischer, Carsten and Tonnis, Andreas}, LANGUAGE = {eng}, ISBN = {978-3-319-77403-9}, DOI = {10.1007/978-3-319-77404-6_5}, PUBLISHER = {Springer}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, BOOKTITLE = {LATIN 2018: Theoretical Informatics}, EDITOR = {Bender, Michael A. and Farach-Colton, Mart{\'i}n and Mosteiro, Miguel A.}, PAGES = {52--65}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {10807}, ADDRESS = {Buenos Aires, Argentinia}, }
Endnote
%0 Conference Proceedings %A Antoniadis, Antonios %A Fischer, Carsten %A Tonnis, Andreas %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T A Collection of Lower Bounds for Online Matching on the Line : %G eng %U http://hdl.handle.net/21.11116/0000-0002-5763-D %R 10.1007/978-3-319-77404-6_5 %D 2018 %B 13th Latin American Theoretical Informatics Symposium %Z date of event: 2018-04-16 - 2018-04-19 %C Buenos Aires, Argentinia %B LATIN 2018: Theoretical Informatics %E Bender, Michael A.; Farach-Colton, Mart&#237;n; Mosteiro, Miguel A. %P 52 - 65 %I Springer %@ 978-3-319-77403-9 %B Lecture Notes in Computer Science %N 10807
[65]
A. Antoniadis, K. Fleszar, R. Hoeksma, and K. Schewior, “A PTAS for Euclidean TSP with Hyperplane Neighborhoods,” 2018. [Online]. Available: http://arxiv.org/abs/1804.03953. (arXiv: 1804.03953)
Abstract
In the Traveling Salesperson Problem with Neighborhoods (TSPN), we are given a collection of geometric regions in some space. The goal is to output a tour of minimum length that visits at least one point in each region. Even in the Euclidean plane, TSPN is known to be APX-hard, which gives rise to studying more tractable special cases of the problem. In this paper, we focus on the fundamental special case of regions that are hyperplanes in the $d$-dimensional Euclidean space. This case contrasts the much-better understood case of so-called fat regions. While for $d=2$ an exact algorithm with running time $O(n^5)$ is known, settling the exact approximability of the problem for $d=3$ has been repeatedly posed as an open question. To date, only an approximation algorithm with guarantee exponential in $d$ is known, and NP-hardness remains open. For arbitrary fixed $d$, we develop a Polynomial Time Approximation Scheme (PTAS) that works for both the tour and path version of the problem. Our algorithm is based on approximating the convex hull of the optimal tour by a convex polytope of bounded complexity. Such polytopes are represented as solutions of a sophisticated LP formulation, which we combine with the enumeration of crucial properties of the tour. As the approximation guarantee approaches $1$, our scheme adjusts the complexity of the considered polytopes accordingly. In the analysis of our approximation scheme, we show that our search space includes a sufficiently good approximation of the optimum. To do so, we develop a novel and general sparsification technique to transform an arbitrary convex polytope into one with a constant number of vertices and, in turn, into one of bounded complexity in the above sense. Hereby, we maintain important properties of the polytope.
Export
BibTeX
@online{Antoniadis_arXiv1804.03953, TITLE = {A {PTAS} for {E}uclidean {TSP} with Hyperplane Neighborhoods}, AUTHOR = {Antoniadis, Antonios and Fleszar, Krzysztof and Hoeksma, Ruben and Schewior, Kevin}, URL = {http://arxiv.org/abs/1804.03953}, EPRINT = {1804.03953}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {In the Traveling Salesperson Problem with Neighborhoods (TSPN), we are given a collection of geometric regions in some space. The goal is to output a tour of minimum length that visits at least one point in each region. Even in the Euclidean plane, TSPN is known to be APX-hard, which gives rise to studying more tractable special cases of the problem. In this paper, we focus on the fundamental special case of regions that are hyperplanes in the $d$-dimensional Euclidean space. This case contrasts the much-better understood case of so-called fat regions. While for $d=2$ an exact algorithm with running time $O(n^5)$ is known, settling the exact approximability of the problem for $d=3$ has been repeatedly posed as an open question. To date, only an approximation algorithm with guarantee exponential in $d$ is known, and NP-hardness remains open. For arbitrary fixed $d$, we develop a Polynomial Time Approximation Scheme (PTAS) that works for both the tour and path version of the problem. Our algorithm is based on approximating the convex hull of the optimal tour by a convex polytope of bounded complexity. Such polytopes are represented as solutions of a sophisticated LP formulation, which we combine with the enumeration of crucial properties of the tour. As the approximation guarantee approaches $1$, our scheme adjusts the complexity of the considered polytopes accordingly. In the analysis of our approximation scheme, we show that our search space includes a sufficiently good approximation of the optimum. To do so, we develop a novel and general sparsification technique to transform an arbitrary convex polytope into one with a constant number of vertices and, in turn, into one of bounded complexity in the above sense. Hereby, we maintain important properties of the polytope.}, }
Endnote
%0 Report %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 : %U http://hdl.handle.net/21.11116/0000-0002-9F37-E %U http://arxiv.org/abs/1804.03953 %D 2018 %X In the Traveling Salesperson Problem with Neighborhoods (TSPN), we are given a collection of geometric regions in some space. The goal is to output a tour of minimum length that visits at least one point in each region. Even in the Euclidean plane, TSPN is known to be APX-hard, which gives rise to studying more tractable special cases of the problem. In this paper, we focus on the fundamental special case of regions that are hyperplanes in the $d$-dimensional Euclidean space. This case contrasts the much-better understood case of so-called fat regions. While for $d=2$ an exact algorithm with running time $O(n^5)$ is known, settling the exact approximability of the problem for $d=3$ has been repeatedly posed as an open question. To date, only an approximation algorithm with guarantee exponential in $d$ is known, and NP-hardness remains open. For arbitrary fixed $d$, we develop a Polynomial Time Approximation Scheme (PTAS) that works for both the tour and path version of the problem. Our algorithm is based on approximating the convex hull of the optimal tour by a convex polytope of bounded complexity. Such polytopes are represented as solutions of a sophisticated LP formulation, which we combine with the enumeration of crucial properties of the tour. As the approximation guarantee approaches $1$, our scheme adjusts the complexity of the considered polytopes accordingly. In the analysis of our approximation scheme, we show that our search space includes a sufficiently good approximation of the optimum. To do so, we develop a novel and general sparsification technique to transform an arbitrary convex polytope into one with a constant number of vertices and, in turn, into one of bounded complexity in the above sense. Hereby, we maintain important properties of the polytope. %K Computer Science, Data Structures and Algorithms, cs.DS
[66]
A. Antoniadis and K. Schewior, “A Tight Lower Bound for Online Convex Optimization with Switching Costs,” in Approximation and Online Algorithms (WAOA 2017), Vienna, Austria, 2018.
Export
BibTeX
@inproceedings{Antoniadis_WAOA2017, TITLE = {A Tight Lower Bound for Online Convex Optimization with Switching Costs}, AUTHOR = {Antoniadis, Antonios and Schewior, Kevin}, LANGUAGE = {eng}, ISBN = {978-3-319-89440-9}, DOI = {10.1007/978-3-319-89441-6_13}, PUBLISHER = {Springer}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2018}, BOOKTITLE = {Approximation and Online Algorithms (WAOA 2017)}, EDITOR = {Solis-Oba, Roberto and Fleischer, Rudolf}, PAGES = {164--165}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {10787}, ADDRESS = {Vienna, Austria}, }
Endnote
%0 Conference Proceedings %A Antoniadis, Antonios %A Schewior, Kevin %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T A Tight Lower Bound for Online Convex Optimization with Switching Costs : %G eng %U http://hdl.handle.net/21.11116/0000-0002-9F30-5 %R 10.1007/978-3-319-89441-6_13 %D 2018 %B 15th Workshop on Approximation and Online Algorithms %Z date of event: 2017-09-07 - 2017-09-08 %C Vienna, Austria %B Approximation and Online Algorithms %E Solis-Oba, Roberto; Fleischer, Rudolf %P 164 - 165 %I Springer %@ 978-3-319-89440-9 %B Lecture Notes in Computer Science %N 10787
[67]
A. Antoniadis and A. Cristi, “Near Optimal Mechanism for Energy Aware Scheduling,” in Algorithmic Game Theory (SAGT 2018), Beijing, China, 2018.
Export
BibTeX
@inproceedings{Antoniadis_SAGT2017, TITLE = {Near Optimal Mechanism for Energy Aware Scheduling}, AUTHOR = {Antoniadis, Antonios and Cristi, Andr{\'e}s}, LANGUAGE = {eng}, ISBN = {978-3-319-99659-2}, DOI = {10.1007/978-3-319-99660-8_4}, PUBLISHER = {Springer}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, BOOKTITLE = {Algorithmic Game Theory (SAGT 2018)}, EDITOR = {Deng, Xiaotie}, PAGES = {31--42}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {11059}, ADDRESS = {Beijing, China}, }
Endnote
%0 Conference Proceedings %A Antoniadis, Antonios %A Cristi, Andr&#233;s %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Near Optimal Mechanism for Energy Aware Scheduling : %G eng %U http://hdl.handle.net/21.11116/0000-0002-9F48-B %R 10.1007/978-3-319-99660-8_4 %D 2018 %B 11th International Symposium on Algorithmic Game Theory %Z date of event: 2018-09-11 - 2018-09-14 %C Beijing, China %B Algorithmic Game Theory %E Deng, Xiaotie %P 31 - 42 %I Springer %@ 978-3-319-99659-2 %B Lecture Notes in Computer Science %N 11059
[68]
S. Arunachalam, S. Chakraborty, M. Koucký, N. Saurabh, and R. de Wolf, “Improved Bounds on Fourier Entropy and Min-entropy,” 2018. [Online]. Available: http://arxiv.org/abs/1809.09819. (arXiv: 1809.09819)
Abstract
Given a Boolean function $f:\{-1,1\}^n\to \{-1,1\}$, the Fourier distribution assigns probability $\widehat{f}(S)^2$ to $S\subseteq [n]$. The Fourier Entropy-Influence (FEI) conjecture of Friedgut and Kalai asks if there exist a universal constant C>0 such that $H(\hat{f}^2)\leq C Inf(f)$, where $H(\hat{f}^2)$ is the Shannon entropy of the Fourier distribution of $f$ and $Inf(f)$ is the total influence of $f$. 1) We consider the weaker Fourier Min-entropy-Influence (FMEI) conjecture. This asks if $H_{\infty}(\hat{f}^2)\leq C Inf(f)$, where $H_{\infty}(\hat{f}^2)$ is the min-entropy of the Fourier distribution. We show $H_{\infty}(\hat{f}^2)\leq 2C_{\min}^\oplus(f)$, where $C_{\min}^\oplus(f)$ is the minimum parity certificate complexity of $f$. We also show that for every $\epsilon\geq 0$, we have $H_{\infty}(\hat{f}^2)\leq 2\log (\|\hat{f}\|_{1,\epsilon}/(1-\epsilon))$, where $\|\hat{f}\|_{1,\epsilon}$ is the approximate spectral norm of $f$. As a corollary, we verify the FMEI conjecture for the class of read-$k$ $DNF$s (for constant $k$). 2) We show that $H(\hat{f}^2)\leq 2 aUC^\oplus(f)$, where $aUC^\oplus(f)$ is the average unambiguous parity certificate complexity of $f$. This improves upon Chakraborty et al. An important consequence of the FEI conjecture is the long-standing Mansour's conjecture. We show that a weaker version of FEI already implies Mansour's conjecture: is $H(\hat{f}^2)\leq C \min\{C^0(f),C^1(f)\}$?, where $C^0(f), C^1(f)$ are the 0- and 1-certificate complexities of $f$, respectively. 3) We study what FEI implies about the structure of polynomials that 1/3-approximate a Boolean function. We pose a conjecture (which is implied by FEI): no "flat" degree-$d$ polynomial of sparsity $2^{\omega(d)}$ can 1/3-approximate a Boolean function. We prove this conjecture unconditionally for a particular class of polynomials.
Export
BibTeX
@online{Arunachalam_arXiv1809.09819, 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}, URL = {http://arxiv.org/abs/1809.09819}, EPRINT = {1809.09819}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Given a Boolean function $f:\{-1,1\}^n\to \{-1,1\}$, the Fourier distribution assigns probability $\widehat{f}(S)^2$ to $S\subseteq [n]$. The Fourier Entropy-Influence (FEI) conjecture of Friedgut and Kalai asks if there exist a universal constant C>0 such that $H(\hat{f}^2)\leq C Inf(f)$, where $H(\hat{f}^2)$ is the Shannon entropy of the Fourier distribution of $f$ and $Inf(f)$ is the total influence of $f$. 1) We consider the weaker Fourier Min-entropy-Influence (FMEI) conjecture. This asks if $H_{\infty}(\hat{f}^2)\leq C Inf(f)$, where $H_{\infty}(\hat{f}^2)$ is the min-entropy of the Fourier distribution. We show $H_{\infty}(\hat{f}^2)\leq 2C_{\min}^\oplus(f)$, where $C_{\min}^\oplus(f)$ is the minimum parity certificate complexity of $f$. We also show that for every $\epsilon\geq 0$, we have $H_{\infty}(\hat{f}^2)\leq 2\log (\|\hat{f}\|_{1,\epsilon}/(1-\epsilon))$, where $\|\hat{f}\|_{1,\epsilon}$ is the approximate spectral norm of $f$. As a corollary, we verify the FMEI conjecture for the class of read-$k$ $DNF$s (for constant $k$). 2) We show that $H(\hat{f}^2)\leq 2 aUC^\oplus(f)$, where $aUC^\oplus(f)$ is the average unambiguous parity certificate complexity of $f$. This improves upon Chakraborty et al. An important consequence of the FEI conjecture is the long-standing Mansour's conjecture. We show that a weaker version of FEI already implies Mansour's conjecture: is $H(\hat{f}^2)\leq C \min\{C^0(f),C^1(f)\}$?, where $C^0(f), C^1(f)$ are the 0- and 1-certificate complexities of $f$, respectively. 3) We study what FEI implies about the structure of polynomials that 1/3-approximate a Boolean function. We pose a conjecture (which is implied by FEI): no "flat" degree-$d$ polynomial of sparsity $2^{\omega(d)}$ can 1/3-approximate a Boolean function. We prove this conjecture unconditionally for a particular class of polynomials.}, }
Endnote
%0 Report %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-0002-AA5A-A %U http://arxiv.org/abs/1809.09819 %D 2018 %X Given a Boolean function $f:\{-1,1\}^n\to \{-1,1\}$, the Fourier distribution assigns probability $\widehat{f}(S)^2$ to $S\subseteq [n]$. The Fourier Entropy-Influence (FEI) conjecture of Friedgut and Kalai asks if there exist a universal constant C>0 such that $H(\hat{f}^2)\leq C Inf(f)$, where $H(\hat{f}^2)$ is the Shannon entropy of the Fourier distribution of $f$ and $Inf(f)$ is the total influence of $f$. 1) We consider the weaker Fourier Min-entropy-Influence (FMEI) conjecture. This asks if $H_{\infty}(\hat{f}^2)\leq C Inf(f)$, where $H_{\infty}(\hat{f}^2)$ is the min-entropy of the Fourier distribution. We show $H_{\infty}(\hat{f}^2)\leq 2C_{\min}^\oplus(f)$, where $C_{\min}^\oplus(f)$ is the minimum parity certificate complexity of $f$. We also show that for every $\epsilon\geq 0$, we have $H_{\infty}(\hat{f}^2)\leq 2\log (\|\hat{f}\|_{1,\epsilon}/(1-\epsilon))$, where $\|\hat{f}\|_{1,\epsilon}$ is the approximate spectral norm of $f$. As a corollary, we verify the FMEI conjecture for the class of read-$k$ $DNF$s (for constant $k$). 2) We show that $H(\hat{f}^2)\leq 2 aUC^\oplus(f)$, where $aUC^\oplus(f)$ is the average unambiguous parity certificate complexity of $f$. This improves upon Chakraborty et al. An important consequence of the FEI conjecture is the long-standing Mansour's conjecture. We show that a weaker version of FEI already implies Mansour's conjecture: is $H(\hat{f}^2)\leq C \min\{C^0(f),C^1(f)\}$?, where $C^0(f), C^1(f)$ are the 0- and 1-certificate complexities of $f$, respectively. 3) We study what FEI implies about the structure of polynomials that 1/3-approximate a Boolean function. We pose a conjecture (which is implied by FEI): no "flat" degree-$d$ polynomial of sparsity $2^{\omega(d)}$ can 1/3-approximate a Boolean function. We prove this conjecture unconditionally for a particular class of polynomials. %K Computer Science, Computational Complexity, cs.CC
[69]
J. Baldus and K. Bringmann, “A Fast Implementation of Near Neighbors Queries for Fréchet Distance (GIS Cup),” 2018. [Online]. Available: http://arxiv.org/abs/1803.00806. (arXiv: 1803.00806)
Abstract
This paper describes an implementation of fast near-neighbours queries (also known as range searching) with respect to the Fr\'echet distance. The algorithm is designed to be efficient on practical data such as GPS trajectories. Our approach is to use a quadtree data structure to enumerate all curves in the database that have similar start and endpoints as the query curve. On these curves we run positive and negative filters to narrow the set of potential results. Only for those trajectories where these heuristics fail, we compute the Fr\'echet distance exactly, by running a novel recursive variant of the classic free-space diagram algorithm. Our implementation won the ACM SIGSPATIAL GIS Cup 2017.
Export
BibTeX
@online{Baldus_arXiv1803.00806, TITLE = {A Fast Implementation of Near Neighbors Queries for {F}r\'{e}chet Distance ({GIS Cup})}, AUTHOR = {Baldus, Julian and Bringmann, Karl}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1803.00806}, EPRINT = {1803.00806}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {This paper describes an implementation of fast near-neighbours queries (also known as range searching) with respect to the Fr\'echet distance. The algorithm is designed to be efficient on practical data such as GPS trajectories. Our approach is to use a quadtree data structure to enumerate all curves in the database that have similar start and endpoints as the query curve. On these curves we run positive and negative filters to narrow the set of potential results. Only for those trajectories where these heuristics fail, we compute the Fr\'echet distance exactly, by running a novel recursive variant of the classic free-space diagram algorithm. Our implementation won the ACM SIGSPATIAL GIS Cup 2017.}, }
Endnote
%0 Report %A Baldus, Julian %A Bringmann, Karl %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Fast Implementation of Near Neighbors Queries for Fr&#233;chet Distance (GIS Cup) : %G eng %U http://hdl.handle.net/21.11116/0000-0001-3E1A-E %U http://arxiv.org/abs/1803.00806 %D 2018 %X This paper describes an implementation of fast near-neighbours queries (also known as range searching) with respect to the Fr\'echet distance. The algorithm is designed to be efficient on practical data such as GPS trajectories. Our approach is to use a quadtree data structure to enumerate all curves in the database that have similar start and endpoints as the query curve. On these curves we run positive and negative filters to narrow the set of potential results. Only for those trajectories where these heuristics fail, we compute the Fr\'echet distance exactly, by running a novel recursive variant of the classic free-space diagram algorithm. Our implementation won the ACM SIGSPATIAL GIS Cup 2017. %K Computer Science, Computational Geometry, cs.CG
[70]
G. Ballard, C. Ikenmeyer, J. M. Landsberg, and N. Ryder, “The Geometry of Rank Decompositions of Matrix Multiplication II: 3 x 3 Matrices,” 2018. [Online]. Available: http://arxiv.org/abs/1801.00843. (arXiv: 1801.00843)
Abstract
This is the second in a series of papers on rank decompositions of the matrix multiplication tensor. We present new rank $23$ decompositions for the $3\times 3$ matrix multiplication tensor $M_{\langle 3\rangle}$. All our decompositions have symmetry groups that include the standard cyclic permutation of factors but otherwise exhibit a range of behavior. One of them has 11 cubes as summands and admits an unexpected symmetry group of order 12. We establish basic information regarding symmetry groups of decompositions and outline two approaches for finding new rank decompositions of $M_{\langle n\rangle}$ for larger $n$.
Export
BibTeX
@online{Ballard_arXiv1801.00843, TITLE = {{The Geometry of Rank Decompositions of Matrix Multiplication II: $3\times 3$ Matrices}}, AUTHOR = {Ballard, Grey and Ikenmeyer, Christian and Landsberg, J. M. and Ryder, Nick}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1801.00843}, EPRINT = {1801.00843}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {This is the second in a series of papers on rank decompositions of the matrix multiplication tensor. We present new rank $23$ decompositions for the $3\times 3$ matrix multiplication tensor $M_{\langle 3\rangle}$. All our decompositions have symmetry groups that include the standard cyclic permutation of factors but otherwise exhibit a range of behavior. One of them has 11 cubes as summands and admits an unexpected symmetry group of order 12. We establish basic information regarding symmetry groups of decompositions and outline two approaches for finding new rank decompositions of $M_{\langle n\rangle}$ for larger $n$.}, }
Endnote
%0 Report %A Ballard, Grey %A Ikenmeyer, Christian %A Landsberg, J. M. %A Ryder, Nick %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T The Geometry of Rank Decompositions of Matrix Multiplication II: 3 x 3 Matrices : %G eng %U http://hdl.handle.net/21.11116/0000-0001-3F64-9 %U http://arxiv.org/abs/1801.00843 %D 2018 %X This is the second in a series of papers on rank decompositions of the matrix multiplication tensor. We present new rank $23$ decompositions for the $3\times 3$ matrix multiplication tensor $M_{\langle 3\rangle}$. All our decompositions have symmetry groups that include the standard cyclic permutation of factors but otherwise exhibit a range of behavior. One of them has 11 cubes as summands and admits an unexpected symmetry group of order 12. We establish basic information regarding symmetry groups of decompositions and outline two approaches for finding new rank decompositions of $M_{\langle n\rangle}$ for larger $n$. %K Computer Science, Computational Complexity, cs.CC,
[71]
F. Ban, V. Bhattiprolu, K. Bringmann, P. Kolev, E. Lee, and D. P. Woodruff, “A PTAS for l p-Low Rank Approximation,” 2018. [Online]. Available: http://arxiv.org/abs/1807.06101. (arXiv: 1807.06101)
Abstract
A number of recent works have studied algorithms for entrywise $\ell_p$-low rank approximation, namely, algorithms which given an $n \times d$ matrix $A$ (with $n \geq d$), output a rank-$k$ matrix $B$ minimizing $\|A-B\|_p^p=\sum_{i,j}|A_{i,j}-B_{i,j}|^p$ when $p > 0$; and $\|A-B\|_0=\sum_{i,j}[A_{i,j}\neq B_{i,j}]$ for $p=0$. On the algorithmic side, for $p \in (0,2)$, we give the first $(1+\epsilon)$-approximation algorithm running in time $n^{\text{poly}(k/\epsilon)}$. Further, for $p = 0$, we give the first almost-linear time approximation scheme for what we call the Generalized Binary $\ell_0$-Rank-$k$ problem. Our algorithm computes $(1+\epsilon)$-approximation in time $(1/\epsilon)^{2^{O(k)}/\epsilon^{2}} \cdot nd^{1+o(1)}$. On the hardness of approximation side, for $p \in (1,2)$, assuming the Small Set Expansion Hypothesis and the Exponential Time Hypothesis (ETH), we show that there exists $\delta := \delta(\alpha) > 0$ such that the entrywise $\ell_p$-Rank-$k$ problem has no $\alpha$-approximation algorithm running in time $2^{k^{\delta}}$.
Export
BibTeX
@online{Ban_arXiv1807.06101, TITLE = {A {PTAS} for $\ell_p$-Low Rank Approximation}, AUTHOR = {Ban, Frank and Bhattiprolu, Vijay and Bringmann, Karl and Kolev, Pavel and Lee, Euiwoong and Woodruff, David P.}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1807.06101}, EPRINT = {1807.06101}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {A number of recent works have studied algorithms for entrywise $\ell_p$-low rank approximation, namely, algorithms which given an $n \times d$ matrix $A$ (with $n \geq d$), output a rank-$k$ matrix $B$ minimizing $\|A-B\|_p^p=\sum_{i,j}|A_{i,j}-B_{i,j}|^p$ when $p > 0$; and $\|A-B\|_0=\sum_{i,j}[A_{i,j}\neq B_{i,j}]$ for $p=0$. On the algorithmic side, for $p \in (0,2)$, we give the first $(1+\epsilon)$-approximation algorithm running in time $n^{\text{poly}(k/\epsilon)}$. Further, for $p = 0$, we give the first almost-linear time approximation scheme for what we call the Generalized Binary $\ell_0$-Rank-$k$ problem. Our algorithm computes $(1+\epsilon)$-approximation in time $(1/\epsilon)^{2^{O(k)}/\epsilon^{2}} \cdot nd^{1+o(1)}$. On the hardness of approximation side, for $p \in (1,2)$, assuming the Small Set Expansion Hypothesis and the Exponential Time Hypothesis (ETH), we show that there exists $\delta := \delta(\alpha) > 0$ such that the entrywise $\ell_p$-Rank-$k$ problem has no $\alpha$-approximation algorithm running in time $2^{k^{\delta}}$.}, }
Endnote
%0 Report %A Ban, Frank %A Bhattiprolu, Vijay %A Bringmann, Karl %A Kolev, Pavel %A Lee, Euiwoong %A Woodruff, David P. %+ 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 A PTAS for l p-Low Rank Approximation : %G eng %U http://hdl.handle.net/21.11116/0000-0002-9D17-4 %U http://arxiv.org/abs/1807.06101 %D 2018 %X A number of recent works have studied algorithms for entrywise $\ell_p$-low rank approximation, namely, algorithms which given an $n \times d$ matrix $A$ (with $n \geq d$), output a rank-$k$ matrix $B$ minimizing $\|A-B\|_p^p=\sum_{i,j}|A_{i,j}-B_{i,j}|^p$ when $p > 0$; and $\|A-B\|_0=\sum_{i,j}[A_{i,j}\neq B_{i,j}]$ for $p=0$. On the algorithmic side, for $p \in (0,2)$, we give the first $(1+\epsilon)$-approximation algorithm running in time $n^{\text{poly}(k/\epsilon)}$. Further, for $p = 0$, we give the first almost-linear time approximation scheme for what we call the Generalized Binary $\ell_0$-Rank-$k$ problem. Our algorithm computes $(1+\epsilon)$-approximation in time $(1/\epsilon)^{2^{O(k)}/\epsilon^{2}} \cdot nd^{1+o(1)}$. On the hardness of approximation side, for $p \in (1,2)$, assuming the Small Set Expansion Hypothesis and the Exponential Time Hypothesis (ETH), we show that there exists $\delta := \delta(\alpha) > 0$ such that the entrywise $\ell_p$-Rank-$k$ problem has no $\alpha$-approximation algorithm running in time $2^{k^{\delta}}$. %K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Computational Complexity, cs.CC,Computer Science, Learning, cs.LG
[72]
L. Becchetti, A. Clementi, P. Manurangsi, E. Natale, F. Pasquale, P. Raghavendra, and L. Trevisan, “Average Whenever You Meet: Opportunistic Protocols for Community Detection,” in 26th Annual European Symposium on Algorithms (ESA 2018), Helsinki, Finland, 2018.
Export
BibTeX
@inproceedings{Becchetti_ESA2018, TITLE = {Average Whenever You Meet: {O}pportunistic Protocols for Community Detection}, AUTHOR = {Becchetti, Luca and Clementi, Andrea and Manurangsi, Pasin and Natale, Emanuele and Pasquale, Francesco and Raghavendra, Prasad and Trevisan, Luca}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-081-1}, URL = {urn:nbn:de:0030-drops-94705}, DOI = {10.4230/LIPIcs.ESA.2018.7}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {26th Annual European Symposium on Algorithms (ESA 2018)}, EDITOR = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz}, PAGES = {1--13}, EID = {7}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {112}, ADDRESS = {Helsinki, Finland}, }
Endnote
%0 Conference Proceedings %A Becchetti, Luca %A Clementi, Andrea %A Manurangsi, Pasin %A Natale, Emanuele %A Pasquale, Francesco %A Raghavendra, Prasad %A Trevisan, Luca %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Average Whenever You Meet: Opportunistic Protocols for Community Detection : %G eng %U http://hdl.handle.net/21.11116/0000-0002-A957-E %R 10.4230/LIPIcs.ESA.2018.7 %U urn:nbn:de:0030-drops-94705 %D 2018 %B 26th Annual European Symposium on Algorithms %Z date of event: 2018-08-20 - 2018-08-22 %C Helsinki, Finland %B 26th Annual European Symposium on Algorithms %E Azar, Yossi; Bast, Hannah; Herman, Grzegorz %P 1 - 13 %Z sequence number: 7 %I Schloss Dagstuhl %@ 978-3-95977-081-1 %B Leibniz International Proceedings in Informatics %N 112 %@ false %U http://drops.dagstuhl.de/opus/volltexte/2018/9470/http://drops.dagstuhl.de/doku/urheberrecht1.html
[73]
L. Becchetti, V. Bonifaci, and E. Natale, “Pooling or Sampling: Collective Dynamics for Electrical Flow Estimation,” in AAMAS’18, 17th International Conference on Autonomous Agents and MultiAgent Systems, Stockholm, Sweden, 2018.
Export
BibTeX
@inproceedings{Becchetti_AAMAS2018, TITLE = {Pooling or Sampling: {C}ollective Dynamics for Electrical Flow Estimation}, AUTHOR = {Becchetti, Luca and Bonifaci, Vincenzo and Natale, Emanuele}, LANGUAGE = {eng}, ISBN = {978-1-4503-5649-7}, PUBLISHER = {ACM}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, BOOKTITLE = {AAMAS'18, 17th International Conference on Autonomous Agents and MultiAgent Systems}, PAGES = {1576--1584}, ADDRESS = {Stockholm, Sweden}, }
Endnote
%0 Conference Proceedings %A Becchetti, Luca %A Bonifaci, Vincenzo %A Natale, Emanuele %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Pooling or Sampling: Collective Dynamics for Electrical Flow Estimation : %G eng %U http://hdl.handle.net/21.11116/0000-0002-A953-2 %D 2018 %B 17th International Conference on Autonomous Agents and MultiAgent Systems %Z date of event: 2018-07-10 - 2018-07-15 %C Stockholm, Sweden %B AAMAS'18 %P 1576 - 1584 %I ACM %@ 978-1-4503-5649-7
[74]
L. Becchetti, A. Clementi, E. Natale, F. Pasquale, and L. Trevisan, “Finding a Bounded-Degree Expander Inside a Dense One,” 2018. [Online]. Available: http://arxiv.org/abs/1811.10316. (arXiv: 1811.10316)
Abstract
It follows from the Marcus-Spielman-Srivastava proof of the Kadison-Singer conjecture that if $G=(V,E)$ is a $\Delta$-regular dense expander then there is an edge-induced subgraph $H=(V,E_H)$ of $G$ of constant maximum degree which is also an expander. As with other consequences of the MSS theorem, it is not clear how one would explicitly construct such a subgraph. We show that such a subgraph (although with quantitatively weaker expansion and near-regularity properties than those predicted by MSS) can be constructed with high probability in linear time, via a simple algorithm. Our algorithm allows a distributed implementation that runs in $\mathcal O(\log n)$ rounds and does $\bigO(n)$ total work with high probability. The analysis of the algorithm is complicated by the complex dependencies that arise between edges and between choices made in different rounds. We sidestep these difficulties by following the combinatorial approach of counting the number of possible random choices of the algorithm which lead to failure. We do so by a compression argument showing that such random choices can be encoded with a non-trivial compression. Our algorithm bears some similarity to the way agents construct a communication graph in a peer-to-peer network, and, in the bipartite case, to the way agents select servers in blockchain protocols.
Export
BibTeX
@online{Becchetti_arXiv1811.10316, TITLE = {Finding a Bounded-Degree Expander Inside a Dense One}, AUTHOR = {Becchetti, Luca and Clementi, Andrea and Natale, Emanuele and Pasquale, Francesco and Trevisan, Luca}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1811.10316}, EPRINT = {1811.10316}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {It follows from the Marcus-Spielman-Srivastava proof of the Kadison-Singer conjecture that if $G=(V,E)$ is a $\Delta$-regular dense expander then there is an edge-induced subgraph $H=(V,E_H)$ of $G$ of constant maximum degree which is also an expander. As with other consequences of the MSS theorem, it is not clear how one would explicitly construct such a subgraph. We show that such a subgraph (although with quantitatively weaker expansion and near-regularity properties than those predicted by MSS) can be constructed with high probability in linear time, via a simple algorithm. Our algorithm allows a distributed implementation that runs in $\mathcal O(\log n)$ rounds and does $\bigO(n)$ total work with high probability. The analysis of the algorithm is complicated by the complex dependencies that arise between edges and between choices made in different rounds. We sidestep these difficulties by following the combinatorial approach of counting the number of possible random choices of the algorithm which lead to failure. We do so by a compression argument showing that such random choices can be encoded with a non-trivial compression. Our algorithm bears some similarity to the way agents construct a communication graph in a peer-to-peer network, and, in the bipartite case, to the way agents select servers in blockchain protocols.}, }
Endnote
%0 Report %A Becchetti, Luca %A Clementi, Andrea %A Natale, Emanuele %A Pasquale, Francesco %A Trevisan, Luca %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Finding a Bounded-Degree Expander Inside a Dense One : %G eng %U http://hdl.handle.net/21.11116/0000-0002-B967-A %U http://arxiv.org/abs/1811.10316 %D 2018 %X It follows from the Marcus-Spielman-Srivastava proof of the Kadison-Singer conjecture that if $G=(V,E)$ is a $\Delta$-regular dense expander then there is an edge-induced subgraph $H=(V,E_H)$ of $G$ of constant maximum degree which is also an expander. As with other consequences of the MSS theorem, it is not clear how one would explicitly construct such a subgraph. We show that such a subgraph (although with quantitatively weaker expansion and near-regularity properties than those predicted by MSS) can be constructed with high probability in linear time, via a simple algorithm. Our algorithm allows a distributed implementation that runs in $\mathcal O(\log n)$ rounds and does $\bigO(n)$ total work with high probability. The analysis of the algorithm is complicated by the complex dependencies that arise between edges and between choices made in different rounds. We sidestep these difficulties by following the combinatorial approach of counting the number of possible random choices of the algorithm which lead to failure. We do so by a compression argument showing that such random choices can be encoded with a non-trivial compression. Our algorithm bears some similarity to the way agents construct a communication graph in a peer-to-peer network, and, in the bipartite case, to the way agents select servers in blockchain protocols. %K Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC
[75]
R. Becker, M. Sagraloff, V. Sharma, and C. Yap, “A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration,” Journal of Symbolic Computation, vol. 86, 2018.
Export
BibTeX
@article{Becker2017JSC, TITLE = {A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the {Pellet} Test and {Newton} Iteration}, AUTHOR = {Becker, Ruben and Sagraloff, Michael and Sharma, Vikram and Yap, Chee}, LANGUAGE = {eng}, ISSN = {0747-7171}, DOI = {10.1016/j.jsc.2017.03.009}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, JOURNAL = {Journal of Symbolic Computation}, VOLUME = {86}, PAGES = {51--96}, }
Endnote
%0 Journal Article %A Becker, Ruben %A Sagraloff, Michael %A Sharma, Vikram %A Yap, Chee %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-5717-8 %R 10.1016/j.jsc.2017.03.009 %7 2017-03-29 %D 2018 %J Journal of Symbolic Computation %V 86 %& 51 %P 51 - 96 %I Elsevier %C Amsterdam %@ false
[76]
A. Bhattacharya, D. Issac, R. Jaiswal, and A. Kumar, “Sampling in Space Restricted Settings,” Algorithmica, vol. 80, no. 5, 2018.
Export
BibTeX
@article{Bhattacharya2018, TITLE = {Sampling in Space Restricted Settings}, AUTHOR = {Bhattacharya, Anup and Issac, Davis and Jaiswal, Ragesh and Kumar, Amit}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-017-0335-z}, PUBLISHER = {Springer-Verlag}, ADDRESS = {New York}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, JOURNAL = {Algorithmica}, VOLUME = {80}, NUMBER = {5}, PAGES = {1439--1458}, }
Endnote
%0 Journal Article %A Bhattacharya, Anup %A Issac, Davis %A Jaiswal, Ragesh %A Kumar, Amit %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Sampling in Space Restricted Settings : %G eng %U http://hdl.handle.net/21.11116/0000-0001-2C37-1 %R 10.1007/s00453-017-0335-z %7 2017 %D 2018 %J Algorithmica %V 80 %N 5 %& 1439 %P 1439 - 1458 %I Springer-Verlag %C New York %@ false
[77]
M. Bläser, C. Ikenmeyer, G. Jindal, and V. Lysikov, “Generalized Matrix Completion and Algebraic Natural Proofs,” in STOC’18, 50th Annual ACM SIGACT Symposium on Theory of Computing, Los Angeles, CA, USA, 2018.
Export
BibTeX
@inproceedings{Blaeser_STOC2018, TITLE = {Generalized Matrix Completion and Algebraic Natural Proofs}, AUTHOR = {Bl{\"a}ser, Markus and Ikenmeyer, Christian and Jindal, Gorav and Lysikov, Vladimir}, LANGUAGE = {eng}, ISBN = {978-1-4503-5559-9}, DOI = {10.1145/3188745.3188832}, PUBLISHER = {ACM}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, BOOKTITLE = {STOC'18, 50th Annual ACM SIGACT Symposium on Theory of Computing}, PAGES = {1193--1206}, ADDRESS = {Los Angeles, CA, USA}, }
Endnote
%0 Conference Proceedings %A Bl&#228;ser, Markus %A Ikenmeyer, Christian %A Jindal, Gorav %A Lysikov, Vladimir %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Generalized Matrix Completion and Algebraic Natural Proofs : %G eng %U http://hdl.handle.net/21.11116/0000-0002-17DF-A %R 10.1145/3188745.3188832 %D 2018 %B 50th Annual ACM SIGACT Symposium on Theory of Computing %Z date of event: 2018-06-25 - 2017-06-29 %C Los Angeles, CA, USA %B STOC'18 %P 1193 - 1206 %I ACM %@ 978-1-4503-5559-9
[78]
M. Bläser, C. Ikenmeyer, G. Jindal, and V. Lysikov, “Generalized Matrix Completion and Algebraic Natural Proofs Contact Add Comment RSS-Feed,” Electronic Colloquium on Computational Complexity (ECCC): Report Series, vol. 18–064, 2018.
Export
BibTeX
@article{BlaeserCCC18_064, TITLE = {Generalized Matrix Completion and Algebraic Natural Proofs Contact Add Comment {RSS}-Feed}, AUTHOR = {Bl{\"a}ser, Markus and Ikenmeyer, Christian and Jindal, Gorav and Lysikov, Vladimir}, LANGUAGE = {eng}, ISSN = {1433-8092}, PUBLISHER = {Hasso-Plattner-Institut f{\"u}r Softwaretechnik GmbH}, ADDRESS = {Potsdam}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, JOURNAL = {Electronic Colloquium on Computational Complexity (ECCC): Report Series}, VOLUME = {18-064}, PAGES = {1--27}, }
Endnote
%0 Journal Article %A Bl&#228;ser, Markus %A Ikenmeyer, Christian %A Jindal, Gorav %A Lysikov, Vladimir %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Generalized Matrix Completion and Algebraic Natural Proofs Contact Add Comment RSS-Feed : %G eng %U http://hdl.handle.net/21.11116/0000-0001-3F5F-0 %7 2018 %D 2018 %J Electronic Colloquium on Computational Complexity (ECCC): Report Series %V 18-064 %& 1 %P 1 - 27 %I Hasso-Plattner-Institut f&#252;r Softwaretechnik GmbH %C Potsdam %@ false %U https://eccc.weizmann.ac.il/report/2018/064/
[79]
M. Bläser, G. Jindal, and A. Pandey, “A Deterministic PTAS for Commutative Rank of Matrix Spaces,” Theory of Computing, vol. 14, 2018.
Export
BibTeX
@article{Blaeser_ToC18, TITLE = {A Deterministic {PTAS} for Commutative Rank of Matrix Spaces}, AUTHOR = {Bl{\"a}ser, Markus and Jindal, Gorav and Pandey, Anurag}, LANGUAGE = {eng}, ISSN = {1557-2862}, DOI = {10.4086/toc.2018.v014a003}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, JOURNAL = {Theory of Computing}, VOLUME = {14}, PAGES = {1--21}, EID = {3}, }
Endnote
%0 Journal Article %A Bl&#228;ser, Markus %A Jindal, Gorav %A Pandey, Anurag %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Deterministic PTAS for Commutative Rank of Matrix Spaces : %G eng %U http://hdl.handle.net/21.11116/0000-0002-B48E-3 %R 10.4086/toc.2018.v014a003 %7 2018 %D 2018 %J Theory of Computing %V 14 %& 1 %P 1 - 21 %Z sequence number: 3 %@ false
[80]
L. Boczkowski, E. Natale, O. Feinerman, and A. Korman, “Limits on Reliable Information Flows through Stochastic Populations,” PLoS Computational Biology, vol. 14, no. 6, 2018.
Export
BibTeX
@article{Boczkowski2018, TITLE = {Limits on Reliable Information Flows through Stochastic Populations}, AUTHOR = {Boczkowski, Lucas and Natale, Emanuele and Feinerman, Ofer and Korman, Amos}, LANGUAGE = {eng}, ISSN = {1553-734X}, DOI = {10.1371/journal.pcbi.1006195}, PUBLISHER = {Public Library of Science}, ADDRESS = {San Francisco, CA}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, JOURNAL = {PLoS Computational Biology}, VOLUME = {14}, NUMBER = {6}, EID = {e1006195}, }
Endnote
%0 Journal Article %A Boczkowski, Lucas %A Natale, Emanuele %A Feinerman, Ofer %A Korman, Amos %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Limits on Reliable Information Flows through Stochastic Populations : %G eng %U http://hdl.handle.net/21.11116/0000-0001-999D-2 %R 10.1371/journal.pcbi.1006195 %7 2018 %D 2018 %J PLoS Computational Biology %V 14 %N 6 %Z sequence number: e1006195 %I Public Library of Science %C San Francisco, CA %@ false
[81]
L. Boczkowski, O. Feinerman, A. Korman, and E. Natale, “Limits for Rumor Spreading in Stochastic Populations,” in 9th Innovations in Theoretical Computer Science (ITCS 2018), Cambridge, MA, USA, 2018.
Export
BibTeX
@inproceedings{Boczkowski_ITCS2018, TITLE = {Limits for Rumor Spreading in Stochastic Populations}, AUTHOR = {Boczkowski, Lucas and Feinerman, Ofer and Korman, Amos and Natale, Emanuele}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-060-6}, URL = {urn:nbn:de:0030-drops-83207}, DOI = {10.4230/LIPIcs.ITCS.2018.49}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {9th Innovations in Theoretical Computer Science (ITCS 2018)}, EDITOR = {Karlin, Anna R.}, PAGES = {1--21}, EID = {49}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {94}, ADDRESS = {Cambridge, MA, USA}, }
Endnote
%0 Conference Proceedings %A Boczkowski, Lucas %A Feinerman, Ofer %A Korman, Amos %A Natale, Emanuele %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Limits for Rumor Spreading in Stochastic Populations : %G eng %U http://hdl.handle.net/21.11116/0000-0002-A962-1 %R 10.4230/LIPIcs.ITCS.2018.49 %U urn:nbn:de:0030-drops-83207 %D 2018 %B 9th Innovations in Theoretical Computer Science %Z date of event: 2018-01-11 - 2018-01-14 %C Cambridge, MA, USA %B 9th Innovations in Theoretical Computer Science %E Karlin, Anna R. %P 1 - 21 %Z sequence number: 49 %I Schloss Dagstuhl %@ 978-3-95977-060-6 %B Leibniz International Proceedings in Informatics %N 94 %@ false %U http://drops.dagstuhl.de/opus/volltexte/2018/8320/http://drops.dagstuhl.de/opus/volltexte/2018/8320/
[82]
J.-D. Boissonnat, R. Dyer, and A. Ghosh, “Delaunay Triangulation of Manifolds,” Foundations of Computational Mathematics, vol. 18, no. 2, 2018.
Export
BibTeX
@article{Boissonnat2017, TITLE = {Delaunay Triangulation of Manifolds}, AUTHOR = {Boissonnat, Jean-Daniel and Dyer, Ramsay and Ghosh, Arijit}, LANGUAGE = {eng}, ISSN = {1615-3375}, DOI = {10.1007/s10208-017-9344-1}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, JOURNAL = {Foundations of Computational Mathematics}, VOLUME = {18}, NUMBER = {2}, PAGES = {399--431}, }
Endnote
%0 Journal Article %A Boissonnat, Jean-Daniel %A Dyer, Ramsay %A Ghosh, Arijit %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Delaunay Triangulation of Manifolds : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-7945-0 %R 10.1007/s10208-017-9344-1 %7 2017-02-01 %D 2018 %J Foundations of Computational Mathematics %V 18 %N 2 %& 399 %P 399 - 431 %I Springer %C New York, NY %@ false
[83]
K. Bringmann and P. Wellnitz, “Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars,” 2018. [Online]. Available: http://arxiv.org/abs/1803.00804. (arXiv: 1803.00804)
Abstract
Tree-adjoining grammars are a generalization of context-free grammars that are well suited to model human languages and are thus popular in computational linguistics. In the tree-adjoining grammar recognition problem, given a grammar $\Gamma$ and a string $s$ of length $n$, the task is to decide whether $s$ can be obtained from $\Gamma$. Rajasekaran and Yooseph's parser (JCSS'98) solves this problem in time $O(n^{2\omega})$, where $\omega < 2.373$ is the matrix multiplication exponent. The best algorithms avoiding fast matrix multiplication take time $O(n^6)$. The first evidence for hardness was given by Satta (J. Comp. Linguist.'94): For a more general parsing problem, any algorithm that avoids fast matrix multiplication and is significantly faster than $O(|\Gamma| n^6)$ in the case of $|\Gamma| = \Theta(n^{12})$ would imply a breakthrough for Boolean matrix multiplication. Following an approach by Abboud et al. (FOCS'15) for context-free grammar recognition, in this paper we resolve many of the disadvantages of the previous lower bound. We show that, even on constant-size grammars, any improvement on Rajasekaran and Yooseph's parser would imply a breakthrough for the $k$-Clique problem. This establishes tree-adjoining grammar parsing as a practically relevant problem with the unusual running time of $n^{2\omega}$, up to lower order factors.
Export
BibTeX
@online{Bringmann_arXiv1803.00804, TITLE = {Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars}, AUTHOR = {Bringmann, Karl and Wellnitz, Philip}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1803.00804}, EPRINT = {1803.00804}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Tree-adjoining grammars are a generalization of context-free grammars that are well suited to model human languages and are thus popular in computational linguistics. In the tree-adjoining grammar recognition problem, given a grammar $\Gamma$ and a string $s$ of length $n$, the task is to decide whether $s$ can be obtained from $\Gamma$. Rajasekaran and Yooseph's parser (JCSS'98) solves this problem in time $O(n^{2\omega})$, where $\omega < 2.373$ is the matrix multiplication exponent. The best algorithms avoiding fast matrix multiplication take time $O(n^6)$. The first evidence for hardness was given by Satta (J. Comp. Linguist.'94): For a more general parsing problem, any algorithm that avoids fast matrix multiplication and is significantly faster than $O(|\Gamma| n^6)$ in the case of $|\Gamma| = \Theta(n^{12})$ would imply a breakthrough for Boolean matrix multiplication. Following an approach by Abboud et al. (FOCS'15) for context-free grammar recognition, in this paper we resolve many of the disadvantages of the previous lower bound. We show that, even on constant-size grammars, any improvement on Rajasekaran and Yooseph's parser would imply a breakthrough for the $k$-Clique problem. This establishes tree-adjoining grammar parsing as a practically relevant problem with the unusual running time of $n^{2\omega}$, up to lower order factors.}, }
Endnote
%0 Report %A Bringmann, Karl %A Wellnitz, Philip %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars : %G eng %U http://hdl.handle.net/21.11116/0000-0001-3E2A-C %U http://arxiv.org/abs/1803.00804 %D 2018 %X Tree-adjoining grammars are a generalization of context-free grammars that are well suited to model human languages and are thus popular in computational linguistics. In the tree-adjoining grammar recognition problem, given a grammar $\Gamma$ and a string $s$ of length $n$, the task is to decide whether $s$ can be obtained from $\Gamma$. Rajasekaran and Yooseph's parser (JCSS'98) solves this problem in time $O(n^{2\omega})$, where $\omega < 2.373$ is the matrix multiplication exponent. The best algorithms avoiding fast matrix multiplication take time $O(n^6)$. The first evidence for hardness was given by Satta (J. Comp. Linguist.'94): For a more general parsing problem, any algorithm that avoids fast matrix multiplication and is significantly faster than $O(|\Gamma| n^6)$ in the case of $|\Gamma| = \Theta(n^{12})$ would imply a breakthrough for Boolean matrix multiplication. Following an approach by Abboud et al. (FOCS'15) for context-free grammar recognition, in this paper we resolve many of the disadvantages of the previous lower bound. We show that, even on constant-size grammars, any improvement on Rajasekaran and Yooseph's parser would imply a breakthrough for the $k$-Clique problem. This establishes tree-adjoining grammar parsing as a practically relevant problem with the unusual running time of $n^{2\omega}$, up to lower order factors. %K Computer Science, Computational Complexity, cs.CC,Computer Science, Data Structures and Algorithms, cs.DS
[84]
K. Bringmann, S. Cabello, and M. T. M. Emmerich, “Maximum Volume Subset Selection for Anchored Boxes,” 2018. [Online]. Available: http://arxiv.org/abs/1803.00849. (arXiv: 1803.00849)
Abstract
Let $B$ be a set of $n$ axis-parallel boxes in $\mathbb{R}^d$ such that each box has a corner at the origin and the other corner in the positive quadrant of $\mathbb{R}^d$, and let $k$ be a positive integer. We study the problem of selecting $k$ boxes in $B$ that maximize the volume of the union of the selected boxes. This research is motivated by applications in skyline queries for databases and in multicriteria optimization, where the problem is known as the hypervolume subset selection problem. It is known that the problem can be solved in polynomial time in the plane, while the best known running time in any dimension $d \ge 3$ is $\Omega\big(\binom{n}{k}\big)$. We show that: - The problem is NP-hard already in 3 dimensions. - In 3 dimensions, we break the bound $\Omega\big(\binom{n}{k}\big)$, by providing an $n^{O(\sqrt{k})}$ algorithm. - For any constant dimension $d$, we present an efficient polynomial-time approximation scheme.
Export
BibTeX
@online{Bringmann_arXiv1803.00849, TITLE = {Maximum Volume Subset Selection for Anchored Boxes}, AUTHOR = {Bringmann, Karl and Cabello, Sergio and Emmerich, Michael T. M.}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1803.00849}, EPRINT = {1803.00849}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Let $B$ be a set of $n$ axis-parallel boxes in $\mathbb{R}^d$ such that each box has a corner at the origin and the other corner in the positive quadrant of $\mathbb{R}^d$, and let $k$ be a positive integer. We study the problem of selecting $k$ boxes in $B$ that maximize the volume of the union of the selected boxes. This research is motivated by applications in skyline queries for databases and in multicriteria optimization, where the problem is known as the hypervolume subset selection problem. It is known that the problem can be solved in polynomial time in the plane, while the best known running time in any dimension $d \ge 3$ is $\Omega\big(\binom{n}{k}\big)$. We show that: -- The problem is NP-hard already in 3 dimensions. -- In 3 dimensions, we break the bound $\Omega\big(\binom{n}{k}\big)$, by providing an $n^{O(\sqrt{k})}$ algorithm. -- For any constant dimension $d$, we present an efficient polynomial-time approximation scheme.}, }
Endnote
%0 Report %A Bringmann, Karl %A Cabello, Sergio %A Emmerich, Michael T. M. %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Maximum Volume Subset Selection for Anchored Boxes : %G eng %U http://hdl.handle.net/21.11116/0000-0001-3E08-2 %U http://arxiv.org/abs/1803.00849 %D 2018 %X Let $B$ be a set of $n$ axis-parallel boxes in $\mathbb{R}^d$ such that each box has a corner at the origin and the other corner in the positive quadrant of $\mathbb{R}^d$, and let $k$ be a positive integer. We study the problem of selecting $k$ boxes in $B$ that maximize the volume of the union of the selected boxes. This research is motivated by applications in skyline queries for databases and in multicriteria optimization, where the problem is known as the hypervolume subset selection problem. It is known that the problem can be solved in polynomial time in the plane, while the best known running time in any dimension $d \ge 3$ is $\Omega\big(\binom{n}{k}\big)$. We show that: - The problem is NP-hard already in 3 dimensions. - In 3 dimensions, we break the bound $\Omega\big(\binom{n}{k}\big)$, by providing an $n^{O(\sqrt{k})}$ algorithm. - For any constant dimension $d$, we present an efficient polynomial-time approximation scheme. %K Computer Science, Computational Geometry, cs.CG,Computer Science, Data Structures and Algorithms, cs.DS
[85]
K. Bringmann, T. Husfeldt, and M. Magnusson, “Multivariate Analysis of Orthogonal Range Searching and Graph Distances Parameterized by Treewidth,” 2018. [Online]. Available: http://arxiv.org/abs/1805.07135. (arXiv: 1805.07135)
Abstract
We show that the eccentricities, diameter, radius, and Wiener index of an undirected $n$-vertex graph with nonnegative edge lengths can be computed in time $O(n\cdot \binom{k+\lceil\log n\rceil}{k} \cdot 2^k k^2 \log n)$, where $k$ is the treewidth of the graph. For every $\epsilon>0$, this bound is $n^{1+\epsilon}\exp O(k)$, which matches a hardness result of Abboud, Vassilevska Williams, and Wang (SODA 2015) and closes an open problem in the multivariate analysis of polynomial-time computation. To this end, we show that the analysis of an algorithm of Cabello and Knauer (Comp. Geom., 2009) in the regime of non-constant treewidth can be improved by revisiting the analysis of orthogonal range searching, improving bounds of the form $\log^d n$ to $\binom{d+\lceil\log n\rceil}{d}$, as originally observed by Monier (J. Alg. 1980). We also investigate the parameterization by vertex cover number.
Export
BibTeX
@online{Bringmann_arXiv1805.07135, 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}, URL = {http://arxiv.org/abs/1805.07135}, EPRINT = {1805.07135}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We show that the eccentricities, diameter, radius, and Wiener index of an undirected $n$-vertex graph with nonnegative edge lengths can be computed in time $O(n\cdot \binom{k+\lceil\log n\rceil}{k} \cdot 2^k k^2 \log n)$, where $k$ is the treewidth of the graph. For every $\epsilon>0$, this bound is $n^{1+\epsilon}\exp O(k)$, which matches a hardness result of Abboud, Vassilevska Williams, and Wang (SODA 2015) and closes an open problem in the multivariate analysis of polynomial-time computation. To this end, we show that the analysis of an algorithm of Cabello and Knauer (Comp. Geom., 2009) in the regime of non-constant treewidth can be improved by revisiting the analysis of orthogonal range searching, improving bounds of the form $\log^d n$ to $\binom{d+\lceil\log n\rceil}{d}$, as originally observed by Monier (J. Alg. 1980). We also investigate the parameterization by vertex cover number.}, }
Endnote
%0 Report %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-0002-173B-3 %U http://arxiv.org/abs/1805.07135 %D 2018 %X We show that the eccentricities, diameter, radius, and Wiener index of an undirected $n$-vertex graph with nonnegative edge lengths can be computed in time $O(n\cdot \binom{k+\lceil\log n\rceil}{k} \cdot 2^k k^2 \log n)$, where $k$ is the treewidth of the graph. For every $\epsilon>0$, this bound is $n^{1+\epsilon}\exp O(k)$, which matches a hardness result of Abboud, Vassilevska Williams, and Wang (SODA 2015) and closes an open problem in the multivariate analysis of polynomial-time computation. To this end, we show that the analysis of an algorithm of Cabello and Knauer (Comp. Geom., 2009) in the regime of non-constant treewidth can be improved by revisiting the analysis of orthogonal range searching, improving bounds of the form $\log^d n$ to $\binom{d+\lceil\log n\rceil}{d}$, as originally observed by Monier (J. Alg. 1980). We also investigate the parameterization by vertex cover number. %K Computer Science, Data Structures and Algorithms, cs.DS
[86]
K. Bringmann and M. Künnemann, “Multivariate Fine-Grained Complexity of Longest Common Subsequence,” 2018. [Online]. Available: http://arxiv.org/abs/1803.00938. (arXiv: 1803.00938)
Abstract
We revisit the classic combinatorial pattern matching problem of finding a longest common subsequence (LCS). For strings $x$ and $y$ of length $n$, a textbook algorithm solves LCS in time $O(n^2)$, but although much effort has been spent, no $O(n^{2-\varepsilon})$-time algorithm is known. Recent work indeed shows that such an algorithm would refute the Strong Exponential Time Hypothesis (SETH) [Abboud, Backurs, Vassilevska Williams + Bringmann, K\"unnemann FOCS'15]. Despite the quadratic-time barrier, for over 40 years an enduring scientific interest continued to produce fast algorithms for LCS and its variations. Particular attention was put into identifying and exploiting input parameters that yield strongly subquadratic time algorithms for special cases of interest, e.g., differential file comparison. This line of research was successfully pursued until 1990, at which time significant improvements came to a halt. In this paper, using the lens of fine-grained complexity, our goal is to (1) justify the lack of further improvements and (2) determine whether some special cases of LCS admit faster algorithms than currently known. To this end, we provide a systematic study of the multivariate complexity of LCS, taking into account all parameters previously discussed in the literature: the input size $n:=\max\{|x|,|y|\}$, the length of the shorter string $m:=\min\{|x|,|y|\}$, the length $L$ of an LCS of $x$ and $y$, the numbers of deletions $\delta := m-L$ and $\Delta := n-L$, the alphabet size, as well as the numbers of matching pairs $M$ and dominant pairs $d$. For any class of instances defined by fixing each parameter individually to a polynomial in terms of the input size, we prove a SETH-based lower bound matching one of three known algorithms. Specifically, we determine the optimal running time for LCS under SETH as $(n+\min\{d, \delta \Delta, \delta m\})^{1\pm o(1)}$. [...]
Export
BibTeX
@online{Bringmann_arXiv1803.00938, TITLE = {Multivariate Fine-Grained Complexity of Longest Common Subsequence}, AUTHOR = {Bringmann, Karl and K{\"u}nnemann, Marvin}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1803.00938}, EPRINT = {1803.00938}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We revisit the classic combinatorial pattern matching problem of finding a longest common subsequence (LCS). For strings $x$ and $y$ of length $n$, a textbook algorithm solves LCS in time $O(n^2)$, but although much effort has been spent, no $O(n^{2-\varepsilon})$-time algorithm is known. Recent work indeed shows that such an algorithm would refute the Strong Exponential Time Hypothesis (SETH) [Abboud, Backurs, Vassilevska Williams + Bringmann, K\"unnemann FOCS'15]. Despite the quadratic-time barrier, for over 40 years an enduring scientific interest continued to produce fast algorithms for LCS and its variations. Particular attention was put into identifying and exploiting input parameters that yield strongly subquadratic time algorithms for special cases of interest, e.g., differential file comparison. This line of research was successfully pursued until 1990, at which time significant improvements came to a halt. In this paper, using the lens of fine-grained complexity, our goal is to (1) justify the lack of further improvements and (2) determine whether some special cases of LCS admit faster algorithms than currently known. To this end, we provide a systematic study of the multivariate complexity of LCS, taking into account all parameters previously discussed in the literature: the input size $n:=\max\{|x|,|y|\}$, the length of the shorter string $m:=\min\{|x|,|y|\}$, the length $L$ of an LCS of $x$ and $y$, the numbers of deletions $\delta := m-L$ and $\Delta := n-L$, the alphabet size, as well as the numbers of matching pairs $M$ and dominant pairs $d$. For any class of instances defined by fixing each parameter individually to a polynomial in terms of the input size, we prove a SETH-based lower bound matching one of three known algorithms. Specifically, we determine the optimal running time for LCS under SETH as $(n+\min\{d, \delta \Delta, \delta m\})^{1\pm o(1)}$. [...]}, }
Endnote
%0 Report %A Bringmann, Karl %A K&#252;nnemann, Marvin %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Multivariate Fine-Grained Complexity of Longest Common Subsequence : %G eng %U http://hdl.handle.net/21.11116/0000-0001-3E02-8 %U http://arxiv.org/abs/1803.00938 %D 2018 %X We revisit the classic combinatorial pattern matching problem of finding a longest common subsequence (LCS). For strings $x$ and $y$ of length $n$, a textbook algorithm solves LCS in time $O(n^2)$, but although much effort has been spent, no $O(n^{2-\varepsilon})$-time algorithm is known. Recent work indeed shows that such an algorithm would refute the Strong Exponential Time Hypothesis (SETH) [Abboud, Backurs, Vassilevska Williams + Bringmann, K\"unnemann FOCS'15]. Despite the quadratic-time barrier, for over 40 years an enduring scientific interest continued to produce fast algorithms for LCS and its variations. Particular attention was put into identifying and exploiting input parameters that yield strongly subquadratic time algorithms for special cases of interest, e.g., differential file comparison. This line of research was successfully pursued until 1990, at which time significant improvements came to a halt. In this paper, using the lens of fine-grained complexity, our goal is to (1) justify the lack of further improvements and (2) determine whether some special cases of LCS admit faster algorithms than currently known. To this end, we provide a systematic study of the multivariate complexity of LCS, taking into account all parameters previously discussed in the literature: the input size $n:=\max\{|x|,|y|\}$, the length of the shorter string $m:=\min\{|x|,|y|\}$, the length $L$ of an LCS of $x$ and $y$, the numbers of deletions $\delta := m-L$ and $\Delta := n-L$, the alphabet size, as well as the numbers of matching pairs $M$ and dominant pairs $d$. For any class of instances defined by fixing each parameter individually to a polynomial in terms of the input size, we prove a SETH-based lower bound matching one of three known algorithms. Specifically, we determine the optimal running time for LCS under SETH as $(n+\min\{d, \delta \Delta, \delta m\})^{1\pm o(1)}$. [...] %K Computer Science, Computational Complexity, cs.CC,Computer Science, Data Structures and Algorithms, cs.DS
[87]
K. Bringmann and M. Künnemann, “Multivariate Fine-Grained Complexity of Longest Common Subsequence,” in Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018), New Orleans, LA, USA, 2018.
Export
BibTeX
@inproceedings{Bringmann_SODA18, TITLE = {Multivariate Fine-Grained Complexity of Longest Common Subsequence}, AUTHOR = {Bringmann, Karl and K{\"u}nnemann, Marvin}, LANGUAGE = {eng}, ISBN = {978-1-61197-503-1}, DOI = {10.1137/1.9781611975031.79}, PUBLISHER = {SIAM}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, BOOKTITLE = {Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018)}, EDITOR = {Czumaj, Artur}, PAGES = {1216--1235}, ADDRESS = {New Orleans, LA, USA}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A K&#252;nnemann, Marvin %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Multivariate Fine-Grained Complexity of Longest Common Subsequence : %G eng %U http://hdl.handle.net/21.11116/0000-0000-3F0E-C %R 10.1137/1.9781611975031.79 %D 2018 %B Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2018-01-07 - 2018-01-10 %C New Orleans, LA, USA %B Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms %E Czumaj, Artur %P 1216 - 1235 %I SIAM %@ 978-1-61197-503-1
[88]
K. Bringmann, T. Friedrich, and A. Krohmer, “De-anonymization of Heterogeneous Random Graphs in Quasilinear Time,” Algorithmica, vol. 80, no. 11, 2018.
Export
BibTeX
@article{bringmann_deanonymization_2018, TITLE = {De-anonymization of Heterogeneous Random Graphs in Quasilinear Time}, AUTHOR = {Bringmann, Karl and Friedrich, Tobias and Krohmer, Anton}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-017-0395-0}, PUBLISHER = {Springer-Verlag}, ADDRESS = {New York, NY}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, JOURNAL = {Algorithmica}, VOLUME = {80}, NUMBER = {11}, PAGES = {3397--3427}, }
Endnote
%0 Journal Article %A Bringmann, Karl %A Friedrich, Tobias %A Krohmer, Anton %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T De-anonymization of Heterogeneous Random Graphs in Quasilinear Time : %G eng %U http://hdl.handle.net/21.11116/0000-0001-F6A3-1 %R 10.1007/s00453-017-0395-0 %7 2017-11-15 %D 2018 %J Algorithmica %V 80 %N 11 %& 3397 %P 3397 - 3427 %I Springer-Verlag %C New York, NY %@ false
[89]
K. Bringmann, P. Gawrychowski, S. Mozes, and O. Weimann, “Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can),” in Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018), New Orleans, LA, USA, 2018.
Export
BibTeX
@inproceedings{Bringmann_SODA18b, 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}, ISBN = {978-1-61197-503-1}, DOI = {10.1137/1.9781611975031.77}, PUBLISHER = {SIAM}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, BOOKTITLE = {Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018)}, EDITOR = {Czumaj, Artur}, PAGES = {1190--1206}, ADDRESS = {New Orleans, LA, USA}, }
Endnote
%0 Conference Proceedings %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-0000-3F13-5 %R 10.1137/1.9781611975031.77 %D 2018 %B Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2018-01-07 - 2018-01-10 %C New Orleans, LA, USA %B Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms %E Czumaj, Artur %P 1190 - 1206 %I SIAM %@ 978-1-61197-503-1
[90]
K. Bringmann and S. Krinninger, “A Note on Hardness of Diameter Approximation,” Information Processing Letters, vol. 133, 2018.
Export
BibTeX
@article{Bringmann2018, TITLE = {A Note on Hardness of Diameter Approximation}, AUTHOR = {Bringmann, Karl and Krinninger, Sebastian}, LANGUAGE = {eng}, ISSN = {0020-0190}, DOI = {10.1016/j.ipl.2017.12.010}, PUBLISHER = {Elsevier}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, JOURNAL = {Information Processing Letters}, VOLUME = {133}, PAGES = {10--15}, }
Endnote
%0 Journal Article %A Bringmann, Karl %A Krinninger, Sebastian %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T A Note on Hardness of Diameter Approximation : %G eng %U http://hdl.handle.net/21.11116/0000-0001-2C44-2 %R 10.1016/j.ipl.2017.12.010 %7 2018 %D 2018 %J Information Processing Letters %V 133 %& 10 %P 10 - 15 %I Elsevier %@ false
[91]
K. Bringmann, C. Ikenmeyer, and J. Zuiddam, “On Algebraic Branching Programs of Small Width,” Journal of the ACM, vol. 65, no. 5, 2018.
Export
BibTeX
@article{Bringmann_JACM2018, TITLE = {On Algebraic Branching Programs of Small Width}, AUTHOR = {Bringmann, Karl and Ikenmeyer, Christian and Zuiddam, Jeroen}, LANGUAGE = {eng}, ISSN = {0004-5411}, DOI = {10.1145/3209663}, PUBLISHER = {ACM}, ADDRESS = {New York, NY}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, JOURNAL = {Journal of the ACM}, VOLUME = {65}, NUMBER = {5}, PAGES = {1--29}, EID = {32}, }
Endnote
%0 Journal Article %A Bringmann, Karl %A Ikenmeyer, Christian %A Zuiddam, Jeroen %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T On Algebraic Branching Programs of Small Width : %G eng %U http://hdl.handle.net/21.11116/0000-0002-1B53-3 %R 10.1145/3209663 %7 2018 %D 2018 %J Journal of the ACM %V 65 %N 5 %& 1 %P 1 - 29 %Z sequence number: 32 %I ACM %C New York, NY %@ false
[92]
K. Bringmann and B. Ray Chaudhury, “Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS,” 2018. [Online]. Available: http://arxiv.org/abs/1810.01238. (arXiv: 1810.01238)
Abstract
We study sketching and streaming algorithms for the Longest Common Subsequence problem (LCS) on strings of small alphabet size $|\Sigma|$. For the problem of deciding whether the LCS of strings $x,y$ has length at least $L$, we obtain a sketch size and streaming space usage of $\mathcal{O}(L^{|\Sigma| - 1} \log L)$. We also prove matching unconditional lower bounds. As an application, we study a variant of LCS where each alphabet symbol is equipped with a weight that is given as input, and the task is to compute a common subsequence of maximum total weight. Using our sketching algorithm, we obtain an $\mathcal{O}(\textrm{min}\{nm, n + m^{{\lvert \Sigma \rvert}}\})$-time algorithm for this problem, on strings $x,y$ of length $n,m$, with $n \ge m$. We prove optimality of this running time up to lower order factors, assuming the Strong Exponential Time Hypothesis.
Export
BibTeX
@online{Bringmann_arXiv1810.01238, TITLE = {Sketching, Streaming, and Fine-Grained Complexity of (Weighted) {LCS}}, AUTHOR = {Bringmann, Karl and Ray Chaudhury, Bhaskar}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1810.01238}, EPRINT = {1810.01238}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We study sketching and streaming algorithms for the Longest Common Subsequence problem (LCS) on strings of small alphabet size $|\Sigma|$. For the problem of deciding whether the LCS of strings $x,y$ has length at least $L$, we obtain a sketch size and streaming space usage of $\mathcal{O}(L^{|\Sigma| - 1} \log L)$. We also prove matching unconditional lower bounds. As an application, we study a variant of LCS where each alphabet symbol is equipped with a weight that is given as input, and the task is to compute a common subsequence of maximum total weight. Using our sketching algorithm, we obtain an $\mathcal{O}(\textrm{min}\{nm, n + m^{{\lvert \Sigma \rvert}}\})$-time algorithm for this problem, on strings $x,y$ of length $n,m$, with $n \ge m$. We prove optimality of this running time up to lower order factors, assuming the Strong Exponential Time Hypothesis.}, }
Endnote
%0 Report %A Bringmann, Karl %A Ray Chaudhury, Bhaskar %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS : %G eng %U http://hdl.handle.net/21.11116/0000-0002-57B9-C %U http://arxiv.org/abs/1810.01238 %D 2018 %X We study sketching and streaming algorithms for the Longest Common Subsequence problem (LCS) on strings of small alphabet size $|\Sigma|$. For the problem of deciding whether the LCS of strings $x,y$ has length at least $L$, we obtain a sketch size and streaming space usage of $\mathcal{O}(L^{|\Sigma| - 1} \log L)$. We also prove matching unconditional lower bounds. As an application, we study a variant of LCS where each alphabet symbol is equipped with a weight that is given as input, and the task is to compute a common subsequence of maximum total weight. Using our sketching algorithm, we obtain an $\mathcal{O}(\textrm{min}\{nm, n + m^{{\lvert \Sigma \rvert}}\})$-time algorithm for this problem, on strings $x,y$ of length $n,m$, with $n \ge m$. We prove optimality of this running time up to lower order factors, assuming the Strong Exponential Time Hypothesis. %K Computer Science, Data Structures and Algorithms, cs.DS,
[93]
K. Bringmann and B. Ray Chaudhury, “Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS,” in 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018), Ahmedabad, India, 2018.
Export
BibTeX
@inproceedings{Bringmann_FSTTCS2018, TITLE = {Sketching, Streaming, and Fine-Grained Complexity of (Weighted) {LCS}}, AUTHOR = {Bringmann, Karl and Ray Chaudhury, Bhaskar}, LANGUAGE = {eng}, ISSN = {1868-896}, ISBN = {978-3-95977-093-4}, URL = {urn:nbn:de:0030-drops-99390}, DOI = {10.4230/LIPIcs.FSTTCS.2018.40}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)}, EDITOR = {Ganguly, Sumit and Pandya, Paritosh}, PAGES = {1--16}, EID = {40}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {122}, ADDRESS = {Ahmedabad, India}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Ray Chaudhury, Bhaskar %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS : %G eng %U http://hdl.handle.net/21.11116/0000-0002-9D0B-2 %R 10.4230/LIPIcs.FSTTCS.2018.40 %U urn:nbn:de:0030-drops-99390 %D 2018 %B 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science %Z date of event: 2018-12-11 - 2018-12-13 %C Ahmedabad, India %B 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science %E Ganguly, Sumit; Pandya, Paritosh %P 1 - 16 %Z sequence number: 40 %I Schloss Dagstuhl %@ 978-3-95977-093-4 %B Leibniz International Proceedings in Informatics %N 122 %@ false %U http://drops.dagstuhl.de/opus/volltexte/2018/9939/http://drops.dagstuhl.de/doku/urheberrecht1.html
[94]
K. Bringmann, M. Künnemann, and A. Nusser, “Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability,” 2018. [Online]. Available: http://arxiv.org/abs/1810.10982. (arXiv: 1810.10982)
Abstract
The discrete Fr\'echet distance is a popular measure for comparing polygonal curves. An important variant is the discrete Fr\'echet distance under translation, which enables detection of similar movement patterns in different spatial domains. For polygonal curves of length $n$ in the plane, the fastest known algorithm runs in time $\tilde{\cal O}(n^{5})$ [Ben Avraham, Kaplan, Sharir '15]. This is achieved by constructing an arrangement of disks of size ${\cal O}(n^{4})$, and then traversing its faces while updating reachability in a directed grid graph of size $N := {\cal O}(n^2)$, which can be done in time $\tilde{\cal O}(\sqrt{N})$ per update [Diks, Sankowski '07]. The contribution of this paper is two-fold. First, although it is an open problem to solve dynamic reachability in directed grid graphs faster than $\tilde{\cal O}(\sqrt{N})$, we improve this part of the algorithm: We observe that an offline variant of dynamic $s$-$t$-reachability in directed grid graphs suffices, and we solve this variant in amortized time $\tilde{\cal O}(N^{1/3})$ per update, resulting in an improved running time of $\tilde{\cal O}(n^{4.66...})$ for the discrete Fr\'echet distance under translation. Second, we provide evidence that constructing the arrangement of size ${\cal O}(n^{4})$ is necessary in the worst case, by proving a conditional lower bound of $n^{4 - o(1)}$ on the running time for the discrete Fr\'echet distance under translation, assuming the Strong Exponential Time Hypothesis.
Export
BibTeX
@online{Bringmann_arXiv1810.10982, TITLE = {Fr{\'e}chet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability}, AUTHOR = {Bringmann, Karl and K{\"u}nnemann, Marvin and Nusser, Andr{\'e}}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1810.10982}, EPRINT = {1810.10982}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {The discrete Fr\'echet distance is a popular measure for comparing polygonal curves. An important variant is the discrete Fr\'echet distance under translation, which enables detection of similar movement patterns in different spatial domains. For polygonal curves of length $n$ in the plane, the fastest known algorithm runs in time $\tilde{\cal O}(n^{5})$ [Ben Avraham, Kaplan, Sharir '15]. This is achieved by constructing an arrangement of disks of size ${\cal O}(n^{4})$, and then traversing its faces while updating reachability in a directed grid graph of size $N := {\cal O}(n^2)$, which can be done in time $\tilde{\cal O}(\sqrt{N})$ per update [Diks, Sankowski '07]. The contribution of this paper is two-fold. First, although it is an open problem to solve dynamic reachability in directed grid graphs faster than $\tilde{\cal O}(\sqrt{N})$, we improve this part of the algorithm: We observe that an offline variant of dynamic $s$-$t$-reachability in directed grid graphs suffices, and we solve this variant in amortized time $\tilde{\cal O}(N^{1/3})$ per update, resulting in an improved running time of $\tilde{\cal O}(n^{4.66...})$ for the discrete Fr\'echet distance under translation. Second, we provide evidence that constructing the arrangement of size ${\cal O}(n^{4})$ is necessary in the worst case, by proving a conditional lower bound of $n^{4 -- o(1)}$ on the running time for the discrete Fr\'echet distance under translation, assuming the Strong Exponential Time Hypothesis.}, }
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 Fr&#233;chet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability : %G eng %U http://hdl.handle.net/21.11116/0000-0002-9E35-1 %U http://arxiv.org/abs/1810.10982 %D 2018 %X The discrete Fr\'echet distance is a popular measure for comparing polygonal curves. An important variant is the discrete Fr\'echet distance under translation, which enables detection of similar movement patterns in different spatial domains. For polygonal curves of length $n$ in the plane, the fastest known algorithm runs in time $\tilde{\cal O}(n^{5})$ [Ben Avraham, Kaplan, Sharir '15]. This is achieved by constructing an arrangement of disks of size ${\cal O}(n^{4})$, and then traversing its faces while updating reachability in a directed grid graph of size $N := {\cal O}(n^2)$, which can be done in time $\tilde{\cal O}(\sqrt{N})$ per update [Diks, Sankowski '07]. The contribution of this paper is two-fold. First, although it is an open problem to solve dynamic reachability in directed grid graphs faster than $\tilde{\cal O}(\sqrt{N})$, we improve this part of the algorithm: We observe that an offline variant of dynamic $s$-$t$-reachability in directed grid graphs suffices, and we solve this variant in amortized time $\tilde{\cal O}(N^{1/3})$ per update, resulting in an improved running time of $\tilde{\cal O}(n^{4.66...})$ for the discrete Fr\'echet distance under translation. Second, we provide evidence that constructing the arrangement of size ${\cal O}(n^{4})$ is necessary in the worst case, by proving a conditional lower bound of $n^{4 - o(1)}$ on the running time for the discrete Fr\'echet distance under translation, assuming the Strong Exponential Time Hypothesis. %K Computer Science, Data Structures and Algorithms, cs.DS
[95]
J. Bund, C. Lenzen, and M. Medina, “Optimal Metastability-containing Sorting Networks,” in Proceedings of the 2018 Design, Automation & Test in Europe (DATE 2018), Dresden, Germany, 2018.
Export
BibTeX
@inproceedings{Bund_DATE2018, TITLE = {Optimal Metastability-containing Sorting Networks}, AUTHOR = {Bund, Johannes and Lenzen, Christoph and Medina, Moti}, LANGUAGE = {eng}, ISBN = {978-3-9819263-1-6}, DOI = {10.23919/DATE.2018.8342063}, PUBLISHER = {IEEE}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, BOOKTITLE = {Proceedings of the 2018 Design, Automation \& Test in Europe (DATE 2018)}, PAGES = {521--526}, ADDRESS = {Dresden, Germany}, }
Endnote
%0 Conference Proceedings %A Bund, Johannes %A Lenzen, Christoph %A Medina, Moti %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Optimal Metastability-containing Sorting Networks : %G eng %U http://hdl.handle.net/21.11116/0000-0001-3F69-4 %R 10.23919/DATE.2018.8342063 %D 2018 %B Design, Automation & Test in Europe Conference & Exhibition %Z date of event: 2018-03-19 - 2018-03-23 %C Dresden, Germany %B Proceedings of the 2018 Design, Automation & Test in Europe %P 521 - 526 %I IEEE %@ 978-3-9819263-1-6
[96]
J. Bund, C. Lenzen, and M. Medina, “Optimal Metastability-Containing Sorting Networks,” 2018. [Online]. Available: http://arxiv.org/abs/1801.07549. (arXiv: 1801.07549)
Abstract
When setup/hold times of bistable elements are violated, they may become metastable, i.e., enter a transient state that is neither digital 0 nor 1. In general, metastability cannot be avoided, a problem that manifests whenever taking discrete measurements of analog values. Metastability of the output then reflects uncertainty as to whether a measurement should be rounded up or down to the next possible measurement outcome. Surprisingly, Lenzen and Medina (ASYNC 2016) showed that metastability can be contained, i.e., measurement values can be correctly sorted without resolving metastability first. However, both their work and the state of the art by Bund et al. (DATE 2017) leave open whether such a solution can be as small and fast as standard sorting networks. We show that this is indeed possible, by providing a circuit that sorts Gray code inputs (possibly containing a metastable bit) and has asymptotically optimal depth and size. Concretely, for 10-channel sorting networks and 16-bit wide inputs, we improve by 48.46% in delay and by 71.58% in area over Bund et al. Our simulations indicate that straightforward transistor-level optimization is likely to result in performance on par with standard (non-containing) solutions.
Export
BibTeX
@online{Bund_arXiv1801.07549, TITLE = {Optimal Metastability-Containing Sorting Networks}, AUTHOR = {Bund, Johannes and Lenzen, Christoph and Medina, Moti}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1801.07549}, EPRINT = {1801.07549}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {When setup/hold times of bistable elements are violated, they may become metastable, i.e., enter a transient state that is neither digital 0 nor 1. In general, metastability cannot be avoided, a problem that manifests whenever taking discrete measurements of analog values. Metastability of the output then reflects uncertainty as to whether a measurement should be rounded up or down to the next possible measurement outcome. Surprisingly, Lenzen and Medina (ASYNC 2016) showed that metastability can be contained, i.e., measurement values can be correctly sorted without resolving metastability first. However, both their work and the state of the art by Bund et al. (DATE 2017) leave open whether such a solution can be as small and fast as standard sorting networks. We show that this is indeed possible, by providing a circuit that sorts Gray code inputs (possibly containing a metastable bit) and has asymptotically optimal depth and size. Concretely, for 10-channel sorting networks and 16-bit wide inputs, we improve by 48.46% in delay and by 71.58% in area over Bund et al. Our simulations indicate that straightforward transistor-level optimization is likely to result in performance on par with standard (non-containing) solutions.}, }
Endnote
%0 Report %A Bund, Johannes %A Lenzen, Christoph %A Medina, Moti %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Optimal Metastability-Containing Sorting Networks : %G eng %U http://hdl.handle.net/21.11116/0000-0002-1801-2 %U http://arxiv.org/abs/1801.07549 %D 2018 %X When setup/hold times of bistable elements are violated, they may become metastable, i.e., enter a transient state that is neither digital 0 nor 1. In general, metastability cannot be avoided, a problem that manifests whenever taking discrete measurements of analog values. Metastability of the output then reflects uncertainty as to whether a measurement should be rounded up or down to the next possible measurement outcome. Surprisingly, Lenzen and Medina (ASYNC 2016) showed that metastability can be contained, i.e., measurement values can be correctly sorted without resolving metastability first. However, both their work and the state of the art by Bund et al. (DATE 2017) leave open whether such a solution can be as small and fast as standard sorting networks. We show that this is indeed possible, by providing a circuit that sorts Gray code inputs (possibly containing a metastable bit) and has asymptotically optimal depth and size. Concretely, for 10-channel sorting networks and 16-bit wide inputs, we improve by 48.46% in delay and by 71.58% in area over Bund et al. Our simulations indicate that straightforward transistor-level optimization is likely to result in performance on par with standard (non-containing) solutions. %K Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC
[97]
J. Bund, C. Lenzen, and M. Medina, “Small Hazard-free Transducers,” 2018. [Online]. Available: http://arxiv.org/abs/1811.12369. (arXiv: 1811.12369)
Abstract
Recently, an unconditional exponential separation between the hazard-free complexity and (standard) circuit complexity of explicit functions has been shown. This raises the question: which classes of functions permit efficient hazard-free circuits? Our main result is as follows. A \emph{transducer} is a finite state machine that transcribes, symbol by symbol, an input string of length $n$ into an output string of length $n$. We prove that any function arising from a transducer with $s$ states, that is input symbols which are encoded by $\ell$ bits, has a hazard-free circuit of size $2^{\BO(s+\ell)}\cdot n$ and depth $\BO(\ell+ s\cdot \log n)$; in particular, if $s, \ell\in \BO(1)$, size and depth are asymptotically optimal. We utilize our main result to derive efficient circuits for \emph{$k$-recoverable addition}. Informally speaking, a code is \emph{$k$-recoverable} if it does not increase uncertainty regarding the encoded value, so long as it is guaranteed that it is from $\{x,x+1,\ldots,x+k\}$ for some $x\in \NN_0$. We provide an asymptotically optimal $k$-recoverable code. We also realize a transducer with $\BO(k)$ states that adds two codewords from this $k$-recoverable code. Combined with our main result, we obtain a hazard-free adder circuit of size $2^{\BO(k)}n$ and depth $\BO(k\log n)$ with respect to this code, i.e., a $k$-recoverable adder circuit that adds two codewords of $n$ bits each. In other words, $k$-recoverable addition is fixed-parameter tractable with respect to $k$.
Export
BibTeX
@online{Bund_arXiv1811.12369, TITLE = {Small Hazard-free Transducers}, AUTHOR = {Bund, Johannes and Lenzen, Christoph and Medina, Moti}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1811.12369}, EPRINT = {1811.12369}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Recently, an unconditional exponential separation between the hazard-free complexity and (standard) circuit complexity of explicit functions has been shown. This raises the question: which classes of functions permit efficient hazard-free circuits? Our main result is as follows. A \emph{transducer} is a finite state machine that transcribes, symbol by symbol, an input string of length $n$ into an output string of length $n$. We prove that any function arising from a transducer with $s$ states, that is input symbols which are encoded by $\ell$ bits, has a hazard-free circuit of size $2^{\BO(s+\ell)}\cdot n$ and depth $\BO(\ell+ s\cdot \log n)$; in particular, if $s, \ell\in \BO(1)$, size and depth are asymptotically optimal. We utilize our main result to derive efficient circuits for \emph{$k$-recoverable addition}. Informally speaking, a code is \emph{$k$-recoverable} if it does not increase uncertainty regarding the encoded value, so long as it is guaranteed that it is from $\{x,x+1,\ldots,x+k\}$ for some $x\in \NN_0$. We provide an asymptotically optimal $k$-recoverable code. We also realize a transducer with $\BO(k)$ states that adds two codewords from this $k$-recoverable code. Combined with our main result, we obtain a hazard-free adder circuit of size $2^{\BO(k)}n$ and depth $\BO(k\log n)$ with respect to this code, i.e., a $k$-recoverable adder circuit that adds two codewords of $n$ bits each. In other words, $k$-recoverable addition is fixed-parameter tractable with respect to $k$.}, }
Endnote
%0 Report %A Bund, Johannes %A Lenzen, Christoph %A Medina, Moti %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Small Hazard-free Transducers : %G eng %U http://hdl.handle.net/21.11116/0000-0002-9FAD-9 %U http://arxiv.org/abs/1811.12369 %D 2018 %X Recently, an unconditional exponential separation between the hazard-free complexity and (standard) circuit complexity of explicit functions has been shown. This raises the question: which classes of functions permit efficient hazard-free circuits? Our main result is as follows. A \emph{transducer} is a finite state machine that transcribes, symbol by symbol, an input string of length $n$ into an output string of length $n$. We prove that any function arising from a transducer with $s$ states, that is input symbols which are encoded by $\ell$ bits, has a hazard-free circuit of size $2^{\BO(s+\ell)}\cdot n$ and depth $\BO(\ell+ s\cdot \log n)$; in particular, if $s, \ell\in \BO(1)$, size and depth are asymptotically optimal. We utilize our main result to derive efficient circuits for \emph{$k$-recoverable addition}. Informally speaking, a code is \emph{$k$-recoverable} if it does not increase uncertainty regarding the encoded value, so long as it is guaranteed that it is from $\{x,x+1,\ldots,x+k\}$ for some $x\in \NN_0$. We provide an asymptotically optimal $k$-recoverable code. We also realize a transducer with $\BO(k)$ states that adds two codewords from this $k$-recoverable code. Combined with our main result, we obtain a hazard-free adder circuit of size $2^{\BO(k)}n$ and depth $\BO(k\log n)$ with respect to this code, i.e., a $k$-recoverable adder circuit that adds two codewords of $n$ bits each. In other words, $k$-recoverable addition is fixed-parameter tractable with respect to $k$. %K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Computational Complexity, cs.CC
[98]
P. Chalermsook, M. Goswami, L. Kozma, K. Mehlhorn, and T. Saranurak, “Multi-Finger Binary Search Trees,” in 29th International Symposium on Algorithms and Computation (ISAAC 2018), Jiaoxi, Yilan, Taiwan, 2018.
Export
BibTeX
@inproceedings{Chalermsook_ISAAC2018b, TITLE = {Multi-Finger Binary Search Trees}, AUTHOR = {Chalermsook, Parinya and Goswami, Mayank and Kozma, L{\`a}sz{\`o} and Mehlhorn, Kurt and Saranurak, Thatchaphol}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-094-1}, URL = {urn:nbn:de:0030-drops-100032}, DOI = {10.4230/LIPIcs.ISAAC.2018.55}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, EDITOR = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, PAGES = {1--26}, EID = {55}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {123}, ADDRESS = {Jiaoxi, Yilan, Taiwan}, }
Endnote
%0 Conference Proceedings %A Chalermsook, Parinya %A Goswami, Mayank %A Kozma, L&#224;sz&#242; %A Mehlhorn, Kurt %A Saranurak, Thatchaphol %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Multi-Finger Binary Search Trees : %G eng %U http://hdl.handle.net/21.11116/0000-0002-AADE-5 %R 10.4230/LIPIcs.ISAAC.2018.55 %U urn:nbn:de:0030-drops-100032 %D 2018 %B 29th International Symposium on Algorithms and Computation %Z date of event: 2018-12-16 - 2018-12-19 %C Jiaoxi, Yilan, Taiwan %B 29th International Symposium on Algorithms and Computation %E Hsu, Wen-Lian; Lee, Der-Tsai; Liao, Chung-Shou %P 1 - 26 %Z sequence number: 55 %I Schloss Dagstuhl %@ 978-3-95977-094-1 %B Leibniz International Proceedings in Informatics %N 123 %@ false %U http://drops.dagstuhl.de/opus/volltexte/2018/10003/http://drops.dagstuhl.de/doku/urheberrecht1.html
[99]
P. Chalermsook, S. Das, G. Even, B. Laekhanukit, and D. Vaz, “Survivable Network Design for Group Connectivity in Low-Treewidth Graphs,” 2018. [Online]. Available: http://arxiv.org/abs/1802.10403. (arXiv: 1802.10403)
Abstract
In the Group Steiner Tree problem (GST), we are given a (vertex or edge)-weighted graph $G=(V,E)$ on $n$ vertices, a root vertex $r$ and a collection of groups $\{S_i\}_{i\in[h]}: S_i\subseteq V(G)$. The goal is to find a min-cost subgraph $H$ that connects the root to every group. We consider a fault-tolerant variant of GST, which we call Restricted (Rooted) Group SNDP. In this setting, each group $S_i$ has a demand $k_i\in[k],k\in\mathbb N$, and we wish to find a min-cost $H\subseteq G$ such that, for each group $S_i$, there is a vertex in $S_i$ connected to the root via $k_i$ (vertex or edge) disjoint paths. While GST admits $O(\log^2 n\log h)$ approximation, its high connectivity variants are Label-Cover hard, and for the vertex-weighted version, the hardness holds even when $k=2$. Previously, positive results were known only for the edge-weighted version when $k=2$ [Gupta et al., SODA 2010; Khandekar et al., Theor. Comput. Sci., 2012] and for a relaxed variant where the disjoint paths may end at different vertices in a group [Chalermsook et al., SODA 2015]. Our main result is an $O(\log n\log h)$ approximation for Restricted Group SNDP that runs in time $n^{f(k, w)}$, where $w$ is the treewidth of $G$. This nearly matches the lower bound when $k$ and $w$ are constant. The key to achieving this result is a non-trivial extension of the framework in [Chalermsook et al., SODA 2017], which embeds all feasible solutions to the problem into a dynamic program (DP) table. However, finding the optimal solution in the DP table remains intractable. We formulate a linear program relaxation for the DP and obtain an approximate solution via randomized rounding. This framework also allows us to systematically construct DP tables for high-connectivity problems. As a result, we present new exact algorithms for several variants of survivable network design problems in low-treewidth graphs.
Export
BibTeX
@online{Chalermsook_arXiv1802.10403, TITLE = {Survivable Network Design for Group Connectivity in Low-Treewidth Graphs}, AUTHOR = {Chalermsook, Parinya and Das, Syamantak and Even, Guy and Laekhanukit, Bundit and Vaz, Daniel}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1802.10403}, EPRINT = {1802.10403}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {In the Group Steiner Tree problem (GST), we are given a (vertex or edge)-weighted graph $G=(V,E)$ on $n$ vertices, a root vertex $r$ and a collection of groups $\{S_i\}_{i\in[h]}: S_i\subseteq V(G)$. The goal is to find a min-cost subgraph $H$ that connects the root to every group. We consider a fault-tolerant variant of GST, which we call Restricted (Rooted) Group SNDP. In this setting, each group $S_i$ has a demand $k_i\in[k],k\in\mathbb N$, and we wish to find a min-cost $H\subseteq G$ such that, for each group $S_i$, there is a vertex in $S_i$ connected to the root via $k_i$ (vertex or edge) disjoint paths. While GST admits $O(\log^2 n\log h)$ approximation, its high connectivity variants are Label-Cover hard, and for the vertex-weighted version, the hardness holds even when $k=2$. Previously, positive results were known only for the edge-weighted version when $k=2$ [Gupta et al., SODA 2010; Khandekar et al., Theor. Comput. Sci., 2012] and for a relaxed variant where the disjoint paths may end at different vertices in a group [Chalermsook et al., SODA 2015]. Our main result is an $O(\log n\log h)$ approximation for Restricted Group SNDP that runs in time $n^{f(k, w)}$, where $w$ is the treewidth of $G$. This nearly matches the lower bound when $k$ and $w$ are constant. The key to achieving this result is a non-trivial extension of the framework in [Chalermsook et al., SODA 2017], which embeds all feasible solutions to the problem into a dynamic program (DP) table. However, finding the optimal solution in the DP table remains intractable. We formulate a linear program relaxation for the DP and obtain an approximate solution via randomized rounding. This framework also allows us to systematically construct DP tables for high-connectivity problems. As a result, we present new exact algorithms for several variants of survivable network design problems in low-treewidth graphs.}, }
Endnote
%0 Report %A Chalermsook, Parinya %A Das, Syamantak %A Even, Guy %A Laekhanukit, Bundit %A Vaz, Daniel %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Survivable Network Design for Group Connectivity in Low-Treewidth Graphs : %G eng %U http://hdl.handle.net/21.11116/0000-0002-A84E-A %U http://arxiv.org/abs/1802.10403 %D 2018 %X In the Group Steiner Tree problem (GST), we are given a (vertex or edge)-weighted graph $G=(V,E)$ on $n$ vertices, a root vertex $r$ and a collection of groups $\{S_i\}_{i\in[h]}: S_i\subseteq V(G)$. The goal is to find a min-cost subgraph $H$ that connects the root to every group. We consider a fault-tolerant variant of GST, which we call Restricted (Rooted) Group SNDP. In this setting, each group $S_i$ has a demand $k_i\in[k],k\in\mathbb N$, and we wish to find a min-cost $H\subseteq G$ such that, for each group $S_i$, there is a vertex in $S_i$ connected to the root via $k_i$ (vertex or edge) disjoint paths. While GST admits $O(\log^2 n\log h)$ approximation, its high connectivity variants are Label-Cover hard, and for the vertex-weighted version, the hardness holds even when $k=2$. Previously, positive results were known only for the edge-weighted version when $k=2$ [Gupta et al., SODA 2010; Khandekar et al., Theor. Comput. Sci., 2012] and for a relaxed variant where the disjoint paths may end at different vertices in a group [Chalermsook et al., SODA 2015]. Our main result is an $O(\log n\log h)$ approximation for Restricted Group SNDP that runs in time $n^{f(k, w)}$, where $w$ is the treewidth of $G$. This nearly matches the lower bound when $k$ and $w$ are constant. The key to achieving this result is a non-trivial extension of the framework in [Chalermsook et al., SODA 2017], which embeds all feasible solutions to the problem into a dynamic program (DP) table. However, finding the optimal solution in the DP table remains intractable. We formulate a linear program relaxation for the DP and obtain an approximate solution via randomized rounding. This framework also allows us to systematically construct DP tables for high-connectivity problems. As a result, we present new exact algorithms for several variants of survivable network design problems in low-treewidth graphs. %K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Discrete Mathematics, cs.DM
[100]
P. Chalermsook, S. Das, G. Even, B. Laekhanukit, and D. Vaz, “Survivable Network Design for Group Connectivity in Low-Treewidth Graphs,” in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018), Princeton, NJ, USA, 2018.
Export
BibTeX
@inproceedings{Chalermsook_APPROXRANDOM18, TITLE = {Survivable Network Design for Group Connectivity in Low-Treewidth Graphs}, AUTHOR = {Chalermsook, Parinya and Das, Syamantak and Even, Guy and Laekhanukit, Bundit and Vaz, Daniel}, LANGUAGE = {eng}, ISBN = {978-3-95977-085-9}, URL = {urn:nbn:de:0030-drops-94127}, DOI = {10.4230/LIPIcs.APPROX-RANDOM.2018.8}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)}, EDITOR = {Blais, Eric and Jansen, Klaus and Rolim, Jos{\'e} D. P. and Steurer, David}, PAGES = {1--19}, EID = {8}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {116}, ADDRESS = {Princeton, NJ, USA}, }
Endnote
%0 Conference Proceedings %A Chalermsook, Parinya %A Das, Syamantak %A Even, Guy %A Laekhanukit, Bundit %A Vaz, Daniel %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Survivable Network Design for Group Connectivity in Low-Treewidth Graphs : %G eng %U http://hdl.handle.net/21.11116/0000-0002-A832-8 %R 10.4230/LIPIcs.APPROX-RANDOM.2018.8 %U urn:nbn:de:0030-drops-94127 %D 2018 %B 21st International Workshop on Approximation Algorithms for Combinatorial Optimization Problems / 22nd International Workshop on Randomization and Computation %Z date of event: 2018-08-20 - 2018-08-22 %C Princeton, NJ, USA %B Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques %E Blais, Eric; Jansen, Klaus; Rolim, Jos&#233; D. P.; Steurer, David %P 1 - 19 %Z sequence number: 8 %I Schloss Dagstuhl %@ 978-3-95977-085-9 %B Leibniz International Proceedings in Informatics %N 116 %U http://drops.dagstuhl.de/opus/volltexte/2018/9412/http://drops.dagstuhl.de/doku/urheberrecht1.html
[101]
P. Chalermsook, A. Schmid, and S. Uniyal, “A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs,” 2018. [Online]. Available: http://arxiv.org/abs/1804.03485. (arXiv: 1804.03485)
Abstract
A cactus graph is a graph in which any two cycles are edge-disjoint. We present a constructive proof of the fact that any plane graph $G$ contains a cactus subgraph $C$ where $C$ contains at least a $\frac{1}{6}$ fraction of the triangular faces of $G$. We also show that this ratio cannot be improved by showing a tight lower bound. Together with an algorithm for linear matroid parity, our bound implies two approximation algorithms for computing "dense planar structures" inside any graph: (i) A $\frac{1}{6}$ approximation algorithm for, given any graph $G$, finding a planar subgraph with a maximum number of triangular faces; this improves upon the previous $\frac{1}{11}$-approximation; (ii) An alternate (and arguably more illustrative) proof of the $\frac{4}{9}$ approximation algorithm for finding a planar subgraph with a maximum number of edges. Our bound is obtained by analyzing a natural local search strategy and heavily exploiting the exchange arguments. Therefore, this suggests the power of local search in handling problems of this kind.
Export
BibTeX
@online{Chalermsook_arXiv1804.03485, TITLE = {A Tight Extremal Bound on the {Lov\'{a}sz} Cactus Number in Planar Graphs}, AUTHOR = {Chalermsook, Parinya and Schmid, Andreas and Uniyal, Sumedha}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1804.03485}, EPRINT = {1804.03485}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {A cactus graph is a graph in which any two cycles are edge-disjoint. We present a constructive proof of the fact that any plane graph $G$ contains a cactus subgraph $C$ where $C$ contains at least a $\frac{1}{6}$ fraction of the triangular faces of $G$. We also show that this ratio cannot be improved by showing a tight lower bound. Together with an algorithm for linear matroid parity, our bound implies two approximation algorithms for computing "dense planar structures" inside any graph: (i) A $\frac{1}{6}$ approximation algorithm for, given any graph $G$, finding a planar subgraph with a maximum number of triangular faces; this improves upon the previous $\frac{1}{11}$-approximation; (ii) An alternate (and arguably more illustrative) proof of the $\frac{4}{9}$ approximation algorithm for finding a planar subgraph with a maximum number of edges. Our bound is obtained by analyzing a natural local search strategy and heavily exploiting the exchange arguments. Therefore, this suggests the power of local search in handling problems of this kind.}, }
Endnote
%0 Report %A Chalermsook, Parinya %A Schmid, Andreas %A Uniyal, Sumedha %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T A Tight Extremal Bound on the Lov&#225;sz Cactus Number in Planar Graphs : %G eng %U http://hdl.handle.net/21.11116/0000-0002-E5D0-0 %U http://arxiv.org/abs/1804.03485 %D 2018 %X A cactus graph is a graph in which any two cycles are edge-disjoint. We present a constructive proof of the fact that any plane graph $G$ contains a cactus subgraph $C$ where $C$ contains at least a $\frac{1}{6}$ fraction of the triangular faces of $G$. We also show that this ratio cannot be improved by showing a tight lower bound. Together with an algorithm for linear matroid parity, our bound implies two approximation algorithms for computing "dense planar structures" inside any graph: (i) A $\frac{1}{6}$ approximation algorithm for, given any graph $G$, finding a planar subgraph with a maximum number of triangular faces; this improves upon the previous $\frac{1}{11}$-approximation; (ii) An alternate (and arguably more illustrative) proof of the $\frac{4}{9}$ approximation algorithm for finding a planar subgraph with a maximum number of edges. Our bound is obtained by analyzing a natural local search strategy and heavily exploiting the exchange arguments. Therefore, this suggests the power of local search in handling problems of this kind. %K Computer Science, Discrete Mathematics, cs.DM,Computer Science, Data Structures and Algorithms, cs.DS,Mathematics, Combinatorics, math.CO
[102]
L. S. Chandran, A. Das, D. Issac, and E. J. van Leeuwen, “Algorithms and Bounds for Very Strong Rainbow Coloring,” in LATIN 2018: Theoretical Informatics, Buenos Aires, Argentinia, 2018.
Export
BibTeX
@inproceedings{Chandran_LATIN2018, TITLE = {Algorithms and Bounds for Very Strong Rainbow Coloring}, AUTHOR = {Chandran, L. Sunil and Das, Anita and Issac, Davis and van Leeuwen, Erik Jan}, LANGUAGE = {eng}, ISBN = {978-3-319-77403-9}, DOI = {10.1007/978-3-319-77404-6_46}, PUBLISHER = {Springer}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, BOOKTITLE = {LATIN 2018: Theoretical Informatics}, EDITOR = {Bender, Michael A. and Farach-Colton, Mart{\'i}n and Mosteiro, Miguel A.}, PAGES = {625--639}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {10807}, ADDRESS = {Buenos Aires, Argentinia}, }
Endnote
%0 Conference Proceedings %A Chandran, L. Sunil %A Das, Anita %A Issac, Davis %A van Leeuwen, Erik Jan %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Algorithms and Bounds for Very Strong Rainbow Coloring : %G eng %U http://hdl.handle.net/21.11116/0000-0002-576A-6 %R 10.1007/978-3-319-77404-6_46 %D 2018 %B 13th Latin American Theoretical Informatics Symposium %Z date of event: 2018-04-16 - 2018-04-19 %C Buenos Aires, Argentinia %B LATIN 2018: Theoretical Informatics %E Bender, Michael A.; Farach-Colton, Mart&#237;n; Mosteiro, Miguel A. %P 625 - 639 %I Springer %@ 978-3-319-77403-9 %B Lecture Notes in Computer Science %N 10807
[103]
L. S. Chandran, Y. K. Cheung, and D. Issac, “Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition,” in 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Prague, Czech Republic, 2018.
Export
BibTeX
@inproceedings{stc-gyo-lov-2018-chandran, TITLE = {Spanning Tree Congestion and Computation of Generalized {Gy{\"o}ri-Lov{\'a}sz} Partition}, AUTHOR = {Chandran, L. Sunil and Cheung, Yun Kuen and Issac, Davis}, LANGUAGE = {eng}, ISBN = {978-3-95977-076-7}, URL = {urn:nbn:de:0030-drops-90361}, DOI = {10.4230/LIPIcs.ICALP.2018.32}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, EDITOR = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D{\'a}niel and Sannella, Donald}, PAGES = {1--14}, EID = {32}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {107}, ADDRESS = {Prague, Czech Republic}, }
Endnote
%0 Conference Proceedings %A Chandran, L. Sunil %A Cheung, Yun Kuen %A Issac, Davis %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Spanning Tree Congestion and Computation of Generalized Gy&#246;ri-Lov&#225;sz Partition : %G eng %U http://hdl.handle.net/21.11116/0000-0002-9E67-9 %R 10.4230/LIPIcs.ICALP.2018.32 %U urn:nbn:de:0030-drops-90361 %D 2018 %B 45th International Colloquium on Automata, Languages, and Programming %Z date of event: 2018-07-09 - 2018-07-13 %C Prague, Czech Republic %B 45th International Colloquium on Automata, Languages, and Programming %E Chatzigiannakis, Ioannis; Kaklamanis, Christos; Marx, D&#225;niel; Sannella, Donald %P 1 - 14 %Z sequence number: 32 %I Schloss Dagstuhl %@ 978-3-95977-076-7 %B Leibniz International Proceedings in Informatics %N 107 %U http://drops.dagstuhl.de/opus/volltexte/2018/9036/http://drops.dagstuhl.de/doku/urheberrecht1.html
[104]
T. M. Chan, T. C. van Dijk, K. Fleszar, J. Spoerhase, and A. Wolff, “Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity,” in 29th International Symposium on Algorithms and Computation (ISAAC 2018), Jiaoxi, Yilan, Taiwan, 2018.
Export
BibTeX
@inproceedings{Chan_ISAAC2018b, TITLE = {Stabbing Rectangles by Line Segments -- How Decomposition Reduces the Shallow-Cell Complexity}, AUTHOR = {Chan, Timothy M. and van Dijk, Thomas C. and Fleszar, Krzysztof and Spoerhase, Joachim and Wolff, Alexander}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-094-1}, URL = {urn:nbn:de:0030-drops-100094}, DOI = {10.4230/LIPIcs.ISAAC.2018.61}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, EDITOR = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, PAGES = {1--13}, EID = {61}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {123}, ADDRESS = {Jiaoxi, Yilan, Taiwan}, }
Endnote
%0 Conference Proceedings %A Chan, Timothy M. %A van Dijk, Thomas C. %A Fleszar, Krzysztof %A Spoerhase, Joachim %A Wolff, Alexander %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity : %G eng %U http://hdl.handle.net/21.11116/0000-0002-ADEA-4 %R 10.4230/LIPIcs.ISAAC.2018.61 %U urn:nbn:de:0030-drops-100094 %D 2018 %B 29th International Symposium on Algorithms and Computation %Z date of event: 2018-12-16 - 2018-12-19 %C Jiaoxi, Yilan, Taiwan %B 29th International Symposium on Algorithms and Computation %E Hsu, Wen-Lian; Lee, Der-Tsai; Liao, Chung-Shou %P 1 - 13 %Z sequence number: 61 %I Schloss Dagstuhl %@ 978-3-95977-094-1 %B Leibniz International Proceedings in Informatics %N 123 %@ false %U http://drops.dagstuhl.de/opus/volltexte/2018/10009/http://drops.dagstuhl.de/doku/urheberrecht1.html
[105]
N. Chen, M. Hoefer, M. Künnemann, C. Lin, and P. Miao, “Secretary Markets with Local Information,” Distributed Computing. (Accepted/in press)
Export
BibTeX
@article{Chen2018, TITLE = {Secretary Markets with Local Information}, AUTHOR = {Chen, Ning and Hoefer, Martin and K{\"u}nnemann, Marvin and Lin, Chengyu and Miao, Peihan}, LANGUAGE = {eng}, ISSN = {0178-2770}, DOI = {10.1007/s00446-018-0327-5}, PUBLISHER = {Springer International}, ADDRESS = {Berlin}, YEAR = {2018}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, JOURNAL = {Distributed Computing}, }
Endnote
%0 Journal Article %A Chen, Ning %A Hoefer, Martin %A K&#252;nnemann, Marvin %A Lin, Chengyu %A Miao, Peihan %+ 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 Secretary Markets with Local Information : %G eng %U http://hdl.handle.net/21.11116/0000-0002-A90C-3 %R 10.1007/s00446-018-0327-5 %D 2018 %J Distributed Computing %I Springer International %C Berlin %@ false
[106]
Y. K. Cheung, M. Hoefer, and P. Nakhe, “Tracing Equilibrium in Dynamic Markets via Distributed Adaptation,” 2018. [Online]. Available: http://arxiv.org/abs/1804.08017. (arXiv: 1804.08017)
Abstract
Competitive equilibrium is a central concept in economics with numerous applications beyond markets, such as scheduling, fair allocation of goods, or bandwidth distribution in networks. Computation of competitive equilibria has received a significant amount of interest in algorithmic game theory, mainly for the prominent case of Fisher markets. Natural and decentralized processes like tatonnement and proportional response dynamics (PRD) converge quickly towards equilibrium in large classes of Fisher markets. Almost all of the literature assumes that the market is a static environment and that the parameters of agents and goods do not change over time. In contrast, many large real-world markets are subject to frequent and dynamic changes. In this paper, we provide the first provable performance guarantees of discrete-time tatonnement and PRD in markets that are subject to perturbation over time. We analyze the prominent class of Fisher markets with CES utilities and quantify the impact of changes in supplies of goods, budgets of agents, and utility functions of agents on the convergence of tatonnement to market equilibrium. Since the equilibrium becomes a dynamic object and will rarely be reached, our analysis provides bounds expressing the distance to equilibrium that will be maintained via tatonnement and PRD updates. Our results indicate that in many cases, tatonnement and PRD follow the equilibrium rather closely and quickly recover conditions of approximate market clearing. Our approach can be generalized to analyzing a general class of Lyapunov dynamical systems with changing system parameters, which might be of independent interest.
Export
BibTeX
@online{Cheung_arXiv1804.08017, TITLE = {Tracing Equilibrium in Dynamic Markets via Distributed Adaptation}, AUTHOR = {Cheung, Yun Kuen and Hoefer, Martin and Nakhe, Paresh}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1804.08017}, EPRINT = {1804.08017}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Competitive equilibrium is a central concept in economics with numerous applications beyond markets, such as scheduling, fair allocation of goods, or bandwidth distribution in networks. Computation of competitive equilibria has received a significant amount of interest in algorithmic game theory, mainly for the prominent case of Fisher markets. Natural and decentralized processes like tatonnement and proportional response dynamics (PRD) converge quickly towards equilibrium in large classes of Fisher markets. Almost all of the literature assumes that the market is a static environment and that the parameters of agents and goods do not change over time. In contrast, many large real-world markets are subject to frequent and dynamic changes. In this paper, we provide the first provable performance guarantees of discrete-time tatonnement and PRD in markets that are subject to perturbation over time. We analyze the prominent class of Fisher markets with CES utilities and quantify the impact of changes in supplies of goods, budgets of agents, and utility functions of agents on the convergence of tatonnement to market equilibrium. Since the equilibrium becomes a dynamic object and will rarely be reached, our analysis provides bounds expressing the distance to equilibrium that will be maintained via tatonnement and PRD updates. Our results indicate that in many cases, tatonnement and PRD follow the equilibrium rather closely and quickly recover conditions of approximate market clearing. Our approach can be generalized to analyzing a general class of Lyapunov dynamical systems with changing system parameters, which might be of independent interest.}, }
Endnote
%0 Report %A Cheung, Yun Kuen %A Hoefer, Martin %A Nakhe, Paresh %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Tracing Equilibrium in Dynamic Markets via Distributed Adaptation : %G eng %U http://hdl.handle.net/21.11116/0000-0002-AE08-2 %U http://arxiv.org/abs/1804.08017 %D 2018 %X Competitive equilibrium is a central concept in economics with numerous applications beyond markets, such as scheduling, fair allocation of goods, or bandwidth distribution in networks. Computation of competitive equilibria has received a significant amount of interest in algorithmic game theory, mainly for the prominent case of Fisher markets. Natural and decentralized processes like tatonnement and proportional response dynamics (PRD) converge quickly towards equilibrium in large classes of Fisher markets. Almost all of the literature assumes that the market is a static environment and that the parameters of agents and goods do not change over time. In contrast, many large real-world markets are subject to frequent and dynamic changes. In this paper, we provide the first provable performance guarantees of discrete-time tatonnement and PRD in markets that are subject to perturbation over time. We analyze the prominent class of Fisher markets with CES utilities and quantify the impact of changes in supplies of goods, budgets of agents, and utility functions of agents on the convergence of tatonnement to market equilibrium. Since the equilibrium becomes a dynamic object and will rarely be reached, our analysis provides bounds expressing the distance to equilibrium that will be maintained via tatonnement and PRD updates. Our results indicate that in many cases, tatonnement and PRD follow the equilibrium rather closely and quickly recover conditions of approximate market clearing. Our approach can be generalized to analyzing a general class of Lyapunov dynamical systems with changing system parameters, which might be of independent interest. %K Computer Science, Computer Science and Game Theory, cs.GT
[107]
Y. K. Cheung, R. Cole, and Y. Tao, “Parallel Stochastic Asynchronous Coordinate Descent: Tight Bounds on the Possible Parallelism,” 2018. [Online]. Available: http://arxiv.org/abs/1811.05087. (arXiv: 1811.05087)
Abstract
Several works have shown linear speedup is achieved by an asynchronous parallel implementation of stochastic coordinate descent so long as there is not too much parallelism. More specifically, it is known that if all updates are of similar duration, then linear speedup is possible with up to $\Theta(\sqrt n/L_{\mathsf{res}})$ processors, where $L_{\mathsf{res}}$ is a suitable Lipschitz parameter. This paper shows the bound is tight for essentially all possible values of $L_{\mathsf{res}}$.
Export
BibTeX
@online{corr/abs-1811-05087, TITLE = {Parallel Stochastic Asynchronous Coordinate Descent: {T}ight Bounds on the Possible Parallelism}, AUTHOR = {Cheung, Yun Kuen and Cole, Richard and Tao, Yixin}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1811.05087}, EPRINT = {1811.05087}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Several works have shown linear speedup is achieved by an asynchronous parallel implementation of stochastic coordinate descent so long as there is not too much parallelism. More specifically, it is known that if all updates are of similar duration, then linear speedup is possible with up to $\Theta(\sqrt n/L_{\mathsf{res}})$ processors, where $L_{\mathsf{res}}$ is a suitable Lipschitz parameter. This paper shows the bound is tight for essentially all possible values of $L_{\mathsf{res}}$.}, }
Endnote
%0 Report %A Cheung, Yun Kuen %A Cole, Richard %A Tao, Yixin %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Parallel Stochastic Asynchronous Coordinate Descent: Tight Bounds on the Possible Parallelism : %G eng %U http://hdl.handle.net/21.11116/0000-0002-AAF2-D %U http://arxiv.org/abs/1811.05087 %D 2018 %X Several works have shown linear speedup is achieved by an asynchronous parallel implementation of stochastic coordinate descent so long as there is not too much parallelism. More specifically, it is known that if all updates are of similar duration, then linear speedup is possible with up to $\Theta(\sqrt n/L_{\mathsf{res}})$ processors, where $L_{\mathsf{res}}$ is a suitable Lipschitz parameter. This paper shows the bound is tight for essentially all possible values of $L_{\mathsf{res}}$. %K Mathematics, Optimization and Control, math.OC,Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC
[108]
Y. K. Cheung, “Multiplicative Weights Updates with Constant Step-Size in Graphical Constant-Sum Games,” in Advances in Neural Information Processing Systems 31 (NIPS 2018), Montréal, Canada, 2018.
Export
BibTeX
@inproceedings{NeurIPS/Cheung18, TITLE = {Multiplicative Weights Updates with Constant Step-Size in Graphical Constant-Sum Games}, AUTHOR = {Cheung, Yun Kuen}, LANGUAGE = {eng}, PUBLISHER = {Curran Associates}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Advances in Neural Information Processing Systems 31 (NIPS 2018)}, EDITOR = {Bengio, S. and Wallach, H. and Larochelle, H. and Grauman, K. and Cesa-Bianchi, N. and Garnett, R.}, PAGES = {3532--3542}, ADDRESS = {Montr{\'e}al, Canada}, }
Endnote
%0 Conference Proceedings %A Cheung, Yun Kuen %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Multiplicative Weights Updates with Constant Step-Size in Graphical Constant-Sum Games : %G eng %U http://hdl.handle.net/21.11116/0000-0002-AB07-6 %D 2018 %B Thirty-second Conference on Neural Information Processing Systems %Z date of event: 2018-12-02 - 2018-12-08 %C Montr&#233;al, Canada %B Advances in Neural Information Processing Systems 31 %E Bengio, S.; Wallach, H.; Larochelle, H.; Grauman, K.; Cesa-Bianchi, N.; Garnett, R. %P 3532 - 3542 %I Curran Associates %U http://papers.nips.cc/paper/7612-multiplicative-weights-updates-with-constant-step-size-in-graphical-constant-sum-games.pdf
[109]
Y. K. Cheung, R. Cole, and Y. Tao, “Dynamics of Distributed Updating in Fisher Markets,” in ACM EC’18, Nineteenth ACM Conference on Economics and Computation, Ithaca, NY, USA, 2018.
Export
BibTeX
@inproceedings{EC/CCT18, TITLE = {Dynamics of Distributed Updating in {F}isher Markets}, AUTHOR = {Cheung, Yun Kuen and Cole, Richard and Tao, Yixin}, LANGUAGE = {eng}, ISBN = {978-1-4503-5829-3}, DOI = {10.1145/3219166.3219189}, PUBLISHER = {ACM}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, BOOKTITLE = {ACM EC'18, Nineteenth ACM Conference on Economics and Computation}, PAGES = {351--368}, ADDRESS = {Ithaca, NY, USA}, }
Endnote
%0 Conference Proceedings %A Cheung, Yun Kuen %A Cole, Richard %A Tao, Yixin %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Dynamics of Distributed Updating in Fisher Markets : %G eng %U http://hdl.handle.net/21.11116/0000-0002-AAE9-8 %R 10.1145/3219166.3219189 %D 2018 %B Nineteenth ACM Conference on Economics and Computation %Z date of event: 2018-06-18 - 2018-06-22 %C Ithaca, NY, USA %B ACM EC'18 %P 351 - 368 %I ACM %@ 978-1-4503-5829-3
[110]
Y. K. Cheung and R. Cole, “Amortized Analysis of Asynchronous Price Dynamics,” in 26th Annual European Symposium on Algorithms (ESA 2018), Helsinki, Finland, 2018.
Export
BibTeX
@inproceedings{Cheung_ESA2018, TITLE = {Amortized Analysis of Asynchronous Price Dynamics}, AUTHOR = {Cheung, Yun Kuen and Cole, Richard}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-081-1}, URL = {urn:nbn:de:0030-drops-94812}, DOI = {10.4230/LIPIcs.ESA.2018.18}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {26th Annual European Symposium on Algorithms (ESA 2018)}, EDITOR = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz}, PAGES = {1--15}, EID = {18}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {112}, ADDRESS = {Helsinki, Finland}, }
Endnote
%0 Conference Proceedings %A Cheung, Yun Kuen %A Cole, Richard %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Amortized Analysis of Asynchronous Price Dynamics : %G eng %U http://hdl.handle.net/21.11116/0000-0002-AAEE-3 %R 10.4230/LIPIcs.ESA.2018.18 %U urn:nbn:de:0030-drops-94812 %D 2018 %B 26th Annual European Symposium on Algorithms %Z date of event: 2018-08-20 - 2018-08-22 %C Helsinki, Finland %B 26th Annual European Symposium on Algorithms %E Azar, Yossi; Bast, Hannah; Herman, Grzegorz %P 1 - 15 %Z sequence number: 18 %I Schloss Dagstuhl %@ 978-3-95977-081-1 %B Leibniz International Proceedings in Informatics %N 112 %@ false %U http://drops.dagstuhl.de/opus/volltexte/2018/9481/http://drops.dagstuhl.de/doku/urheberrecht1.html
[111]
Y. K. Cheung, R. Cole, and Y. Tao, “(Near) Optimal Parallelism Bound for Fully Asynchronous Coordinate Descent with Linear Speedup,” 2018. [Online]. Available: http://arxiv.org/abs/1811.03254. (arXiv: 1811.03254)
Abstract
When solving massive optimization problems in areas such as machine learning, it is a common practice to seek speedup via massive parallelism. However, especially in an asynchronous environment, there are limits on the possible parallelism. Accordingly, we seek tight bounds on the viable parallelism in asynchronous implementations of coordinate descent. We focus on asynchronous coordinate descent (ACD) algorithms on convex functions $F:\mathbb{R}^n \rightarrow \mathbb{R}$ of the form $$F(x) = f(x) ~+~ \sum_{k=1}^n \Psi_k(x_k),$$ where $f:\mathbb{R}^n \rightarrow \mathbb{R}$ is a smooth convex function, and each $\Psi_k:\mathbb{R} \rightarrow \mathbb{R}$ is a univariate and possibly non-smooth convex function. Our approach is to quantify the shortfall in progress compared to the standard sequential stochastic gradient descent. This leads to a truly simple yet optimal analysis of the standard stochastic ACD in a partially asynchronous environment, which already generalizes and improves on the bounds in prior work. We also give a considerably more involved analysis for general asynchronous environments in which the only constraint is that each update can overlap with at most $q$ others, where $q$ is at most the number of processors times the ratio in the lengths of the longest and shortest updates. The main technical challenge is to demonstrate linear speedup in the latter environment. This stems from the subtle interplay of asynchrony and randomization. This improves Liu and Wright's (SIOPT'15) lower bound on the maximum degree of parallelism almost quadratically, and we show that our new bound is almost optimal.
Export
BibTeX
@online{corr/abs-1811-03254, TITLE = {(Near) Optimal Parallelism Bound for Fully Asynchronous Coordinate Descent with Linear Speedup}, AUTHOR = {Cheung, Yun Kuen and Cole, Richard and Tao, Yixin}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1811.03254}, EPRINT = {1811.03254}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {When solving massive optimization problems in areas such as machine learning, it is a common practice to seek speedup via massive parallelism. However, especially in an asynchronous environment, there are limits on the possible parallelism. Accordingly, we seek tight bounds on the viable parallelism in asynchronous implementations of coordinate descent. We focus on asynchronous coordinate descent (ACD) algorithms on convex functions $F:\mathbb{R}^n \rightarrow \mathbb{R}$ of the form $$F(x) = f(x) ~+~ \sum_{k=1}^n \Psi_k(x_k),$$ where $f:\mathbb{R}^n \rightarrow \mathbb{R}$ is a smooth convex function, and each $\Psi_k:\mathbb{R} \rightarrow \mathbb{R}$ is a univariate and possibly non-smooth convex function. Our approach is to quantify the shortfall in progress compared to the standard sequential stochastic gradient descent. This leads to a truly simple yet optimal analysis of the standard stochastic ACD in a partially asynchronous environment, which already generalizes and improves on the bounds in prior work. We also give a considerably more involved analysis for general asynchronous environments in which the only constraint is that each update can overlap with at most $q$ others, where $q$ is at most the number of processors times the ratio in the lengths of the longest and shortest updates. The main technical challenge is to demonstrate linear speedup in the latter environment. This stems from the subtle interplay of asynchrony and randomization. This improves Liu and Wright's (SIOPT'15) lower bound on the maximum degree of parallelism almost quadratically, and we show that our new bound is almost optimal.}, }
Endnote
%0 Report %A Cheung, Yun Kuen %A Cole, Richard %A Tao, Yixin %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T (Near) Optimal Parallelism Bound for Fully Asynchronous Coordinate Descent with Linear Speedup : %G eng %U http://hdl.handle.net/21.11116/0000-0002-AAF5-A %U http://arxiv.org/abs/1811.03254 %D 2018 %X When solving massive optimization problems in areas such as machine learning, it is a common practice to seek speedup via massive parallelism. However, especially in an asynchronous environment, there are limits on the possible parallelism. Accordingly, we seek tight bounds on the viable parallelism in asynchronous implementations of coordinate descent. We focus on asynchronous coordinate descent (ACD) algorithms on convex functions $F:\mathbb{R}^n \rightarrow \mathbb{R}$ of the form $$F(x) = f(x) ~+~ \sum_{k=1}^n \Psi_k(x_k),$$ where $f:\mathbb{R}^n \rightarrow \mathbb{R}$ is a smooth convex function, and each $\Psi_k:\mathbb{R} \rightarrow \mathbb{R}$ is a univariate and possibly non-smooth convex function. Our approach is to quantify the shortfall in progress compared to the standard sequential stochastic gradient descent. This leads to a truly simple yet optimal analysis of the standard stochastic ACD in a partially asynchronous environment, which already generalizes and improves on the bounds in prior work. We also give a considerably more involved analysis for general asynchronous environments in which the only constraint is that each update can overlap with at most $q$ others, where $q$ is at most the number of processors times the ratio in the lengths of the longest and shortest updates. The main technical challenge is to demonstrate linear speedup in the latter environment. This stems from the subtle interplay of asynchrony and randomization. This improves Liu and Wright's (SIOPT'15) lower bound on the maximum degree of parallelism almost quadratically, and we show that our new bound is almost optimal. %K Mathematics, Optimization and Control, math.OC,Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC
[112]
Y. K. Cheung, “Steiner Point Removal - Distant Terminals Don’t (Really) Bother,” in Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018), New Orleans, LA, USA, 2018.
Export
BibTeX
@inproceedings{Cheung_SODA18, TITLE = {{S}teiner Point Removal -- Distant Terminals Don't (Really) Bother}, AUTHOR = {Cheung, Yun Kuen}, LANGUAGE = {eng}, ISBN = {978-1-61197-503-1}, DOI = {10.1137/1.9781611975031.89}, PUBLISHER = {SIAM}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, BOOKTITLE = {Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018)}, EDITOR = {Czumaj, Artur}, PAGES = {1353--1360}, ADDRESS = {New Orleans, LA, USA}, }
Endnote
%0 Conference Proceedings %A Cheung, Yun Kuen %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Steiner Point Removal - Distant Terminals Don't (Really) Bother : %G eng %U http://hdl.handle.net/21.11116/0000-0002-AA8C-1 %R 10.1137/1.9781611975031.89 %D 2018 %B Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2018-01-07 - 2018-01-10 %C New Orleans, LA, USA %B Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms %E Czumaj, Artur %P 1353 - 1360 %I SIAM %@ 978-1-61197-503-1
[113]
L. Chiantini, J. D. Hauenstein, C. Ikenmeyer, J. M. Landsberg, and G. Ottaviani, “Polynomials and the Exponent of Matrix Multiplication,” Bulletin of the London Mathematical Society, vol. 50, no. 3, 2018.
Export
BibTeX
@article{Chaintini2018, TITLE = {Polynomials and the Exponent of Matrix Multiplication}, AUTHOR = {Chiantini, Luca and Hauenstein, Jonathan D. and Ikenmeyer, Christian and Landsberg, Joseph M. and Ottaviani, Giorgio}, LANGUAGE = {eng}, ISSN = {0024-6093}, DOI = {10.1112/blms.12147}, PUBLISHER = {London Mathematical Society}, ADDRESS = {London}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, JOURNAL = {Bulletin of the London Mathematical Society}, VOLUME = {50}, NUMBER = {3}, PAGES = {369--389}, }
Endnote
%0 Journal Article %A Chiantini, Luca %A Hauenstein, Jonathan D. %A Ikenmeyer, Christian %A Landsberg, Joseph M. %A Ottaviani, Giorgio %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Polynomials and the Exponent of Matrix Multiplication : %G eng %U http://hdl.handle.net/21.11116/0000-0001-88D0-A %R 10.1112/blms.12147 %7 2018 %D 2018 %J Bulletin of the London Mathematical Society %V 50 %N 3 %& 369 %P 369 - 389 %I London Mathematical Society %C London %@ false
[114]
A. Choudhary, S. Kachanovich, and M. Wintraecken, “Coxeter Triangulations Have Good Quality,” in EuroCG 18 Extended Abstracts, Berlin, Germany, 2018.
Export
BibTeX
@inproceedings{Choudhary-coxeter, TITLE = {Coxeter Triangulations Have Good Quality}, AUTHOR = {Choudhary, Aruni and Kachanovich, Siargey and Wintraecken, Mathijs}, LANGUAGE = {eng}, URL = {https://conference.imp.fu-berlin.de/eurocg18/download/eurocg_proc.pdf}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {EuroCG 18 Extended Abstracts}, PAGES = {37--42}, ADDRESS = {Berlin, Germany}, }
Endnote
%0 Conference Proceedings %A Choudhary, Aruni %A Kachanovich, Siargey %A Wintraecken, Mathijs %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Coxeter Triangulations Have Good Quality : %G eng %U http://hdl.handle.net/21.11116/0000-0002-E5C4-E %D 2018 %B 34th European Workshop on Computational Geometry %Z date of event: 2018-03-21 - 2018-03-23 %C Berlin, Germany %B EuroCG 18 Extended Abstracts %P 37 - 42 %U https://conference.imp.fu-berlin.de/eurocg18/download/eurocg_proc.pdf
[115]
G. Christodoulou and A. Sgouritsa, “Designing Networks with Good Equilibria under Uncertainty,” SIAM Journal on Computing. (Accepted/in press)
Export
BibTeX
@article{Christodoulou2019SICOMP, TITLE = {Designing Networks with Good Equilibria under Uncertainty}, AUTHOR = {Christodoulou, George and Sgouritsa, Alkmini}, LANGUAGE = {eng}, ISSN = {0097-5397}, PUBLISHER = {Society for Industrial and Applied Mathematics.}, ADDRESS = {Philadelphia}, YEAR = {2018}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, JOURNAL = {SIAM Journal on Computing}, }
Endnote
%0 Journal Article %A Christodoulou, George %A Sgouritsa, Alkmini %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Designing Networks with Good Equilibria under Uncertainty : %G eng %U http://hdl.handle.net/21.11116/0000-0002-AEC7-A %D 2018 %J SIAM Journal on Computing %I Society for Industrial and Applied Mathematics. %C Philadelphia %@ false
[116]
A. Clementi, M. Ghaffari, L. Gualà, E. Natale, F. Pasquale, and G. Scornavacca, “A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors,” in 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), Liverpool, UK, 2018.
Export
BibTeX
@inproceedings{Clementi_MFCS2018, TITLE = {A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors}, AUTHOR = {Clementi, Andrea and Ghaffari, Mohsen and Gual{\`a}, Luciano and Natale, Emanuele and Pasquale, Francesco and Scornavacca, Giacomo}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-086-6}, URL = {urn:nbn:de:0030-drops-96107}, DOI = {10.4230/LIPIcs.MFCS.2018.28}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, EDITOR = {Potapov, Igor and Spirakis, Paul and Worrell, James}, PAGES = {1--15}, EID = {28}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {117}, ADDRESS = {Liverpool, UK}, }
Endnote
%0 Conference Proceedings %A Clementi, Andrea %A Ghaffari, Mohsen %A Gual&#224;, Luciano %A Natale, Emanuele %A Pasquale, Francesco %A Scornavacca, Giacomo %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors : %G eng %U http://hdl.handle.net/21.11116/0000-0002-A96C-7 %R 10.4230/LIPIcs.MFCS.2018.28 %U urn:nbn:de:0030-drops-96107 %D 2018 %B 43rd International Symposium on Mathematical Foundations of Computer Science %Z date of event: 2018-08-27 - 2018-08-31 %C Liverpool, UK %B 43rd International Symposium on Mathematical Foundations of Computer Science %E Potapov, Igor; Spirakis, Paul; Worrell, James %P 1 - 15 %Z sequence number: 28 %I Schloss Dagstuhl %@ 978-3-95977-086-6 %B Leibniz International Proceedings in Informatics %N 117 %@ false %U http://drops.dagstuhl.de/opus/volltexte/2018/9610/http://drops.dagstuhl.de/doku/urheberrecht1.html
[117]
A. Clementi, L. Gualà, E. Natale, F. Pasquale, G. Scornavacca, and L. Trevisan, “Consensus Needs Broadcast in Noiseless Models but can be Exponentially Easier in the Presence of Noise,” 2018. [Online]. Available: http://arxiv.org/abs/1807.05626. (arXiv: 1807.05626)
Abstract
Consensus and Broadcast are two fundamental problems in distributed computing, whose solutions have several applications. Intuitively, Consensus should be no harder than Broadcast, and this can be rigorously established in several models. Can Consensus be easier than Broadcast? In models that allow noiseless communication, we prove a reduction of (a suitable variant of) Broadcast to binary Consensus, that preserves the communication model and all complexity parameters such as randomness, number of rounds, communication per round, etc., while there is a loss in the success probability of the protocol. Using this reduction, we get, among other applications, the first logarithmic lower bound on the number of rounds needed to achieve Consensus in the uniform GOSSIP model on the complete graph. The lower bound is tight and, in this model, Consensus and Broadcast are equivalent. We then turn to distributed models with noisy communication channels that have been studied in the context of some bio-inspired systems. In such models, only one noisy bit is exchanged when a communication channel is established between two nodes, and so one cannot easily simulate a noiseless protocol by using error-correcting codes. An $\Omega(\epsilon^{-2} n)$ lower bound on the number of rounds needed for Broadcast is proved by Boczkowski et al. [PLOS Comp. Bio. 2018] in one such model (noisy uniform PULL, where $\epsilon$ is a parameter that measures the amount of noise). In such model, we prove a new $\Theta(\epsilon^{-2} n \log n)$ bound for Broadcast and a $\Theta(\epsilon^{-2} \log n)$ bound for binary Consensus, thus establishing an exponential gap between the number of rounds necessary for Consensus versus Broadcast.
Export
BibTeX
@online{Clementi_arXiv1807.05626, TITLE = {Consensus Needs Broadcast in Noiseless Models but can be Exponentially Easier in the Presence of Noise}, AUTHOR = {Clementi, Andrea and Gual{\`a}, Luciano and Natale, Emanuele and Pasquale, Francesco and Scornavacca, Giacomo and Trevisan, Luca}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1807.05626}, EPRINT = {1807.05626}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Consensus and Broadcast are two fundamental problems in distributed computing, whose solutions have several applications. Intuitively, Consensus should be no harder than Broadcast, and this can be rigorously established in several models. Can Consensus be easier than Broadcast? In models that allow noiseless communication, we prove a reduction of (a suitable variant of) Broadcast to binary Consensus, that preserves the communication model and all complexity parameters such as randomness, number of rounds, communication per round, etc., while there is a loss in the success probability of the protocol. Using this reduction, we get, among other applications, the first logarithmic lower bound on the number of rounds needed to achieve Consensus in the uniform GOSSIP model on the complete graph. The lower bound is tight and, in this model, Consensus and Broadcast are equivalent. We then turn to distributed models with noisy communication channels that have been studied in the context of some bio-inspired systems. In such models, only one noisy bit is exchanged when a communication channel is established between two nodes, and so one cannot easily simulate a noiseless protocol by using error-correcting codes. An $\Omega(\epsilon^{-2} n)$ lower bound on the number of rounds needed for Broadcast is proved by Boczkowski et al. [PLOS Comp. Bio. 2018] in one such model (noisy uniform PULL, where $\epsilon$ is a parameter that measures the amount of noise). In such model, we prove a new $\Theta(\epsilon^{-2} n \log n)$ bound for Broadcast and a $\Theta(\epsilon^{-2} \log n)$ bound for binary Consensus, thus establishing an exponential gap between the number of rounds necessary for Consensus versus Broadcast.}, }
Endnote
%0 Report %A Clementi, Andrea %A Gual&#224;, Luciano %A Natale, Emanuele %A Pasquale, Francesco %A Scornavacca, Giacomo %A Trevisan, Luca %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Consensus Needs Broadcast in Noiseless Models but can be Exponentially Easier in the Presence of Noise : %G eng %U http://hdl.handle.net/21.11116/0000-0002-B985-7 %U http://arxiv.org/abs/1807.05626 %D 2018 %X Consensus and Broadcast are two fundamental problems in distributed computing, whose solutions have several applications. Intuitively, Consensus should be no harder than Broadcast, and this can be rigorously established in several models. Can Consensus be easier than Broadcast? In models that allow noiseless communication, we prove a reduction of (a suitable variant of) Broadcast to binary Consensus, that preserves the communication model and all complexity parameters such as randomness, number of rounds, communication per round, etc., while there is a loss in the success probability of the protocol. Using this reduction, we get, among other applications, the first logarithmic lower bound on the number of rounds needed to achieve Consensus in the uniform GOSSIP model on the complete graph. The lower bound is tight and, in this model, Consensus and Broadcast are equivalent. We then turn to distributed models with noisy communication channels that have been studied in the context of some bio-inspired systems. In such models, only one noisy bit is exchanged when a communication channel is established between two nodes, and so one cannot easily simulate a noiseless protocol by using error-correcting codes. An $\Omega(\epsilon^{-2} n)$ lower bound on the number of rounds needed for Broadcast is proved by Boczkowski et al. [PLOS Comp. Bio. 2018] in one such model (noisy uniform PULL, where $\epsilon$ is a parameter that measures the amount of noise). In such model, we prove a new $\Theta(\epsilon^{-2} n \log n)$ bound for Broadcast and a $\Theta(\epsilon^{-2} \log n)$ bound for binary Consensus, thus establishing an exponential gap between the number of rounds necessary for Consensus versus Broadcast. %K Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC
[118]
C. Croitoru and K. Mehlhorn, “On Testing Substitutability,” Information Processing Letters, vol. 138, 2018.
Export
BibTeX
@article{Croitoru_2018, TITLE = {On Testing Substitutability}, AUTHOR = {Croitoru, Cosmina and Mehlhorn, Kurt}, LANGUAGE = {eng}, ISSN = {0020-0190}, DOI = {10.1016/j.ipl.2018.05.006}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, JOURNAL = {Information Processing Letters}, VOLUME = {138}, PAGES = {19--21}, }
Endnote
%0 Journal Article %A Croitoru, Cosmina %A Mehlhorn, Kurt %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T On Testing Substitutability : %G eng %U http://hdl.handle.net/21.11116/0000-0001-EE14-D %R 10.1016/j.ipl.2018.05.006 %7 2018 %D 2018 %J Information Processing Letters %V 138 %& 19 %P 19 - 21 %I Elsevier %C Amsterdam %@ false
[119]
C. Croitoru and K. Mehlhorn, “On Testing Substitutability,” 2018. [Online]. Available: http://arxiv.org/abs/1805.07642. (arXiv: 1805.07642)
Abstract
The papers~\cite{hatfimmokomi11} and~\cite{azizbrilharr13} propose algorithms for testing whether the choice function induced by a (strict) preference list of length $N$ over a universe $U$ is substitutable. The running time of these algorithms is $O(|U|^3\cdot N^3)$, respectively $O(|U|^2\cdot N^3)$. In this note we present an algorithm with running time $O(|U|^2\cdot N^2)$. Note that $N$ may be exponential in the size $|U|$ of the universe.
Export
BibTeX
@online{Croitoru_arXiv1805.07642, TITLE = {On Testing Substitutability}, AUTHOR = {Croitoru, Cosmina and Mehlhorn, Kurt}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1805.07642}, EPRINT = {1805.07642}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {The papers~\cite{hatfimmokomi11} and~\cite{azizbrilharr13} propose algorithms for testing whether the choice function induced by a (strict) preference list of length $N$ over a universe $U$ is substitutable. The running time of these algorithms is $O(|U|^3\cdot N^3)$, respectively $O(|U|^2\cdot N^3)$. In this note we present an algorithm with running time $O(|U|^2\cdot N^2)$. Note that $N$ may be exponential in the size $|U|$ of the universe.}, }
Endnote
%0 Report %A Croitoru, Cosmina %A Mehlhorn, Kurt %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T On Testing Substitutability : %G eng %U http://hdl.handle.net/21.11116/0000-0002-05FA-F %U http://arxiv.org/abs/1805.07642 %D 2018 %X The papers~\cite{hatfimmokomi11} and~\cite{azizbrilharr13} propose algorithms for testing whether the choice function induced by a (strict) preference list of length $N$ over a universe $U$ is substitutable. The running time of these algorithms is $O(|U|^3\cdot N^3)$, respectively $O(|U|^2\cdot N^3)$. In this note we present an algorithm with running time $O(|U|^2\cdot N^2)$. Note that $N$ may be exponential in the size $|U|$ of the universe. %K Computer Science, Data Structures and Algorithms, cs.DS,econ.EM
[120]
E. Cruciani, E. Natale, A. Nusser, and G. Scornavacca, “On the Emergent Behavior of the 2-Choices Dynamics,” in Proceedings of the 19th Italian Conference on Theoretical Computer Science (ICTCS 2018), Urbino, Italy, 2018.
Export
BibTeX
@inproceedings{Cruciano_ICTCS2018, TITLE = {On the Emergent Behavior of the 2-Choices Dynamics}, AUTHOR = {Cruciani, Emilio and Natale, Emanuele and Nusser, Andr{\'e} and Scornavacca, Giacomo}, LANGUAGE = {eng}, URL = {urn:nbn:de:0074-2243-4}, PUBLISHER = {CEUR-WS}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Proceedings of the 19th Italian Conference on Theoretical Computer Science (ICTCS 2018)}, EDITOR = {Aldini, Alessandro and Bernardo, Marco}, SERIES = {CEUR Workshop Proceedings}, VOLUME = {2243}, ADDRESS = {Urbino, Italy}, }
Endnote
%0 Conference Proceedings %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 On the Emergent Behavior of the 2-Choices Dynamics : %G eng %U http://hdl.handle.net/21.11116/0000-0002-A44E-E %D 2018 %B 19th Italian Conference on Theoretical Computer Science %Z date of event: 2018-09-18 - 2018-09-20 %C Urbino, Italy %B Proceedings of the 19th Italian Conference on Theoretical Computer Science %E Aldini, Alessandro; Bernardo, Marco %I CEUR-WS %B CEUR Workshop Proceedings %N 2243 %U http://ceur-ws.org/Vol-2243/paper4.pdf
[121]
E. Cruciani, E. Natale, A. Nusser, and G. Scornavacca, “Phase Transition of the 2-Choices Dynamics on Core-Periphery Networks,” 2018. [Online]. Available: http://arxiv.org/abs/1804.07223. (arXiv: 1804.07223)
Abstract
Consider the following process on a network: Each agent initially holds either opinion blue or red; then, in each round, each agent looks at two random neighbors and, if the two have the same opinion, the agent adopts it. This process is known as the 2-Choices dynamics and is arguably the most basic non-trivial opinion dynamics modeling voting behavior on social networks. Despite its apparent simplicity, 2-Choices has been analytically characterized only on networks with a strong expansion property -- under assumptions on the initial configuration that establish it as a fast majority consensus protocol. In this work, we aim at contributing to the understanding of the 2-Choices dynamics by considering its behavior on a class of networks with core-periphery structure, a well-known topological assumption in social networks. In a nutshell, assume that a densely-connected subset of agents, the core, holds a different opinion from the rest of the network, the periphery. Then, depending on the strength of the cut between the core and the periphery, a phase-transition phenomenon occurs: Either the core's opinion rapidly spreads among the rest of the network, or a metastability phase takes place, in which both opinions coexist in the network for superpolynomial time. The interest of our result is twofold. On the one hand, by looking at the 2-Choices dynamics as a simplistic model of competition among opinions in social networks, our theorem sheds light on the influence of the core on the rest of the network, as a function of the core's connectivity towards the latter. On the other hand, to the best of our knowledge, we provide the first analytical result which shows a heterogeneous behavior of a simple dynamics as a function of structural parameters of the network. Finally, we validate our theoretical predictions with extensive experiments on real networks.
Export
BibTeX
@online{Cruciano_arXiv1804.07223, 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}, URL = {http://arxiv.org/abs/1804.07223}, EPRINT = {1804.07223}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Consider the following process on a network: Each agent initially holds either opinion blue or red; then, in each round, each agent looks at two random neighbors and, if the two have the same opinion, the agent adopts it. This process is known as the 2-Choices dynamics and is arguably the most basic non-trivial opinion dynamics modeling voting behavior on social networks. Despite its apparent simplicity, 2-Choices has been analytically characterized only on networks with a strong expansion property -- under assumptions on the initial configuration that establish it as a fast majority consensus protocol. In this work, we aim at contributing to the understanding of the 2-Choices dynamics by considering its behavior on a class of networks with core-periphery structure, a well-known topological assumption in social networks. In a nutshell, assume that a densely-connected subset of agents, the core, holds a different opinion from the rest of the network, the periphery. Then, depending on the strength of the cut between the core and the periphery, a phase-transition phenomenon occurs: Either the core's opinion rapidly spreads among the rest of the network, or a metastability phase takes place, in which both opinions coexist in the network for superpolynomial time. The interest of our result is twofold. On the one hand, by looking at the 2-Choices dynamics as a simplistic model of competition among opinions in social networks, our theorem sheds light on the influence of the core on the rest of the network, as a function of the core's connectivity towards the latter. On the other hand, to the best of our knowledge, we provide the first analytical result which shows a heterogeneous behavior of a simple dynamics as a function of structural parameters of the network. Finally, we validate our theoretical predictions with extensive experiments on real networks.}, }
Endnote
%0 Report %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-0002-A446-6 %U http://arxiv.org/abs/1804.07223 %D 2018 %X Consider the following process on a network: Each agent initially holds either opinion blue or red; then, in each round, each agent looks at two random neighbors and, if the two have the same opinion, the agent adopts it. This process is known as the 2-Choices dynamics and is arguably the most basic non-trivial opinion dynamics modeling voting behavior on social networks. Despite its apparent simplicity, 2-Choices has been analytically characterized only on networks with a strong expansion property -- under assumptions on the initial configuration that establish it as a fast majority consensus protocol. In this work, we aim at contributing to the understanding of the 2-Choices dynamics by considering its behavior on a class of networks with core-periphery structure, a well-known topological assumption in social networks. In a nutshell, assume that a densely-connected subset of agents, the core, holds a different opinion from the rest of the network, the periphery. Then, depending on the strength of the cut between the core and the periphery, a phase-transition phenomenon occurs: Either the core's opinion rapidly spreads among the rest of the network, or a metastability phase takes place, in which both opinions coexist in the network for superpolynomial time. The interest of our result is twofold. On the one hand, by looking at the 2-Choices dynamics as a simplistic model of competition among opinions in social networks, our theorem sheds light on the influence of the core on the rest of the network, as a function of the core's connectivity towards the latter. On the other hand, to the best of our knowledge, we provide the first analytical result which shows a heterogeneous behavior of a simple dynamics as a function of structural parameters of the network. Finally, we validate our theoretical predictions with extensive experiments on real networks. %K cs.SI, Physics, Physics and Society, physics.soc-ph
[122]
E. Cruciani, E. Natale, and G. Scornavacca, “On the Metastability of Quadratic Majority Dynamics on Clustered Graphs and its Biological Implications,” Bulletin of the EATCS, vol. 125, 2018.
Export
BibTeX
@article{Cruciani_EATCS2018b, TITLE = {On the Metastability of Quadratic Majority Dynamics on Clustered Graphs and its Biological Implications}, AUTHOR = {Cruciani, Emilio and Natale, Emanuele and Scornavacca, Giacomo}, LANGUAGE = {eng}, ISSN = {0252-9742}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, JOURNAL = {Bulletin of the EATCS}, VOLUME = {125}, EID = {535}, }
Endnote
%0 Journal Article %A Cruciani, Emilio %A Natale, Emanuele %A Scornavacca, Giacomo %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T On the Metastability of Quadratic Majority Dynamics on Clustered Graphs and its Biological Implications : %G eng %U http://hdl.handle.net/21.11116/0000-0002-A94B-C %7 2018 %D 2018 %J Bulletin of the EATCS %O EATCS %V 125 %Z sequence number: 535 %@ false
[123]
E. Cruciani, E. Natale, A. Nusser, and G. Scornavacca, “Phase Transition of the 2-Choices Dynamics on Core-Periphery Networks,” in AAMAS’18, 17th International Conference on Autonomous Agents and MultiAgent Systems, Stockholm, Sweden, 2018.
Export
BibTeX
@inproceedings{Cruciani_AAMAS2018, 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}, ISBN = {978-1-4503-5649-7}, PUBLISHER = {ACM}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, BOOKTITLE = {AAMAS'18, 17th International Conference on Autonomous Agents and MultiAgent Systems}, PAGES = {777--785}, ADDRESS = {Stockholm, Sweden}, }
Endnote
%0 Conference Proceedings %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-0002-A47E-8 %D 2018 %B 17th International Conference on Autonomous Agents and MultiAgent Systems %Z date of event: 2018-07-10 - 2018-07-15 %C Stockholm, Sweden %B AAMAS'18 %P 777 - 785 %I ACM %@ 978-1-4503-5649-7
[124]
E. Cruciani, E. Natale, A. Nusser, and G. Scornavacca, “Phase Transition of the 2-Choices Dynamics on Core-Periphery Networks,” Bulletin of the EATCS, vol. 125, 2018.
Export
BibTeX
@article{Cruciani_EATCS2018, 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 = {0252-9742}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, JOURNAL = {Bulletin of the EATCS}, VOLUME = {125}, EID = {542}, }
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-0002-A48F-4 %7 2018 %D 2018 %J Bulletin of the EATCS %O EATCS %V 125 %Z sequence number: 542 %@ false
[125]
M. Cygan, S. Kratsch, and J. Nederlof, “Fast Hamiltonicity Checking Via Bases of Perfect Matchings,” Journal of the ACM, vol. 65, no. 3, 2018.
Export
BibTeX
@article{Cygan2018, TITLE = {Fast {Hamiltonicity} Checking Via Bases of Perfect Matchings}, AUTHOR = {Cygan, Marek and Kratsch, Stefan and Nederlof, Jesper}, LANGUAGE = {eng}, ISSN = {0004-5411}, DOI = {10.1145/3148227}, PUBLISHER = {Association for Computing Machinery, Inc.}, ADDRESS = {New York, NY}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, JOURNAL = {Journal of the ACM}, VOLUME = {65}, NUMBER = {3}, EID = {12}, }
Endnote
%0 Journal Article %A Cygan, Marek %A Kratsch, Stefan %A Nederlof, Jesper %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Fast Hamiltonicity Checking Via Bases of Perfect Matchings : %G eng %U http://hdl.handle.net/21.11116/0000-0001-7AE5-4 %R 10.1145/3148227 %7 2018 %D 2018 %J Journal of the ACM %V 65 %N 3 %Z sequence number: 12 %I Association for Computing Machinery, Inc. %C New York, NY %@ false
[126]
M. Cygan, G. Kortsarz, and B. Laekhanukit, “On Subexponential Running Times for Approximating Directed Steiner Tree and Related Problems,” 2018. [Online]. Available: http://arxiv.org/abs/1811.00710. (arXiv: 1811.00710)
Abstract
This paper concerns proving almost tight (super-polynomial) running times, for achieving desired approximation ratios for various problems. To illustrate, the question we study, let us consider the Set-Cover problem with n elements and m sets. Now we specify our goal to approximate Set-Cover to a factor of (1-d)ln n, for a given parameter 0<d<1. What is the best possible running time for achieving such approximation? This question was answered implicitly in the work of Moshkovitz [Theory of Computing, 2015]: Assuming both the Projection Games Conjecture (PGC) and the Exponential-Time Hypothesis (ETH), any ((1-d) ln n)-approximation algorithm for Set-Cover must run in time >= 2^{n^{c d}}, for some constant 0<d<1. We study the questions along this line. First, we show that under ETH and PGC any ((1-d) \ln n)-approximation for Set-Cover requires 2^{n^{d}}-time. This (almost) matches the running time of 2^{O(n^d)} for approximating Set-Cover to a factor (1-d) ln n by Cygan et al. [IPL, 2009]. Our result is tight up to the constant multiplying the n^{d} terms in the exponent. This lower bound applies to all of its generalizations, e.g., Group Steiner Tree (GST), Directed Steiner (DST), Covering Steiner Tree (CST), Connected Polymatroid (CP). We also show that in almost exponential time, these problems reduce to Set-Cover: We show (1-d)ln n approximation algorithms for all these problems that run in time 2^{n^{d \log n } poly(m). We also study log^{2-d}n approximation for GST. Chekuri-Pal [FOCS, 2005] showed that GST admits (log^{2-d}n)-approximation in time exp(2^{log^{d+o(1)}n}), for any 0 < d < 1. We show the lower bound of GST: any (log^{2-d}n)-approximation for GST must run in time >= exp((1+o(1)){log^{d-c}n}), for any c>0, unless the ETH is false. Our result follows by analyzing the work of Halperin and Krauthgamer [STOC, 2003]. The same lower and upper bounds hold for CST.
Export
BibTeX
@online{Cygan_arXiv1811.00710, TITLE = {{On Subexponential Running Times for Approximating Directed Steiner Tree and Related Problems}}, AUTHOR = {Cygan, Marek and Kortsarz, Guy and Laekhanukit, Bundit}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1811.00710}, EPRINT = {1811.00710}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {This paper concerns proving almost tight (super-polynomial) running times, for achieving desired approximation ratios for various problems. To illustrate, the question we study, let us consider the Set-Cover problem with n elements and m sets. Now we specify our goal to approximate Set-Cover to a factor of (1-d)ln n, for a given parameter 0<d<1. What is the best possible running time for achieving such approximation? This question was answered implicitly in the work of Moshkovitz [Theory of Computing, 2015]: Assuming both the Projection Games Conjecture (PGC) and the Exponential-Time Hypothesis (ETH), any ((1-d) ln n)-approximation algorithm for Set-Cover must run in time >= 2^{n^{c d}}, for some constant 0<d<1. We study the questions along this line. First, we show that under ETH and PGC any ((1-d) \ln n)-approximation for Set-Cover requires 2^{n^{d}}-time. This (almost) matches the running time of 2^{O(n^d)} for approximating Set-Cover to a factor (1-d) ln n by Cygan et al. [IPL, 2009]. Our result is tight up to the constant multiplying the n^{d} terms in the exponent. This lower bound applies to all of its generalizations, e.g., Group Steiner Tree (GST), Directed Steiner (DST), Covering Steiner Tree (CST), Connected Polymatroid (CP). We also show that in almost exponential time, these problems reduce to Set-Cover: We show (1-d)ln n approximation algorithms for all these problems that run in time 2^{n^{d \log n } poly(m). We also study log^{2-d}n approximation for GST. Chekuri-Pal [FOCS, 2005] showed that GST admits (log^{2-d}n)-approximation in time exp(2^{log^{d+o(1)}n}), for any 0 < d < 1. We show the lower bound of GST: any (log^{2-d}n)-approximation for GST must run in time >= exp((1+o(1)){log^{d-c}n}), for any c>0, unless the ETH is false. Our result follows by analyzing the work of Halperin and Krauthgamer [STOC, 2003]. The same lower and upper bounds hold for CST.}, }
Endnote
%0 Report %A Cygan, Marek %A Kortsarz, Guy %A Laekhanukit, Bundit %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T On Subexponential Running Times for Approximating Directed Steiner Tree and Related Problems : %G eng %U http://hdl.handle.net/21.11116/0000-0002-A85B-B %U http://arxiv.org/abs/1811.00710 %D 2018 %X This paper concerns proving almost tight (super-polynomial) running times, for achieving desired approximation ratios for various problems. To illustrate, the question we study, let us consider the Set-Cover problem with n elements and m sets. Now we specify our goal to approximate Set-Cover to a factor of (1-d)ln n, for a given parameter 0<d<1. What is the best possible running time for achieving such approximation? This question was answered implicitly in the work of Moshkovitz [Theory of Computing, 2015]: Assuming both the Projection Games Conjecture (PGC) and the Exponential-Time Hypothesis (ETH), any ((1-d) ln n)-approximation algorithm for Set-Cover must run in time >= 2^{n^{c d}}, for some constant 0<d<1. We study the questions along this line. First, we show that under ETH and PGC any ((1-d) \ln n)-approximation for Set-Cover requires 2^{n^{d}}-time. This (almost) matches the running time of 2^{O(n^d)} for approximating Set-Cover to a factor (1-d) ln n by Cygan et al. [IPL, 2009]. Our result is tight up to the constant multiplying the n^{d} terms in the exponent. This lower bound applies to all of its generalizations, e.g., Group Steiner Tree (GST), Directed Steiner (DST), Covering Steiner Tree (CST), Connected Polymatroid (CP). We also show that in almost exponential time, these problems reduce to Set-Cover: We show (1-d)ln n approximation algorithms for all these problems that run in time 2^{n^{d \log n } poly(m). We also study log^{2-d}n approximation for GST. Chekuri-Pal [FOCS, 2005] showed that GST admits (log^{2-d}n)-approximation in time exp(2^{log^{d+o(1)}n}), for any 0 < d < 1. We show the lower bound of GST: any (log^{2-d}n)-approximation for GST must run in time >= exp((1+o(1)){log^{d-c}n}), for any c>0, unless the ETH is false. Our result follows by analyzing the work of Halperin and Krauthgamer [STOC, 2003]. The same lower and upper bounds hold for CST. %K Computer Science, Data Structures and Algorithms, cs.DS
[127]
R. David, C. S. Karthik, and B. Laekhanukit, “On the Complexity of Closest Pair via Polar-Pair of Point-Sets,” in 34th International Symposium on Computational Geometry (SoCG 2018), Budapest, Hungary, 2018.
Export
BibTeX
@inproceedings{David_SoCG2018, TITLE = {On the Complexity of Closest Pair via Polar-Pair of Point-Sets}, AUTHOR = {David, Roee and Karthik, C. S. and Laekhanukit, Bundit}, LANGUAGE = {eng}, ISBN = {978-3-95977-066-8}, URL = {urn:nbn:de:0030-drops-87412}, DOI = {10.4230/LIPIcs.SoCG.2018.28}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {34th International Symposium on Computational Geometry (SoCG 2018)}, EDITOR = {Speckmann, Bettina and T{\'o}th, Csaba D.}, PAGES = {1--15}, EID = {28}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {99}, ADDRESS = {Budapest, Hungary}, }
Endnote
%0 Conference Proceedings %A David, Roee %A Karthik, C. S. %A Laekhanukit, Bundit %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T On the Complexity of Closest Pair via Polar-Pair of Point-Sets : %G eng %U http://hdl.handle.net/21.11116/0000-0002-A827-5 %R 10.4230/LIPIcs.SoCG.2018.28 %U urn:nbn:de:0030-drops-87412 %D 2018 %B 34th International Symposium on Computational Geometry %Z date of event: 2018-06-11 - 2018-06-14 %C Budapest, Hungary %B 34th International Symposium on Computational Geometry %E Speckmann, Bettina; T&#243;th, Csaba D. %P 1 - 15 %Z sequence number: 28 %I Schloss Dagstuhl %@ 978-3-95977-066-8 %B Leibniz International Proceedings in Informatics %N 99 %U http://drops.dagstuhl.de/opus/volltexte/2018/8741/http://drops.dagstuhl.de/doku/urheberrecht1.html
[128]
L. Duraj, M. Künnemann, and A. Polak, “Tight Conditional Lower Bounds for Longest Common Increasing Subsequence,” Algorithmica, 2018.
Export
BibTeX
@article{Duraj2018, TITLE = {Tight Conditional Lower Bounds for Longest Common Increasing Subsequence}, AUTHOR = {Duraj, Lech and K{\"u}nnemann, Marvin and Polak, Adam}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-018-0485-7}, PUBLISHER = {Springer-Verlag}, ADDRESS = {New York, NY}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, JOURNAL = {Algorithmica}, }
Endnote
%0 Journal Article %A Duraj, Lech %A K&#252;nnemann, Marvin %A Polak, Adam %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Tight Conditional Lower Bounds for Longest Common Increasing Subsequence : %G eng %U http://hdl.handle.net/21.11116/0000-0002-A906-9 %R 10.1007/s00453-018-0485-7 %7 2018 %D 2018 %J Algorithmica %I Springer-Verlag %C New York, NY %@ false
[129]
G. Even, M. Ghaffari, and M. Medina, “Distributed Set Cover Approximation: Primal-Dual with Optimal Locality,” in 32nd International Symposium on Distributed Computing (DISC 2018), New Orleans, LA, USA, 2018.
Export
BibTeX
@inproceedings{Even_DISC2018, TITLE = {Distributed Set Cover Approximation: {P}rimal-Dual with Optimal Locality}, AUTHOR = {Even, Guy and Ghaffari, Mohsen and Medina, Moti}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-092-7}, URL = {urn:nbn:de:0030-drops-98114}, DOI = {10.4230/LIPIcs.DISC.2018.22}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {32nd International Symposium on Distributed Computing (DISC 2018)}, EDITOR = {Schmid, Ulrich and Widder, Josef}, PAGES = {1--14}, EID = {22}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {121}, ADDRESS = {New Orleans, LA, USA}, }
Endnote
%0 Conference Proceedings %A Even, Guy %A Ghaffari, Mohsen %A Medina, Moti %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Distributed Set Cover Approximation: Primal-Dual with Optimal Locality : %G eng %U http://hdl.handle.net/21.11116/0000-0002-AC02-A %R 10.4230/LIPIcs.DISC.2018.22 %U urn:nbn:de:0030-drops-98114 %D 2018 %B 32nd International Symposium on Distributed Computing %Z date of event: 2018-10-15 - 2018-10-19 %C New Orleans, LA, USA %B 32nd International Symposium on Distributed Computing %E Schmid, Ulrich; Widder, Josef %P 1 - 14 %Z sequence number: 22 %I Schloss Dagstuhl %@ 978-3-95977-092-7 %B Leibniz International Proceedings in Informatics %N 121 %@ false %U http://drops.dagstuhl.de/opus/volltexte/2018/9811/http://drops.dagstuhl.de/doku/urheberrecht1.html
[130]
G. Even, M. Medina, and D. Rawitz, “Online Generalized Caching with Varying Weights and Costs,” in SPAA’18, 30th ACM Symposium on Parallelism in Algorithms and Architectures, Vienna, Austria, 2018.
Export
BibTeX
@inproceedings{Even_SPAA2018, TITLE = {Online Generalized Caching with Varying Weights and Costs}, AUTHOR = {Even, Guy and Medina, Moti and Rawitz, Dror}, LANGUAGE = {eng}, ISBN = {978-1-4503-5799-9}, DOI = {10.1145/3210377.3210404}, PUBLISHER = {ACM}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, BOOKTITLE = {SPAA'18, 30th ACM Symposium on Parallelism in Algorithms and Architectures}, PAGES = {205--2012}, ADDRESS = {Vienna, Austria}, }
Endnote
%0 Conference Proceedings %A Even, Guy %A Medina, Moti %A Rawitz, Dror %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Online Generalized Caching with Varying Weights and Costs : %G eng %U http://hdl.handle.net/21.11116/0000-0002-ABEA-6 %R 10.1145/3210377.3210404 %D 2018 %B 30th ACM Symposium on Parallelism in Algorithms and Architectures %Z date of event: 2018-07-16 - 2018-07-18 %C Vienna, Austria %B SPAA'18 %P 205 - 2012 %I ACM %@ 978-1-4503-5799-9
[131]
H. Fichtenberger, R. Levi, Y. Vasudev, and M. Wötzel, “A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided Error,” in 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Prague, Czech Republic, 2018.
Export
BibTeX
@inproceedings{FLVW18, TITLE = {A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided Error}, AUTHOR = {Fichtenberger, Hendrik and Levi, Reut and Vasudev, Yadu and W{\"o}tzel, Maximilian}, LANGUAGE = {eng}, ISBN = {978-3-95977-076-7}, URL = {urn:nbn:de:0030-drops-90563}, DOI = {10.4230/LIPIcs.ICALP.2018.52}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, EDITOR = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D{\'a}niel and Sannella, Donald}, PAGES = {1--14}, EID = {52}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {107}, ADDRESS = {Prague, Czech Republic}, }
Endnote
%0 Conference Proceedings %A Fichtenberger, Hendrik %A Levi, Reut %A Vasudev, Yadu %A W&#246;tzel, Maximilian %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided Error : %G eng %U http://hdl.handle.net/21.11116/0000-0002-E86A-2 %R 10.4230/LIPIcs.ICALP.2018.52 %U urn:nbn:de:0030-drops-90563 %D 2018 %B 45th International Colloquium on Automata, Languages, and Programming %Z date of event: 2018-07-09 - 2018-07-13 %C Prague, Czech Republic %B 45th International Colloquium on Automata, Languages, and Programming %E Chatzigiannakis, Ioannis; Kaklamanis, Christos; Marx, D&#225;niel; Sannella, Donald %P 1 - 14 %Z sequence number: 52 %I Schloss Dagstuhl %@ 978-3-95977-076-7 %B Leibniz International Proceedings in Informatics %N 107 %U http://drops.dagstuhl.de/opus/volltexte/2018/9056/http://drops.dagstuhl.de/doku/urheberrecht1.html
[132]
K. Fleszar, M. Mnich, and J. Spoerhase, “New Algorithms for Maximum Disjoint Paths Based on Tree-likeness,” Mathematical Programming / A, vol. 171, no. 1–2, 2018.
Export
BibTeX
@article{edge-disjoint-paths-mapr-17, TITLE = {New Algorithms for Maximum Disjoint Paths Based on Tree-likeness}, AUTHOR = {Fleszar, Krzysztof and Mnich, Matthias and Spoerhase, Joachim}, LANGUAGE = {eng}, ISSN = {0025-5610}, DOI = {10.1007/s10107-017-1199-3}, PUBLISHER = {North-Holland}, ADDRESS = {Heidelberg}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, JOURNAL = {Mathematical Programming / A}, VOLUME = {171}, NUMBER = {1-2}, PAGES = {433--461}, }
Endnote
%0 Journal Article %A Fleszar, Krzysztof %A Mnich, Matthias %A Spoerhase, Joachim %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T New Algorithms for Maximum Disjoint Paths Based on Tree-likeness : %G eng %U http://hdl.handle.net/21.11116/0000-0000-B54C-F %R 10.1007/s10107-017-1199-3 %7 2017 %D 2018 %J Mathematical Programming / A %V 171 %N 1-2 %& 433 %P 433 - 461 %I North-Holland %C Heidelberg %@ false
[133]
P. Fraigniaud and E. Natale, “Noisy Rumor Spreading and Plurality Consensus,” Distributed Computing, 2018.
Export
BibTeX
@article{Fraigniaud2018, TITLE = {Noisy Rumor Spreading and Plurality Consensus}, AUTHOR = {Fraigniaud, Pierre and Natale, Emanuele}, LANGUAGE = {eng}, ISSN = {0178-2770}, DOI = {10.1007/s00446-018-0335-5}, PUBLISHER = {Springer International}, ADDRESS = {Berlin}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, JOURNAL = {Distributed Computing}, }
Endnote
%0 Journal Article %A Fraigniaud, Pierre %A Natale, Emanuele %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Noisy Rumor Spreading and Plurality Consensus : %G eng %U http://hdl.handle.net/21.11116/0000-0002-6CD7-3 %R 10.1007/s00446-018-0335-5 %7 2018 %D 2018 %J Distributed Computing %I Springer International %C Berlin %@ false
[134]
S. Friedrichs, M. Függer, and C. Lenzen, “Metastability-Containing Circuits,” IEEE Transactions on Computers, vol. 67, no. 8, 2018.
Abstract
Communication across unsynchronized clock domains is inherently vulnerable to metastable upsets; no digital circuit can deterministically avoid, resolve, or detect metastability (Marino, 1981). Traditionally, a possibly metastable input is stored in synchronizers, decreasing the odds of maintained metastability over time. This approach costs time, and does not guarantee success. We propose a fundamentally different approach: It is possible to \emph{contain} metastability by logical masking, so that it cannot infect the entire circuit. This technique guarantees a limited degree of metastability in---and uncertainty about---the output. We present a synchronizer-free, fault-tolerant clock synchronization algorithm as application, synchronizing clock domains and thus enabling metastability-free communication. At the heart of our approach lies a model for metastability in synchronous clocked digital circuits. Metastability is propagated in a worst-case fashion, allowing to derive deterministic guarantees, without and unlike synchronizers. The proposed model permits positive results while at the same time reproducing established impossibility results regarding avoidance, resolution, and detection of metastability. Furthermore, we fully classify which functions can be computed by synchronous circuits with standard registers, and show that masking registers are computationally strictly more powerful.
Export
BibTeX
@article{Friedrichs_Fuegger_Lenzen2018, TITLE = {Metastability-Containing Circuits}, AUTHOR = {Friedrichs, Stephan and F{\"u}gger, Matthias and Lenzen, Christoph}, LANGUAGE = {eng}, ISSN = {0018-9340}, DOI = {10.1109/TC.2018.2808185}, PUBLISHER = {IEEE}, ADDRESS = {Piscataway, NJ}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, ABSTRACT = {Communication across unsynchronized clock domains is inherently vulnerable to metastable upsets; no digital circuit can deterministically avoid, resolve, or detect metastability (Marino, 1981). Traditionally, a possibly metastable input is stored in synchronizers, decreasing the odds of maintained metastability over time. This approach costs time, and does not guarantee success. We propose a fundamentally different approach: It is possible to \emph{contain} metastability by logical masking, so that it cannot infect the entire circuit. This technique guarantees a limited degree of metastability in---and uncertainty about---the output. We present a synchronizer-free, fault-tolerant clock synchronization algorithm as application, synchronizing clock domains and thus enabling metastability-free communication. At the heart of our approach lies a model for metastability in synchronous clocked digital circuits. Metastability is propagated in a worst-case fashion, allowing to derive deterministic guarantees, without and unlike synchronizers. The proposed model permits positive results while at the same time reproducing established impossibility results regarding avoidance, resolution, and detection of metastability. Furthermore, we fully classify which functions can be computed by synchronous circuits with standard registers, and show that masking registers are computationally strictly more powerful.}, JOURNAL = {IEEE Transactions on Computers}, VOLUME = {67}, NUMBER = {8}, PAGES = {1167--1183}, }
Endnote
%0 Journal Article %A Friedrichs, Stephan %A F&#252;gger, Matthias %A Lenzen, Christoph %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Metastability-Containing Circuits : %G eng %U http://hdl.handle.net/21.11116/0000-0001-E5A0-7 %R 10.1109/TC.2018.2808185 %7 2018 %D 2018 %X Communication across unsynchronized clock domains is inherently vulnerable to metastable upsets; no digital circuit can deterministically avoid, resolve, or detect metastability (Marino, 1981). Traditionally, a possibly metastable input is stored in synchronizers, decreasing the odds of maintained metastability over time. This approach costs time, and does not guarantee success. We propose a fundamentally different approach: It is possible to \emph{contain} metastability by logical masking, so that it cannot infect the entire circuit. This technique guarantees a limited degree of metastability in---and uncertainty about---the output. We present a synchronizer-free, fault-tolerant clock synchronization algorithm as application, synchronizing clock domains and thus enabling metastability-free communication. At the heart of our approach lies a model for metastability in synchronous clocked digital circuits. Metastability is propagated in a worst-case fashion, allowing to derive deterministic guarantees, without and unlike synchronizers. The proposed model permits positive results while at the same time reproducing established impossibility results regarding avoidance, resolution, and detection of metastability. Furthermore, we fully classify which functions can be computed by synchronous circuits with standard registers, and show that masking registers are computationally strictly more powerful. %K Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC %J IEEE Transactions on Computers %V 67 %N 8 %& 1167 %P 1167 - 1183 %I IEEE %C Piscataway, NJ %@ false
[135]
S. Friedrichs and C. Lenzen, “Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford,” Journal of the ACM, vol. 65, no. 6, 2018.
Export
BibTeX
@article{FriedrichsJACM2018, TITLE = {Parallel Metric Tree Embedding based on an Algebraic View on {Moore}-{Bellman}-{Ford}}, AUTHOR = {Friedrichs, Stephan and Lenzen, Christoph}, LANGUAGE = {eng}, ISSN = {0004-5411}, DOI = {10.1145/3231591}, PUBLISHER = {ACM}, ADDRESS = {New York, NY}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, JOURNAL = {Journal of the ACM}, VOLUME = {65}, NUMBER = {6}, EID = {43}, }
Endnote
%0 Journal Article %A Friedrichs, Stephan %A Lenzen, Christoph %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford : %G eng %U http://hdl.handle.net/21.11116/0000-0002-8892-F %R 10.1145/3231591 %7 2018 %D 2018 %J Journal of the ACM %V 65 %N 6 %Z sequence number: 43 %I ACM %C New York, NY %@ false
[136]
M. Függer, A. Kinali, C. Lenzen, and B. Wiederhake, “Fast All-Digital Clock Frequency Adaptation Circuit for Voltage Droop Tolerance,” in 24th IEEE International Symposium on Asynchronous Circuits and Systems, Vienna, Austria, 2018.
Export
BibTeX
@inproceedings{Fuegger_ASYNC2018, 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}, ISBN = {978-1-5386-5883-3}, DOI = {10.1109/ASYNC.2018.00025}, PUBLISHER = {IEEE}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {24th IEEE International Symposium on Asynchronous Circuits and Systems}, PAGES = {68--77}, ADDRESS = {Vienna, Austria}, }
Endnote
%0 Conference Proceedings %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-0002-9FA4-2 %R 10.1109/ASYNC.2018.00025 %D 2018 %B 24th IEEE International Symposium on Asynchronous Circuits and Systems %Z date of event: 2018-05-13 - 2018-05-16 %C Vienna, Austria %B 24th IEEE International Symposium on Asynchronous Circuits and Systems %P 68 - 77 %I IEEE %@ 978-1-5386-5883-3
[137]
J. Garg, M. Hoefer, and K. Mehlhorn, “Approximating the Nash Social Welfare with Budget-Additive Valuations,” in Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018), New Orleans, LA, USA, 2018.
Export
BibTeX
@inproceedings{GargHoeferMehlhornSODA18, TITLE = {Approximating the {Nash} Social Welfare with Budget-Additive Valuations}, AUTHOR = {Garg, Jugal and Hoefer, Martin and Mehlhorn, Kurt}, LANGUAGE = {eng}, ISBN = {978-1-61197-503-1}, DOI = {10.1137/1.9781611975031.150}, PUBLISHER = {SIAM}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, BOOKTITLE = {Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018)}, EDITOR = {Czumaj, Artur}, PAGES = {2326--2340}, ADDRESS = {New Orleans, LA, USA}, }
Endnote
%0 Conference Proceedings %A Garg, Jugal %A Hoefer, Martin %A Mehlhorn, Kurt %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Approximating the Nash Social Welfare with Budget-Additive Valuations : %G eng %U http://hdl.handle.net/21.11116/0000-0000-37F9-A %R 10.1137/1.9781611975031.150 %D 2018 %B Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2018-01-07 - 2018-01-10 %C New Orleans, LA, USA %B Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms %E Czumaj, Artur %P 2326 - 2340 %I SIAM %@ 978-1-61197-503-1
[138]
M. Ghaffari, A. Karrenbauer, F. Kuhn, C. Lenzen, and B. Patt-Shamir, “Near-Optimal Distributed Maximum Flow,” SIAM Journal on Computing, vol. 47, no. 6, 2018.
Export
BibTeX
@article{GKKLP2018, TITLE = {Near-Optimal Distributed Maximum Flow}, AUTHOR = {Ghaffari, Mohsen and Karrenbauer, Andreas and Kuhn, Fabian and Lenzen, Christoph and Patt-Shamir, Boaz}, LANGUAGE = {eng}, ISSN = {0097-5397}, DOI = {10.1137/17M113277X}, PUBLISHER = {Society for Industrial and Applied Mathematics.}, ADDRESS = {Philadelphia, PA}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, JOURNAL = {SIAM Journal on Computing}, VOLUME = {47}, NUMBER = {6}, PAGES = {2078--2117}, }
Endnote
%0 Journal Article %A Ghaffari, Mohsen %A Karrenbauer, Andreas %A Kuhn, Fabian %A Lenzen, Christoph %A Patt-Shamir, Boaz %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Near-Optimal Distributed Maximum Flow : %G eng %U http://hdl.handle.net/21.11116/0000-0002-A3A9-7 %R 10.1137/17M113277X %7 2018 %D 2018 %J SIAM Journal on Computing %V 47 %N 6 %& 2078 %P 2078 - 2117 %I Society for Industrial and Applied Mathematics. %C Philadelphia, PA %@ false
[139]
F. Grandoni, B. Laekhanukit, and S. Li, “O(log 2 k/ log log k)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm,” 2018. [Online]. Available: http://arxiv.org/abs/1811.03020. (arXiv: 1811.03020)
Abstract
In the Directed Steiner Tree (DST) problem we are given an $n$-vertex directed edge-weighted graph, a root $r$, and a collection of $k$ terminal nodes. Our goal is to find a minimum-cost arborescence that contains a directed path from $r$ to every terminal. We present an $O(\log^2 k/\log\log{k})$-approximation algorithm for DST that runs in quasi-polynomial-time. By adjusting the parameters in the hardness result of Halperin and Krauthgamer, we show the matching lower bound of $\Omega(\log^2{k}/\log\log{k})$ for the class of quasi-polynomial-time algorithms. This is the first improvement on the DST problem since the classical quasi-polynomial-time $O(\log^3 k)$ approximation algorithm by Charikar et al. (The paper erroneously claims an $O(\log^2k)$ approximation due to a mistake in prior work.) Our approach is based on two main ingredients. First, we derive an approximation preserving reduction to the Label-Consistent Subtree (LCST) problem. The LCST instance has quasi-polynomial size and logarithmic height. We remark that, in contrast, Zelikovsky's heigh-reduction theorem used in all prior work on DST achieves a reduction to a tree instance of the related Group Steiner Tree (GST) problem of similar height, however losing a logarithmic factor in the approximation ratio. Our second ingredient is an LP-rounding algorithm to approximately solve LCST instances, which is inspired by the framework developed by Rothvo{\ss}. We consider a Sherali-Adams lifting of a proper LP relaxation of LCST. Our rounding algorithm proceeds level by level from the root to the leaves, rounding and conditioning each time on a proper subset of label variables. A small enough (namely, polylogarithmic) number of Sherali-Adams lifting levels is sufficient to condition up to the leaves.
Export
BibTeX
@online{Grandoni_arXiv1811.03020, TITLE = {{$O(\log^2k/\log\log{k})$}-{A}pproximation {A}lgorithm for {D}irected {S}teiner {T}ree: {A} {Tight Quasi-Polynomial-Time Algorithm}}, AUTHOR = {Grandoni, Fabrizio and Laekhanukit, Bundit and Li, Shi}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1811.03020}, EPRINT = {1811.03020}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {In the Directed Steiner Tree (DST) problem we are given an $n$-vertex directed edge-weighted graph, a root $r$, and a collection of $k$ terminal nodes. Our goal is to find a minimum-cost arborescence that contains a directed path from $r$ to every terminal. We present an $O(\log^2 k/\log\log{k})$-approximation algorithm for DST that runs in quasi-polynomial-time. By adjusting the parameters in the hardness result of Halperin and Krauthgamer, we show the matching lower bound of $\Omega(\log^2{k}/\log\log{k})$ for the class of quasi-polynomial-time algorithms. This is the first improvement on the DST problem since the classical quasi-polynomial-time $O(\log^3 k)$ approximation algorithm by Charikar et al. (The paper erroneously claims an $O(\log^2k)$ approximation due to a mistake in prior work.) Our approach is based on two main ingredients. First, we derive an approximation preserving reduction to the Label-Consistent Subtree (LCST) problem. The LCST instance has quasi-polynomial size and logarithmic height. We remark that, in contrast, Zelikovsky's heigh-reduction theorem used in all prior work on DST achieves a reduction to a tree instance of the related Group Steiner Tree (GST) problem of similar height, however losing a logarithmic factor in the approximation ratio. Our second ingredient is an LP-rounding algorithm to approximately solve LCST instances, which is inspired by the framework developed by Rothvo{\ss}. We consider a Sherali-Adams lifting of a proper LP relaxation of LCST. Our rounding algorithm proceeds level by level from the root to the leaves, rounding and conditioning each time on a proper subset of label variables. A small enough (namely, polylogarithmic) number of Sherali-Adams lifting levels is sufficient to condition up to the leaves.}, }
Endnote
%0 Report %A Grandoni, Fabrizio %A Laekhanukit, Bundit %A Li, Shi %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T O(log 2 k/ log log k)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm : %G eng %U http://hdl.handle.net/21.11116/0000-0002-A880-F %U http://arxiv.org/abs/1811.03020 %D 2018 %X In the Directed Steiner Tree (DST) problem we are given an $n$-vertex directed edge-weighted graph, a root $r$, and a collection of $k$ terminal nodes. Our goal is to find a minimum-cost arborescence that contains a directed path from $r$ to every terminal. We present an $O(\log^2 k/\log\log{k})$-approximation algorithm for DST that runs in quasi-polynomial-time. By adjusting the parameters in the hardness result of Halperin and Krauthgamer, we show the matching lower bound of $\Omega(\log^2{k}/\log\log{k})$ for the class of quasi-polynomial-time algorithms. This is the first improvement on the DST problem since the classical quasi-polynomial-time $O(\log^3 k)$ approximation algorithm by Charikar et al. (The paper erroneously claims an $O(\log^2k)$ approximation due to a mistake in prior work.) Our approach is based on two main ingredients. First, we derive an approximation preserving reduction to the Label-Consistent Subtree (LCST) problem. The LCST instance has quasi-polynomial size and logarithmic height. We remark that, in contrast, Zelikovsky's heigh-reduction theorem used in all prior work on DST achieves a reduction to a tree instance of the related Group Steiner Tree (GST) problem of similar height, however losing a logarithmic factor in the approximation ratio. Our second ingredient is an LP-rounding algorithm to approximately solve LCST instances, which is inspired by the framework developed by Rothvo{\ss}. We consider a Sherali-Adams lifting of a proper LP relaxation of LCST. Our rounding algorithm proceeds level by level from the root to the leaves, rounding and conditioning each time on a proper subset of label variables. A small enough (namely, polylogarithmic) number of Sherali-Adams lifting levels is sufficient to condition up to the leaves. %K Computer Science, Data Structures and Algorithms, cs.DS
[140]
F. Grandoni, T. Mömke, A. Wiese, and H. Zhou, “A(5/3+ε)-Approximation for Unsplittable Flow on a Path: Placing Small Tasks into Boxes,” in STOC’18, 50th Annual ACM SIGACT Symposium on Theory of Computing, Los Angeles, CA, USA, 2018.
Export
BibTeX
@inproceedings{DBLP:conf/stoc/0001MW018, TITLE = {A {(5/3} + {\(\epsilon\)})-approximation for unsplittable flow on a path: {P}lacing small tasks into boxes}, AUTHOR = {Grandoni, Fabrizio and M{\"o}mke, Tobias and Wiese, Andreas and Zhou, Hang}, LANGUAGE = {eng}, ISBN = {978-1-4503-5559-9}, DOI = {10.1145/3188745.3188894}, PUBLISHER = {ACM}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, BOOKTITLE = {STOC'18, 50th Annual ACM SIGACT Symposium on Theory of Computing}, PAGES = {607--619}, ADDRESS = {Los Angeles, CA, USA}, }
Endnote
%0 Conference Proceedings %A Grandoni, Fabrizio %A M&#246;mke, Tobias %A Wiese, Andreas %A Zhou, Hang %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A(5/3+&#949;)-Approximation for Unsplittable Flow on a Path: Placing Small Tasks into Boxes : %G eng %U http://hdl.handle.net/21.11116/0000-0002-E5F3-9 %R 10.1145/3188745.3188894 %D 2018 %B 50th Annual ACM SIGACT Symposium on Theory of Computing %Z date of event: 2018-06-25 - 2017-06-29 %C Los Angeles, CA, USA %B STOC'18 %P 607 - 619 %I ACM %@ 978-1-4503-5559-9
[141]
T. A. G. Hageman, P. A. Loethman, M. Dirnberger, M. C. Elwenspoek, A. Manz, and L. Abelmann, “Macroscopic Equivalence for Microscopic Motion in a Turbulence Driven Three-dimensional Self-assembly Reactor,” Journal of Applied Physics, vol. 123, no. 2, 2018.
Export
BibTeX
@article{Hageman2018, TITLE = {Macroscopic Equivalence for Microscopic Motion in a Turbulence Driven Three-dimensional Self-assembly Reactor}, AUTHOR = {Hageman, T. A. G. and Loethman, P. A. and Dirnberger, Michael and Elwenspoek, M. C. and Manz, A. and Abelmann, L.}, LANGUAGE = {eng}, ISSN = {0021-8979}, DOI = {10.1063/1.5007029}, PUBLISHER = {AIP Publishing}, ADDRESS = {New York, NY}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, JOURNAL = {Journal of Applied Physics}, VOLUME = {123}, NUMBER = {2}, PAGES = {1--10}, EID = {024901}, }
Endnote
%0 Journal Article %A Hageman, T. A. G. %A Loethman, P. A. %A Dirnberger, Michael %A Elwenspoek, M. C. %A Manz, A. %A Abelmann, L. %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Macroscopic Equivalence for Microscopic Motion in a Turbulence Driven Three-dimensional Self-assembly Reactor : %G eng %U http://hdl.handle.net/21.11116/0000-0000-431A-8 %R 10.1063/1.5007029 %7 2018 %D 2018 %J Journal of Applied Physics %O J. Appl. Phys. %V 123 %N 2 %& 1 %P 1 - 10 %Z sequence number: 024901 %I AIP Publishing %C New York, NY %@ false
[142]
P. Heggernes, D. Issac, J. Lauri, P. T. Lima, and E. J. van Leeuwen, “Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs,” in 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), Liverpool, UK, 2018.
Export
BibTeX
@inproceedings{heggernes_et_al-2018-rainbow-vertex, TITLE = {Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs}, AUTHOR = {Heggernes, Pinar and Issac, Davis and Lauri, Juho and Lima, Paloma T. and van Leeuwen, Erik Jan}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-086-6}, URL = {urn:nbn:de:0030-drops-96657}, DOI = {10.4230/LIPIcs.MFCS.2018.83}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, EDITOR = {Potapov, Igor and Spirakis, Paul and Worrell, James}, PAGES = {1--13}, EID = {83}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {117}, ADDRESS = {Liverpool, UK}, }
Endnote
%0 Conference Proceedings %A Heggernes, Pinar %A Issac, Davis %A Lauri, Juho %A Lima, Paloma T. %A van Leeuwen, Erik Jan %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs : %G eng %U http://hdl.handle.net/21.11116/0000-0002-9E4D-7 %U urn:nbn:de:0030-drops-96657 %R 10.4230/LIPIcs.MFCS.2018.83 %D 2018 %B 43rd International Symposium on Mathematical Foundations of Computer Science %Z date of event: 2018-08-27 - 2018-08-31 %C Liverpool, UK %B 43rd International Symposium on Mathematical Foundations of Computer Science %E Potapov, Igor; Spirakis, Paul; Worrell, James %P 1 - 13 %Z sequence number: 83 %I Schloss Dagstuhl %@ 978-3-95977-086-6 %B Leibniz International Proceedings in Informatics %N 117 %@ false %U http://drops.dagstuhl.de/opus/volltexte/2018/9665/http://drops.dagstuhl.de/doku/urheberrecht1.html
[143]
S. Heydrich, “A Tale of Two Packing Problems: Improved Algorithms and Tighter Bounds for Online Bin Packing and the Geometric Knapsack Problem,” Universität des Saarlandes, Saarbrücken, 2018.
Abstract
Abstract In this thesis, we deal with two packing problems: the online bin packing and the geometric knapsack problem. In online bin packing, the aim is to pack a given number of items of dierent size into a minimal number of containers. The items need to be packed one by one without knowing future items. For online bin packing in one dimension, we present a new family of algorithms that constitutes the rst improvement over the previously best algorithm in almost 15 years. While the algorithmic ideas are intuitive, an elaborate analysis is required to prove its competitive ratio. We also give a lower bound for the competitive ratio of this family of algorithms. For online bin packing in higher dimensions, we discuss lower bounds for the competitive ratio and show that the ideas from the one-dimensional case cannot be easily transferred to obtain better two-dimensional algorithms. In the geometric knapsack problem, one aims to pack a maximum weight subset of given rectangles into one square container. For this problem, we consider oine approximation algorithms. For geometric knapsack with square items, we improve the running time of the best known PTAS and obtain an EPTAS . This shows that large running times caused by some standard techniques for geometric packing problems are not always necessary and can be improved. Finally, we show how to use resource augmentation to compute optimal solutions in EPTAS -time, thereby improving upon the known PTAS for this case.
Export
BibTeX
@phdthesis{Heydrphd18, TITLE = {A Tale of Two Packing Problems: Improved Algorithms and Tighter Bounds for Online Bin Packing and the Geometric Knapsack Problem}, AUTHOR = {Heydrich, Sandy}, LANGUAGE = {eng}, DOI = {10.22028/D291-27240}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, ABSTRACT = {Abstract In this thesis, we deal with two packing problems: the online bin packing and the geometric knapsack problem. In online bin packing, the aim is to pack a given number of items of dierent size into a minimal number of containers. The items need to be packed one by one without knowing future items. For online bin packing in one dimension, we present a new family of algorithms that constitutes the rst improvement over the previously best algorithm in almost 15 years. While the algorithmic ideas are intuitive, an elaborate analysis is required to prove its competitive ratio. We also give a lower bound for the competitive ratio of this family of algorithms. For online bin packing in higher dimensions, we discuss lower bounds for the competitive ratio and show that the ideas from the one-dimensional case cannot be easily transferred to obtain better two-dimensional algorithms. In the geometric knapsack problem, one aims to pack a maximum weight subset of given rectangles into one square container. For this problem, we consider oine approximation algorithms. For geometric knapsack with square items, we improve the running time of the best known PTAS and obtain an EPTAS . This shows that large running times caused by some standard techniques for geometric packing problems are not always necessary and can be improved. Finally, we show how to use resource augmentation to compute optimal solutions in EPTAS -time, thereby improving upon the known PTAS for this case.}, }
Endnote
%0 Thesis %A Heydrich, Sandy %Y van Stee, Rob %A referee: Mehlhorn, Kurt %A referee: Grandoni, Fabrizio %+ 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 Discrete Optimization, MPI for Informatics, Max Planck Society %T A Tale of Two Packing Problems: Improved Algorithms and Tighter Bounds for Online Bin Packing and the Geometric Knapsack Problem : %G eng %U http://hdl.handle.net/21.11116/0000-0001-E3DC-7 %R 10.22028/D291-27240 %I Universit&#228;t des Saarlandes %C Saarbr&#252;cken %D 2018 %P viii, 161 p. %V phd %9 phd %X Abstract In this thesis, we deal with two packing problems: the online bin packing and the geometric knapsack problem. In online bin packing, the aim is to pack a given number of items of dierent size into a minimal number of containers. The items need to be packed one by one without knowing future items. For online bin packing in one dimension, we present a new family of algorithms that constitutes the rst improvement over the previously best algorithm in almost 15 years. While the algorithmic ideas are intuitive, an elaborate analysis is required to prove its competitive ratio. We also give a lower bound for the competitive ratio of this family of algorithms. For online bin packing in higher dimensions, we discuss lower bounds for the competitive ratio and show that the ideas from the one-dimensional case cannot be easily transferred to obtain better two-dimensional algorithms. In the geometric knapsack problem, one aims to pack a maximum weight subset of given rectangles into one square container. For this problem, we consider oine approximation algorithms. For geometric knapsack with square items, we improve the running time of the best known PTAS and obtain an EPTAS . This shows that large running times caused by some standard techniques for geometric packing problems are not always necessary and can be improved. Finally, we show how to use resource augmentation to compute optimal solutions in EPTAS -time, thereby improving upon the known PTAS for this case. %U https://publikationen.sulb.uni-saarland.de/handle/20.500.11880/27141
[144]
R. Hodges and V. Lakshmibai, “A Classification of Spherical Schubert Varieties in the Grassmannian,” 2018. [Online]. Available: http://arxiv.org/abs/1809.08003. (arXiv: 1809.08003)
Abstract
Let $L$ be a Levi subgroup of $GL_N$ which acts by left multiplication on a Schubert variety $X(w)$ in the Grassmannian $G_{d,N}$. We say that $X(w)$ is a spherical Schubert variety if $X(w)$ is a spherical variety for the action of $L$. In earlier work we provide a combinatorial description of the decomposition of the homogeneous coordinate ring of $X(w)$ into irreducible $L$-modules for the induced action of $L$. In this work we classify those decompositions into irreducible $L$-modules that are multiplicity-free. This is then applied towards giving a complete classification of the spherical Schubert varieties in the Grassmannian.
Export
BibTeX
@online{2018arXiv180908003H, TITLE = {A Classification of Spherical Schubert Varieties in the Grassmannian}, AUTHOR = {Hodges, Reuven and Lakshmibai, Venkatramani}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1809.08003}, EPRINT = {1809.08003}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Let $L$ be a Levi subgroup of $GL_N$ which acts by left multiplication on a Schubert variety $X(w)$ in the Grassmannian $G_{d,N}$. We say that $X(w)$ is a spherical Schubert variety if $X(w)$ is a spherical variety for the action of $L$. In earlier work we provide a combinatorial description of the decomposition of the homogeneous coordinate ring of $X(w)$ into irreducible $L$-modules for the induced action of $L$. In this work we classify those decompositions into irreducible $L$-modules that are multiplicity-free. This is then applied towards giving a complete classification of the spherical Schubert varieties in the Grassmannian.}, }
Endnote
%0 Report %A Hodges, Reuven %A Lakshmibai, Venkatramani %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T A Classification of Spherical Schubert Varieties in the Grassmannian : %G eng %U http://hdl.handle.net/21.11116/0000-0002-F4AA-B %U http://arxiv.org/abs/1809.08003 %D 2018 %X Let $L$ be a Levi subgroup of $GL_N$ which acts by left multiplication on a Schubert variety $X(w)$ in the Grassmannian $G_{d,N}$. We say that $X(w)$ is a spherical Schubert variety if $X(w)$ is a spherical variety for the action of $L$. In earlier work we provide a combinatorial description of the decomposition of the homogeneous coordinate ring of $X(w)$ into irreducible $L$-modules for the induced action of $L$. In this work we classify those decompositions into irreducible $L$-modules that are multiplicity-free. This is then applied towards giving a complete classification of the spherical Schubert varieties in the Grassmannian. %K Mathematics, Representation Theory, math.RT,Mathematics, Algebraic Geometry, math.AG,Mathematics, Combinatorics, math.CO,
[145]
M. Hoefer, D. Vaz, and L. Wagner, “Dynamics in Matching and Coalition Formation Games with Structural Constraints,” Artificial Intelligence, vol. 262, 2018.
Export
BibTeX
@article{Hoefer_2018, TITLE = {Dynamics in Matching and Coalition Formation Games with Structural Constraints}, AUTHOR = {Hoefer, Martin and Vaz, Daniel and Wagner, Lisa}, LANGUAGE = {eng}, ISSN = {0004-3702}, DOI = {10.1016/j.artint.2018.06.004}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, JOURNAL = {Artificial Intelligence}, VOLUME = {262}, PAGES = {222--247}, }
Endnote
%0 Journal Article %A Hoefer, Martin %A Vaz, Daniel %A Wagner, Lisa %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Dynamics in Matching and Coalition Formation Games with Structural Constraints : %G eng %U http://hdl.handle.net/21.11116/0000-0002-02F6-6 %R 10.1016/j.artint.2018.06.004 %7 2018 %D 2018 %J Artificial Intelligence %V 262 %& 222 %P 222 - 247 %I Elsevier %C Amsterdam %@ false
[146]
W. Höhn, J. Mestre, and A. Wiese, “How Unsplittable-flow-covering Helps Scheduling with Job-dependent Cost Functions,” Algorithmica, vol. 80, no. 4, 2018.
Export
BibTeX
@article{Hoehn2017, TITLE = {How Unsplittable-flow-covering Helps Scheduling with Job-dependent Cost Functions}, AUTHOR = {H{\"o}hn, Wiebke and Mestre, Julian and Wiese, Andreas}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-017-0300-x}, PUBLISHER = {Springer-Verlag}, ADDRESS = {New York, NY}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, JOURNAL = {Algorithmica}, VOLUME = {80}, NUMBER = {4}, PAGES = {1191--1213}, }
Endnote
%0 Journal Article %A H&#246;hn, Wiebke %A Mestre, Julian %A Wiese, Andreas %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T How Unsplittable-flow-covering Helps Scheduling with Job-dependent Cost Functions : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-2618-3 %R 10.1007/s00453-017-0300-x %7 2017 %D 2018 %J Algorithmica %V 80 %N 4 %& 1191 %P 1191 - 1213 %I Springer-Verlag %C New York, NY %@ false
[147]
C. Ikenmeyer, B. Komarath, C. Lenzen, V. Lysikov, A. Mokhov, and K. Sreenivasaiah, “On the Complexity of Hazard-free Circuits,” in STOC’18, 50th Annual ACM SIGACT Symposium on Theory of Computing, Los Angeles, CA, USA, 2018.
Export
BibTeX
@inproceedings{Ikenmeyer_STOC2018, TITLE = {On the Complexity of Hazard-free Circuits}, AUTHOR = {Ikenmeyer, Christian and Komarath, Balagopal and Lenzen, Christoph and Lysikov, Vladimir and Mokhov, Andrey and Sreenivasaiah, Karteek}, LANGUAGE = {eng}, ISBN = {978-1-4503-5559-9}, DOI = {10.1145/3188745.3188912}, PUBLISHER = {ACM}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, BOOKTITLE = {STOC'18, 50th Annual ACM SIGACT Symposium on Theory of Computing}, PAGES = {878--889}, ADDRESS = {Los Angeles, CA, USA}, }
Endnote
%0 Conference Proceedings %A Ikenmeyer, Christian %A Komarath, Balagopal %A Lenzen, Christoph %A Lysikov, Vladimir %A Mokhov, Andrey %A Sreenivasaiah, Karteek %+ 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 On the Complexity of Hazard-free Circuits : %G eng %U http://hdl.handle.net/21.11116/0000-0002-17E1-6 %R 10.1145/3188745.3188912 %D 2018 %B 50th Annual ACM SIGACT Symposium on Theory of Computing %Z date of event: 2018-06-25 - 2017-06-29 %C Los Angeles, CA, USA %B STOC'18 %P 878 - 889 %I ACM %@ 978-1-4503-5559-9
[148]
C. Ikenmeyer and S. Mengel, “On the Relative Power of Reduction Notions in Arithmetic Circuit Complexity,” Information Processing Letters, vol. 130, 2018.
Export
BibTeX
@article{Ikenmeyer2018, TITLE = {On the Relative Power of Reduction Notions in Arithmetic Circuit Complexity}, AUTHOR = {Ikenmeyer, Christian and Mengel, Stefan}, LANGUAGE = {eng}, ISSN = {0020-0190}, DOI = {10.1016/j.ipl.2017.09.009}, PUBLISHER = {Elsevier}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, JOURNAL = {Information Processing Letters}, VOLUME = {130}, PAGES = {7--10}, }
Endnote
%0 Journal Article %A Ikenmeyer, Christian %A Mengel, Stefan %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T On the Relative Power of Reduction Notions in Arithmetic Circuit Complexity : %G eng %U http://hdl.handle.net/21.11116/0000-0000-0361-F %R 10.1016/j.ipl.2017.09.009 %7 2017 %D 2018 %J Information Processing Letters %V 130 %& 7 %P 7 - 10 %I Elsevier %@ false
[149]
C. S. Karthik, B. Laekhanukit, and P. Manurangsi, “On the Parameterized Complexity of Approximating Dominating Set,” in STOC’18, 50th Annual ACM SIGACT Symposium on Theory of Computing, Los Angeles, CA, USA, 2018.
Export
BibTeX
@inproceedings{Karthik_STOC2018, TITLE = {On the Parameterized Complexity of Approximating Dominating Set}, AUTHOR = {Karthik, C. S. and Laekhanukit, Bundit and Manurangsi, Pasin}, LANGUAGE = {eng}, ISBN = {978-1-4503-5559-9}, DOI = {10.1145/3188745.3188896}, PUBLISHER = {ACM}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, BOOKTITLE = {STOC'18, 50th Annual ACM SIGACT Symposium on Theory of Computing}, PAGES = {1283--1296}, ADDRESS = {Los Angeles, CA, USA}, }
Endnote
%0 Conference Proceedings %A Karthik, C. S. %A Laekhanukit, Bundit %A Manurangsi, Pasin %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T On the Parameterized Complexity of Approximating Dominating Set : %G eng %U http://hdl.handle.net/21.11116/0000-0002-A81D-1 %R 10.1145/3188745.3188896 %D 2018 %B 50th Annual ACM SIGACT Symposium on Theory of Computing %Z date of event: 2018-06-25 - 2017-06-29 %C Los Angeles, CA, USA %B STOC'18 %P 1283 - 1296 %I ACM %@ 978-1-4503-5559-9
[150]
T. Kesselheim and B. Kodric, “Price of Anarchy for Mechanisms with Risk-Averse Agents,” in 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Prague, Czech Republic, 2018.
Export
BibTeX
@inproceedings{Kesselheim_ICALP2018, TITLE = {Price of Anarchy for Mechanisms with Risk-Averse Agents}, AUTHOR = {Kesselheim, Thomas and Kodric, Bojana}, LANGUAGE = {eng}, ISBN = {978-3-95977-076-7}, URL = {urn:nbn:de:0030-drops-91599}, DOI = {10.4230/LIPIcs.ICALP.2018.155}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, EDITOR = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D{\'a}niel and Sannella, Donald}, PAGES = {1--14}, EID = {155}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {107}, ADDRESS = {Prague, Czech Republic}, }
Endnote
%0 Conference Proceedings %A Kesselheim, Thomas %A Kodric, Bojana %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Price of Anarchy for Mechanisms with Risk-Averse Agents : %G eng %U http://hdl.handle.net/21.11116/0000-0002-A32D-4 %R 10.4230/LIPIcs.ICALP.2018.155 %U urn:nbn:de:0030-drops-91599 %D 2018 %B 45th International Colloquium on Automata, Languages, and Programming %Z date of event: 2018-07-09 - 2018-07-13 %C Prague, Czech Republic %B 45th International Colloquium on Automata, Languages, and Programming %E Chatzigiannakis, Ioannis; Kaklamanis, Christos; Marx, D&#225;niel; Sannella, Donald %P 1 - 14 %Z sequence number: 155 %I Schloss Dagstuhl %@ 978-3-95977-076-7 %B Leibniz International Proceedings in Informatics %N 107 %U http://drops.dagstuhl.de/opus/volltexte/2018/9159/http://drops.dagstuhl.de/doku/urheberrecht1.html
[151]
P. Kolev, “Algorithmic Results for Clustering and Refined Physarum Analysis,” Universität des Saarlandes, Saarbrücken, 2018.
Export
BibTeX
@phdthesis{Kolev_PhD2018, TITLE = {Algorithmic Results for Clustering and Refined Physarum Analysis}, AUTHOR = {Kolev, Pavel}, LANGUAGE = {eng}, URL = {urn:nbn:de:bsz:291-scidok-ds-275519}, DOI = {10.22028/D291-27551}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, }
Endnote
%0 Thesis %A Kolev, Pavel %Y Mehlhorn, Kurt %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 Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Algorithmic Results for Clustering and Refined Physarum Analysis : %G eng %U http://hdl.handle.net/21.11116/0000-0003-3937-0 %R 10.22028/D291-27551 %U urn:nbn:de:bsz:291-scidok-ds-275519 %F OTHER: hdl:20.500.11880/27234 %I Universit&#228;t des Saarlandes %C Saarbr&#252;cken %D 2018 %P XIV, 123 p. %V phd %9 phd %U http://dx.doi.org/10.22028/D291-27551
[152]
P. Koprowski, K. Mehlhorn, and S. Ray, “Corrigendum to ‘Faster algorithms for computing Hong’s bound on absolute positiveness’ [J. Symb. Comput. 45 (2010) 677–683],” Journal of Symbolic Computation, vol. 87, 2018.
Export
BibTeX
@article{Koprowski2018, TITLE = {Corrigendum to ``{F}aster algorithms for computing {H}ong's bound on absolute positiveness'' [{J. Symb. Comput.} 45 (2010) 677--683]}, AUTHOR = {Koprowski, Przemys{\l}aw and Mehlhorn, Kurt and Ray, Saurabh}, LANGUAGE = {eng}, ISSN = {0747-7171}, DOI = {10.1016/j.jsc.2017.05.008}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, JOURNAL = {Journal of Symbolic Computation}, VOLUME = {87}, PAGES = {238--241}, }
Endnote
%0 Journal Article %A Koprowski, Przemys&#322;aw %A Mehlhorn, Kurt %A Ray, Saurabh %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Corrigendum to &#8220;Faster algorithms for computing Hong's bound on absolute positiveness&#8221; [J. Symb. Comput. 45 (2010) 677&#8211;683] : %G eng %U http://hdl.handle.net/21.11116/0000-0001-3C55-D %R 10.1016/j.jsc.2017.05.008 %7 2017 %D 2018 %J Journal of Symbolic Computation %V 87 %& 238 %P 238 - 241 %I Elsevier %C Amsterdam %@ false
[153]
F. Kuhn, C. Lenzen, T. Locher, and R. Oshman, “Optimal Gradient Clock Synchronization in Dynamic Networks (Version 3),” 2018. [Online]. Available: http://arxiv.org/abs/1005.2894. (arXiv: 1005.2894)
Abstract
We study the problem of clock synchronization in highly dynamic networks, where communication links can appear or disappear at any time. The nodes in the network are equipped with hardware clocks, but the rate of the hardware clocks can vary arbitrarily within specific bounds, and the estimates that nodes can obtain about the clock values of other nodes are inherently inaccurate. Our goal in this setting is to output a logical clock at each node such that the logical clocks of any two nodes are not too far apart, and nodes that remain close to each other in the network for a long time are better synchronized than distant nodes. This property is called gradient clock synchronization. Gradient clock synchronization has been widely studied in the static setting, where the network topology does not change. We show that the asymptotically optimal bounds obtained for the static case also apply to our highly dynamic setting: if two nodes remain at distance $d$ from each other for sufficiently long, it is possible to upper bound the difference between their clock values by $O(d \log (D / d))$, where $D$ is the diameter of the network. This is known to be optimal even for static networks. Furthermore, we show that our algorithm has optimal stabilization time: when a path of length $d$ appears between two nodes, the time required until the clock skew between the two nodes is reduced to $O(d \log (D / d))$ is $O(D)$, which we prove to be optimal. Finally, the techniques employed for the more intricate analysis of the algorithm for dynamic graphs provide additional insights that are also of interest for the static setting. In particular, we establish self-stabilization of the gradient property within $O(D)$ time.
Export
BibTeX
@online{Kuhn2018-gradient, TITLE = {Optimal Gradient Clock Synchronization in Dynamic Networks (Version 3)}, AUTHOR = {Kuhn, Fabian and Lenzen, Christoph and Locher, Thomas and Oshman, Rotem}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1005.2894}, EPRINT = {1005.2894}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We study the problem of clock synchronization in highly dynamic networks, where communication links can appear or disappear at any time. The nodes in the network are equipped with hardware clocks, but the rate of the hardware clocks can vary arbitrarily within specific bounds, and the estimates that nodes can obtain about the clock values of other nodes are inherently inaccurate. Our goal in this setting is to output a logical clock at each node such that the logical clocks of any two nodes are not too far apart, and nodes that remain close to each other in the network for a long time are better synchronized than distant nodes. This property is called gradient clock synchronization. Gradient clock synchronization has been widely studied in the static setting, where the network topology does not change. We show that the asymptotically optimal bounds obtained for the static case also apply to our highly dynamic setting: if two nodes remain at distance $d$ from each other for sufficiently long, it is possible to upper bound the difference between their clock values by $O(d \log (D / d))$, where $D$ is the diameter of the network. This is known to be optimal even for static networks. Furthermore, we show that our algorithm has optimal stabilization time: when a path of length $d$ appears between two nodes, the time required until the clock skew between the two nodes is reduced to $O(d \log (D / d))$ is $O(D)$, which we prove to be optimal. Finally, the techniques employed for the more intricate analysis of the algorithm for dynamic graphs provide additional insights that are also of interest for the static setting. In particular, we establish self-stabilization of the gradient property within $O(D)$ time.}, }
Endnote
%0 Report %A Kuhn, Fabian %A Lenzen, Christoph %A Locher, Thomas %A Oshman, Rotem %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Optimal Gradient Clock Synchronization in Dynamic Networks (Version 3) : %G eng %U http://hdl.handle.net/21.11116/0000-0002-F1E8-8 %U http://arxiv.org/abs/1005.2894 %D 2018 %X We study the problem of clock synchronization in highly dynamic networks, where communication links can appear or disappear at any time. The nodes in the network are equipped with hardware clocks, but the rate of the hardware clocks can vary arbitrarily within specific bounds, and the estimates that nodes can obtain about the clock values of other nodes are inherently inaccurate. Our goal in this setting is to output a logical clock at each node such that the logical clocks of any two nodes are not too far apart, and nodes that remain close to each other in the network for a long time are better synchronized than distant nodes. This property is called gradient clock synchronization. Gradient clock synchronization has been widely studied in the static setting, where the network topology does not change. We show that the asymptotically optimal bounds obtained for the static case also apply to our highly dynamic setting: if two nodes remain at distance $d$ from each other for sufficiently long, it is possible to upper bound the difference between their clock values by $O(d \log (D / d))$, where $D$ is the diameter of the network. This is known to be optimal even for static networks. Furthermore, we show that our algorithm has optimal stabilization time: when a path of length $d$ appears between two nodes, the time required until the clock skew between the two nodes is reduced to $O(d \log (D / d))$ is $O(D)$, which we prove to be optimal. Finally, the techniques employed for the more intricate analysis of the algorithm for dynamic graphs provide additional insights that are also of interest for the static setting. In particular, we establish self-stabilization of the gradient property within $O(D)$ time. %K Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC,Computer Science, Data Structures and Algorithms, cs.DS
[154]
M. Künnemann, “On Nondeterministic Derandomization of Freivalds’ Algorithm: Consequences, Avenues and Algorithmic Progress,” in 26th Annual European Symposium on Algorithms (ESA 2018), Helsinki, Finland, 2018.
Export
BibTeX
@inproceedings{Kuennemann_ESA2018, TITLE = {On Nondeterministic Derandomization of {F}reivalds' Algorithm: {C}onsequences, Avenues and Algorithmic Progress}, AUTHOR = {K{\"u}nnemann, Marvin}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-081-1}, URL = {urn:nbn:de:0030-drops-95195}, DOI = {10.4230/LIPIcs.ESA.2018.56}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {26th Annual European Symposium on Algorithms (ESA 2018)}, EDITOR = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz}, PAGES = {1--16}, EID = {56}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {112}, ADDRESS = {Helsinki, Finland}, }
Endnote
%0 Conference Proceedings %A K&#252;nnemann, Marvin %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society %T On Nondeterministic Derandomization of Freivalds' Algorithm: Consequences, Avenues and Algorithmic Progress : %G eng %U http://hdl.handle.net/21.11116/0000-0002-A8F1-0 %R 10.4230/LIPIcs.ESA.2018.56 %U urn:nbn:de:0030-drops-95195 %D 2018 %B 26th Annual European Symposium on Algorithms %Z date of event: 2018-08-20 - 2018-08-22 %C Helsinki, Finland %B 26th Annual European Symposium on Algorithms %E Azar, Yossi; Bast, Hannah; Herman, Grzegorz %P 1 - 16 %Z sequence number: 56 %I Schloss Dagstuhl %@ 978-3-95977-081-1 %B Leibniz International Proceedings in Informatics %N 112 %@ false %U http://drops.dagstuhl.de/opus/volltexte/2018/9519/http://drops.dagstuhl.de/doku/urheberrecht1.html
[155]
M. Künnemann, “On Nondeterministic Derandomization of Freivalds’ Algorithm: Consequences, Avenues and Algorithmic Progress,” 2018. [Online]. Available: http://arxiv.org/abs/1806.09189. (arXiv: 1806.09189)
Abstract
Motivated by studying the power of randomness, certifying algorithms and barriers for fine-grained reductions, we investigate the question whether the multiplication of two $n\times n$ matrices can be performed in near-optimal nondeterministic time $\tilde{O}(n^2)$. Since a classic algorithm due to Freivalds verifies correctness of matrix products probabilistically in time $O(n^2)$, our question is a relaxation of the open problem of derandomizing Freivalds' algorithm. We discuss consequences of a positive or negative resolution of this problem and provide potential avenues towards resolving it. Particularly, we show that sufficiently fast deterministic verifiers for 3SUM or univariate polynomial identity testing yield faster deterministic verifiers for matrix multiplication. Furthermore, we present the partial algorithmic progress that distinguishing whether an integer matrix product is correct or contains between 1 and $n$ erroneous entries can be performed in time $\tilde{O}(n^2)$ -- interestingly, the difficult case of deterministic matrix product verification is not a problem of "finding a needle in the haystack", but rather cancellation effects in the presence of many errors. Our main technical contribution is a deterministic algorithm that corrects an integer matrix product containing at most $t$ errors in time $\tilde{O}(\sqrt{t} n^2 + t^2)$. To obtain this result, we show how to compute an integer matrix product with at most $t$ nonzeroes in the same running time. This improves upon known deterministic output-sensitive integer matrix multiplication algorithms for $t = \Omega(n^{2/3})$ nonzeroes, which is of independent interest.
Export
BibTeX
@online{Kuennemann_arXiv1806.09189, TITLE = {On Nondeterministic Derandomization of {F}reivalds' Algorithm: {C}onsequences, Avenues and Algorithmic Progress}, AUTHOR = {K{\"u}nnemann, Marvin}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1806.09189}, EPRINT = {1806.09189}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Motivated by studying the power of randomness, certifying algorithms and barriers for fine-grained reductions, we investigate the question whether the multiplication of two $n\times n$ matrices can be performed in near-optimal nondeterministic time $\tilde{O}(n^2)$. Since a classic algorithm due to Freivalds verifies correctness of matrix products probabilistically in time $O(n^2)$, our question is a relaxation of the open problem of derandomizing Freivalds' algorithm. We discuss consequences of a positive or negative resolution of this problem and provide potential avenues towards resolving it. Particularly, we show that sufficiently fast deterministic verifiers for 3SUM or univariate polynomial identity testing yield faster deterministic verifiers for matrix multiplication. Furthermore, we present the partial algorithmic progress that distinguishing whether an integer matrix product is correct or contains between 1 and $n$ erroneous entries can be performed in time $\tilde{O}(n^2)$ -- interestingly, the difficult case of deterministic matrix product verification is not a problem of "finding a needle in the haystack", but rather cancellation effects in the presence of many errors. Our main technical contribution is a deterministic algorithm that corrects an integer matrix product containing at most $t$ errors in time $\tilde{O}(\sqrt{t} n^2 + t^2)$. To obtain this result, we show how to compute an integer matrix product with at most $t$ nonzeroes in the same running time. This improves upon known deterministic output-sensitive integer matrix multiplication algorithms for $t = \Omega(n^{2/3})$ nonzeroes, which is of independent interest.}, }
Endnote
%0 Report %A K&#252;nnemann, Marvin %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society %T On Nondeterministic Derandomization of Freivalds' Algorithm: Consequences, Avenues and Algorithmic Progress : %G eng %U http://hdl.handle.net/21.11116/0000-0002-A8F5-C %U http://arxiv.org/abs/1806.09189 %D 2018 %X Motivated by studying the power of randomness, certifying algorithms and barriers for fine-grained reductions, we investigate the question whether the multiplication of two $n\times n$ matrices can be performed in near-optimal nondeterministic time $\tilde{O}(n^2)$. Since a classic algorithm due to Freivalds verifies correctness of matrix products probabilistically in time $O(n^2)$, our question is a relaxation of the open problem of derandomizing Freivalds' algorithm. We discuss consequences of a positive or negative resolution of this problem and provide potential avenues towards resolving it. Particularly, we show that sufficiently fast deterministic verifiers for 3SUM or univariate polynomial identity testing yield faster deterministic verifiers for matrix multiplication. Furthermore, we present the partial algorithmic progress that distinguishing whether an integer matrix product is correct or contains between 1 and $n$ erroneous entries can be performed in time $\tilde{O}(n^2)$ -- interestingly, the difficult case of deterministic matrix product verification is not a problem of "finding a needle in the haystack", but rather cancellation effects in the presence of many errors. Our main technical contribution is a deterministic algorithm that corrects an integer matrix product containing at most $t$ errors in time $\tilde{O}(\sqrt{t} n^2 + t^2)$. To obtain this result, we show how to compute an integer matrix product with at most $t$ nonzeroes in the same running time. This improves upon known deterministic output-sensitive integer matrix multiplication algorithms for $t = \Omega(n^{2/3})$ nonzeroes, which is of independent interest. %K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Computational Complexity, cs.CC
[156]
A. Kurpisz, M. Mastrolilli, C. Mathieu, T. Mömke, V. Verdugo, and A. Wiese, “Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines,” Mathematical Programming / B, vol. 172, no. 1–2, 2018.
Export
BibTeX
@article{Kurpisz2018, TITLE = {Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines}, AUTHOR = {Kurpisz, Adam and Mastrolilli, Monaldo and Mathieu, Claire and M{\"o}mke, Tobias and Verdugo, Victor and Wiese, Andreas}, LANGUAGE = {eng}, ISSN = {0025-5610}, DOI = {10.1007/s10107-017-1152-5}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, JOURNAL = {Mathematical Programming / B}, VOLUME = {172}, NUMBER = {1-2}, PAGES = {231--248}, }
Endnote
%0 Journal Article %A Kurpisz, Adam %A Mastrolilli, Monaldo %A Mathieu, Claire %A M&#246;mke, Tobias %A Verdugo, Victor %A Wiese, Andreas %+ External Organizations External Organizations External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines : %G eng %U http://hdl.handle.net/21.11116/0000-0002-6BCF-E %R 10.1007/s10107-017-1152-5 %7 2017 %D 2018 %J Mathematical Programming / B %V 172 %N 1-2 %& 231 %P 231 - 248 %@ false
[157]
J.-H. Lange, A. Karrenbauer, and B. Andres, “Partial Optimality and Fast Lower Bounds for Weighted Correlation Clustering,” in Proceedings of the 35th International Conference on Machine Learning (ICML 2018), Stockholm, Sweden, 2018.
Export
BibTeX
@inproceedings{pmlr-v80-lange18a, TITLE = {Partial Optimality and Fast Lower Bounds for Weighted Correlation Clustering}, AUTHOR = {Lange, Jan-Hendrik and Karrenbauer, Andreas and Andres, Bjoern}, LANGUAGE = {eng}, ISSN = {1938-7228}, URL = {http://proceedings.mlr.press/v80/lange18a.html}, PUBLISHER = {PMLR}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Proceedings of the 35th International Conference on Machine Learning (ICML 2018)}, EDITOR = {Dy, Jennifer and Krause, Andreas}, PAGES = {2898--2907}, SERIES = {Proceedings of Machine Learning Research}, VOLUME = {80}, ADDRESS = {Stockholm, Sweden}, }
Endnote
%0 Conference Proceedings %A Lange, Jan-Hendrik %A Karrenbauer, Andreas %A Andres, Bjoern %+ Computer Vision and Multimodal Computing, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Computer Vision and Multimodal Computing, MPI for Informatics, Max Planck Society %T Partial Optimality and Fast Lower Bounds for Weighted Correlation Clustering : %G eng %U http://hdl.handle.net/21.11116/0000-0001-A71C-4 %U http://proceedings.mlr.press/v80/lange18a.html %D 2018 %B 35th International Conference on Machine Learning %Z date of event: 2018-07-10 - 2018-07-15 %C Stockholm, Sweden %B Proceedings of the 35th International Conference on Machine Learning %E Dy, Jennifer; Krause, Andreas %P 2898 - 2907 %I PMLR %B Proceedings of Machine Learning Research %N 80 %@ false %U http://proceedings.mlr.press/v80/lange18a/lange18a.pdf
[158]
C. Lenzen and R. Levi, “A Centralized Local Algorithm for the Sparse Spanning Graph Problem,” in 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Prague, Czech Republic, 2018.
Export
BibTeX
@inproceedings{Lenzen_ICALP2018, TITLE = {A Centralized Local Algorithm for the Sparse Spanning Graph Problem}, AUTHOR = {Lenzen, Christoph and Levi, Reut}, LANGUAGE = {eng}, ISBN = {978-3-95977-076-7}, URL = {urn:nbn:de:0030-drops-90919}, DOI = {10.4230/LIPIcs.ICALP.2018.87}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, EDITOR = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D{\'a}niel and Sannella, Donald}, PAGES = {1--47}, EID = {87}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {107}, ADDRESS = {Prague, Czech Republic}, }
Endnote
%0 Conference Proceedings %A Lenzen, Christoph %A Levi, Reut %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Centralized Local Algorithm for the Sparse Spanning Graph Problem : %G eng %U http://hdl.handle.net/21.11116/0000-0002-17EF-8 %R 10.4230/LIPIcs.ICALP.2018.87 %U urn:nbn:de:0030-drops-90919 %D 2018 %B 45th International Colloquium on Automata, Languages, and Programming %Z date of event: 2018-07-09 - 2018-07-13 %C Prague, Czech Republic %B 45th International Colloquium on Automata, Languages, and Programming %E Chatzigiannakis, Ioannis; Kaklamanis, Christos; Marx, D&#225;niel; Sannella, Donald %P 1 - 47 %Z sequence number: 87 %I Schloss Dagstuhl %@ 978-3-95977-076-7 %B Leibniz International Proceedings in Informatics %N 107 %U http://drops.dagstuhl.de/opus/volltexte/2018/9091/http://drops.dagstuhl.de/doku/urheberrecht1.html
[159]
N. Mustafa, K. Dutta, and A. Ghosh, “Simple Proof of Optimal Epsilon Nets,” Combinatorica, vol. 38, no. 5, 2018.
Export
BibTeX
@article{mustafa:hal-01360452, TITLE = {Simple Proof of Optimal Epsilon Nets}, AUTHOR = {Mustafa, Nabil and Dutta, Kunal and Ghosh, Arijit}, LANGUAGE = {eng}, ISSN = {0209-9683}, DOI = {10.1007/s00493-017-3564-5}, PUBLISHER = {Springer}, ADDRESS = {Heidelberg}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, JOURNAL = {Combinatorica}, VOLUME = {38}, NUMBER = {5}, PAGES = {1269--1277}, }
Endnote
%0 Journal Article %A Mustafa, Nabil %A Dutta, Kunal %A Ghosh, Arijit %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Simple Proof of Optimal Epsilon Nets : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-65CA-7 %R 10.1007/s00493-017-3564-5 %7 2017 %D 2018 %J Combinatorica %V 38 %N 5 %& 1269 %P 1269 - 1277 %I Springer %C Heidelberg %@ false
[160]
E. Natale, “On the Computational Power of Simple Dynamics,” Bulletin of the EATCS, vol. 124, 2018.
Export
BibTeX
@article{Natale_EATCS2018, TITLE = {On the Computational Power of Simple Dynamics}, AUTHOR = {Natale, Emanuele}, LANGUAGE = {eng}, PUBLISHER = {EATCS}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, JOURNAL = {Bulletin of the EATCS}, VOLUME = {124}, EID = {526}, }
Endnote
%0 Journal Article %A Natale, Emanuele %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society %T On the Computational Power of Simple Dynamics : %G eng %U http://hdl.handle.net/21.11116/0000-0002-A93E-B %7 2018 %D 2018 %J Bulletin of the EATCS %V 124 %Z sequence number: 526 %I EATCS %U http://eatcs.org/beatcs/index.php/beatcs/article/view/526
[161]
E. Oh, “Point Location in Incremental Planar Subdivisions,” in 29th International Symposium on Algorithms and Computation (ISAAC 2018), Jiaoxi, Yilan, Taiwan, 2018.
Export
BibTeX
@inproceedings{Oh_ISAAC2018, TITLE = {Point Location in Incremental Planar Subdivisions}, AUTHOR = {Oh, Eunjin}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-094-1}, URL = {urn:nbn:de:0030-drops-99991}, DOI = {10.4230/LIPIcs.ISAAC.2018.51}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, EDITOR = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, PAGES = {1--12}, EID = {51}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {123}, ADDRESS = {Jiaoxi, Yilan, Taiwan}, }
Endnote
%0 Conference Proceedings %A Oh, Eunjin %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Point Location in Incremental Planar Subdivisions : %G eng %U http://hdl.handle.net/21.11116/0000-0002-AA7B-5 %R 10.4230/LIPIcs.ISAAC.2018.51 %U urn:nbn:de:0030-drops-99991 %D 2018 %B 29th International Symposium on Algorithms and Computation %Z date of event: 2018-12-16 - 2018-12-19 %C Jiaoxi, Yilan, Taiwan %B 29th International Symposium on Algorithms and Computation %E Hsu, Wen-Lian; Lee, Der-Tsai; Liao, Chung-Shou %P 1 - 12 %Z sequence number: 51 %I Schloss Dagstuhl %@ 978-3-95977-094-1 %B Leibniz International Proceedings in Informatics %N 123 %@ false %U http://drops.dagstuhl.de/opus/volltexte/2018/9999/http://drops.dagstuhl.de/doku/urheberrecht1.html
[162]
E. Oh and H.-K. Ahn, “Point Location in Dynamic Planar Subdivisions,” in 34th International Symposium on Computational Geometry (SoCG 2018), Budapest, Hungary, 2018.
Export
BibTeX
@inproceedings{Oh_SoCG2018b, TITLE = {Point Location in Dynamic Planar Subdivisions}, AUTHOR = {Oh, Eunjin and Ahn, Hee-Kap}, LANGUAGE = {eng}, ISBN = {978-3-95977-066-8}, URL = {urn:nbn:de:0030-drops-87769}, DOI = {10.4230/LIPIcs.SoCG.2018.63}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {34th International Symposium on Computational Geometry (SoCG 2018)}, EDITOR = {Speckmann, Bettina and T{\'o}th, Csaba D.}, PAGES = {1--14}, EID = {63}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {99}, ADDRESS = {Budapest, Hungary}, }
Endnote
%0 Conference Proceedings %A Oh, Eunjin %A Ahn, Hee-Kap %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Point Location in Dynamic Planar Subdivisions : %G eng %U http://hdl.handle.net/21.11116/0000-0002-AA86-7 %R 10.4230/LIPIcs.SoCG.2018.63 %U urn:nbn:de:0030-drops-87769 %D 2018 %B 34th International Symposium on Computational Geometry %Z date of event: 2018-06-11 - 2018-06-14 %C Budapest, Hungary %B 34th International Symposium on Computational Geometry %E Speckmann, Bettina; T&#243;th, Csaba D. %P 1 - 14 %Z sequence number: 63 %I Schloss Dagstuhl %@ 978-3-95977-066-8 %B Leibniz International Proceedings in Informatics %N 99 %U http://drops.dagstuhl.de/opus/volltexte/2018/8776/http://drops.dagstuhl.de/doku/urheberrecht1.html
[163]
E. Oh, “Minimizing Distance-to-Sight in Polygonal Domains,” in 29th International Symposium on Algorithms and Computation (ISAAC 2018), Jiaoxi, Yilan, Taiwan, 2018.
Export
BibTeX
@inproceedings{Oh_ISAAC2018b, TITLE = {Minimizing Distance-to-Sight in Polygonal Domains}, AUTHOR = {Oh, Eunjin}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-094-1}, URL = {urn:nbn:de:0030-drops-100073}, DOI = {10.4230/LIPIcs.ISAAC.2018.59}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, EDITOR = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, PAGES = {1--12}, EID = {59}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {123}, ADDRESS = {Jiaoxi, Yilan, Taiwan}, }
Endnote
%0 Conference Proceedings %A Oh, Eunjin %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Minimizing Distance-to-Sight in Polygonal Domains : %G eng %U http://hdl.handle.net/21.11116/0000-0002-AA7D-3 %R 10.4230/LIPIcs.ISAAC.2018.59 %U urn:nbn:de:0030-drops-100073 %D 2018 %B 29th International Symposium on Algorithms and Computation %Z date of event: 2018-12-16 - 2018-12-19 %C Jiaoxi, Yilan, Taiwan %B 29th International Symposium on Algorithms and Computation %E Hsu, Wen-Lian; Lee, Der-Tsai; Liao, Chung-Shou %P 1 - 12 %Z sequence number: 59 %I Schloss Dagstuhl %@ 978-3-95977-094-1 %B Leibniz International Proceedings in Informatics %N 123 %@ false %U http://drops.dagstuhl.de/opus/volltexte/2018/10007/http://drops.dagstuhl.de/doku/urheberrecht1.html
[164]
E. Oh and H.-K. Ahn, “Approximate Range Queries for Clustering,” in 34th International Symposium on Computational Geometry (SoCG 2018), Budapest, Hungary, 2018.
Export
BibTeX
@inproceedings{Oh_SoCG2018, TITLE = {Approximate Range Queries for Clustering}, AUTHOR = {Oh, Eunjin and Ahn, Hee-Kap}, LANGUAGE = {eng}, ISBN = {978-3-95977-066-8}, URL = {urn:nbn:de:0030-drops-87755}, DOI = {10.4230/LIPIcs.SoCG.2018.62}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {34th International Symposium on Computational Geometry (SoCG 2018)}, EDITOR = {Speckmann, Bettina and T{\'o}th, Csaba D.}, PAGES = {1--14}, EID = {62}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {99}, ADDRESS = {Budapest, Hungary}, }
Endnote
%0 Conference Proceedings %A Oh, Eunjin %A Ahn, Hee-Kap %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Approximate Range Queries for Clustering : %G eng %U http://hdl.handle.net/21.11116/0000-0002-AA83-A %R 10.4230/LIPIcs.SoCG.2018.62 %U urn:nbn:de:0030-drops-87755 %D 2018 %B 34th International Symposium on Computational Geometry %Z date of event: 2018-06-11 - 2018-06-14 %C Budapest, Hungary %B 34th International Symposium on Computational Geometry %E Speckmann, Bettina; T&#243;th, Csaba D. %P 1 - 14 %Z sequence number: 62 %I Schloss Dagstuhl %@ 978-3-95977-066-8 %B Leibniz International Proceedings in Informatics %N 99 %U http://drops.dagstuhl.de/opus/volltexte/2018/8775/http://drops.dagstuhl.de/doku/urheberrecht1.html
[165]
N. Olver, K. Pruhs, K. Schewior, R. Sitters, and L. Stougie, “The Itinerant List Update Problem,” in Approximation and Online Algorithms (WAOA 2018), Helsiniki, Finland, 2018.
Export
BibTeX
@inproceedings{Olver_WAOA2018, TITLE = {The Itinerant List Update Problem}, AUTHOR = {Olver, Neil and Pruhs, Kirk and Schewior, Kevin and Sitters, Rene and Stougie, Leen}, LANGUAGE = {eng}, ISBN = {978-3-030-04692-7}, PUBLISHER = {Springer}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, BOOKTITLE = {Approximation and Online Algorithms (WAOA 2018)}, EDITOR = {Epstein, Leah and Erlebach, Thomas}, PAGES = {310--326}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {11312}, ADDRESS = {Helsiniki, Finland}, }
Endnote
%0 Conference Proceedings %A Olver, Neil %A Pruhs, Kirk %A Schewior, Kevin %A Sitters, Rene %A Stougie, Leen %+ 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 Itinerant List Update Problem : %G eng %U http://hdl.handle.net/21.11116/0000-0002-F4BA-9 %D 2018 %B 16th Workshop on Approximation and Online Algorithms %Z date of event: 2018-08-23 - 2018-08-24 %C Helsiniki, Finland %B Approximation and Online Algorithms %E Epstein, Leah; Erlebach, Thomas %P 310 - 326 %I Springer %@ 978-3-030-04692-7 %B Lecture Notes in Computer Science %N 11312
[166]
A. Oulasvirta and A. Karrenbauer, “Combinatorial Optimization for UI Design,” in Computational Interaction, Oxford, UK: Oxford University Press, 2018.
Export
BibTeX
@incollection{Oulasvirta2018OUP, TITLE = {Combinatorial Optimization for {UI} Design}, AUTHOR = {Oulasvirta, Antti and Karrenbauer, Andreas}, LANGUAGE = {eng}, ISBN = {9780198799610}, PUBLISHER = {Oxford University Press}, ADDRESS = {Oxford, UK}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, BOOKTITLE = {Computational Interaction}, EDITOR = {Oulasvirta, Antti and Kristensson, Per Ola and Bi, Xiaojun and Howes, Andrew}, PAGES = {97--120}, }
Endnote
%0 Book Section %A Oulasvirta, Antti %A Karrenbauer, Andreas %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Combinatorial Optimization for UI Design : %G eng %U http://hdl.handle.net/21.11116/0000-0002-AA65-D %D 2018 %B Computational Interaction %E Oulasvirta, Antti; Kristensson, Per Ola; Bi, Xiaojun; Howes, Andrew %P 97 - 120 %I Oxford University Press %C Oxford, UK %@ 9780198799610
[167]
A. Pandey, N. Saxena, and A. Sinhababu, “Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits,” Computational Complexity, vol. 27, no. 4, 2018.
Export
BibTeX
@article{Pandey2018, TITLE = {Algebraic Independence over Positive Characteristic: {N}ew Criterion and Applications to Locally Low Algebraic Rank Circuits}, AUTHOR = {Pandey, Anurag and Saxena, Nitin and Sinhababu, Amit}, LANGUAGE = {eng}, ISSN = {1016-3328}, DOI = {10.1007/s00037-018-0167-5}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, JOURNAL = {Computational Complexity}, VOLUME = {27}, NUMBER = {4}, PAGES = {617--670}, }
Endnote
%0 Journal Article %A Pandey, Anurag %A Saxena, Nitin %A Sinhababu, Amit %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits : %G eng %U http://hdl.handle.net/21.11116/0000-0002-F6EF-C %R 10.1007/s00037-018-0167-5 %7 2018 %D 2018 %J Computational Complexity %V 27 %N 4 %& 617 %P 617 - 670 %I Springer %C New York, NY %@ false
[168]
M. Pilipczuk, M. Pilipczuk, P. Sankowski, and E. J. van Leeuwen, “Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs,” ACM Transactions on Algorithms, vol. 14, no. 4, 2018.
Export
BibTeX
@article{PilipzukTOA2018, TITLE = {Network Sparsification for {Steiner} Problems on Planar and Bounded-Genus Graphs}, AUTHOR = {Pilipczuk, Marcin and Pilipczuk, Micha{\l} and Sankowski, Piotr and van Leeuwen, Erik Jan}, LANGUAGE = {eng}, ISSN = {1549-6325}, DOI = {10.1145/3239560}, PUBLISHER = {ACM}, ADDRESS = {New York, NY}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, JOURNAL = {ACM Transactions on Algorithms}, VOLUME = {14}, NUMBER = {4}, EID = {53}, }
Endnote
%0 Journal Article %A Pilipczuk, Marcin %A Pilipczuk, Micha&#322; %A Sankowski, Piotr %A van Leeuwen, Erik Jan %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs : %G eng %U http://hdl.handle.net/21.11116/0000-0002-F70C-B %R 10.1145/3239560 %7 2018 %D 2018 %J ACM Transactions on Algorithms %V 14 %N 4 %Z sequence number: 53 %I ACM %C New York, NY %@ false
[169]
B. Ray Chaudhury, Y. K. Cheung, J. Garg, N. Garg, M. Hoefer, and K. Mehlhorn, “On Fair Division of Indivisible Items,” 2018. [Online]. Available: http://arxiv.org/abs/1805.06232. (arXiv: 1805.06232)
Abstract
We consider the task of assigning indivisible goods to a set of agents in a fair manner. Our notion of fairness is Nash social welfare, i.e., the goal is to maximize the geometric mean of the utilities of the agents. Each good comes in multiple items or copies, and the utility of an agent diminishes as it receives more items of the same good. The utility of a bundle of items for an agent is the sum of the utilities of the items in the bundle. Each agent has a utility cap beyond which he does not value additional items. We give a polynomial time approximation algorithm that maximizes Nash social welfare up to a factor of $e^{1/e} \approx 1.445$.
Export
BibTeX
@online{Chaudhury_arXiv1805.06232, TITLE = {On Fair Division of Indivisible Items}, AUTHOR = {Ray Chaudhury, Bhaskar and Cheung, Yun Kuen and Garg, Jugal and Garg, Naveen and Hoefer, Martin and Mehlhorn, Kurt}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1805.06232}, EPRINT = {1805.06232}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We consider the task of assigning indivisible goods to a set of agents in a fair manner. Our notion of fairness is Nash social welfare, i.e., the goal is to maximize the geometric mean of the utilities of the agents. Each good comes in multiple items or copies, and the utility of an agent diminishes as it receives more items of the same good. The utility of a bundle of items for an agent is the sum of the utilities of the items in the bundle. Each agent has a utility cap beyond which he does not value additional items. We give a polynomial time approximation algorithm that maximizes Nash social welfare up to a factor of $e^{1/e} \approx 1.445$.}, }
Endnote
%0 Report %A Ray Chaudhury, Bhaskar %A Cheung, Yun Kuen %A Garg, Jugal %A Garg, Naveen %A Hoefer, Martin %A Mehlhorn, Kurt %+ 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 Algorithms and Complexity, MPI for Informatics, Max Planck Society %T On Fair Division of Indivisible Items : %G eng %U http://hdl.handle.net/21.11116/0000-0002-05E7-4 %U http://arxiv.org/abs/1805.06232 %D 2018 %X We consider the task of assigning indivisible goods to a set of agents in a fair manner. Our notion of fairness is Nash social welfare, i.e., the goal is to maximize the geometric mean of the utilities of the agents. Each good comes in multiple items or copies, and the utility of an agent diminishes as it receives more items of the same good. The utility of a bundle of items for an agent is the sum of the utilities of the items in the bundle. Each agent has a utility cap beyond which he does not value additional items. We give a polynomial time approximation algorithm that maximizes Nash social welfare up to a factor of $e^{1/e} \approx 1.445$. %K Computer Science, Data Structures and Algorithms, cs.DS
[170]
B. Ray Chaudhury and K. Mehlhorn, “Combinatorial Algorithms for General Linear Arrow-Debreu Markets,” 2018. [Online]. Available: http://arxiv.org/abs/1810.01237. (arXiv: 1810.01237)
Abstract
We present a combinatorial algorithm for determining the market clearing prices of a general linear Arrow-Debreu market, where every agent can own multiple goods. The existing combinatorial algorithms for linear Arrow-Debreu markets consider the case where each agent can own all of one good only. We present an $\tilde{\mathcal{O}}((n+m)^7 \log^3(UW))$ algorithm where $n$, $m$, $U$ and $W$ refer to the number of agents, the number of goods, the maximal integral utility and the maximum quantity of any good in the market respectively. The algorithm refines the iterative algorithm of Duan, Garg and Mehlhorn using several new ideas. We also identify the hard instances for existing combinatorial algorithms for linear Arrow-Debreu markets. In particular we find instances where the ratio of the maximum to the minimum equilibrium price of a good is $U^{\Omega(n)}$ and the number of iterations required by the existing iterative combinatorial algorithms of Duan, and Mehlhorn and Duan, Garg, and Mehlhorn are high. Our instances also separate the two algorithms.
Export
BibTeX
@online{RayChaudhury_arxiv1810.01237, TITLE = {Combinatorial Algorithms for General Linear {Arrow}-{Debreu} Markets}, AUTHOR = {Ray Chaudhury, Bhaskar and Mehlhorn, Kurt}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1810.01237}, EPRINT = {1810.01237}, EPRINTTYPE = {arXiv}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We present a combinatorial algorithm for determining the market clearing prices of a general linear Arrow-Debreu market, where every agent can own multiple goods. The existing combinatorial algorithms for linear Arrow-Debreu markets consider the case where each agent can own all of one good only. We present an $\tilde{\mathcal{O}}((n+m)^7 \log^3(UW))$ algorithm where $n$, $m$, $U$ and $W$ refer to the number of agents, the number of goods, the maximal integral utility and the maximum quantity of any good in the market respectively. The algorithm refines the iterative algorithm of Duan, Garg and Mehlhorn using several new ideas. We also identify the hard instances for existing combinatorial algorithms for linear Arrow-Debreu markets. In particular we find instances where the ratio of the maximum to the minimum equilibrium price of a good is $U^{\Omega(n)}$ and the number of iterations required by the existing iterative combinatorial algorithms of Duan, and Mehlhorn and Duan, Garg, and Mehlhorn are high. Our instances also separate the two algorithms.}, }
Endnote
%0 Report %A Ray Chaudhury, Bhaskar %A Mehlhorn, Kurt %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Combinatorial Algorithms for General Linear Arrow-Debreu Markets : %G eng %U http://hdl.handle.net/21.11116/0000-0002-57B5-0 %U http://arxiv.org/abs/1810.01237 %D 2018 %8 02.10.2018 %X We present a combinatorial algorithm for determining the market clearing prices of a general linear Arrow-Debreu market, where every agent can own multiple goods. The existing combinatorial algorithms for linear Arrow-Debreu markets consider the case where each agent can own all of one good only. We present an $\tilde{\mathcal{O}}((n+m)^7 \log^3(UW))$ algorithm where $n$, $m$, $U$ and $W$ refer to the number of agents, the number of goods, the maximal integral utility and the maximum quantity of any good in the market respectively. The algorithm refines the iterative algorithm of Duan, Garg and Mehlhorn using several new ideas. We also identify the hard instances for existing combinatorial algorithms for linear Arrow-Debreu markets. In particular we find instances where the ratio of the maximum to the minimum equilibrium price of a good is $U^{\Omega(n)}$ and the number of iterations required by the existing iterative combinatorial algorithms of Duan, and Mehlhorn and Duan, Garg, and Mehlhorn are high. Our instances also separate the two algorithms. %K Computer Science, Computer Science and Game Theory, cs.GT,
[171]
B. Ray Chaudhury, Y. K. Cheung, J. Garg, N. Garg, M. Hoefer, and K. Mehlhorn, “On Fair Division for Indivisible Items,” in 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018), Ahmedabad, India, 2018.
Export
BibTeX
@inproceedings{Chaudhury_FSTTCS2018b, TITLE = {On Fair Division for Indivisible Items}, AUTHOR = {Ray Chaudhury, Bhaskar and Cheung, Yun Kuen and Garg, Jugal and Garg, Naveen and Hoefer, Martin and Mehlhorn, Kurt}, LANGUAGE = {eng}, ISSN = {1868-896}, ISBN = {978-3-95977-093-4}, URL = {urn:nbn:de:0030-drops-99242}, DOI = {10.4230/LIPIcs.FSTTCS.2018.25}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)}, EDITOR = {Ganguly, Sumit and Pandya, Paritosh}, PAGES = {1--17}, EID = {25}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {122}, ADDRESS = {Ahmedabad, India}, }
Endnote
%0 Conference Proceedings %A Ray Chaudhury, Bhaskar %A Cheung, Yun Kuen %A Garg, Jugal %A Garg, Naveen %A Hoefer, Martin %A Mehlhorn, Kurt %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T On Fair Division for Indivisible Items : %G eng %U http://hdl.handle.net/21.11116/0000-0002-AAE1-0 %R 10.4230/LIPIcs.FSTTCS.2018.25 %U urn:nbn:de:0030-drops-99242 %D 2018 %B 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science %Z date of event: 2018-12-11 - 2018-12-13 %C Ahmedabad, India %B 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science %E Ganguly, Sumit; Pandya, Paritosh %P 1 - 17 %Z sequence number: 25 %I Schloss Dagstuhl %@ 978-3-95977-093-4 %B Leibniz International Proceedings in Informatics %N 122 %@ false %U http://drops.dagstuhl.de/opus/volltexte/2018/9924/http://drops.dagstuhl.de/doku/urheberrecht1.html
[172]
B. Ray Chaudhury and K. Mehlhorn, “Combinatorial Algorithms for General Linear Arrow-Debreu Markets,” in 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018), Ahmedabad, India, 2018.
Export
BibTeX
@inproceedings{Chaudhury_FSTTCS2018, TITLE = {Combinatorial Algorithms for General Linear {A}rrow-{D}ebreu Markets}, AUTHOR = {Ray Chaudhury, Bhaskar and Mehlhorn, Kurt}, LANGUAGE = {eng}, ISSN = {1868-896}, ISBN = {978-3-95977-093-4}, URL = {urn:nbn:de:0030-drops-99255}, DOI = {10.4230/LIPIcs.FSTTCS.2018.26}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)}, EDITOR = {Ganguly, Sumit and Pandya, Paritosh}, PAGES = {1--16}, EID = {26}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {122}, ADDRESS = {Ahmedabad, India}, }
Endnote
%0 Conference Proceedings %A Ray Chaudhury, Bhaskar %A Mehlhorn, Kurt %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Combinatorial Algorithms for General Linear Arrow-Debreu Markets : %G eng %U http://hdl.handle.net/21.11116/0000-0002-AADC-7 %R 10.4230/LIPIcs.FSTTCS.2018.26 %U urn:nbn:de:0030-drops-99255 %D 2018 %B 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science %Z date of event: 2018-12-11 - 2018-12-13 %C Ahmedabad, India %B 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science %E Ganguly, Sumit; Pandya, Paritosh %P 1 - 16 %Z sequence number: 26 %I Schloss Dagstuhl %@ 978-3-95977-093-4 %B Leibniz International Proceedings in Informatics %N 122 %@ false %U http://drops.dagstuhl.de/opus/volltexte/2018/9925/http://drops.dagstuhl.de/doku/urheberrecht1.html
[173]
A. Schmid and J. M. Schmidt, “Computing 2-Walks in Polynomial Time,” ACM Transactions on Algorithms, vol. 14, no. 2, 2018.
Export
BibTeX
@article{Schmid2018, TITLE = {Computing 2-Walks in Polynomial Time}, AUTHOR = {Schmid, Andreas and Schmidt, Jens M.}, LANGUAGE = {eng}, ISSN = {1549-6325}, DOI = {10.1145/3183368}, PUBLISHER = {ACM}, ADDRESS = {New York, NY}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, JOURNAL = {ACM Transactions on Algorithms}, VOLUME = {14}, NUMBER = {2}, EID = {22}, }
Endnote
%0 Journal Article %A Schmid, Andreas %A Schmidt, Jens M. %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Computing 2-Walks in Polynomial Time : %G eng %U http://hdl.handle.net/21.11116/0000-0001-949E-6 %R 10.1145/3183368 %7 2018 %D 2018 %J ACM Transactions on Algorithms %V 14 %N 2 %Z sequence number: 22 %I ACM %C New York, NY %@ false
[174]
A. Schmid and J. M. Schmidt, “Computing Tutte Paths,” in 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Prague, Czech Republic, 2018.
Export
BibTeX
@inproceedings{Schmid_ICALP2018, TITLE = {Computing {T}utte Paths}, AUTHOR = {Schmid, Andreas and Schmidt, Jens M.}, LANGUAGE = {eng}, ISBN = {978-3-95977-076-7}, URL = {urn:nbn:de:0030-drops-91029}, DOI = {10.4230/LIPIcs.ICALP.2018.98}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, EDITOR = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D{\'a}niel and Sannella, Donald}, PAGES = {1--14}, EID = {98}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {107}, ADDRESS = {Prague, Czech Republic}, }
Endnote
%0 Conference Proceedings %A Schmid, Andreas %A Schmidt, Jens M. %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Computing Tutte Paths : %G eng %U http://hdl.handle.net/21.11116/0000-0002-AB32-5 %R 10.4230/LIPIcs.ICALP.2018.98 %U urn:nbn:de:0030-drops-91029 %D 2018 %B 45th International Colloquium on Automata, Languages, and Programming %Z date of event: 2018-07-09 - 2018-07-13 %C Prague, Czech Republic %B 45th International Colloquium on Automata, Languages, and Programming %E Chatzigiannakis, Ioannis; Kaklamanis, Christos; Marx, D&#225;niel; Sannella, Donald %P 1 - 14 %Z sequence number: 98 %I Schloss Dagstuhl %@ 978-3-95977-076-7 %B Leibniz International Proceedings in Informatics %N 107 %U http://drops.dagstuhl.de/opus/volltexte/2018/9102/http://drops.dagstuhl.de/doku/urheberrecht1.html
[175]
A. Wiese, “Independent Set of Convex Polygons: From nϵ to 1+ϵ via Shrinking,” Algorithmica, vol. 80, no. 3, 2018.
Export
BibTeX
@article{Wiese2017, TITLE = {Independent Set of Convex Polygons: From $n^{\epsilon}$ to 1+$\epsilon$ via Shrinking}, AUTHOR = {Wiese, Andreas}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-017-0347-8}, PUBLISHER = {Springer-Verlag}, ADDRESS = {New York}, YEAR = {2018}, MARGINALMARK = {$\bullet$}, DATE = {2018}, JOURNAL = {Algorithmica}, VOLUME = {80}, NUMBER = {3}, PAGES = {918--934}, }
Endnote
%0 Journal Article %A Wiese, Andreas %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Independent Set of Convex Polygons: From n&#1013; to 1+&#1013; via Shrinking : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-2602-4 %R 10.1007/s00453-017-0347-8 %7 2017 %D 2018 %J Algorithmica %V 80 %N 3 %& 918 %P 918 - 934 %I Springer-Verlag %C New York %@ false
2017
[176]
A. Abboud, A. Backurs, K. Bringmann, and M. Künnemann, “Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-And-Solve,” in 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017), Berkeley, CA, USA, 2017.
Export
BibTeX
@inproceedings{Abboud_FOCS2017, TITLE = {Fine-Grained Complexity of Analyzing Compressed Data: {Q}uantifying Improvements over Decompress-And-Solve}, AUTHOR = {Abboud, Amir and Backurs, Arturs and Bringmann, Karl and K{\"u}nnemann, Marvin}, LANGUAGE = {eng}, ISBN = {978-1-5386-3464-6}, DOI = {10.1109/FOCS.2017.26}, PUBLISHER = {IEEE}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {58th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017)}, PAGES = {192--203}, ADDRESS = {Berkeley, CA, USA}, }
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 Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-And-Solve : %G eng %U http://hdl.handle.net/21.11116/0000-0000-0475-8 %R 10.1109/FOCS.2017.26 %D 2017 %B 58th Annual IEEE Symposium on Foundations of Computer Science %Z date of event: 2017-10-15 - 2017-10-17 %C Berkeley, CA, USA %B 58th Annual IEEE Symposium on Foundations of Computer Science %P 192 - 203 %I IEEE %@ 978-1-5386-3464-6
[177]
I. Abraham, S. Chechik, and S. Krinninger, “Fully Dynamic All-Pairs Shortest Paths with Worst-Case Update-Time Revisited,” in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), Barcelona, Spain, 2017.
Export
BibTeX
@inproceedings{AbrahamCK17, TITLE = {Fully Dynamic All-Pairs Shortest Paths with Worst-Case Update-Time Revisited}, AUTHOR = {Abraham, Ittai and Chechik, Shiri and Krinninger, Sebastian}, LANGUAGE = {eng}, ISBN = {978-1-61197-478-2}, DOI = {10.1137/1.9781611974782.28}, PUBLISHER = {SIAM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017)}, EDITOR = {Klein, Philip N.}, PAGES = {440--452}, ADDRESS = {Barcelona, Spain}, }
Endnote
%0 Conference Proceedings %A Abraham, Ittai %A Chechik, Shiri %A Krinninger, Sebastian %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Fully Dynamic All-Pairs Shortest Paths with Worst-Case Update-Time Revisited : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-52D0-1 %R 10.1137/1.9781611974782.28 %D 2017 %B Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2017-01-16 - 2017-01-19 %C Barcelona, Spain %B Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms %E Klein, Philip N. %P 440 - 452 %I SIAM %@ 978-1-61197-478-2
[178]
A. Adamaszek, M. P. Renault, A. Rosen, and R. van Stee, “Reordering Buffer Management with Advice,” Journal of Scheduling, vol. 20, no. 5, 2017.
Export
BibTeX
@article{Adamaszek2017, TITLE = {Reordering Buffer Management with Advice}, AUTHOR = {Adamaszek, Anna and Renault, Marc P. and Rosen, Adi and van Stee, Rob}, LANGUAGE = {eng}, ISSN = {1094-6136}, DOI = {10.1007/s10951-016-0487-8}, PUBLISHER = {Wiley}, ADDRESS = {New York, NY}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, JOURNAL = {Journal of Scheduling}, VOLUME = {20}, NUMBER = {5}, PAGES = {423--442}, }
Endnote
%0 Journal Article %A Adamaszek, Anna %A Renault, Marc P. %A Rosen, Adi %A van Stee, Rob %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Reordering Buffer Management with Advice : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-0E60-C %R 10.1007/s10951-016-0487-8 %7 2016-06-17 %D 2017 %J Journal of Scheduling %V 20 %N 5 %& 423 %P 423 - 442 %I Wiley %C New York, NY %@ false
[179]
N. Alon, S. Moran, and A. Yehudayoff, “Sign Rank versus Vapnik-Chervonenkis Dimension,” Sbornik: Mathematics, vol. 208, no. 12, 2017.
Export
BibTeX
@article{Alon2017, TITLE = {Sign Rank versus {V}apnik-{C}hervonenkis Dimension}, AUTHOR = {Alon, Noga and Moran, Shay and Yehudayoff, Amir}, LANGUAGE = {eng}, ISSN = {1064-5616}, DOI = {10.1070/SM8780}, PUBLISHER = {Mathematical Society, Turpion Ltd.}, ADDRESS = {London}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, JOURNAL = {Sbornik: Mathematics}, VOLUME = {208}, NUMBER = {12}, PAGES = {1724--1757}, }
Endnote
%0 Journal Article %A Alon, Noga %A Moran, Shay %A Yehudayoff, Amir %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Sign Rank versus Vapnik-Chervonenkis Dimension : %G eng %U http://hdl.handle.net/21.11116/0000-0000-C8D2-1 %R 10.1070/SM8780 %7 2017 %D 2017 %J Sbornik: Mathematics %O Sb. Math. %V 208 %N 12 %& 1724 %P 1724 - 1757 %I Mathematical Society, Turpion Ltd. %C London %@ false
[180]
E. Althaus, B. Beber, W. Damm, S. Disch, W. Hagemann, A. Rakow, C. Scholl, U. Waldmann, and B. Wirtz, “Verification of Linear Hybrid Systems with Large Discrete State Spaces Using Counterexample-guided Abstraction Refinement,” Science of Computer Programming, vol. 148, 2017.
Export
BibTeX
@article{Althaus2017, TITLE = {Verification of Linear Hybrid Systems with Large Discrete State Spaces Using Counterexample-guided Abstraction Refinement}, AUTHOR = {Althaus, Ernst and Beber, Bj{\"o}rn and Damm, Werner and Disch, Stefan and Hagemann, Willem and Rakow, Astrid and Scholl, Christoph and Waldmann, Uwe and Wirtz, Boris}, LANGUAGE = {eng}, ISSN = {0167-6423}, DOI = {10.1016/j.scico.2017.04.010}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, JOURNAL = {Science of Computer Programming}, VOLUME = {148}, PAGES = {123--160}, }
Endnote
%0 Journal Article %A Althaus, Ernst %A Beber, Bj&#246;rn %A Damm, Werner %A Disch, Stefan %A Hagemann, Willem %A Rakow, Astrid %A Scholl, Christoph %A Waldmann, Uwe %A Wirtz, Boris %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations Automation of Logic, MPI for Informatics, Max Planck Society External Organizations External Organizations Automation of Logic, MPI for Informatics, Max Planck Society External Organizations %T Verification of Linear Hybrid Systems with Large Discrete State Spaces Using Counterexample-guided Abstraction Refinement : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-1C23-5 %R 10.1016/j.scico.2017.04.010 %7 2017-05-10 %D 2017 %J Science of Computer Programming %V 148 %& 123 %P 123 - 160 %I Elsevier %C Amsterdam %@ false
[181]
S. Anand, K. Bringmann, T. Friedrich, N. Garg, and A. Kumar, “Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines,” Algorithmica, vol. 77, no. 2, 2017.
Export
BibTeX
@article{DBLP:journals/algorithmica/0002B0G017, TITLE = {Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines}, AUTHOR = {Anand, S. and Bringmann, Karl and Friedrich, Tobias and Garg, Naveen and Kumar, Amit}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-015-0082-y}, PUBLISHER = {Springer-Verlag}, ADDRESS = {New York, NY}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, JOURNAL = {Algorithmica}, VOLUME = {77}, NUMBER = {2}, PAGES = {515--536}, }
Endnote
%0 Journal Article %A Anand, S. %A Bringmann, Karl %A Friedrich, Tobias %A Garg, Naveen %A Kumar, Amit %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Discrete Optimization, 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 Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-5527-9 %R 10.1007/s00453-015-0082-y %7 2015 %D 2017 %J Algorithmica %V 77 %N 2 %& 515 %P 515 - 536 %I Springer-Verlag %C New York, NY %@ false
[182]
A. Antoniadis, P. Kling, S. Ott, and S. Riechers, “Continuous Speed Scaling with Variability: A simple and Direct Approach,” Theoretical Computer Science, vol. 678, 2017.
Export
BibTeX
@article{Antoniadis2017, TITLE = {Continuous Speed Scaling with Variability: {A} simple and Direct Approach}, AUTHOR = {Antoniadis, Antonios and Kling, Peter and Ott, Sebastian and Riechers, S{\"o}ren}, LANGUAGE = {eng}, ISSN = {0304-3975}, DOI = {10.1016/j.tcs.2017.03.021}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, JOURNAL = {Theoretical Computer Science}, VOLUME = {678}, PAGES = {1--13}, }
Endnote
%0 Journal Article %A Antoniadis, Antonios %A Kling, Peter %A Ott, Sebastian %A Riechers, S&#246;ren %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Continuous Speed Scaling with Variability: A simple and Direct Approach : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-7857-F %R 10.1016/j.tcs.2017.03.021 %7 2017 %D 2017 %J Theoretical Computer Science %V 678 %& 1 %P 1 - 13 %I Elsevier %C Amsterdam %@ false
[183]
A. Antoniadis, N. Barcelo, M. Consuegra, P. Kling, M. Nugent, K. Pruhs, and M. Scquizzato, “Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-Off Schedules,” Algorithmica, vol. 79, no. 2, 2017.
Export
BibTeX
@article{Antoniadis2016, TITLE = {Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-Off Schedules}, AUTHOR = {Antoniadis, Antonios and Barcelo, Neal and Consuegra, Mario and Kling, Peter and Nugent, Michael and Pruhs, Kirk and Scquizzato, Michele}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-016-0208-x}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, JOURNAL = {Algorithmica}, VOLUME = {79}, NUMBER = {2}, PAGES = {568--597}, }
Endnote
%0 Journal Article %A Antoniadis, Antonios %A Barcelo, Neal %A Consuegra, Mario %A Kling, Peter %A Nugent, Michael %A Pruhs, Kirk %A Scquizzato, Michele %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations External Organizations External Organizations %T Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-Off Schedules : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-58AA-7 %R 10.1007/s00453-016-0208-x %7 2016-08-31 %D 2017 %J Algorithmica %V 79 %N 2 %& 568 %P 568 - 597 %I Springer %C New York, NY %@ false
[184]
A. Antoniadis, R. Hoeksma, J. Meißner, J. Verschae, and A. Wiese, “A QPTAS for the General Scheduling Problem with Identical Release Dates,” in 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Warsaw, Poland, 2017.
Export
BibTeX
@inproceedings{Antoniadis_ICALP2017, TITLE = {A {QPTAS} for the General Scheduling Problem with Identical Release Dates}, AUTHOR = {Antoniadis, Antonios and Hoeksma, Ruben and Mei{\ss}ner, Julie and Verschae, Jos{\'e} and Wiese, Andreas}, LANGUAGE = {eng}, ISBN = {978-3-95977-041-5}, URL = {urn:nbn:de:0030-drops-74575}, DOI = {10.4230/LIPIcs.ICALP.2017.31}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, EDITOR = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca}, PAGES = {1--14}, EID = {31}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {80}, ADDRESS = {Warsaw, Poland}, }
Endnote
%0 Conference Proceedings %A Antoniadis, Antonios %A Hoeksma, Ruben %A Mei&#223;ner, Julie %A Verschae, Jos&#233; %A Wiese, Andreas %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A QPTAS for the General Scheduling Problem with Identical Release Dates : %G eng %U http://hdl.handle.net/21.11116/0000-0002-9F4A-9 %R 10.4230/LIPIcs.ICALP.2017.31 %U urn:nbn:de:0030-drops-74575 %D 2017 %B 44th International Colloquium on Automata, Languages, and Programming %Z date of event: 2017-07-10 - 2017-07-14 %C Warsaw, Poland %B 44th International Colloquium on Automata, Languages, and Programming %E Chatzigiannakis, Ioannis; Indyk, Piotr; Kuhn, Fabian; Muscholl, Anca %P 1 - 14 %Z sequence number: 31 %I Schloss Dagstuhl %@ 978-3-95977-041-5 %B Leibniz International Proceedings in Informatics %N 80 %U http://drops.dagstuhl.de/opus/volltexte/2017/7457/http://drops.dagstuhl.de/doku/urheberrecht1.html
[185]
Y. Azar, M. Hoefer, I. Maor, R. Reiffenhäuser, and B. Vöcking, “Truthful Mechanism Design via Correlated Tree Rounding,” Mathematical Programming / A, vol. 163, no. 1–2, 2017.
Export
BibTeX
@article{Azar2017, TITLE = {Truthful Mechanism Design via Correlated Tree Rounding}, AUTHOR = {Azar, Yossi and Hoefer, Martin and Maor, Idan and Reiffenh{\"a}user, Rebecca and V{\"o}cking, Berthold}, LANGUAGE = {eng}, ISSN = {0025-5610}, DOI = {10.1007/s10107-016-1068-5}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, JOURNAL = {Mathematical Programming / A}, VOLUME = {163}, NUMBER = {1-2}, PAGES = {445--469}, }
Endnote
%0 Journal Article %A Azar, Yossi %A Hoefer, Martin %A Maor, Idan %A Reiffenh&#228;user, Rebecca %A V&#246;cking, Berthold %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Truthful Mechanism Design via Correlated Tree Rounding : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-326B-A %R 10.1007/s10107-016-1068-5 %7 2016-09-10 %D 2017 %J Mathematical Programming / A %V 163 %N 1-2 %& 445 %P 445 - 469 %I Springer %C New York, NY %@ false
[186]
J. Baldus and K. Bringmann, “A Fast Implementation of Near Neighbors Queries for Fréchet Distance (GIS Cup),” in 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (GIS 2017), Redondo Beach, CA, USA, 2017.
Export
BibTeX
@inproceedings{Baldus_SIGSPATIAL2017, TITLE = {A Fast Implementation of Near Neighbors Queries for {F}r\'{e}chet Distance ({GIS Cup})}, AUTHOR = {Baldus, Julian and Bringmann, Karl}, LANGUAGE = {eng}, ISBN = {978-1-4503-5490-5}, DOI = {10.1145/3139958.3140062}, PUBLISHER = {ACM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (GIS 2017)}, EDITOR = {Hoel, Erik and Newsman, Shawn and Ravada, Siva and Tamassia, Roberto and Trjacevski, Goce}, EID = {99}, ADDRESS = {Redondo Beach, CA, USA}, }
Endnote
%0 Conference Proceedings %A Baldus, Julian %A Bringmann, Karl %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Fast Implementation of Near Neighbors Queries for Fr&#233;chet Distance (GIS Cup) : %G eng %U http://hdl.handle.net/21.11116/0000-0001-3E17-1 %R 10.1145/3139958.3140062 %D 2017 %B 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems %Z date of event: 2017-11-07 - 2017-11-10 %C Redondo Beach, CA, USA %B 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems %E Hoel, Erik; Newsman, Shawn; Ravada, Siva; Tamassia, Roberto; Trjacevski, Goce %Z sequence number: 99 %I ACM %@ 978-1-4503-5490-5
[187]
L. Becchetti, A. Clementi, E. Natale, F. Pasquale, and L. Trevisan, “Find Your Place: Simple Distributed Algorithms for Community Detection,” in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), Barcelona, Spain, 2017.
Export
BibTeX
@inproceedings{BCNPT17, TITLE = {Find Your Place: {S}imple Distributed Algorithms for Community Detection}, AUTHOR = {Becchetti, Luca and Clementi, Andrea and Natale, Emanuele and Pasquale, Francesco and Trevisan, Luca}, LANGUAGE = {eng}, DOI = {10.1137/1.9781611974782.59}, PUBLISHER = {SIAM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017)}, EDITOR = {Klein, Philip N.}, PAGES = {940--959}, ADDRESS = {Barcelona, Spain}, }
Endnote
%0 Conference Proceedings %A Becchetti, Luca %A Clementi, Andrea %A Natale, Emanuele %A Pasquale, Francesco %A Trevisan, Luca %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Find Your Place: Simple Distributed Algorithms for Community Detection : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-5877-A %R 10.1137/1.9781611974782.59 %D 2017 %B Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2017-01-16 - 2017-01-19 %C Barcelona, Spain %B Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms %E Klein, Philip N. %P 940 - 959 %I SIAM
[188]
L. Becchetti, A. Clementi, E. Natale, F. Pasquale, R. Silvestri, and L. Trevisan, “Simple Dynamics for Plurality Consensus,” Distributed Computing, vol. 30, no. 4, 2017.
Export
BibTeX
@article{Becchetti2017, TITLE = {Simple Dynamics for Plurality Consensus}, AUTHOR = {Becchetti, Luca and Clementi, Andrea and Natale, Emanuele and Pasquale, Francesco and Silvestri, Riccardo and Trevisan, Luca}, LANGUAGE = {eng}, ISSN = {0178-2770}, DOI = {10.1007/s00446-016-0289-4}, PUBLISHER = {Springer International}, ADDRESS = {Berlin}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, JOURNAL = {Distributed Computing}, VOLUME = {30}, NUMBER = {4}, PAGES = {293--306}, }
Endnote
%0 Journal Article %A Becchetti, Luca %A Clementi, Andrea %A Natale, Emanuele %A Pasquale, Francesco %A Silvestri, Riccardo %A Trevisan, Luca %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Simple Dynamics for Plurality Consensus : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-F885-F %R 10.1007/s00446-016-0289-4 %7 2016-11-22 %D 2017 %J Distributed Computing %V 30 %N 4 %& 293 %P 293 - 306 %I Springer International %C Berlin %@ false
[189]
R. Becker, A. Karrenbauer, S. Krinninger, and C. Lenzen, “Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models,” in 31st International Symposium on Distributed Computing (DISC 2017), Vienna, Austria, 2017.
Export
BibTeX
@inproceedings{Becker_DISC17, TITLE = {Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models}, AUTHOR = {Becker, Ruben and Karrenbauer, Andreas and Krinninger, Sebastian and Lenzen, Christoph}, LANGUAGE = {eng}, ISBN = {978-3-95977-053-8}, URL = {urn:nbn:de:0030-drops-80031}, DOI = {10.4230/LIPIcs.DISC.2017.7}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {31st International Symposium on Distributed Computing (DISC 2017)}, EDITOR = {Richa, Andr{\'e}a W.}, PAGES = {1--16}, EID = {7}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {91}, ADDRESS = {Vienna, Austria}, }
Endnote
%0 Conference Proceedings %A Becker, Ruben %A Karrenbauer, Andreas %A Krinninger, Sebastian %A Lenzen, Christoph %+ 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 Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models : %G eng %U http://hdl.handle.net/21.11116/0000-0000-3F19-F %U urn:nbn:de:0030-drops-80031 %R 10.4230/LIPIcs.DISC.2017.7 %D 2017 %B 31st International Symposium on Distributed Computing %Z date of event: 2017-10-16 - 2017-10-20 %C Vienna, Austria %B 31st International Symposium on Distributed Computing %E Richa, Andr&#233;a W. %P 1 - 16 %Z sequence number: 7 %I Schloss Dagstuhl %@ 978-3-95977-053-8 %B Leibniz International Proceedings in Informatics %N 91 %U http://drops.dagstuhl.de/opus/volltexte/2017/8003/http://drops.dagstuhl.de/doku/urheberrecht1.html
[190]
R. Becker, V. Bonifaci, A. Karrenbauer, P. Kolev, and K. Mehlhorn, “Two Results on Slime Mold Computations,” 2017. [Online]. Available: http://arxiv.org/abs/1707.06631. (arXiv: 1707.06631)
Abstract
In this paper, we present two results on slime mold computations. The first one treats a biologically-grounded model, originally proposed by biologists analyzing the behavior of the slime mold Physarum polycephalum. This primitive organism was empirically shown by Nakagaki et al. to solve shortest path problems in wet-lab experiments (Nature'00). We show that the proposed simple mathematical model actually generalizes to a much wider class of problems, namely undirected linear programs with a non-negative cost vector. For our second result, we consider the discretization of a biologically-inspired model. This model is a directed variant of the biologically-grounded one and was never claimed to describe the behavior of a biological system. Straszak and Vishnoi showed that it can $\epsilon$-approximately solve flow problems (SODA'16) and even general linear programs with positive cost vector (ITCS'16) within a finite number of steps. We give a refined convergence analysis that improves the dependence on $\epsilon$ from polynomial to logarithmic and simultaneously allows to choose a step size that is independent of $\epsilon$. Furthermore, we show that the dynamics can be initialized with a more general set of (infeasible) starting points.
Export
BibTeX
@online{Becker_arxiv2017, TITLE = {Two Results on Slime Mold Computations}, AUTHOR = {Becker, Ruben and Bonifaci, Vincenzo and Karrenbauer, Andreas and Kolev, Pavel and Mehlhorn, Kurt}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1707.06631}, EPRINT = {1707.06631}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {In this paper, we present two results on slime mold computations. The first one treats a biologically-grounded model, originally proposed by biologists analyzing the behavior of the slime mold Physarum polycephalum. This primitive organism was empirically shown by Nakagaki et al. to solve shortest path problems in wet-lab experiments (Nature'00). We show that the proposed simple mathematical model actually generalizes to a much wider class of problems, namely undirected linear programs with a non-negative cost vector. For our second result, we consider the discretization of a biologically-inspired model. This model is a directed variant of the biologically-grounded one and was never claimed to describe the behavior of a biological system. Straszak and Vishnoi showed that it can $\epsilon$-approximately solve flow problems (SODA'16) and even general linear programs with positive cost vector (ITCS'16) within a finite number of steps. We give a refined convergence analysis that improves the dependence on $\epsilon$ from polynomial to logarithmic and simultaneously allows to choose a step size that is independent of $\epsilon$. Furthermore, we show that the dynamics can be initialized with a more general set of (infeasible) starting points.}, }
Endnote
%0 Report %A Becker, Ruben %A Bonifaci, Vincenzo %A Karrenbauer, Andreas %A Kolev, Pavel %A 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 Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Two Results on Slime Mold Computations : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-FBA8-F %U http://arxiv.org/abs/1707.06631 %D 2017 %X In this paper, we present two results on slime mold computations. The first one treats a biologically-grounded model, originally proposed by biologists analyzing the behavior of the slime mold Physarum polycephalum. This primitive organism was empirically shown by Nakagaki et al. to solve shortest path problems in wet-lab experiments (Nature'00). We show that the proposed simple mathematical model actually generalizes to a much wider class of problems, namely undirected linear programs with a non-negative cost vector. For our second result, we consider the discretization of a biologically-inspired model. This model is a directed variant of the biologically-grounded one and was never claimed to describe the behavior of a biological system. Straszak and Vishnoi showed that it can $\epsilon$-approximately solve flow problems (SODA'16) and even general linear programs with positive cost vector (ITCS'16) within a finite number of steps. We give a refined convergence analysis that improves the dependence on $\epsilon$ from polynomial to logarithmic and simultaneously allows to choose a step size that is independent of $\epsilon$. Furthermore, we show that the dynamics can be initialized with a more general set of (infeasible) starting points. %K Computer Science, Data Structures and Algorithms, cs.DS,Mathematics, Dynamical Systems, math.DS,Mathematics, Optimization and Control, math.OC, Physics, Biological Physics, physics.bio-ph
[191]
R. Becker and M. Sagraloff, “Counting Solutions of a Polynomial System Locally and Exactly,” 2017. [Online]. Available: http://arxiv.org/abs/1712.05487. (arXiv: 1712.05487)
Abstract
We propose a symbolic-numeric algorithm to count the number of solutions of a polynomial system within a local region. More specifically, given a zero-dimensional system $f_1=\cdots=f_n=0$, with $f_i\in\mathbb{C}[x_1,\ldots,x_n]$, and a polydisc $\mathbf{\Delta}\subset\mathbb{C}^n$, our method aims to certify the existence of $k$ solutions (counted with multiplicity) within the polydisc. In case of success, it yields the correct result under guarantee. Otherwise, no information is given. However, we show that our algorithm always succeeds if $\mathbf{\Delta}$ is sufficiently small and well-isolating for a $k$-fold solution $\mathbf{z}$ of the system. Our analysis of the algorithm further yields a bound on the size of the polydisc for which our algorithm succeeds under guarantee. This bound depends on local parameters such as the size and multiplicity of $\mathbf{z}$ as well as the distances between $\mathbf{z}$ and all other solutions. Efficiency of our method stems from the fact that we reduce the problem of counting the roots in $\mathbf{\Delta}$ of the original system to the problem of solving a truncated system of degree $k$. In particular, if the multiplicity $k$ of $\mathbf{z}$ is small compared to the total degrees of the polynomials $f_i$, our method considerably improves upon known complete and certified methods. For the special case of a bivariate system, we report on an implementation of our algorithm, and show experimentally that our algorithm leads to a significant improvement, when integrated as inclusion predicate into an elimination method.
Export
BibTeX
@online{Becker_arXiv1712.05487, TITLE = {Counting Solutions of a Polynomial System Locally and Exactly}, AUTHOR = {Becker, Ruben and Sagraloff, Michael}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1712.05487}, EPRINT = {1712.05487}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We propose a symbolic-numeric algorithm to count the number of solutions of a polynomial system within a local region. More specifically, given a zero-dimensional system $f_1=\cdots=f_n=0$, with $f_i\in\mathbb{C}[x_1,\ldots,x_n]$, and a polydisc $\mathbf{\Delta}\subset\mathbb{C}^n$, our method aims to certify the existence of $k$ solutions (counted with multiplicity) within the polydisc. In case of success, it yields the correct result under guarantee. Otherwise, no information is given. However, we show that our algorithm always succeeds if $\mathbf{\Delta}$ is sufficiently small and well-isolating for a $k$-fold solution $\mathbf{z}$ of the system. Our analysis of the algorithm further yields a bound on the size of the polydisc for which our algorithm succeeds under guarantee. This bound depends on local parameters such as the size and multiplicity of $\mathbf{z}$ as well as the distances between $\mathbf{z}$ and all other solutions. Efficiency of our method stems from the fact that we reduce the problem of counting the roots in $\mathbf{\Delta}$ of the original system to the problem of solving a truncated system of degree $k$. In particular, if the multiplicity $k$ of $\mathbf{z}$ is small compared to the total degrees of the polynomials $f_i$, our method considerably improves upon known complete and certified methods. For the special case of a bivariate system, we report on an implementation of our algorithm, and show experimentally that our algorithm leads to a significant improvement, when integrated as inclusion predicate into an elimination method.}, }
Endnote
%0 Report %A Becker, Ruben %A Sagraloff, Michael %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Counting Solutions of a Polynomial System Locally and Exactly : %G eng %U http://hdl.handle.net/21.11116/0000-0002-AB99-1 %U http://arxiv.org/abs/1712.05487 %D 2017 %X We propose a symbolic-numeric algorithm to count the number of solutions of a polynomial system within a local region. More specifically, given a zero-dimensional system $f_1=\cdots=f_n=0$, with $f_i\in\mathbb{C}[x_1,\ldots,x_n]$, and a polydisc $\mathbf{\Delta}\subset\mathbb{C}^n$, our method aims to certify the existence of $k$ solutions (counted with multiplicity) within the polydisc. In case of success, it yields the correct result under guarantee. Otherwise, no information is given. However, we show that our algorithm always succeeds if $\mathbf{\Delta}$ is sufficiently small and well-isolating for a $k$-fold solution $\mathbf{z}$ of the system. Our analysis of the algorithm further yields a bound on the size of the polydisc for which our algorithm succeeds under guarantee. This bound depends on local parameters such as the size and multiplicity of $\mathbf{z}$ as well as the distances between $\mathbf{z}$ and all other solutions. Efficiency of our method stems from the fact that we reduce the problem of counting the roots in $\mathbf{\Delta}$ of the original system to the problem of solving a truncated system of degree $k$. In particular, if the multiplicity $k$ of $\mathbf{z}$ is small compared to the total degrees of the polynomials $f_i$, our method considerably improves upon known complete and certified methods. For the special case of a bivariate system, we report on an implementation of our algorithm, and show experimentally that our algorithm leads to a significant improvement, when integrated as inclusion predicate into an elimination method. %K Computer Science, Symbolic Computation, cs.SC,Computer Science, Numerical Analysis, cs.NA,Mathematics, Numerical Analysis, math.NA
[192]
R. Becker, “On Flows, Paths, Roots, and Zeros,” Universität des Saarlandes, Saarbrücken, 2017.
Export
BibTeX
@phdthesis{Becker_PhD2018, TITLE = {On Flows, Paths, Roots, and Zeros}, AUTHOR = {Becker, Ruben}, LANGUAGE = {eng}, URL = {urn:nbn:de:bsz:291-scidok-ds-273348}, DOI = {10.22028/D291-27334}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, }
Endnote
%0 Thesis %A Becker, Ruben %Y Mehlhorn, Kurt %A referee: Karrenbauer, Andreas %A referee: Sagraloff, Michael %+ 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 Algorithms and Complexity, MPI for Informatics, Max Planck Society %T On Flows, Paths, Roots, and Zeros : %G eng %U http://hdl.handle.net/21.11116/0000-0003-3931-6 %R 10.22028/D291-27334 %U urn:nbn:de:bsz:291-scidok-ds-273348 %F OTHER: hdl:20.500.11880/27162 %I Universit&#228;t des Saarlandes %C Saarbr&#252;cken %D 2017 %P XI, 168 p. %V phd %9 phd %U http://dx.doi.org/10.22028/D291-27334
[193]
X. Bei, J. Garg, M. Hoefer, and K. Mehlhorn, “Earning Limits in Fisher Markets with Spending-Constraint Utilities,” in Algorithmic Game Theory (SAGT 2017), L’Aquila, Italy, 2017.
Export
BibTeX
@inproceedings{BeiSAGT2017, TITLE = {Earning Limits in {Fisher} Markets with Spending-Constraint Utilities}, AUTHOR = {Bei, Xiaohui and Garg, Jugal and Hoefer, Martin and Mehlhorn, Kurt}, LANGUAGE = {eng}, ISBN = {978-3-319-66699-0}, DOI = {10.1007/978-3-319-66700-3_6}, PUBLISHER = {Springer}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {Algorithmic Game Theory (SAGT 2017)}, PAGES = {67--79}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {10504}, ADDRESS = {L'Aquila, Italy}, }
Endnote
%0 Conference Proceedings %A Bei, Xiaohui %A Garg, Jugal %A Hoefer, Martin %A Mehlhorn, Kurt %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Earning Limits in Fisher Markets with Spending-Constraint Utilities : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-E7DB-7 %R 10.1007/978-3-319-66700-3_6 %D 2017 %B 10th International Symposium on Algorithmic Game Theory %Z date of event: 2017-09-12 - 2017-09-14 %C L'Aquila, Italy %B Algorithmic Game Theory %P 67 - 79 %I Springer %@ 978-3-319-66699-0 %B Lecture Notes in Computer Science %N 10504
[194]
F. Benhamouda, T. Lepoint, C. Mathieu, and H. Zhou, “Optimization of Bootstrapping in Circuits,” in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), Barcelona, Spain, 2017.
Export
BibTeX
@inproceedings{doi:10.1137/1.9781611974782.160, TITLE = {Optimization of Bootstrapping in Circuits}, AUTHOR = {Benhamouda, Fabrice and Lepoint, Tancr{\`e}de and Mathieu, Claire and Zhou, Hang}, LANGUAGE = {eng}, ISBN = {978-1-61197-478-2}, DOI = {10.1137/1.9781611974782.160}, PUBLISHER = {SIAM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017)}, EDITOR = {Klein, Philip N.}, PAGES = {2423--2433}, ADDRESS = {Barcelona, Spain}, }
Endnote
%0 Conference Proceedings %A Benhamouda, Fabrice %A Lepoint, Tancr&#232;de %A Mathieu, Claire %A Zhou, Hang %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Optimization of Bootstrapping in Circuits : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-4EBE-A %R 10.1137/1.9781611974782.160 %D 2017 %B Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2017-01-16 - 2017-01-19 %C Barcelona, Spain %B Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms %E Klein, Philip N. %P 2423 - 2433 %I SIAM %@ 978-1-61197-478-2
[195]
P. Berenbrink, A. Clementi, R. Elsässer, P. Kling, F. Mallmann-Trenn, and E. Natale, “Ignore or Comply?: On Breaking Symmetry in Consensus,” in PODC’17, ACM Symposium on Principles of Distributed Computing, Washington, DC, USA, 2017.
Export
BibTeX
@inproceedings{Berenbrink:2017:ICB:3087801.3087817, TITLE = {Ignore or Comply?: {O}n Breaking Symmetry in Consensus}, AUTHOR = {Berenbrink, Petra and Clementi, Andrea and Els{\"a}sser, Robert and Kling, Peter and Mallmann-Trenn, Frederik and Natale, Emanuele}, LANGUAGE = {eng}, ISBN = {978-1-4503-4992-5}, DOI = {10.1145/3087801.3087817}, PUBLISHER = {ACM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {PODC'17, ACM Symposium on Principles of Distributed Computing}, PAGES = {335--344}, ADDRESS = {Washington, DC, USA}, }
Endnote
%0 Conference Proceedings %A Berenbrink, Petra %A Clementi, Andrea %A Els&#228;sser, Robert %A Kling, Peter %A Mallmann-Trenn, Frederik %A Natale, Emanuele %+ External Organizations External Organizations External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Ignore or Comply?: On Breaking Symmetry in Consensus : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-76B2-0 %R 10.1145/3087801.3087817 %D 2017 %B ACM Symposium on Principles of Distributed Computing %Z date of event: 2017-07-25 - 2017-07-27 %C Washington, DC, USA %B PODC'17 %P 335 - 344 %I ACM %@ 978-1-4503-4992-5
[196]
O. Beyersdorff, L. Chew, and K. Sreenivasaiah, “A Game Characterisation of Tree-like Q-Resolution Size,” Journal of Computer and System Sciences, 2017.
Export
BibTeX
@article{Beyersdorff2017, TITLE = {A Game Characterisation of Tree-like {Q-Resolution} Size}, AUTHOR = {Beyersdorff, Olaf and Chew, Leroy and Sreenivasaiah, Karteek}, LANGUAGE = {eng}, ISSN = {0022-0000}, DOI = {10.1016/j.jcss.2016.11.011}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, JOURNAL = {Journal of Computer and System Sciences}, }
Endnote
%0 Journal Article %A Beyersdorff, Olaf %A Chew, Leroy %A Sreenivasaiah, Karteek %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Game Characterisation of Tree-like Q-Resolution Size : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-5F80-F %R 10.1016/j.jcss.2016.11.011 %7 2017 %D 2017 %J Journal of Computer and System Sciences %I Elsevier %C Amsterdam %@ false
[197]
M. Bläser, G. Jindal, and A. Pandey, “Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix Spaces,” in 32nd Computational Complexity Conference (CCC 2017), Riga, Latvia, 2017.
Export
BibTeX
@inproceedings{Blaeser_CCC17, TITLE = {Greedy Strikes Again: {A} Deterministic {PTAS} for Commutative Rank of Matrix Spaces}, AUTHOR = {Bl{\"a}ser, Markus and Jindal, Gorav and Pandey, Anurag}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-040-8}, URL = {urn:nbn:de:0030-drops-75194}, DOI = {10.4230/LIPIcs.CCC.2017.33}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {32nd Computational Complexity Conference (CCC 2017)}, EDITOR = {O'Donnell, Ryan}, PAGES = {1--2116}, EID = {33}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {79}, ADDRESS = {Riga, Latvia}, }
Endnote
%0 Conference Proceedings %A Bl&#228;ser, Markus %A Jindal, Gorav %A Pandey, Anurag %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix Spaces : %G eng %U http://hdl.handle.net/21.11116/0000-0002-B495-A %R 10.4230/LIPIcs.CCC.2017.33 %U urn:nbn:de:0030-drops-75194 %D 2017 %B 32nd Computational Complexity Conference %Z date of event: 2017-07-06 - 2017-07-09 %C Riga, Latvia %B 32nd Computational Complexity Conference %E O'Donnell, Ryan %P 1 - 2116 %Z sequence number: 33 %I Schloss Dagstuhl %@ 978-3-95977-040-8 %B Leibniz International Proceedings in Informatics %N 79 %@ false %U http://drops.dagstuhl.de/opus/volltexte/2017/7519/http://drops.dagstuhl.de/doku/urheberrecht1.html
[198]
L. Boczkowski, A. Korman, and E. Natale, “Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits,” in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), Barcelona, Spain, 2017.
Export
BibTeX
@inproceedings{BKN17, TITLE = {Minimizing Message Size in Stochastic Communication Patterns: {F}ast Self-Stabilizing Protocols with 3 bits}, AUTHOR = {Boczkowski, Lucas and Korman, Amos and Natale, Emanuele}, LANGUAGE = {eng}, DOI = {10.1137/1.9781611974782.168}, PUBLISHER = {SIAM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017)}, EDITOR = {Klein, Philip N.}, PAGES = {2540--2559}, ADDRESS = {Barcelona, Spain}, }
Endnote
%0 Conference Proceedings %A Boczkowski, Lucas %A Korman, Amos %A Natale, Emanuele %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-587B-2 %R 10.1137/1.9781611974782.168 %D 2017 %B Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2017-01-16 - 2017-01-19 %C Barcelona, Spain %B Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms %E Klein, Philip N. %P 2540 - 2559 %I SIAM
[199]
N. Boucquey and A. Kinali, “Damped Sine Based Time Interval Counter,” in Joint Conference of the European Frequency and Time Forum and IEEE International Frequency Control Symposium (EFTF/IFC 2017), Besançon, France, 2017.
Export
BibTeX
@inproceedings{Boucquey_EFTF/IFCS2017b, TITLE = {Damped Sine Based Time Interval Counter}, AUTHOR = {Boucquey, Nicolas and Kinali, Attila}, LANGUAGE = {eng}, ISBN = {978-1-5386-2916-1}, DOI = {10.1109/FCS.2017.8088819}, PUBLISHER = {IEEE}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {Joint Conference of the European Frequency and Time Forum and IEEE International Frequency Control Symposium (EFTF/IFC 2017)}, PAGES = {121--123}, ADDRESS = {Besan{\c c}on, France}, }
Endnote
%0 Conference Proceedings %A Boucquey, Nicolas %A Kinali, Attila %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Damped Sine Based Time Interval Counter : %G eng %U http://hdl.handle.net/21.11116/0000-0001-94B8-8 %R 10.1109/FCS.2017.8088819 %D 2017 %B Joint Conference of the European Frequency and Time Forum and IEEE International Frequency Control Symposium %Z date of event: 2017-07-09 - 2017-07-13 %C Besan&#231;on, France %B Joint Conference of the European Frequency and Time Forum and IEEE International Frequency Control Symposium %P 121 - 123 %I IEEE %@ 978-1-5386-2916-1
[200]
N. Boucquey and A. Kinali, “Software Defined Radio Platform for Time and Frequency Metrology,” in Joint Conference of the European Frequency and Time Forum and IEEE International Frequency Control Symposium (EFTF/IFC 2017), Besançon, France, 2017.
Export
BibTeX
@inproceedings{Boucquey_EFTF/IFCS2017, TITLE = {Software Defined Radio Platform for Time and Frequency Metrology}, AUTHOR = {Boucquey, Nicolas and Kinali, Attila}, LANGUAGE = {eng}, ISBN = {978-1-5386-2916-1}, DOI = {10.1109/FCS.2017.8088968}, PUBLISHER = {IEEE}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {Joint Conference of the European Frequency and Time Forum and IEEE International Frequency Control Symposium (EFTF/IFC 2017)}, PAGES = {598--599}, ADDRESS = {Besan{\c c}on, France}, }
Endnote
%0 Conference Proceedings %A Boucquey, Nicolas %A Kinali, Attila %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Software Defined Radio Platform for Time and Frequency Metrology : %G eng %U http://hdl.handle.net/21.11116/0000-0001-94B6-A %R 10.1109/FCS.2017.8088968 %D 2017 %B Joint Conference of the European Frequency and Time Forum and IEEE International Frequency Control Symposium %Z date of event: 2017-07-09 - 2017-07-13 %C Besan&#231;on, France %B Joint Conference of the European Frequency and Time Forum and IEEE International Frequency Control Symposium %P 598 - 599 %I IEEE %@ 978-1-5386-2916-1
[201]
K. Bringmann, A. Gronlund, and K. G. Larsen, “A Dichotomy for Regular Expression Membership Testing,” in 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017), Berkeley, CA, USA, 2017.
Export
BibTeX
@inproceedings{Bringman_FOCS2017, TITLE = {A Dichotomy for Regular Expression Membership Testing}, AUTHOR = {Bringmann, Karl and Gronlund, Allan and Larsen, Kasper Green}, LANGUAGE = {eng}, ISBN = {978-1-5386-3464-6}, DOI = {10.1109/FOCS.2017.36}, PUBLISHER = {IEEE}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {58th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017)}, PAGES = {307--318}, ADDRESS = {Berkeley, CA, USA}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Gronlund, Allan %A Larsen, Kasper Green %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T A Dichotomy for Regular Expression Membership Testing : %G eng %U http://hdl.handle.net/21.11116/0000-0000-0471-C %R 10.1109/FOCS.2017.36 %D 2017 %B 58th Annual IEEE Symposium on Foundations of Computer Science %Z date of event: 2017-10-15 - 2017-10-17 %C Berkeley, CA, USA %B 58th Annual IEEE Symposium on Foundations of Computer Science %P 307 - 318 %I IEEE %@ 978-1-5386-3464-6
[202]
K. Bringmann, “A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum,” in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), Barcelona, Spain, 2017.
Export
BibTeX
@inproceedings{DBLP:conf/soda/Bringmann17, TITLE = {A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum}, AUTHOR = {Bringmann, Karl}, LANGUAGE = {eng}, DOI = {10.1137/1.9781611974782.69}, PUBLISHER = {SIAM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017)}, EDITOR = {Klein, Philip N.}, PAGES = {1073--1084}, ADDRESS = {Barcelona, Spain}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-5522-4 %R 10.1137/1.9781611974782.69 %D 2017 %B Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2017-01-16 - 2017-01-19 %C Barcelona, Spain %B Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms %E Klein, Philip N. %P 1073 - 1084 %I SIAM
[203]
K. Bringmann and P. Wellnitz, “Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars,” in 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), Warsaw, Poland, 2017.
Export
BibTeX
@inproceedings{BringmannCPM2017, TITLE = {Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars}, AUTHOR = {Bringmann, Karl and Wellnitz, Philip}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-039-2}, URL = {urn:nbn:de:0030-drops-73329}, DOI = {10.4230/LIPIcs.CPM.2017.12}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)}, EDITOR = {K{\"a}rkk{\"a}inen, Juha and Radoszweski, Jakub and Rytter, Wojciech}, PAGES = {1--14}, EID = {12}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {78}, ADDRESS = {Warsaw, Poland}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Wellnitz, Philip %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-FB92-0 %R 10.4230/LIPIcs.CPM.2017.12 %U urn:nbn:de:0030-drops-73329 %D 2017 %B 28th Annual Symposium on Combinatorial Pattern Matching %Z date of event: 2017-07-04 - 2017-07-06 %C Warsaw, Poland %B 28th Annual Symposium on Combinatorial Pattern Matching %E K&#228;rkk&#228;inen, Juha; Radoszweski, Jakub; Rytter, Wojciech %P 1 - 14 %Z sequence number: 12 %I Schloss Dagstuhl %@ 978-3-95977-039-2 %B Leibniz International Proceedings in Informatics %N 78 %@ false %U http://drops.dagstuhl.de/opus/volltexte/2017/7332/http://drops.dagstuhl.de/doku/urheberrecht1.html
[204]
K. Bringmann and K. Panagiotou, “Efficient Sampling Methods for Discrete Distributions,” Algorithmica, vol. 79, no. 2, 2017.
Export
BibTeX
@article{BringmannAlgorithmica2016, TITLE = {Efficient Sampling Methods for Discrete Distributions}, AUTHOR = {Bringmann, Karl and Panagiotou, Konstantinos}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-016-0205-0}, PUBLISHER = {Springer-Verlag}, ADDRESS = {New York}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, JOURNAL = {Algorithmica}, VOLUME = {79}, NUMBER = {2}, PAGES = {484--508}, }
Endnote
%0 Journal Article %A Bringmann, Karl %A Panagiotou, Konstantinos %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Efficient Sampling Methods for Discrete Distributions : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002B-85D0-8 %R 10.1007/s00453-016-0205-0 %7 2016-08-29 %D 2017 %J Algorithmica %V 79 %N 2 %& 484 %P 484 - 508 %I Springer-Verlag %C New York %@ false
[205]
K. Bringmann, S. Cabello, and M. Emmerich, “Maximum Volume Subset Selection for Anchored Boxes,” in 33rd International Symposium on Computational Geometry (SoCG 2017), Brisbane, Australia, 2017.
Export
BibTeX
@inproceedings{bringmann:scg, TITLE = {Maximum Volume Subset Selection for Anchored Boxes}, AUTHOR = {Bringmann, Karl and Cabello, Sergio and Emmerich, Michael}, LANGUAGE = {eng}, ISBN = {978-3-95977-038-5}, URL = {urn:nbn:de:0030-drops-72011}, DOI = {10.4230/LIPIcs.SoCG.2017.22}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {33rd International Symposium on Computational Geometry (SoCG 2017)}, EDITOR = {Aranov, Boris and Katz, Matthew J.}, PAGES = {1--15}, EID = {22}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {77}, ADDRESS = {Brisbane, Australia}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Cabello, Sergio %A Emmerich, Michael %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Maximum Volume Subset Selection for Anchored Boxes : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-7D6F-9 %U urn:nbn:de:0030-drops-72011 %R 10.4230/LIPIcs.SoCG.2017.22 %D 2017 %B 33rd International Symposium on Computational Geometry %Z date of event: 2017-07-04 - 2017-07-07 %C Brisbane, Australia %B 33rd International Symposium on Computational Geometry %E Aranov, Boris; Katz, Matthew J. %P 1 - 15 %Z sequence number: 22 %I Schloss Dagstuhl %@ 978-3-95977-038-5 %B Leibniz International Proceedings in Informatics %N 77 %U http://drops.dagstuhl.de/opus/volltexte/2017/7201/http://drops.dagstuhl.de/doku/urheberrecht1.html
[206]
K. Bringmann, R. Keusch, and J. Lengler, “Sampling Geometric Inhomogeneous Random Graphs in Linear Time,” in 25th Annual European Symposium on Algorithms (ESA 2017), Vienna, Austria, 2017.
Export
BibTeX
@inproceedings{BringmannESA2017, TITLE = {Sampling Geometric Inhomogeneous Random Graphs in Linear Time}, AUTHOR = {Bringmann, Karl and Keusch, Ralph and Lengler, Johannes}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-049-1}, URL = {urn:nbn:de:0030-drops-78396}, DOI = {10.4230/LIPIcs.ESA.2017.20}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {25th Annual European Symposium on Algorithms (ESA 2017)}, EDITOR = {Pruhs, Kirk and Sohler, Christian}, PAGES = {1--15}, EID = {20}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {87}, ADDRESS = {Vienna, Austria}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Keusch, Ralph %A Lengler, Johannes %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Sampling Geometric Inhomogeneous Random Graphs in Linear Time : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-FB87-A %R 10.4230/LIPIcs.ESA.2017.20 %U urn:nbn:de:0030-drops-78396 %D 2017 %B 25th Annual European Symposium on Algorithms %Z date of event: 2017-09-04 - 2017-09-06 %C Vienna, Austria %B 25th Annual European Symposium on Algorithms %E Pruhs, Kirk; Sohler, Christian %P 1 - 15 %Z sequence number: 20 %I Schloss Dagstuhl %@ 978-3-95977-049-1 %B Leibniz International Proceedings in Informatics %N 87 %@ false %U http://drops.dagstuhl.de/opus/volltexte/2017/7839/http://drops.dagstuhl.de/doku/urheberrecht1.html
[207]
K. Bringmann, P. Gawrychowski, S. Mozes, and O. Weimann, “Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can),” 2017. [Online]. Available: http://arxiv.org/abs/1703.08940. (arXiv: 1703.08940)
Abstract
The edit distance between two rooted ordered trees with $n$ nodes labeled from an alphabet~$\Sigma$ is the minimum cost of transforming one tree into the other by a sequence of elementary operations consisting of deleting and relabeling existing nodes, as well as inserting new nodes. Tree edit distance is a well known generalization of string edit distance. The fastest known algorithm for tree edit distance runs in cubic $O(n^3)$ time and is based on a similar dynamic programming solution as string edit distance. In this paper we show that a truly subcubic $O(n^{3-\varepsilon})$ time algorithm for tree edit distance is unlikely: For $|\Sigma| = \Omega(n)$, a truly subcubic algorithm for tree edit distance implies a truly subcubic algorithm for the all pairs shortest paths problem. For $|\Sigma| = O(1)$, a truly subcubic algorithm for tree edit distance implies an $O(n^{k-\varepsilon})$ algorithm for finding a maximum weight $k$-clique. Thus, while in terms of upper bounds string edit distance and tree edit distance are highly related, in terms of lower bounds string edit distance exhibits the hardness of the strong exponential time hypothesis [Backurs, Indyk STOC'15] whereas tree edit distance exhibits the hardness of all pairs shortest paths. Our result provides a matching conditional lower bound for one of the last remaining classic dynamic programming problems.
Export
BibTeX
@online{DBLP:journals/corr/BringmannGMW17, 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}, URL = {http://arxiv.org/abs/1703.08940}, EPRINT = {1703.08940}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {The edit distance between two rooted ordered trees with $n$ nodes labeled from an alphabet~$\Sigma$ is the minimum cost of transforming one tree into the other by a sequence of elementary operations consisting of deleting and relabeling existing nodes, as well as inserting new nodes. Tree edit distance is a well known generalization of string edit distance. The fastest known algorithm for tree edit distance runs in cubic $O(n^3)$ time and is based on a similar dynamic programming solution as string edit distance. In this paper we show that a truly subcubic $O(n^{3-\varepsilon})$ time algorithm for tree edit distance is unlikely: For $|\Sigma| = \Omega(n)$, a truly subcubic algorithm for tree edit distance implies a truly subcubic algorithm for the all pairs shortest paths problem. For $|\Sigma| = O(1)$, a truly subcubic algorithm for tree edit distance implies an $O(n^{k-\varepsilon})$ algorithm for finding a maximum weight $k$-clique. Thus, while in terms of upper bounds string edit distance and tree edit distance are highly related, in terms of lower bounds string edit distance exhibits the hardness of the strong exponential time hypothesis [Backurs, Indyk STOC'15] whereas tree edit distance exhibits the hardness of all pairs shortest paths. Our result provides a matching conditional lower bound for one of the last remaining classic dynamic programming problems.}, }
Endnote
%0 Report %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) : %O Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless {APSP} can) %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-8A70-3 %U http://arxiv.org/abs/1703.08940 %D 2017 %X The edit distance between two rooted ordered trees with $n$ nodes labeled from an alphabet~$\Sigma$ is the minimum cost of transforming one tree into the other by a sequence of elementary operations consisting of deleting and relabeling existing nodes, as well as inserting new nodes. Tree edit distance is a well known generalization of string edit distance. The fastest known algorithm for tree edit distance runs in cubic $O(n^3)$ time and is based on a similar dynamic programming solution as string edit distance. In this paper we show that a truly subcubic $O(n^{3-\varepsilon})$ time algorithm for tree edit distance is unlikely: For $|\Sigma| = \Omega(n)$, a truly subcubic algorithm for tree edit distance implies a truly subcubic algorithm for the all pairs shortest paths problem. For $|\Sigma| = O(1)$, a truly subcubic algorithm for tree edit distance implies an $O(n^{k-\varepsilon})$ algorithm for finding a maximum weight $k$-clique. Thus, while in terms of upper bounds string edit distance and tree edit distance are highly related, in terms of lower bounds string edit distance exhibits the hardness of the strong exponential time hypothesis [Backurs, Indyk STOC'15] whereas tree edit distance exhibits the hardness of all pairs shortest paths. Our result provides a matching conditional lower bound for one of the last remaining classic dynamic programming problems. %K Computer Science, Data Structures and Algorithms, cs.DS
[208]
K. Bringmann and S. Krinninger, “A Note on Hardness of Diameter Approximation,” 2017. [Online]. Available: http://arxiv.org/abs/1705.02127. (arXiv: 1705.02127)
Abstract
We revisit the hardness of approximating the diameter of a network. In the CONGEST model, $ \tilde \Omega (n) $ rounds are necessary to compute the diameter [Frischknecht et al. SODA'12]. Abboud et al. DISC 2016 extended this result to sparse graphs and, at a more fine-grained level, showed that, for any integer $ 1 \leq \ell \leq \operatorname{polylog} (n) $, distinguishing between networks of diameter $ 4 \ell + 2 $ and $ 6 \ell + 1 $ requires $ \tilde \Omega (n) $ rounds. We slightly tighten this result by showing that even distinguishing between diameter $ 2 \ell + 1 $ and $ 3 \ell + 1 $ requires $ \tilde \Omega (n) $ rounds. The reduction of Abboud et al. is inspired by recent conditional lower bounds in the RAM model, where the orthogonal vectors problem plays a pivotal role. In our new lower bound, we make the connection to orthogonal vectors explicit, leading to a conceptually more streamlined exposition. This is suited for teaching both the lower bound in the CONGEST model and the conditional lower bound in the RAM model.
Export
BibTeX
@online{DBLP:journals/corr/BringmannK17, TITLE = {A Note on Hardness of Diameter Approximation}, AUTHOR = {Bringmann, Karl and Krinninger, Sebastian}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1705.02127}, EPRINT = {1705.02127}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We revisit the hardness of approximating the diameter of a network. In the CONGEST model, $ \tilde \Omega (n) $ rounds are necessary to compute the diameter [Frischknecht et al. SODA'12]. Abboud et al. DISC 2016 extended this result to sparse graphs and, at a more fine-grained level, showed that, for any integer $ 1 \leq \ell \leq \operatorname{polylog} (n) $, distinguishing between networks of diameter $ 4 \ell + 2 $ and $ 6 \ell + 1 $ requires $ \tilde \Omega (n) $ rounds. We slightly tighten this result by showing that even distinguishing between diameter $ 2 \ell + 1 $ and $ 3 \ell + 1 $ requires $ \tilde \Omega (n) $ rounds. The reduction of Abboud et al. is inspired by recent conditional lower bounds in the RAM model, where the orthogonal vectors problem plays a pivotal role. In our new lower bound, we make the connection to orthogonal vectors explicit, leading to a conceptually more streamlined exposition. This is suited for teaching both the lower bound in the CONGEST model and the conditional lower bound in the RAM model.}, }
Endnote
%0 Report %A Bringmann, Karl %A Krinninger, Sebastian %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T A Note on Hardness of Diameter Approximation : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-89B7-D %U http://arxiv.org/abs/1705.02127 %D 2017 %X We revisit the hardness of approximating the diameter of a network. In the CONGEST model, $ \tilde \Omega (n) $ rounds are necessary to compute the diameter [Frischknecht et al. SODA'12]. Abboud et al. DISC 2016 extended this result to sparse graphs and, at a more fine-grained level, showed that, for any integer $ 1 \leq \ell \leq \operatorname{polylog} (n) $, distinguishing between networks of diameter $ 4 \ell + 2 $ and $ 6 \ell + 1 $ requires $ \tilde \Omega (n) $ rounds. We slightly tighten this result by showing that even distinguishing between diameter $ 2 \ell + 1 $ and $ 3 \ell + 1 $ requires $ \tilde \Omega (n) $ rounds. The reduction of Abboud et al. is inspired by recent conditional lower bounds in the RAM model, where the orthogonal vectors problem plays a pivotal role. In our new lower bound, we make the connection to orthogonal vectors explicit, leading to a conceptually more streamlined exposition. This is suited for teaching both the lower bound in the CONGEST model and the conditional lower bound in the RAM model. %K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC
[209]
K. Bringmann, T. Dueholm Hansen, and S. Krinninger, “Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs,” 2017. [Online]. Available: http://arxiv.org/abs/1704.08122. (arXiv: 1704.08122)
Abstract
We study the problem of finding the cycle of minimum cost-to-time ratio in a directed graph with $ n $ nodes and $ m $ edges. This problem has a long history in combinatorial optimization and has recently seen interesting applications in the context of quantitative verification. We focus on strongly polynomial algorithms to cover the use-case where the weights are relatively large compared to the size of the graph. Our main result is an algorithm with running time $ \tilde O (m^{3/4} n^{3/2}) $, which gives the first improvement over Megiddo's $ \tilde O (n^3) $ algorithm [JACM'83] for sparse graphs. We further demonstrate how to obtain both an algorithm with running time $ n^3 / 2^{\Omega{(\sqrt{\log n})}} $ on general graphs and an algorithm with running time $ \tilde O (n) $ on constant treewidth graphs. To obtain our main result, we develop a parallel algorithm for negative cycle detection and single-source shortest paths that might be of independent interest.
Export
BibTeX
@online{DBLP:journals/corr/BringmannHK17, TITLE = {Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs}, AUTHOR = {Bringmann, Karl and Dueholm Hansen, Thomas and Krinninger, Sebastian}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1704.08122}, EPRINT = {1704.08122}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We study the problem of finding the cycle of minimum cost-to-time ratio in a directed graph with $ n $ nodes and $ m $ edges. This problem has a long history in combinatorial optimization and has recently seen interesting applications in the context of quantitative verification. We focus on strongly polynomial algorithms to cover the use-case where the weights are relatively large compared to the size of the graph. Our main result is an algorithm with running time $ \tilde O (m^{3/4} n^{3/2}) $, which gives the first improvement over Megiddo's $ \tilde O (n^3) $ algorithm [JACM'83] for sparse graphs. We further demonstrate how to obtain both an algorithm with running time $ n^3 / 2^{\Omega{(\sqrt{\log n})}} $ on general graphs and an algorithm with running time $ \tilde O (n) $ on constant treewidth graphs. To obtain our main result, we develop a parallel algorithm for negative cycle detection and single-source shortest paths that might be of independent interest.}, }
Endnote
%0 Report %A Bringmann, Karl %A Dueholm Hansen, Thomas %A Krinninger, Sebastian %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-89BC-3 %U http://arxiv.org/abs/1704.08122 %D 2017 %X We study the problem of finding the cycle of minimum cost-to-time ratio in a directed graph with $ n $ nodes and $ m $ edges. This problem has a long history in combinatorial optimization and has recently seen interesting applications in the context of quantitative verification. We focus on strongly polynomial algorithms to cover the use-case where the weights are relatively large compared to the size of the graph. Our main result is an algorithm with running time $ \tilde O (m^{3/4} n^{3/2}) $, which gives the first improvement over Megiddo's $ \tilde O (n^3) $ algorithm [JACM'83] for sparse graphs. We further demonstrate how to obtain both an algorithm with running time $ n^3 / 2^{\Omega{(\sqrt{\log n})}} $ on general graphs and an algorithm with running time $ \tilde O (n) $ on constant treewidth graphs. To obtain our main result, we develop a parallel algorithm for negative cycle detection and single-source shortest paths that might be of independent interest. %K Computer Science, Data Structures and Algorithms, cs.DS
[210]
K. Bringmann, T. Dueholm Hansen, and S. Krinninger, “Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs,” in 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Warsaw, Poland, 2017.
Export
BibTeX
@inproceedings{BringmannICALP2017, TITLE = {Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs}, AUTHOR = {Bringmann, Karl and Dueholm Hansen, Thomas and Krinninger, Sebastian}, LANGUAGE = {eng}, ISBN = {978-3-95977-041-5}, URL = {urn:nbn:de:0030-drops-74398}, DOI = {10.4230/LIPIcs.ICALP.2017.124}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, EDITOR = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca}, PAGES = {1--16}, EID = {124}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {80}, ADDRESS = {Warsaw, Poland}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Dueholm Hansen, Thomas %A Krinninger, Sebastian %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-89C4-F %R 10.4230/LIPIcs.ICALP.2017.124 %U urn:nbn:de:0030-drops-74398 %D 2017 %B 44th International Colloquium on Automata, Languages, and Programming %Z date of event: 2017-07-10 - 2017-07-14 %C Warsaw, Poland %B 44th International Colloquium on Automata, Languages, and Programming %E Chatzigiannakis, Ioannis; Indyk, Piotr; Kuhn, Fabian; Muscholl, Anca %P 1 - 16 %Z sequence number: 124 %I Schloss Dagstuhl %@ 978-3-95977-041-5 %B Leibniz International Proceedings in Informatics %N 80 %U http://drops.dagstuhl.de/opus/volltexte/2017/7439/http://drops.dagstuhl.de/doku/urheberrecht1.html
[211]
K. Bringmann, C. Ikenmeyer, and J. Zuiddam, “On Algebraic Branching Programs of Small Width,” Electronic Colloquium on Computational Complexity (ECCC) : Report Series, vol. 34 (Revision 1), 2017.
Export
BibTeX
@article{BringmannECCC2017, TITLE = {On Algebraic Branching Programs of Small Width}, AUTHOR = {Bringmann, Karl and Ikenmeyer, Christian and Zuiddam, Jeroen}, LANGUAGE = {eng}, ISSN = {1433-8092}, PUBLISHER = {Hasso-Plattner-Institut f{\"u}r Softwaretechnik GmbH}, ADDRESS = {Potsdam}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, JOURNAL = {Electronic Colloquium on Computational Complexity (ECCC) : Report Series}, VOLUME = {34 (Revision 1)}, PAGES = {1--30}, }
Endnote
%0 Journal Article %A Bringmann, Karl %A Ikenmeyer, Christian %A Zuiddam, Jeroen %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T On Algebraic Branching Programs of Small Width : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-89B2-8 %7 2017 %D 2017 %J Electronic Colloquium on Computational Complexity (ECCC) : Report Series %V 34 (Revision 1) %& 1 %P 1 - 30 %I Hasso-Plattner-Institut f&#252;r Softwaretechnik GmbH %C Potsdam %@ false %U https://eccc.weizmann.ac.il/report/2017/034/
[212]
K. Bringmann, C. Ikenmeyer, and J. Zuiddam, “On Algebraic Branching Programs of Small Width,” 2017. [Online]. Available: http://arxiv.org/abs/1702.05328. (arXiv: 1702.05328)
Abstract
In 1979 Valiant showed that the complexity class VP_e of families with polynomially bounded formula size is contained in the class VP_s of families that have algebraic branching programs (ABPs) of polynomially bounded size. Motivated by the problem of separating these classes we study the topological closure VP_e-bar, i.e. the class of polynomials that can be approximated arbitrarily closely by polynomials in VP_e. We describe VP_e-bar with a strikingly simple complete polynomial (in characteristic different from 2) whose recursive definition is similar to the Fibonacci numbers. Further understanding this polynomial seems to be a promising route to new formula lower bounds. Our methods are rooted in the study of ABPs of small constant width. In 1992 Ben-Or and Cleve showed that formula size is polynomially equivalent to width-3 ABP size. We extend their result (in characteristic different from 2) by showing that approximate formula size is polynomially equivalent to approximate width-2 ABP size. This is surprising because in 2011 Allender and Wang gave explicit polynomials that cannot be computed by width-2 ABPs at all! The details of our construction lead to the aforementioned characterization of VP_e-bar. As a natural continuation of this work we prove that the class VNP can be described as the class of families that admit a hypercube summation of polynomially bounded dimension over a product of polynomially many affine linear forms. This gives the first separations of algebraic complexity classes from their nondeterministic analogs.
Export
BibTeX
@online{BringmannArXiv2017, TITLE = {On Algebraic Branching Programs of Small Width}, AUTHOR = {Bringmann, Karl and Ikenmeyer, Christian and Zuiddam, Jeroen}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1702.05328}, EPRINT = {1702.05328}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {In 1979 Valiant showed that the complexity class VP_e of families with polynomially bounded formula size is contained in the class VP_s of families that have algebraic branching programs (ABPs) of polynomially bounded size. Motivated by the problem of separating these classes we study the topological closure VP_e-bar, i.e. the class of polynomials that can be approximated arbitrarily closely by polynomials in VP_e. We describe VP_e-bar with a strikingly simple complete polynomial (in characteristic different from 2) whose recursive definition is similar to the Fibonacci numbers. Further understanding this polynomial seems to be a promising route to new formula lower bounds. Our methods are rooted in the study of ABPs of small constant width. In 1992 Ben-Or and Cleve showed that formula size is polynomially equivalent to width-3 ABP size. We extend their result (in characteristic different from 2) by showing that approximate formula size is polynomially equivalent to approximate width-2 ABP size. This is surprising because in 2011 Allender and Wang gave explicit polynomials that cannot be computed by width-2 ABPs at all! The details of our construction lead to the aforementioned characterization of VP_e-bar. As a natural continuation of this work we prove that the class VNP can be described as the class of families that admit a hypercube summation of polynomially bounded dimension over a product of polynomially many affine linear forms. This gives the first separations of algebraic complexity classes from their nondeterministic analogs.}, }
Endnote
%0 Report %A Bringmann, Karl %A Ikenmeyer, Christian %A Zuiddam, Jeroen %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T On Algebraic Branching Programs of Small Width : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-89A4-8 %U http://arxiv.org/abs/1702.05328 %D 2017 %X In 1979 Valiant showed that the complexity class VP_e of families with polynomially bounded formula size is contained in the class VP_s of families that have algebraic branching programs (ABPs) of polynomially bounded size. Motivated by the problem of separating these classes we study the topological closure VP_e-bar, i.e. the class of polynomials that can be approximated arbitrarily closely by polynomials in VP_e. We describe VP_e-bar with a strikingly simple complete polynomial (in characteristic different from 2) whose recursive definition is similar to the Fibonacci numbers. Further understanding this polynomial seems to be a promising route to new formula lower bounds. Our methods are rooted in the study of ABPs of small constant width. In 1992 Ben-Or and Cleve showed that formula size is polynomially equivalent to width-3 ABP size. We extend their result (in characteristic different from 2) by showing that approximate formula size is polynomially equivalent to approximate width-2 ABP size. This is surprising because in 2011 Allender and Wang gave explicit polynomials that cannot be computed by width-2 ABPs at all! The details of our construction lead to the aforementioned characterization of VP_e-bar. As a natural continuation of this work we prove that the class VNP can be described as the class of families that admit a hypercube summation of polynomially bounded dimension over a product of polynomially many affine linear forms. This gives the first separations of algebraic complexity classes from their nondeterministic analogs. %K Computer Science, Computational Complexity, cs.CC,
[213]
K. Bringmann, C. Ikenmeyer, and J. Zuiddam, “On Algebraic Branching Programs of Small Width,” in 32nd Computational Complexity Conference (CCC 2017), Riga, Latvia, 2017.
Export
BibTeX
@inproceedings{BringmannCCC2017, TITLE = {On Algebraic Branching Programs of Small Width}, AUTHOR = {Bringmann, Karl and Ikenmeyer, Christian and Zuiddam, Jeroen}, LANGUAGE = {eng}, ISBN = {978-3-95977-040-8}, URL = {urn:nbn:de:0030-drops-75217}, DOI = {10.4230/LIPIcs.CCC.2017.20}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {32nd Computational Complexity Conference (CCC 2017)}, EDITOR = {O'Donnell, Ryan}, PAGES = {1--31}, EID = {20}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {79}, ADDRESS = {Riga, Latvia}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Ikenmeyer, Christian %A Zuiddam, Jeroen %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T On Algebraic Branching Programs of Small Width : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-FB78-C %R 10.4230/LIPIcs.CCC.2017.20 %U urn:nbn:de:0030-drops-75217 %D 2017 %B 32nd Computational Complexity Conference %Z date of event: 2017-07-06 - 2017-07-09 %C Riga, Latvia %B 32nd Computational Complexity Conference %E O'Donnell, Ryan %P 1 - 31 %Z sequence number: 20 %I Schloss Dagstuhl %@ 978-3-95977-040-8 %B Leibniz International Proceedings in Informatics %N 79 %U http://drops.dagstuhl.de/opus/volltexte/2017/7521/http://drops.dagstuhl.de/doku/urheberrecht1.html
[214]
K. Bringmann, P. Kolev, and D. Woodruff, “Approximation Algorithms for l_0-Low Rank Approximation,” in Advances in Neural Information Processing Systems 30 (NIPS 2017), Long Beach, CA, USA, 2017.
Export
BibTeX
@inproceedings{NIPS2018_7242, TITLE = {Approximation Algorithms for $\ell_0$-Low Rank Approximation}, AUTHOR = {Bringmann, Karl and Kolev, Pavel and Woodruff, David}, LANGUAGE = {eng}, PUBLISHER = {Curran Associates}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Advances in Neural Information Processing Systems 30 (NIPS 2017)}, EDITOR = {Guyon, I. and Luxburg, U. V. and Bengio, S. and Wallach, H. and Fergus, R. and Vishwanathan, S. and Garnett, R.}, PAGES = {6648--6659}, EID = {7242}, ADDRESS = {Long Beach, CA, USA}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Kolev, Pavel %A Woodruff, David %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Approximation Algorithms for l_0-Low Rank Approximation : %G eng %U http://hdl.handle.net/21.11116/0000-0002-9CF9-6 %D 2017 %B Thirty-first Conference on Neural Information Processing Systems %Z date of event: 2017-12-04 - 2017-12-09 %C Long Beach, CA, USA %B Advances in Neural Information Processing Systems 30 %E Guyon, I.; Luxburg, U. V.; Bengio, S.; Wallach, H.; Fergus, R.; Vishwanathan, S.; Garnett, R. %P 6648 - 6659 %Z sequence number: 7242 %I Curran Associates %U http://papers.nips.cc/paper/7242-approximation-algorithms-for-ell_0-low-rank-approximation
[215]
K. Bringmann, R. Keusch, J. Lengler, Y. Maus, and A. R. Molla, “Greedy Routing and the Algorithmic Small-World Phenomenon,” in PODC’17, ACM Symposium on Principles of Distributed Computing, Washington, DC, USA, 2017.
Export
BibTeX
@inproceedings{Bringmann_PODC2017, 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}, ISBN = {978-1-4503-4992-5}, DOI = {10.1145/3087801.3087829}, PUBLISHER = {ACM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {PODC'17, ACM Symposium on Principles of Distributed Computing}, PAGES = {371--380}, ADDRESS = {Washington, DC, USA}, }
Endnote
%0 Conference Proceedings %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-0002-9CF4-B %R 10.1145/3087801.3087829 %D 2017 %B ACM Symposium on Principles of Distributed Computing %Z date of event: 2017-07-25 - 2017-07-27 %C Washington, DC, USA %B PODC'17 %P 371 - 380 %I ACM %@ 978-1-4503-4992-5
[216]
K. Bringmann and M. Künnemann, “Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds,” International Journal of Computational Geometry and Applications, vol. 27, no. 1/2, 2017.
Export
BibTeX
@article{Bringmann2017j, TITLE = {Improved Approximation for {F}r\'{e}chet Distance on $c$-packed Curves Matching Conditional Lower Bounds}, AUTHOR = {Bringmann, Karl and K{\"u}nnemann, Marvin}, LANGUAGE = {eng}, ISSN = {0218-1959}, DOI = {10.1142/S0218195917600056}, PUBLISHER = {World Scientific}, ADDRESS = {Singapore}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, JOURNAL = {International Journal of Computational Geometry and Applications}, VOLUME = {27}, NUMBER = {1/2}, PAGES = {85--119}, }
Endnote
%0 Journal Article %A Bringmann, Karl %A K&#252;nnemann, Marvin %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Improved Approximation for Fr&#233;chet Distance on c-packed Curves Matching Conditional Lower Bounds : %G eng %U http://hdl.handle.net/21.11116/0000-0002-A902-D %R 10.1142/S0218195917600056 %7 2017 %D 2017 %J International Journal of Computational Geometry and Applications %V 27 %N 1/2 %& 85 %P 85 - 119 %I World Scientific %C Singapore %@ false
[217]
J. Bund, C. Lenzen, and M. Medina, “Near-Optimal Metastability-Containing Sorting Networks,” in Proceedings of the 2017 Design, Automation & Test in Europe (DATE 2017), Lausanne, Switzerland, 2017.
Export
BibTeX
@inproceedings{BundDATE2017, TITLE = {Near-Optimal Metastability-Containing Sorting Networks}, AUTHOR = {Bund, Johannes and Lenzen, Christoph and Medina, Moti}, LANGUAGE = {eng}, ISBN = {978-1-5090-5826-6}, DOI = {10.23919/DATE.2017.7926987}, PUBLISHER = {IEEE}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {Proceedings of the 2017 Design, Automation \& Test in Europe (DATE 2017)}, PAGES = {226--231}, ADDRESS = {Lausanne, Switzerland}, }
Endnote
%0 Conference Proceedings %A Bund, Johannes %A Lenzen, Christoph %A Medina, Moti %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Near-Optimal Metastability-Containing Sorting Networks : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-571A-2 %R 10.23919/DATE.2017.7926987 %D 2017 %B Design, Automation & Test in Europe Conference & Exhibition %Z date of event: 2017-03-27 - 2017-03-31 %C Lausanne, Switzerland %B Proceedings of the 2017 Design, Automation & Test in Europe %P 226 - 231 %I IEEE %@ 978-1-5090-5826-6
[218]
P. Bürgisser and C. Ikenmeyer, “Fundamental Invariants of Orbit Closures,” Journal of Algebra, vol. 477, 2017.
Export
BibTeX
@article{BI:17, TITLE = {Fundamental Invariants of Orbit Closures}, AUTHOR = {B{\"u}rgisser, Peter and Ikenmeyer, Christian}, LANGUAGE = {eng}, ISSN = {0021-8693}, DOI = {10.1016/j.jalgebra.2016.12.035}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, JOURNAL = {Journal of Algebra}, VOLUME = {477}, PAGES = {390--434}, }
Endnote
%0 Journal Article %A B&#252;rgisser, Peter %A Ikenmeyer, Christian %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Fundamental Invariants of Orbit Closures : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-4F2E-8 %R 10.1016/j.jalgebra.2016.12.035 %7 2017-01-17 %D 2017 %J Journal of Algebra %V 477 %& 390 %P 390 - 434 %I Elsevier %C Amsterdam %@ false
[219]
P. Bürgisser, C. Ikenmeyer, and J. Hüttenhain, “Permanent versus Determinant: Not via Saturations,” Proceedings of the American Mathematical Society, vol. 145, 2017.
Export
BibTeX
@article{BHI:17, TITLE = {Permanent versus Determinant: {N}ot via Saturations}, AUTHOR = {B{\"u}rgisser, Peter and Ikenmeyer, Christian and H{\"u}ttenhain, Jesko}, LANGUAGE = {eng}, ISSN = {0002-9939}, DOI = {10.1090/proc/13310}, PUBLISHER = {American Mathematical Society}, ADDRESS = {Providence, R.I. [etc.]}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, JOURNAL = {Proceedings of the American Mathematical Society}, VOLUME = {145}, PAGES = {1247--1258}, }
Endnote
%0 Journal Article %A B&#252;rgisser, Peter %A Ikenmeyer, Christian %A H&#252;ttenhain, Jesko %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Permanent versus Determinant: Not via Saturations : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-4F48-A %R 10.1090/proc/13310 %7 2017 %D 2017 %J Proceedings of the American Mathematical Society %V 145 %& 1247 %P 1247 - 1258 %I American Mathematical Society %C Providence, R.I. [etc.] %@ false
[220]
P. Chalermsook and A. Schmid, “Finding Triangles for Maximum Planar Subgraphs,” in WALCOM: Algorithms and Computation, Hsinchu, Taiwan, 2017.
Export
BibTeX
@inproceedings{PCAS2017, TITLE = {Finding Triangles for Maximum Planar Subgraphs}, AUTHOR = {Chalermsook, Parinya and Schmid, Andreas}, LANGUAGE = {eng}, ISBN = {978-3-319-53924-9}, DOI = {10.1007/978-3-319-53925-6_29}, PUBLISHER = {Springer}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {WALCOM: Algorithms and Computation}, EDITOR = {Poon, Sheung-Hung and Rahman, Md. Saidur and Yen, Hsu-Chun}, PAGES = {373--384}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {10167}, ADDRESS = {Hsinchu, Taiwan}, }
Endnote
%0 Conference Proceedings %A Chalermsook, Parinya %A Schmid, Andreas %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Finding Triangles for Maximum Planar Subgraphs : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-5DDC-F %R 10.1007/978-3-319-53925-6_29 %D 2017 %B 11th International Conference and Workshops on Algorithms and Computation %Z date of event: 2017-03-29 - 2017-03-31 %C Hsinchu, Taiwan %B WALCOM: Algorithms and Computation %E Poon, Sheung-Hung; Rahman, Md. Saidur; Yen, Hsu-Chun %P 373 - 384 %I Springer %@ 978-3-319-53924-9 %B Lecture Notes in Computer Science %N 10167
[221]
P. Chalermsook, S. Das, B. Laekhanukit, and D. Vaz, “Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs,” in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), Barcelona, Spain, 2017.
Export
BibTeX
@inproceedings{doi:10.1137/1.9781611974782.47, TITLE = {Beyond Metric Embedding: {A}pproximating {Group Steiner Trees} on Bounded Treewidth Graphs}, AUTHOR = {Chalermsook, Parinya and Das, Syamantak and Laekhanukit, Bundit and Vaz, Daniel}, LANGUAGE = {eng}, DOI = {10.1137/1.9781611974782.47}, PUBLISHER = {SIAM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017)}, EDITOR = {Klein, Philip N.}, PAGES = {737--751}, ADDRESS = {Barcelona, Spain}, }
Endnote
%0 Conference Proceedings %A Chalermsook, Parinya %A Das, Syamantak %A Laekhanukit, Bundit %A Vaz, Daniel %+ 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 %T Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-573D-3 %R 10.1137/1.9781611974782.47 %D 2017 %B Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2017-01-16 - 2017-01-19 %C Barcelona, Spain %B Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms %E Klein, Philip N. %P 737 - 751 %I SIAM
[222]
P. Chalermsook and D. Vaz, “New Integrality Gap Results for the Firefighters Problem on Trees,” in Approximation and Online Algorithms (WAOA 2016), Aarhus, Denmark, 2017.
Export
BibTeX
@inproceedings{Chalermsook2017, TITLE = {New Integrality Gap Results for the Firefighters Problem on Trees}, AUTHOR = {Chalermsook, Parinya and Vaz, Daniel}, LANGUAGE = {eng}, ISBN = {978-3-319-51740-7}, DOI = {10.1007/978-3-319-51741-4_6}, PUBLISHER = {Springer}, YEAR = {2016}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {Approximation and Online Algorithms (WAOA 2016)}, EDITOR = {Jansen, Klaus and Mastrolilli, Monaldo}, PAGES = {65--77}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {10138}, ADDRESS = {Aarhus, Denmark}, }
Endnote
%0 Conference Proceedings %A Chalermsook, Parinya %A Vaz, Daniel %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T New Integrality Gap Results for the Firefighters Problem on Trees : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-575B-0 %R 10.1007/978-3-319-51741-4_6 %D 2017 %B 14th Workshop on Approximation and Online Algorithms %Z date of event: 2016-08-25 - 2016-08-26 %C Aarhus, Denmark %B Approximation and Online Algorithms %E Jansen, Klaus; Mastrolilli, Monaldo %P 65 - 77 %I Springer %@ 978-3-319-51740-7 %B Lecture Notes in Computer Science %N 10138
[223]
L. S. Chandran, D. Issac, and A. Karrenbauer, “On the Parameterized Complexity of Biclique Cover and Partition,” in 11th International Symposium on Parameterized and Exact Computation (IPEC 2016), Aarhus, Denmark, 2017.
Export
BibTeX
@inproceedings{BicliqueFPT, TITLE = {On the Parameterized Complexity of Biclique Cover and Partition}, AUTHOR = {Chandran, L. Sunil and Issac, Davis and Karrenbauer, Andreas}, LANGUAGE = {eng}, ISBN = {978-3-95977-023-1}, URL = {urn:nbn:de:0030-drops-69293}, DOI = {10.4230/LIPIcs.IPEC.2016.11}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2016}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)}, EDITOR = {Guo, Jiong and Hermelin, Danny}, PAGES = {1--13}, EID = {11}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {63}, ADDRESS = {Aarhus, Denmark}, }
Endnote
%0 Conference Proceedings %A Chandran, L. Sunil %A Issac, Davis %A Karrenbauer, Andreas %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T On the Parameterized Complexity of Biclique Cover and Partition : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-53DB-3 %R 10.4230/LIPIcs.IPEC.2016.11 %U urn:nbn:de:0030-drops-69293 %D 2017 %B 11th International Symposium on Parameterized and Exact Computation %Z date of event: 2016-08-24 - 2016-08-26 %C Aarhus, Denmark %B 11th International Symposium on Parameterized and Exact Computation %E Guo, Jiong; Hermelin, Danny %P 1 - 13 %Z sequence number: 11 %I Schloss Dagstuhl %@ 978-3-95977-023-1 %B Leibniz International Proceedings in Informatics %N 63 %U http://drops.dagstuhl.de/opus/volltexte/2017/6929/http://drops.dagstuhl.de/doku/urheberrecht1.html
[224]
L. Chiantini, C. Ikenmeyer, J. M. Landsberg, and G. Ottaviani, “The Geometry of Rank Decompositions of Matrix Multiplication I: 2x2 Matrices,” Experimental Mathematics, 2017.
Export
BibTeX
@article{Chiantini2017, TITLE = {The geometry of rank decompositions of matrix multiplication I: $2\times 2$ matrices}, AUTHOR = {Chiantini, Luca and Ikenmeyer, Christian and Landsberg, J. M. and Ottaviani, Giorgio}, LANGUAGE = {eng}, ISSN = {1058-6458}, DOI = {10.1080/10586458.2017.1403981}, PUBLISHER = {Taylor \& Francis}, ADDRESS = {Boston, MA}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, JOURNAL = {Experimental Mathematics}, }
Endnote
%0 Journal Article %A Chiantini, Luca %A Ikenmeyer, Christian %A Landsberg, J. M. %A Ottaviani, Giorgio %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T The Geometry of Rank Decompositions of Matrix Multiplication I: 2x2 Matrices : %G eng %U http://hdl.handle.net/21.11116/0000-0002-AB12-9 %R 10.1080/10586458.2017.1403981 %7 2017 %D 2017 %J Experimental Mathematics %I Taylor & Francis %C Boston, MA %@ false
[225]
A. Choudhary, “Approximation Algorithms for Vietoris-Rips and Ĉech Filtrations,” Universität des Saarlandes, Saarbrücken, 2017.
Abstract
Persistent Homology is a tool to analyze and visualize the shape of data from a topological viewpoint. It computes persistence, which summarizes the evolution of topological and geometric information about metric spaces over multiple scales of distances. While computing persistence is quite efficient for low-dimensional topological features, it becomes overwhelmingly expensive for medium to high-dimensional features. In this thesis, we attack this computational problem from several different angles. We present efficient techniques to approximate the persistence of metric spaces. Three of our methods are tailored towards general point clouds in Euclidean spaces. We make use of high dimensional lattice geometry to reduce the cost of the approximations. In particular, we discover several properties of the Permutahedral lattice, whose Voronoi cell is well-known for its combinatorial properties. The last method is suitable for point clouds with low intrinsic dimension, where we exploit the structural properties of the point set to tame the complexity. In some cases, we achieve a reduction in size complexity by trading off the quality of the approximation. Two of our methods work particularly well in conjunction with dimension-reduction techniques: we arrive at the first approximation schemes whose complexities are only polynomial in the size of the point cloud, and independent of the ambient dimension. On the other hand, we provide a lower bound result: we construct a point cloud that requires super-polynomial complexity for a high-quality approximation of the persistence. Together with our approximation schemes, we show that polynomial complexity is achievable for rough approximations, but impossible for sufficiently fine approximations. For some metric spaces, the intrinsic dimension is low in small neighborhoods of the input points, but much higher for large scales of distances. We develop a concept of local intrinsic dimension to capture this property. We also present several applications of this concept, including an approximation method for persistence. This thesis is written in English.
Export
BibTeX
@phdthesis{Choudharyphd2017, TITLE = {Approximation Algorithms for {V}ietoris-Rips and \v{C}ech Filtrations}, AUTHOR = {Choudhary, Aruni}, LANGUAGE = {eng}, URL = {urn:nbn:de:bsz:291-scidok-ds-269597}, DOI = {10.22028/D291-26959}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, ABSTRACT = {Persistent Homology is a tool to analyze and visualize the shape of data from a topological viewpoint. It computes persistence, which summarizes the evolution of topological and geometric information about metric spaces over multiple scales of distances. While computing persistence is quite efficient for low-dimensional topological features, it becomes overwhelmingly expensive for medium to high-dimensional features. In this thesis, we attack this computational problem from several different angles. We present efficient techniques to approximate the persistence of metric spaces. Three of our methods are tailored towards general point clouds in Euclidean spaces. We make use of high dimensional lattice geometry to reduce the cost of the approximations. In particular, we discover several properties of the Permutahedral lattice, whose Voronoi cell is well-known for its combinatorial properties. The last method is suitable for point clouds with low intrinsic dimension, where we exploit the structural properties of the point set to tame the complexity. In some cases, we achieve a reduction in size complexity by trading off the quality of the approximation. Two of our methods work particularly well in conjunction with dimension-reduction techniques: we arrive at the first approximation schemes whose complexities are only polynomial in the size of the point cloud, and independent of the ambient dimension. On the other hand, we provide a lower bound result: we construct a point cloud that requires super-polynomial complexity for a high-quality approximation of the persistence. Together with our approximation schemes, we show that polynomial complexity is achievable for rough approximations, but impossible for sufficiently fine approximations. For some metric spaces, the intrinsic dimension is low in small neighborhoods of the input points, but much higher for large scales of distances. We develop a concept of local intrinsic dimension to capture this property. We also present several applications of this concept, including an approximation method for persistence. This thesis is written in English.}, }
Endnote
%0 Thesis %A Choudhary, Aruni %A referee: Kerber, Michael %Y Mehlhorn, Kurt %+ 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 %T Approximation Algorithms for Vietoris-Rips and &#264;ech Filtrations : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-8D63-5 %U urn:nbn:de:bsz:291-scidok-ds-269597 %R 10.22028/D291-26959 %I Universit&#228;t des Saarlandes %C Saarbr&#252;cken %D 2017 %P 123 p. %V phd %9 phd %X Persistent Homology is a tool to analyze and visualize the shape of data from a topological viewpoint. It computes persistence, which summarizes the evolution of topological and geometric information about metric spaces over multiple scales of distances. While computing persistence is quite efficient for low-dimensional topological features, it becomes overwhelmingly expensive for medium to high-dimensional features. In this thesis, we attack this computational problem from several different angles. We present efficient techniques to approximate the persistence of metric spaces. Three of our methods are tailored towards general point clouds in Euclidean spaces. We make use of high dimensional lattice geometry to reduce the cost of the approximations. In particular, we discover several properties of the Permutahedral lattice, whose Voronoi cell is well-known for its combinatorial properties. The last method is suitable for point clouds with low intrinsic dimension, where we exploit the structural properties of the point set to tame the complexity. In some cases, we achieve a reduction in size complexity by trading off the quality of the approximation. Two of our methods work particularly well in conjunction with dimension-reduction techniques: we arrive at the first approximation schemes whose complexities are only polynomial in the size of the point cloud, and independent of the ambient dimension. On the other hand, we provide a lower bound result: we construct a point cloud that requires super-polynomial complexity for a high-quality approximation of the persistence. Together with our approximation schemes, we show that polynomial complexity is achievable for rough approximations, but impossible for sufficiently fine approximations. For some metric spaces, the intrinsic dimension is low in small neighborhoods of the input points, but much higher for large scales of distances. We develop a concept of local intrinsic dimension to capture this property. We also present several applications of this concept, including an approximation method for persistence. This thesis is written in English. %U https://publikationen.sulb.uni-saarland.de/handle/20.500.11880/26911
[226]
A. Choudhary, M. Kerber, and S. Raghvendra, “Improved Approximate Rips Filtrations with Shifted Integer Lattices,” in 25th Annual European Symposium on Algorithms (ESA 2017), Vienna, Austria, 2017.
Export
BibTeX
@inproceedings{Choudhary-barycentric, TITLE = {Improved Approximate Rips Filtrations with Shifted Integer Lattices}, AUTHOR = {Choudhary, Aruni and Kerber, Michael and Raghvendra, Sharath}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-049-1}, URL = {urn:nbn:de:0030-drops-78259}, DOI = {10.4230/LIPIcs.ESA.2017.28}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {25th Annual European Symposium on Algorithms (ESA 2017)}, EDITOR = {Pruhs, Kirk and Sohler, Christian}, PAGES = {1--13}, EID = {28}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {87}, ADDRESS = {Vienna, Austria}, }
Endnote
%0 Conference Proceedings %A Choudhary, Aruni %A Kerber, Michael %A Raghvendra, Sharath %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Improved Approximate Rips Filtrations with Shifted Integer Lattices : %G eng %U http://hdl.handle.net/21.11116/0000-0002-E5B9-B %R 10.4230/LIPIcs.ESA.2017.28 %U urn:nbn:de:0030-drops-78259 %D 2017 %B 25th Annual European Symposium on Algorithms %Z date of event: 2017-09-04 - 2017-09-06 %C Vienna, Austria %B 25th Annual European Symposium on Algorithms %E Pruhs, Kirk; Sohler, Christian %P 1 - 13 %Z sequence number: 28 %I Schloss Dagstuhl %@ 978-3-95977-049-1 %B Leibniz International Proceedings in Informatics %N 87 %@ false %U http://drops.dagstuhl.de/opus/volltexte/2017/7825/http://drops.dagstuhl.de/doku/urheberrecht1.html
[227]
C. Croitoru, “Graph Models for Rational Social Interaction,” Universität des Saarlandes, Saarbrücken, 2017.
Export
BibTeX
@phdthesis{CroitoruPhd2017, TITLE = {Graph Models for Rational Social Interaction}, AUTHOR = {Croitoru, Cosmina}, LANGUAGE = {eng}, URL = {urn:nbn:de:bsz:291-scidok-ds-270576}, DOI = {10.22028/D291-27057}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, }
Endnote
%0 Thesis %A Croitoru, Cosmina %Y Mehlhorn, Kurt %A referee: Amgoud, Leila %+ 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 %T Graph Models for Rational Social Interaction : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-87DE-5 %R 10.22028/D291-27057 %U urn:nbn:de:bsz:291-scidok-ds-270576 %I Universit&#228;t des Saarlandes %C Saarbr&#252;cken %D 2017 %P X, 75 p. %V phd %9 phd %U https://publikationen.sulb.uni-saarland.de/handle/20.500.11880/26954
[228]
M. Cygan, M. Pilipczuk, M. Pilipczuk, E. J. van Leeuwen, and M. Wrochna, “Polynomial Kernelization for Removing Induced Claws and Diamonds,” Theory of Computing Systems, vol. 60, no. 4, 2017.
Export
BibTeX
@article{CyganAlgorithmica2016, TITLE = {Polynomial Kernelization for Removing Induced Claws and Diamonds}, AUTHOR = {Cygan, Marek and Pilipczuk, Marcin and Pilipczuk, Micha{\l} and van Leeuwen, Erik Jan and Wrochna, Marcin}, LANGUAGE = {eng}, ISSN = {1432-4350}, DOI = {10.1007/s00224-016-9689-x}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, JOURNAL = {Theory of Computing Systems}, VOLUME = {60}, NUMBER = {4}, PAGES = {615--636}, }
Endnote
%0 Journal Article %A Cygan, Marek %A Pilipczuk, Marcin %A Pilipczuk, Micha&#322; %A van Leeuwen, Erik Jan %A Wrochna, Marcin %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Polynomial Kernelization for Removing Induced Claws and Diamonds : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002B-8606-6 %R 10.1007/s00224-016-9689-x %7 2016-06-23 %D 2017 %J Theory of Computing Systems %V 60 %N 4 %& 615 %P 615 - 636 %I Springer %C New York, NY %@ false
[229]
J. Diaz, O. Pottonen, M. Serna, and E. J. van Leeuwen, “Complexity of Metric Dimension on Planar Graphs,” Journal of Computer and System Sciences, vol. 83, no. 1, 2017.
Export
BibTeX
@article{Diaz2017, TITLE = {Complexity of Metric Dimension on Planar Graphs}, AUTHOR = {Diaz, Josep and Pottonen, Olli and Serna, Maria and van Leeuwen, Erik Jan}, ISSN = {0022-0000}, DOI = {10.1016/j.jcss.2016.06.006}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, JOURNAL = {Journal of Computer and System Sciences}, VOLUME = {83}, NUMBER = {1}, PAGES = {132--158}, }
Endnote
%0 Journal Article %A Diaz, Josep %A Pottonen, Olli %A Serna, Maria %A van Leeuwen, Erik Jan %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Complexity of Metric Dimension on Planar Graphs : %U http://hdl.handle.net/11858/00-001M-0000-002B-A574-5 %R 10.1016/j.jcss.2016.06.006 %7 2016 %D 2017 %J Journal of Computer and System Sciences %V 83 %N 1 %& 132 %P 132 - 158 %I Elsevier %C Amsterdam %@ false
[230]
M. Dirnberger and K. Mehlhorn, “Characterizing Networks Formed by P. Polycephalum,” Journal of Physics D: Applied Physics, vol. 50, no. 22, 2017.
Export
BibTeX
@article{Dirnberg_Mehlhorn2017, TITLE = {Characterizing networks formed by \textsl{P. polycephalum}}, AUTHOR = {Dirnberger, Michael and Mehlhorn, Kurt}, LANGUAGE = {eng}, ISSN = {0022-3727}, DOI = {10.1088/1361-6463/aa6e7b}, PUBLISHER = {IOP Publishing}, ADDRESS = {Bristol}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, JOURNAL = {Journal of Physics D: Applied Physics}, VOLUME = {50}, NUMBER = {22}, EID = {224002}, }
Endnote
%0 Journal Article %A Dirnberger, Michael %A Mehlhorn, Kurt %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Characterizing Networks Formed by P. Polycephalum : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-56FA-2 %R 10.1088/1361-6463/aa6e7b %7 2017 %D 2017 %J Journal of Physics D: Applied Physics %O J. Phys. D: Appl. Phys. %V 50 %N 22 %Z sequence number: 224002 %I IOP Publishing %C Bristol %@ false
[231]
M. Dirnberger, K. Mehlhorn, and T. Mehlhorn, “Introducing the Slime Mold Graph Repository,” Journal of Physics D: Applied Physics, vol. 50, no. 26, 2017.
Export
BibTeX
@article{Dirnberger2017, TITLE = {Introducing the Slime Mold Graph Repository}, AUTHOR = {Dirnberger, Michael and Mehlhorn, Kurt and Mehlhorn, Tim}, LANGUAGE = {eng}, ISSN = {0022-3727}, DOI = {10.1088/1361-6463/aa7326}, PUBLISHER = {IOP Publishing}, ADDRESS = {Bristol}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, JOURNAL = {Journal of Physics D: Applied Physics}, VOLUME = {50}, NUMBER = {26}, EID = {264001}, }
Endnote
%0 Journal Article %A Dirnberger, Michael %A Mehlhorn, Kurt %A Mehlhorn, Tim %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Introducing the Slime Mold Graph Repository : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-8464-B %R 10.1088/1361-6463/aa7326 %7 2017 %D 2017 %J Journal of Physics D: Applied Physics %O J. Phys. D: Appl. Phys. %V 50 %N 26 %Z sequence number: 264001 %I IOP Publishing %C Bristol %@ false
[232]
M. Dirnberger, “Preliminaries for Distributed Natural Computing Inspired by the Slime Mold Physarum Polycephalum,” Universität des Saarlandes, Saarbrücken, 2017.
Abstract
This doctoral thesis aims towards distributed natural computing inspired by the slime mold Physarum polycephalum. The vein networks formed by this organism presumably support efficient transport of protoplasmic fluid. Devising models which capture the natural efficiency of the organism and form a suitable basis for the development of natural computing algorithms is an interesting and challenging goal. We start working towards this goal by designing and executing wet-lab experi- ments geared towards producing a large number of images of the vein networks of P. polycephalum. Next, we turn the depicted vein networks into graphs using our own custom software called Nefi. This enables a detailed numerical study, yielding a catalogue of characterizing observables spanning a wide array of different graph properties. To share our results and data, i.e. raw experimental data, graphs and analysis results, we introduce a dedicated repository revolving around slime mold data, the Smgr. The purpose of this repository is to promote data reuse and to foster a practice of increased data sharing. Finally we present a model based on interacting electronic circuits including current controlled voltage sources, which mimics the emergent flow patterns observed in live P. polycephalum. The model is simple, distributed and robust to changes in the underlying network topology. Thus it constitutes a promising basis for the development of distributed natural computing algorithms.
Export
BibTeX
@phdthesis{dirnbergerphd17, TITLE = {Preliminaries for Distributed Natural Computing Inspired by the Slime Mold Physarum Polycephalum}, AUTHOR = {Dirnberger, Michael}, LANGUAGE = {eng}, URL = {urn:nbn:de:bsz:291-scidok-69424}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, ABSTRACT = {This doctoral thesis aims towards distributed natural computing inspired by the slime mold Physarum polycephalum. The vein networks formed by this organism presumably support efficient transport of protoplasmic fluid. Devising models which capture the natural efficiency of the organism and form a suitable basis for the development of natural computing algorithms is an interesting and challenging goal. We start working towards this goal by designing and executing wet-lab experi- ments geared towards producing a large number of images of the vein networks of P. polycephalum. Next, we turn the depicted vein networks into graphs using our own custom software called Nefi. This enables a detailed numerical study, yielding a catalogue of characterizing observables spanning a wide array of different graph properties. To share our results and data, i.e. raw experimental data, graphs and analysis results, we introduce a dedicated repository revolving around slime mold data, the Smgr. The purpose of this repository is to promote data reuse and to foster a practice of increased data sharing. Finally we present a model based on interacting electronic circuits including current controlled voltage sources, which mimics the emergent flow patterns observed in live P. polycephalum. The model is simple, distributed and robust to changes in the underlying network topology. Thus it constitutes a promising basis for the development of distributed natural computing algorithms.}, }
Endnote
%0 Thesis %A Dirnberger, Michael %Y Mehlhorn, Kurt %A referee: Grube, Martin %A referee: D&#246;bereiner, Hans-G&#252;nther %+ 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 %T Preliminaries for Distributed Natural Computing Inspired by the Slime Mold Physarum Polycephalum : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-DE4F-0 %U urn:nbn:de:bsz:291-scidok-69424 %I Universit&#228;t des Saarlandes %C Saarbr&#252;cken %D 2017 %P XV, 193 p. %V phd %9 phd %X This doctoral thesis aims towards distributed natural computing inspired by the slime mold Physarum polycephalum. The vein networks formed by this organism presumably support efficient transport of protoplasmic fluid. Devising models which capture the natural efficiency of the organism and form a suitable basis for the development of natural computing algorithms is an interesting and challenging goal. We start working towards this goal by designing and executing wet-lab experi- ments geared towards producing a large number of images of the vein networks of P. polycephalum. Next, we turn the depicted vein networks into graphs using our own custom software called Nefi. This enables a detailed numerical study, yielding a catalogue of characterizing observables spanning a wide array of different graph properties. To share our results and data, i.e. raw experimental data, graphs and analysis results, we introduce a dedicated repository revolving around slime mold data, the Smgr. The purpose of this repository is to promote data reuse and to foster a practice of increased data sharing. Finally we present a model based on interacting electronic circuits including current controlled voltage sources, which mimics the emergent flow patterns observed in live P. polycephalum. The model is simple, distributed and robust to changes in the underlying network topology. Thus it constitutes a promising basis for the development of distributed natural computing algorithms. %U http://scidok.sulb.uni-saarland.de/volltexte/2017/6942/http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=de
[233]
P. Duetting, M. Feldman, T. Kesselheim, and B. Lucier, “Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Non-Stochastic Inputs,” in 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017), Berkeley, CA, USA, 2017.
Export
BibTeX
@inproceedings{Duetting_FOCS2017, TITLE = {Prophet Inequalities Made Easy: {S}tochastic Optimization by Pricing Non-Stochastic Inputs}, AUTHOR = {Duetting, Paul and Feldman, Michal and Kesselheim, Thomas and Lucier, Brendan}, LANGUAGE = {eng}, ISBN = {978-1-5386-3464-6}, DOI = {10.1109/FOCS.2017.56}, PUBLISHER = {IEEE}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {58th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017)}, PAGES = {540--551}, ADDRESS = {Berkeley, CA, USA}, }
Endnote
%0 Conference Proceedings %A Duetting, Paul %A Feldman, Michal %A Kesselheim, Thomas %A Lucier, Brendan %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Non-Stochastic Inputs : %G eng %U http://hdl.handle.net/21.11116/0000-0002-C5AE-C %R 10.1109/FOCS.2017.56 %D 2017 %B 58th Annual IEEE Symposium on Foundations of Computer Science %Z date of event: 2017-10-15 - 2017-10-17 %C Berkeley, CA, USA %B 58th Annual IEEE Symposium on Foundations of Computer Science %P 540 - 551 %I IEEE %@ 978-1-5386-3464-6
[234]
L. Duraj, M. Künnemann, and A. Polak, “Tight Conditional Lower Bounds for Longest Common Increasing Subsequence,” 2017. [Online]. Available: http://arxiv.org/abs/1709.10075. (arXiv: 1709.10075)
Abstract
We consider the canonical generalization of the well-studied Longest Increasing Subsequence problem to multiple sequences, called $k$-LCIS: Given $k$ integer sequences $X_1,\dots,X_k$ of length at most $n$, the task is to determine the length of the longest common subsequence of $X_1,\dots,X_k$ that is also strictly increasing. Especially for the case of $k=2$ (called LCIS for short), several algorithms have been proposed that require quadratic time in the worst case. Assuming the Strong Exponential Time Hypothesis (SETH), we prove a tight lower bound, specifically, that no algorithm solves LCIS in (strongly) subquadratic time. Interestingly, the proof makes no use of normalization tricks common to hardness proofs for similar problems such as LCS. We further strengthen this lower bound (1) to rule out $O((nL)^{1-\varepsilon})$ time algorithms for LCIS, where $L$ denotes the solution size, (2) to rule out $O(n^{k-\varepsilon})$ time algorithms for $k$-LCIS, and (3) to follow already from weaker variants of SETH. We obtain the same conditional lower bounds for the related Longest Common Weakly Increasing Subsequence problem.
Export
BibTeX
@online{Duraj_arXiv1709.10075, TITLE = {Tight Conditional Lower Bounds for Longest Common Increasing Subsequence}, AUTHOR = {Duraj, Lech and K{\"u}nnemann, Marvin and Polak, Adam}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1709.10075}, EPRINT = {1709.10075}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We consider the canonical generalization of the well-studied Longest Increasing Subsequence problem to multiple sequences, called $k$-LCIS: Given $k$ integer sequences $X_1,\dots,X_k$ of length at most $n$, the task is to determine the length of the longest common subsequence of $X_1,\dots,X_k$ that is also strictly increasing. Especially for the case of $k=2$ (called LCIS for short), several algorithms have been proposed that require quadratic time in the worst case. Assuming the Strong Exponential Time Hypothesis (SETH), we prove a tight lower bound, specifically, that no algorithm solves LCIS in (strongly) subquadratic time. Interestingly, the proof makes no use of normalization tricks common to hardness proofs for similar problems such as LCS. We further strengthen this lower bound (1) to rule out $O((nL)^{1-\varepsilon})$ time algorithms for LCIS, where $L$ denotes the solution size, (2) to rule out $O(n^{k-\varepsilon})$ time algorithms for $k$-LCIS, and (3) to follow already from weaker variants of SETH. We obtain the same conditional lower bounds for the related Longest Common Weakly Increasing Subsequence problem.}, }
Endnote
%0 Report %A Duraj, Lech %A K&#252;nnemann, Marvin %A Polak, Adam %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Tight Conditional Lower Bounds for Longest Common Increasing Subsequence : %G eng %U http://hdl.handle.net/21.11116/0000-0002-A8EB-8 %U http://arxiv.org/abs/1709.10075 %D 2017 %X We consider the canonical generalization of the well-studied Longest Increasing Subsequence problem to multiple sequences, called $k$-LCIS: Given $k$ integer sequences $X_1,\dots,X_k$ of length at most $n$, the task is to determine the length of the longest common subsequence of $X_1,\dots,X_k$ that is also strictly increasing. Especially for the case of $k=2$ (called LCIS for short), several algorithms have been proposed that require quadratic time in the worst case. Assuming the Strong Exponential Time Hypothesis (SETH), we prove a tight lower bound, specifically, that no algorithm solves LCIS in (strongly) subquadratic time. Interestingly, the proof makes no use of normalization tricks common to hardness proofs for similar problems such as LCS. We further strengthen this lower bound (1) to rule out $O((nL)^{1-\varepsilon})$ time algorithms for LCIS, where $L$ denotes the solution size, (2) to rule out $O(n^{k-\varepsilon})$ time algorithms for $k$-LCIS, and (3) to follow already from weaker variants of SETH. We obtain the same conditional lower bounds for the related Longest Common Weakly Increasing Subsequence problem. %K Computer Science, Computational Complexity, cs.CC
[235]
L. Duraj, M. Künnemann, and A. Polak, “Tight Conditional Lower Bounds for Longest Common Increasing Subsequence,” in 12th International Symposium on Parameterized and Exact Computation (IPEC 2017), Vienna, Austria, 2017.
Export
BibTeX
@inproceedings{Duraj_IPEC2017, TITLE = {Tight Conditional Lower Bounds for Longest Common Increasing Subsequence}, AUTHOR = {Duraj, Lech and K{\"u}nnemann, Marvin and Polak, Adam}, LANGUAGE = {eng}, ISBN = {978-3-95977-051-4}, URL = {urn:nbn:de:0030-drops-85706}, DOI = {10.4230/LIPIcs.IPEC.2017.15}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, EDITOR = {Lokshtanov, Daniel and Nishimura, Naomi}, PAGES = {1--13}, EID = {15}, SERIES = {Leibniz International Proceedings in Informatics}, ADDRESS = {Vienna, Austria}, }
Endnote
%0 Conference Proceedings %A Duraj, Lech %A K&#252;nnemann, Marvin %A Polak, Adam %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Tight Conditional Lower Bounds for Longest Common Increasing Subsequence : %G eng %U http://hdl.handle.net/21.11116/0000-0002-A8E9-A %R 10.4230/LIPIcs.IPEC.2017.15 %U urn:nbn:de:0030-drops-85706 %D 2017 %B 12th International Symposium on Parameterized and Exact Computation %Z date of event: 2017-09-06 - 2017-09-08 %C Vienna, Austria %B 12th International Symposium on Parameterized and Exact Computation %E Lokshtanov, Daniel; Nishimura, Naomi %P 1 - 13 %Z sequence number: 15 %I Schloss Dagstuhl %@ 978-3-95977-051-4 %B Leibniz International Proceedings in Informatics %U http://drops.dagstuhl.de/opus/volltexte/2018/8570/http://drops.dagstuhl.de/doku/urheberrecht1.html
[236]
K. Dutta, A. Ghosh, B. Jartoux, and N. H. Mustafa, “Shallow Packings, Semialgebraic Set Systems, Macbeath Regions and Polynomial Partitioning,” in 33rd International Symposium on Computational Geometry (SoCG 2017), Brisbane, Australia, 2017.
Export
BibTeX
@inproceedings{DuttaGJM-Mnets-17, TITLE = {Shallow Packings, Semialgebraic Set Systems, {Macbeath} Regions and Polynomial Partitioning}, AUTHOR = {Dutta, Kunal and Ghosh, Arijit and Jartoux, Bruno and Mustafa, Nabil H.}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-038-5}, URL = {urn:nbn:de:0030-drops-71991}, DOI = {10.4230/LIPIcs.SoCG.2017.38}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {33rd International Symposium on Computational Geometry (SoCG 2017)}, EDITOR = {Aronov, Boris and Katz, Matthew J.}, PAGES = {1--15}, EID = {38}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {77}, ADDRESS = {Brisbane, Australia}, }
Endnote
%0 Conference Proceedings %A Dutta, Kunal %A Ghosh, Arijit %A Jartoux, Bruno %A Mustafa, Nabil H. %+ 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 Shallow Packings, Semialgebraic Set Systems, Macbeath Regions and Polynomial Partitioning : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-7941-7 %R 10.4230/LIPIcs.SoCG.2017.38 %U urn:nbn:de:0030-drops-71991 %D 2017 %B 33rd International Symposium on Computational Geometry %Z date of event: 2017-07-04 - 2017-07-07 %C Brisbane, Australia %B 33rd International Symposium on Computational Geometry %E Aronov, Boris; Katz, Matthew J. %P 1 - 15 %Z sequence number: 38 %I Schloss Dagstuhl %@ 978-3-95977-038-5 %B Leibniz International Proceedings in Informatics %N 77 %@ false %U http://drops.dagstuhl.de/opus/volltexte/2017/7199/http://drops.dagstuhl.de/doku/urheberrecht1.html
[237]
P. Dütting and T. Kesselheim, “Best-Response Dynamics in Combinatorial Auctions with Item Bidding,” in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), Barcelona, Spain, 2017.
Export
BibTeX
@inproceedings{doi:10.1137/1.9781611974782.33, TITLE = {Best-Response Dynamics in Combinatorial Auctions with Item Bidding}, AUTHOR = {D{\"u}tting, Paul and Kesselheim, Thomas}, LANGUAGE = {eng}, ISBN = {978-1-61197-478-2}, DOI = {10.1137/1.9781611974782.33}, PUBLISHER = {SIAM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017)}, EDITOR = {Klein, Philip N.}, PAGES = {521--533}, ADDRESS = {Barcelona, Spain}, }
Endnote
%0 Conference Proceedings %A D&#252;tting, Paul %A Kesselheim, Thomas %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Best-Response Dynamics in Combinatorial Auctions with Item Bidding : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-4E5E-2 %R 10.1137/1.9781611974782.33 %D 2017 %B Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2017-01-16 - 2017-01-19 %C Barcelona, Spain %B Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms %E Klein, Philip N. %P 521 - 533 %I SIAM %@ 978-1-61197-478-2
[238]
M. Ernestus, S. Friedrichs, M. Hemmer, J. Kokemüller, A. Kröller, M. Moeini, and C. Schmidt, “Algorithms for Art Gallery Illumination,” Journal of Global Optimization, vol. 68, no. 1, 2017.
Export
BibTeX
@article{ErnestusJGO2016, TITLE = {Algorithms for Art Gallery Illumination}, AUTHOR = {Ernestus, Maximilian and Friedrichs, Stephan and Hemmer, Michael and Kokem{\"u}ller, Jan and Kr{\"o}ller, Alexander and Moeini, Mahdi and Schmidt, Christiane}, LANGUAGE = {eng}, ISSN = {0925-5001}, DOI = {10.1007/s10898-016-0452-2}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, JOURNAL = {Journal of Global Optimization}, VOLUME = {68}, NUMBER = {1}, PAGES = {23--45}, }
Endnote
%0 Journal Article %A Ernestus, Maximilian %A Friedrichs, Stephan %A Hemmer, Michael %A Kokem&#252;ller, Jan %A Kr&#246;ller, Alexander %A Moeini, Mahdi %A Schmidt, Christiane %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations External Organizations %T Algorithms for Art Gallery Illumination : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-0B3C-1 %R 10.1007/s10898-016-0452-2 %7 2016 %D 2017 %J Journal of Global Optimization %V 68 %N 1 %& 23 %P 23 - 45 %I Springer %C New York, NY %@ false
[239]
G. Even and M. Medina, “Online Packet-Routing in Grids with Bounded Buffers,” Algorithmica, vol. 78, no. 3, 2017.
Export
BibTeX
@article{MedinaAlgorithmica2016, TITLE = {Online Packet-Routing in Grids with Bounded Buffers}, AUTHOR = {Even, Guy and Medina, Moti}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-016-0177-0}, PUBLISHER = {Springer-Verlag}, ADDRESS = {New York}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, JOURNAL = {Algorithmica}, VOLUME = {78}, NUMBER = {3}, PAGES = {819--868}, }
Endnote
%0 Journal Article %A Even, Guy %A Medina, Moti %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Online Packet-Routing in Grids with Bounded Buffers : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002B-85DD-E %R 10.1007/s00453-016-0177-0 %7 2016-07-11 %D 2017 %J Algorithmica %V 78 %N 3 %& 819 %P 819 - 868 %I Springer-Verlag %C New York %@ false
[240]
G. Even, R. Levi, and M. Medina, “Faster and Simpler Distributed Algorithms for Testing and Correcting Graph Properties in the CONGEST-Model,” 2017. [Online]. Available: http://arxiv.org/abs/1705.04898. (arXiv: 1705.04898)
Abstract
In this paper we present distributed testing algorithms of graph properties in the CONGEST-model [Censor-Hillel et al. 2016]. We present one-sided error testing algorithms in the general graph model. We first describe a general procedure for converting $\epsilon$-testers with a number of rounds $f(D)$, where $D$ denotes the diameter of the graph, to $O((\log n)/\epsilon)+f((\log n)/\epsilon)$ rounds, where $n$ is the number of processors of the network. We then apply this procedure to obtain an optimal tester, in terms of $n$, for testing bipartiteness, whose round complexity is $O(\epsilon^{-1}\log n)$, which improves over the $poly(\epsilon^{-1} \log n)$-round algorithm by Censor-Hillel et al. (DISC 2016). Moreover, for cycle-freeness, we obtain a \emph{corrector} of the graph that locally corrects the graph so that the corrected graph is acyclic. Note that, unlike a tester, a corrector needs to mend the graph in many places in the case that the graph is far from having the property. In the second part of the paper we design algorithms for testing whether the network is $H$-free for any connected $H$ of size up to four with round complexity of $O(\epsilon^{-1})$. This improves over the $O(\epsilon^{-2})$-round algorithms for testing triangle freeness by Censor-Hillel et al. (DISC 2016) and for testing excluded graphs of size $4$ by Fraigniaud et al. (DISC 2016). In the last part we generalize the global tester by Iwama and Yoshida (ITCS 2014) of testing $k$-path freeness to testing the exclusion of any tree of order $k$. We then show how to simulate this algorithm in the CONGEST-model in $O(k^{k^2+1}\cdot\epsilon^{-k})$ rounds.
Export
BibTeX
@online{DBLP:journals/corr/EvenLM17, TITLE = {{Faster and Simpler Distributed Algorithms for Testing and Correcting Graph Properties in the CONGEST-Model}}, AUTHOR = {Even, Guy and Levi, Reut and Medina, Moti}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1705.04898}, EPRINT = {1705.04898}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {In this paper we present distributed testing algorithms of graph properties in the CONGEST-model [Censor-Hillel et al. 2016]. We present one-sided error testing algorithms in the general graph model. We first describe a general procedure for converting $\epsilon$-testers with a number of rounds $f(D)$, where $D$ denotes the diameter of the graph, to $O((\log n)/\epsilon)+f((\log n)/\epsilon)$ rounds, where $n$ is the number of processors of the network. We then apply this procedure to obtain an optimal tester, in terms of $n$, for testing bipartiteness, whose round complexity is $O(\epsilon^{-1}\log n)$, which improves over the $poly(\epsilon^{-1} \log n)$-round algorithm by Censor-Hillel et al. (DISC 2016). Moreover, for cycle-freeness, we obtain a \emph{corrector} of the graph that locally corrects the graph so that the corrected graph is acyclic. Note that, unlike a tester, a corrector needs to mend the graph in many places in the case that the graph is far from having the property. In the second part of the paper we design algorithms for testing whether the network is $H$-free for any connected $H$ of size up to four with round complexity of $O(\epsilon^{-1})$. This improves over the $O(\epsilon^{-2})$-round algorithms for testing triangle freeness by Censor-Hillel et al. (DISC 2016) and for testing excluded graphs of size $4$ by Fraigniaud et al. (DISC 2016). In the last part we generalize the global tester by Iwama and Yoshida (ITCS 2014) of testing $k$-path freeness to testing the exclusion of any tree of order $k$. We then show how to simulate this algorithm in the CONGEST-model in $O(k^{k^2+1}\cdot\epsilon^{-k})$ rounds.}, }
Endnote
%0 Report %A Even, Guy %A Levi, Reut %A Medina, Moti %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Faster and Simpler Distributed Algorithms for Testing and Correcting Graph Properties in the CONGEST-Model : %G eng %U http://hdl.handle.net/21.11116/0000-0002-E7EA-2 %U http://arxiv.org/abs/1705.04898 %D 2017 %X In this paper we present distributed testing algorithms of graph properties in the CONGEST-model [Censor-Hillel et al. 2016]. We present one-sided error testing algorithms in the general graph model. We first describe a general procedure for converting $\epsilon$-testers with a number of rounds $f(D)$, where $D$ denotes the diameter of the graph, to $O((\log n)/\epsilon)+f((\log n)/\epsilon)$ rounds, where $n$ is the number of processors of the network. We then apply this procedure to obtain an optimal tester, in terms of $n$, for testing bipartiteness, whose round complexity is $O(\epsilon^{-1}\log n)$, which improves over the $poly(\epsilon^{-1} \log n)$-round algorithm by Censor-Hillel et al. (DISC 2016). Moreover, for cycle-freeness, we obtain a \emph{corrector} of the graph that locally corrects the graph so that the corrected graph is acyclic. Note that, unlike a tester, a corrector needs to mend the graph in many places in the case that the graph is far from having the property. In the second part of the paper we design algorithms for testing whether the network is $H$-free for any connected $H$ of size up to four with round complexity of $O(\epsilon^{-1})$. This improves over the $O(\epsilon^{-2})$-round algorithms for testing triangle freeness by Censor-Hillel et al. (DISC 2016) and for testing excluded graphs of size $4$ by Fraigniaud et al. (DISC 2016). In the last part we generalize the global tester by Iwama and Yoshida (ITCS 2014) of testing $k$-path freeness to testing the exclusion of any tree of order $k$. We then show how to simulate this algorithm in the CONGEST-model in $O(k^{k^2+1}\cdot\epsilon^{-k})$ rounds. %K Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC,Computer Science, Data Structures and Algorithms, cs.DS
[241]
G. Even, R. Levi, M. Medina, and A. Rosén, “Sublinear Random Access Generators for Preferential Attachment Graphs,” in 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Warsaw, Poland, 2017.
Export
BibTeX
@inproceedings{DBLP:conf/icalp/EvenLMR17, TITLE = {Sublinear Random Access Generators for Preferential Attachment Graphs}, AUTHOR = {Even, Guy and Levi, Reut and Medina, Moti and Ros{\'e}n, Adi}, LANGUAGE = {eng}, ISBN = {978-3-95977-041-5}, URL = {urn:nbn:de:0030-drops-74242}, DOI = {10.4230/LIPIcs.ICALP.2017.6}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, EDITOR = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca}, PAGES = {1--15}, EID = {6}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {80}, ADDRESS = {Warsaw, Poland}, }
Endnote
%0 Conference Proceedings %A Even, Guy %A Levi, Reut %A Medina, Moti %A Ros&#233;n, Adi %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Sublinear Random Access Generators for Preferential Attachment Graphs : %G eng %U http://hdl.handle.net/21.11116/0000-0002-E7E7-5 %R 10.4230/LIPIcs.ICALP.2017.6 %U urn:nbn:de:0030-drops-74242 %D 2017 %B 44th International Colloquium on Automata, Languages, and Programming %Z date of event: 2017-07-10 - 2017-07-14 %C Warsaw, Poland %B 44th International Colloquium on Automata, Languages, and Programming %E Chatzigiannakis, Ioannis; Indyk, Piotr; Kuhn, Fabian; Muscholl, Anca %P 1 - 15 %Z sequence number: 6 %I Schloss Dagstuhl %@ 978-3-95977-041-5 %B Leibniz International Proceedings in Informatics %N 80 %U http://drops.dagstuhl.de/opus/volltexte/2017/7424/http://drops.dagstuhl.de/doku/urheberrecht1.html
[242]
G. Even, O. Fischer, P. Fraigniaud, T. Gonen, R. Levi, M. Medina, P. Montealegre, D. Olivetti, R. Oshman, I. Rapaport, and I. Todinca, “Three Notes on Distributed Property Testing,” in 31st International Symposium on Distributed Computing (DISC 2017), Vienna, Austria, 2017.
Export
BibTeX
@inproceedings{DBLP:conf/wdag/EvenFFGLMMOORT17, TITLE = {Three Notes on Distributed Property Testing}, AUTHOR = {Even, Guy and Fischer, Orr and Fraigniaud, Pierre and Gonen, Tzlil and Levi, Reut and Medina, Moti and Montealegre, Pedro and Olivetti, Dennis and Oshman, Rotem and Rapaport, Ivan and Todinca, Ioan}, LANGUAGE = {eng}, ISBN = {978-3-95977-053-8}, URL = {urn:nbn:de:0030-drops-79847}, DOI = {10.4230/LIPIcs.DISC.2017.15}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {31st International Symposium on Distributed Computing (DISC 2017)}, EDITOR = {Richa, Andr{\'e}a W.}, PAGES = {1--30}, EID = {15}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {91}, ADDRESS = {Vienna, Austria}, }
Endnote
%0 Conference Proceedings %A Even, Guy %A Fischer, Orr %A Fraigniaud, Pierre %A Gonen, Tzlil %A Levi, Reut %A Medina, Moti %A Montealegre, Pedro %A Olivetti, Dennis %A Oshman, Rotem %A Rapaport, Ivan %A Todinca, Ioan %+ External Organizations External Organizations 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 External Organizations External Organizations External Organizations %T Three Notes on Distributed Property Testing : %G eng %U http://hdl.handle.net/21.11116/0000-0002-E7F6-4 %U urn:nbn:de:0030-drops-79847 %R 10.4230/LIPIcs.DISC.2017.15 %D 2017 %B 31st International Symposium on Distributed Computing %Z date of event: 2017-10-16 - 2017-10-20 %C Vienna, Austria %B 31st International Symposium on Distributed Computing %E Richa, Andr&#233;a W. %P 1 - 30 %Z sequence number: 15 %I Schloss Dagstuhl %@ 978-3-95977-053-8 %B Leibniz International Proceedings in Informatics %N 91 %U http://drops.dagstuhl.de/opus/volltexte/2017/7984/http://drops.dagstuhl.de/doku/urheberrecht1.html
[243]
S. Friedrichs, “Metastability-Containing Circuits, Parallel Distance Problems, and Terrain Guarding,” Unversität des Saarlandes, Saarbrücken, 2017.
Abstract
We study three problems. The first is the phenomenon of metastability in digital circuits. This is a state of bistable storage elements, such as registers, that is neither logical 0 nor 1 and breaks the abstraction of Boolean logic. We propose a time- and value-discrete model for metastability in digital circuits and show that it reflects relevant physical properties. Further, we propose the fundamentally new approach of using logical masking to perform meaningful computations despite the presence of metastable upsets and analyze what functions can be computed in our model. Additionally, we show that circuits with masking registers grow computationally more powerful with each available clock cycle. The second topic are parallel algorithms, based on an algebraic abstraction of the Moore-Bellman-Ford algorithm, for solving various distance problems. Our focus are distance approximations that obey the triangle inequality while at the same time achieving polylogarithmic depth and low work. Finally, we study the continuous Terrain Guarding Problem. We show that it has a rational discretization with a quadratic number of guard candidates, establish its membership in NP and the existence of a PTAS, and present an efficient implementation of a solver.
Export
BibTeX
@phdthesis{Friedrichsphd2017, TITLE = {Metastability-Containing Circuits, Parallel Distance Problems, and Terrain Guarding}, AUTHOR = {Friedrichs, Stephan}, LANGUAGE = {eng}, URL = {urn:nbn:de:bsz:291-scidok-69660}, SCHOOL = {Unversit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, ABSTRACT = {We study three problems. The first is the phenomenon of metastability in digital circuits. This is a state of bistable storage elements, such as registers, that is neither logical 0 nor 1 and breaks the abstraction of Boolean logic. We propose a time- and value-discrete model for metastability in digital circuits and show that it reflects relevant physical properties. Further, we propose the fundamentally new approach of using logical masking to perform meaningful computations despite the presence of metastable upsets and analyze what functions can be computed in our model. Additionally, we show that circuits with masking registers grow computationally more powerful with each available clock cycle. The second topic are parallel algorithms, based on an algebraic abstraction of the Moore-Bellman-Ford algorithm, for solving various distance problems. Our focus are distance approximations that obey the triangle inequality while at the same time achieving polylogarithmic depth and low work. Finally, we study the continuous Terrain Guarding Problem. We show that it has a rational discretization with a quadratic number of guard candidates, establish its membership in NP and the existence of a PTAS, and present an efficient implementation of a solver.}, }
Endnote
%0 Thesis %A Friedrichs, Stephan %Y Lenzen, Christoph %A referee: Mehlhorn, Kurt %A referee: Ghaffari, Mohsen %+ 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 Metastability-Containing Circuits, Parallel Distance Problems, and Terrain Guarding : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-E9A7-B %U urn:nbn:de:bsz:291-scidok-69660 %I Unversit&#228;t des Saarlandes %C Saarbr&#252;cken %D 2017 %P x, 226 p. %V phd %9 phd %X We study three problems. The first is the phenomenon of metastability in digital circuits. This is a state of bistable storage elements, such as registers, that is neither logical 0 nor 1 and breaks the abstraction of Boolean logic. We propose a time- and value-discrete model for metastability in digital circuits and show that it reflects relevant physical properties. Further, we propose the fundamentally new approach of using logical masking to perform meaningful computations despite the presence of metastable upsets and analyze what functions can be computed in our model. Additionally, we show that circuits with masking registers grow computationally more powerful with each available clock cycle. The second topic are parallel algorithms, based on an algebraic abstraction of the Moore-Bellman-Ford algorithm, for solving various distance problems. Our focus are distance approximations that obey the triangle inequality while at the same time achieving polylogarithmic depth and low work. Finally, we study the continuous Terrain Guarding Problem. We show that it has a rational discretization with a quadratic number of guard candidates, establish its membership in NP and the existence of a PTAS, and present an efficient implementation of a solver. %U http://scidok.sulb.uni-saarland.de/volltexte/2017/6966/http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=de
[244]
M. Függer, C. Lenzen, and T. Polzer, “Metastability-Aware Memory-Efficient Time-to-Digital Converters,” in 23rd IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC 2017), San Diego, CA, USA, 2017.
Export
BibTeX
@inproceedings{fueggerASYNC2017, TITLE = {Metastability-Aware Memory-Efficient Time-to-Digital Converters}, AUTHOR = {F{\"u}gger, Matthias and Lenzen, Christoph and Polzer, Thomas}, LANGUAGE = {eng}, ISBN = {978-1-5386-2749-5}, DOI = {10.1109/ASYNC.2017.12}, PUBLISHER = {IEEE}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {23rd IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC 2017)}, PAGES = {49--56}, ADDRESS = {San Diego, CA, USA}, }
Endnote
%0 Conference Proceedings %A F&#252;gger, Matthias %A Lenzen, Christoph %A Polzer, Thomas %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Metastability-Aware Memory-Efficient Time-to-Digital Converters : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-80CD-D %R 10.1109/ASYNC.2017.12 %D 2017 %B 23rd IEEE International Symposium on Asynchronous Circuits and Systems %Z date of event: 2017-05-21 - 2017-05-24 %C San Diego, CA, USA %B 23rd IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC 2017) %P 49 - 56 %I IEEE %@ 978-1-5386-2749-5
[245]
W. Gálvez, F. Grandoni, S. Heydrich, S. Ingala, A. Khan, and A. Wiese, “Approximating Geometric Knapsack via L-Packings,” in 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017), Berkeley, CA, USA, 2017.
Export
BibTeX
@inproceedings{Galvez_FOCS2017, TITLE = {Approximating Geometric Knapsack via {L}-Packings}, AUTHOR = {G{\'a}lvez, Waldo and Grandoni, Fabrizio and Heydrich, Sandy and Ingala, Salvatore and Khan, Arindam and Wiese, Andreas}, LANGUAGE = {eng}, ISBN = {978-1-5386-3464-6}, DOI = {10.1109/FOCS.2017.32}, PUBLISHER = {IEEE}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {58th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017)}, PAGES = {260--271}, ADDRESS = {Berkeley, CA, USA}, }
Endnote
%0 Conference Proceedings %A G&#225;lvez, Waldo %A Grandoni, Fabrizio %A Heydrich, Sandy %A Ingala, Salvatore %A Khan, Arindam %A Wiese, Andreas %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Approximating Geometric Knapsack via L-Packings : %G eng %U http://hdl.handle.net/21.11116/0000-0000-0469-6 %R 10.1109/FOCS.2017.32 %D 2017 %B 58th Annual IEEE Symposium on Foundations of Computer Science %Z date of event: 2017-10-15 - 2017-10-17 %C Berkeley, CA, USA %B 58th Annual IEEE Symposium on Foundations of Computer Science %P 260 - 271 %I IEEE %@ 978-1-5386-3464-6
[246]
J. Garg, M. Hoefer, and K. Mehlhorn, “Approximating the Nash Social Welfare with Budget-Additive Valuations,” 2017. [Online]. Available: http://arxiv.org/abs/1707.04428. (arXiv: 1707.04428)
Abstract
We present the first constant-factor approximation algorithm for maximizing the Nash social welfare when allocating indivisible items to agents with budget-additive valuation functions. Budget-additive valuations represent an important class of submodular functions. They have attracted a lot of research interest in recent years due to many interesting applications. For every $\varepsilon > 0$, our algorithm obtains a $(2.404 + \varepsilon)$-approximation in time polynomial in the input size and $1/\varepsilon$. Our algorithm relies on rounding an approximate equilibrium in a linear Fisher market where sellers have earning limits (upper bounds on the amount of money they want to earn) and buyers have utility limits (upper bounds on the amount of utility they want to achieve). In contrast to markets with either earning or utility limits, these markets have not been studied before. They turn out to have fundamentally different properties. Although the existence of equilibria is not guaranteed, we show that the market instances arising from the Nash social welfare problem always have an equilibrium. Further, we show that the set of equilibria is not convex, answering a question of [Cole et al, EC 2017]. We design an FPTAS to compute an approximate equilibrium, a result that may be of independent interest.
Export
BibTeX
@online{GargHoeferMehlhorn2017, TITLE = {Approximating the {Nash} Social Welfare with Budget-Additive Valuations}, AUTHOR = {Garg, Jugal and Hoefer, Martin and Mehlhorn, Kurt}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1707.04428}, EPRINT = {1707.04428}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We present the first constant-factor approximation algorithm for maximizing the Nash social welfare when allocating indivisible items to agents with budget-additive valuation functions. Budget-additive valuations represent an important class of submodular functions. They have attracted a lot of research interest in recent years due to many interesting applications. For every $\varepsilon > 0$, our algorithm obtains a $(2.404 + \varepsilon)$-approximation in time polynomial in the input size and $1/\varepsilon$. Our algorithm relies on rounding an approximate equilibrium in a linear Fisher market where sellers have earning limits (upper bounds on the amount of money they want to earn) and buyers have utility limits (upper bounds on the amount of utility they want to achieve). In contrast to markets with either earning or utility limits, these markets have not been studied before. They turn out to have fundamentally different properties. Although the existence of equilibria is not guaranteed, we show that the market instances arising from the Nash social welfare problem always have an equilibrium. Further, we show that the set of equilibria is not convex, answering a question of [Cole et al, EC 2017]. We design an FPTAS to compute an approximate equilibrium, a result that may be of independent interest.}, }
Endnote
%0 Report %A Garg, Jugal %A Hoefer, Martin %A Mehlhorn, Kurt %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Approximating the Nash Social Welfare with Budget-Additive Valuations : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-E7D6-2 %U http://arxiv.org/abs/1707.04428 %D 2017 %X We present the first constant-factor approximation algorithm for maximizing the Nash social welfare when allocating indivisible items to agents with budget-additive valuation functions. Budget-additive valuations represent an important class of submodular functions. They have attracted a lot of research interest in recent years due to many interesting applications. For every $\varepsilon > 0$, our algorithm obtains a $(2.404 + \varepsilon)$-approximation in time polynomial in the input size and $1/\varepsilon$. Our algorithm relies on rounding an approximate equilibrium in a linear Fisher market where sellers have earning limits (upper bounds on the amount of money they want to earn) and buyers have utility limits (upper bounds on the amount of utility they want to achieve). In contrast to markets with either earning or utility limits, these markets have not been studied before. They turn out to have fundamentally different properties. Although the existence of equilibria is not guaranteed, we show that the market instances arising from the Nash social welfare problem always have an equilibrium. Further, we show that the set of equilibria is not convex, answering a question of [Cole et al, EC 2017]. We design an FPTAS to compute an approximate equilibrium, a result that may be of independent interest. %K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Computer Science and Game Theory, cs.GT
[247]
F. Gesmundo, C. Ikenmeyer, and G. Panova, “Geometric Complexity Theory and Matrix Powering,” Differential Geometry and its Applications, vol. 55, 2017.
Export
BibTeX
@article{Gesmundo2017, TITLE = {Geometric Complexity Theory and Matrix Powering}, AUTHOR = {Gesmundo, Fulvio and Ikenmeyer, Christian and Panova, Greta}, LANGUAGE = {eng}, ISSN = {0926-2245}, DOI = {10.1016/j.difgeo.2017.07.001}, PUBLISHER = {North-Holland}, ADDRESS = {Amsterdam}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, JOURNAL = {Differential Geometry and its Applications}, VOLUME = {55}, PAGES = {106--127}, }
Endnote
%0 Journal Article %A Gesmundo, Fulvio %A Ikenmeyer, Christian %A Panova, Greta %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Geometric Complexity Theory and Matrix Powering : %G eng %U http://hdl.handle.net/21.11116/0000-0000-0453-E %R 10.1016/j.difgeo.2017.07.001 %7 2017 %D 2017 %K Computer Science, Computational Complexity, cs.CC,Mathematics, Representation Theory, math.RT, %J Differential Geometry and its Applications %V 55 %& 106 %P 106 - 127 %I North-Holland %C Amsterdam %@ false
[248]
M. Goswami, X. Gu, V. P. Pingali, and G. Telang, “Computing Teichmüller Maps Between Polygons,” Foundations of Computational Mathematics, vol. 17, no. 2, 2017.
Export
BibTeX
@article{Goswami2017, TITLE = {Computing {T}eichm{\"u}ller Maps Between Polygons}, AUTHOR = {Goswami, Mayank and Gu, Xianfeng and Pingali, Vamsi P. and Telang, Gaurish}, LANGUAGE = {eng}, ISSN = {1615-3375}, DOI = {10.1007/s10208-015-9294-4}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, JOURNAL = {Foundations of Computational Mathematics}, VOLUME = {17}, NUMBER = {2}, PAGES = {497--526}, }
Endnote
%0 Journal Article %A Goswami, Mayank %A Gu, Xianfeng %A Pingali, Vamsi P. %A Telang, Gaurish %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Computing Teichm&#252;ller Maps Between Polygons : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-3E48-3 %R 10.1007/s10208-015-9294-4 %7 2015-11-25 %D 2017 %J Foundations of Computational Mathematics %V 17 %N 2 %& 497 %P 497 - 526 %I Springer %C New York, NY %@ false
[249]
M. Goswami, R. Pagh, F. Silvestri, and J. Sivertsen, “Distance Sensitive Bloom Filters Without False Negatives,” in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), Barcelona, Spain, 2017.
Export
BibTeX
@inproceedings{GoswamiSODA2017, TITLE = {Distance Sensitive Bloom Filters Without False Negatives}, AUTHOR = {Goswami, Mayank and Pagh, Rasmus and Silvestri, Francesco and Sivertsen, Johan}, LANGUAGE = {eng}, PUBLISHER = {SIAM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017)}, EDITOR = {Klein, Philip N.}, PAGES = {257--269}, ADDRESS = {Barcelona, Spain}, }
Endnote
%0 Conference Proceedings %A Goswami, Mayank %A Pagh, Rasmus %A Silvestri, Francesco %A Sivertsen, Johan %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Distance Sensitive Bloom Filters Without False Negatives : %G eng %U http://hdl.handle.net/21.11116/0000-0001-4FA1-1 %D 2017 %B Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2017-01-16 - 2017-01-19 %C Barcelona, Spain %B Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms %E Klein, Philip N. %P 257 - 269 %I SIAM
[250]
F. Grandoni, T. Mömke, A. Wiese, and H. Zhou, “To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack,” in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), Barcelona, Spain, 2017.
Export
BibTeX
@inproceedings{doi:10.1137/1.9781611974782.159, TITLE = {To Augment or Not to Augment: {S}olving Unsplittable Flow on a Path by Creating Slack}, AUTHOR = {Grandoni, Fabrizio and M{\"o}mke, Tobias and Wiese, Andreas and Zhou, Hang}, LANGUAGE = {eng}, ISBN = {978-1-61197-478-2}, DOI = {10.1137/1.9781611974782.159}, PUBLISHER = {SIAM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017)}, EDITOR = {Klein, Philip N.}, PAGES = {2411--2422}, ADDRESS = {Barcelona, Spain}, }
Endnote
%0 Conference Proceedings %A Grandoni, Fabrizio %A M&#246;mke, Tobias %A Wiese, Andreas %A Zhou, Hang %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-4EB5-B %R 10.1137/1.9781611974782.159 %D 2017 %B Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2017-01-16 - 2017-01-19 %C Barcelona, Spain %B Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms %E Klein, Philip N. %P 2411 - 2422 %I SIAM %@ 978-1-61197-478-2
[251]
S. Heydrich and A. Wiese, “Faster Approximation Schemes for the Two-dimensional Knapsack Problem,” in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), Barcelona, Spain, 2017.
Export
BibTeX
@inproceedings{HeydrichW17, TITLE = {Faster Approximation Schemes for the Two-dimensional Knapsack Problem}, AUTHOR = {Heydrich, Sandy and Wiese, Andreas}, LANGUAGE = {eng}, ISBN = {978-1-61197-478-2}, DOI = {10.1137/1.9781611974782.6}, PUBLISHER = {SIAM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017)}, EDITOR = {Klein, Philip N.}, PAGES = {79--98}, ADDRESS = {Barcelona, Spain}, }
Endnote
%0 Conference Proceedings %A Heydrich, Sandy %A Wiese, Andreas %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Faster Approximation Schemes for the Two-dimensional Knapsack Problem : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-54AD-3 %R 10.1137/1.9781611974782.6 %D 2017 %B Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2017-01-16 - 2017-01-19 %C Barcelona, Spain %B Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms %E Klein, Philip N. %P 79 - 98 %I SIAM %@ 978-1-61197-478-2
[252]
M. Hoefer and B. Kodric, “Combinatorial Secretary Problems with Ordinal Information,” 2017. [Online]. Available: http://arxiv.org/abs/1702.01290. (arXiv: 1702.01290)
Abstract
The secretary problem is a classic model for online decision making. Recently, combinatorial extensions such as matroid or matching secretary problems have become an important tool to study algorithmic problems in dynamic markets. Here the decision maker must know the numerical value of each arriving element, which can be a demanding informational assumption. In this paper, we initiate the study of combinatorial secretary problems with ordinal information, in which the decision maker only needs to be aware of a preference order consistent with the values of arrived elements. The goal is to design online algorithms with small competitive ratios. For a variety of combinatorial problems, such as bipartite matching, general packing LPs, and independent set with bounded local independence number, we design new algorithms that obtain constant competitive ratios. For the matroid secretary problem, we observe that many existing algorithms for special matroid structures maintain their competitive ratios even in the ordinal model. In these cases, the restriction to ordinal information does not represent any additional obstacle. Moreover, we show that ordinal variants of the submodular matroid secretary problems can be solved using algorithms for the linear versions by extending [Feldman and Zenklusen, 2015]. In contrast, we provide a lower bound of $\Omega(\sqrt{n}/(\log n))$ for algorithms that are oblivious to the matroid structure, where $n$ is the total number of elements. This contrasts an upper bound of $O(\log n)$ in the cardinal model, and it shows that the technique of thresholding is not sufficient for good algorithms in the ordinal model.
Export
BibTeX
@online{Hoefer_Kodric2017, TITLE = {Combinatorial Secretary Problems with Ordinal Information}, AUTHOR = {Hoefer, Martin and Kodric, Bojana}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1702.01290}, EPRINT = {1702.01290}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {The secretary problem is a classic model for online decision making. Recently, combinatorial extensions such as matroid or matching secretary problems have become an important tool to study algorithmic problems in dynamic markets. Here the decision maker must know the numerical value of each arriving element, which can be a demanding informational assumption. In this paper, we initiate the study of combinatorial secretary problems with ordinal information, in which the decision maker only needs to be aware of a preference order consistent with the values of arrived elements. The goal is to design online algorithms with small competitive ratios. For a variety of combinatorial problems, such as bipartite matching, general packing LPs, and independent set with bounded local independence number, we design new algorithms that obtain constant competitive ratios. For the matroid secretary problem, we observe that many existing algorithms for special matroid structures maintain their competitive ratios even in the ordinal model. In these cases, the restriction to ordinal information does not represent any additional obstacle. Moreover, we show that ordinal variants of the submodular matroid secretary problems can be solved using algorithms for the linear versions by extending [Feldman and Zenklusen, 2015]. In contrast, we provide a lower bound of $\Omega(\sqrt{n}/(\log n))$ for algorithms that are oblivious to the matroid structure, where $n$ is the total number of elements. This contrasts an upper bound of $O(\log n)$ in the cardinal model, and it shows that the technique of thresholding is not sufficient for good algorithms in the ordinal model.}, }
Endnote
%0 Report %A Hoefer, Martin %A Kodric, Bojana %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Combinatorial Secretary Problems with Ordinal Information : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-5C63-3 %U http://arxiv.org/abs/1702.01290 %D 2017 %X The secretary problem is a classic model for online decision making. Recently, combinatorial extensions such as matroid or matching secretary problems have become an important tool to study algorithmic problems in dynamic markets. Here the decision maker must know the numerical value of each arriving element, which can be a demanding informational assumption. In this paper, we initiate the study of combinatorial secretary problems with ordinal information, in which the decision maker only needs to be aware of a preference order consistent with the values of arrived elements. The goal is to design online algorithms with small competitive ratios. For a variety of combinatorial problems, such as bipartite matching, general packing LPs, and independent set with bounded local independence number, we design new algorithms that obtain constant competitive ratios. For the matroid secretary problem, we observe that many existing algorithms for special matroid structures maintain their competitive ratios even in the ordinal model. In these cases, the restriction to ordinal information does not represent any additional obstacle. Moreover, we show that ordinal variants of the submodular matroid secretary problems can be solved using algorithms for the linear versions by extending [Feldman and Zenklusen, 2015]. In contrast, we provide a lower bound of $\Omega(\sqrt{n}/(\log n))$ for algorithms that are oblivious to the matroid structure, where $n$ is the total number of elements. This contrasts an upper bound of $O(\log n)$ in the cardinal model, and it shows that the technique of thresholding is not sufficient for good algorithms in the ordinal model. %K Computer Science, Data Structures and Algorithms, cs.DS
[253]
M. Hoefer and L. Wagner, “Locally Stable Marriage with Strict Preferences,” SIAM Journal on Discrete Mathematics, vol. 31, no. 1, 2017.
Export
BibTeX
@article{HoeferWagner2017, TITLE = {Locally Stable Marriage with Strict Preferences}, AUTHOR = {Hoefer, Martin and Wagner, Lisa}, LANGUAGE = {eng}, ISSN = {0895-4801}, DOI = {10.1137/151003854}, PUBLISHER = {SIAM}, ADDRESS = {Philadelphia, Pa.}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, JOURNAL = {SIAM Journal on Discrete Mathematics}, VOLUME = {31}, NUMBER = {1}, PAGES = {283--316}, }
Endnote
%0 Journal Article %A Hoefer, Martin %A Wagner, Lisa %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Locally Stable Marriage with Strict Preferences : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-26B4-1 %R 10.1137/151003854 %7 2017-02-23 %D 2017 %J SIAM Journal on Discrete Mathematics %V 31 %N 1 %& 283 %P 283 - 316 %I SIAM %C Philadelphia, Pa. %@ false
[254]
M. Hoefer and B. Kodric, “Combinatorial Secretary Problems with Ordinal Information,” in 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Warsaw, Poland, 2017.
Export
BibTeX
@inproceedings{Hoefer_ICALP2017, TITLE = {Combinatorial Secretary Problems with Ordinal Information}, AUTHOR = {Hoefer, Martin and Kodric, Bojana}, LANGUAGE = {eng}, ISBN = {978-3-95977-041-5}, URL = {urn:nbn:de:0030-drops-74594}, DOI = {10.4230/LIPIcs.ICALP.2017.133}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, EDITOR = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca}, PAGES = {1--14}, EID = {133}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {80}, ADDRESS = {Warsaw, Poland}, }
Endnote
%0 Conference Proceedings %A Hoefer, Martin %A Kodric, Bojana %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Combinatorial Secretary Problems with Ordinal Information : %G eng %U http://hdl.handle.net/21.11116/0000-0002-A320-1 %R 10.4230/LIPIcs.ICALP.2017.133 %U urn:nbn:de:0030-drops-74594 %D 2017 %B 44th International Colloquium on Automata, Languages, and Programming %Z date of event: 2017-07-10 - 2017-07-14 %C Warsaw, Poland %B 44th International Colloquium on Automata, Languages, and Programming %E Chatzigiannakis, Ioannis; Indyk, Piotr; Kuhn, Fabian; Muscholl, Anca %P 1 - 14 %Z sequence number: 133 %I Schloss Dagstuhl %@ 978-3-95977-041-5 %B Leibniz International Proceedings in Informatics %N 80 %U http://drops.dagstuhl.de/opus/volltexte/2017/7459/http://drops.dagstuhl.de/doku/urheberrecht1.html
[255]
C. Ikenmeyer, B. Komarath, C. Lenzen, V. Lysikov, A. Mokhov, and K. Sreenivasaiah, “On the Complexity of Hazard-free Circuits,” 2017. [Online]. Available: http://arxiv.org/abs/1711.01904. (arXiv: 1711.01904)
Abstract
The problem of constructing hazard-free Boolean circuits dates back to the 1940s and is an important problem in circuit design. Our main lower-bound result unconditionally shows the existence of functions whose circuit complexity is polynomially bounded while every hazard-free implementation is provably of exponential size. Previous lower bounds on the hazard-free complexity were only valid for depth 2 circuits. The same proof method yields that every subcubic implementation of Boolean matrix multiplication must have hazards. These results follow from a crucial structural insight: Hazard-free complexity is a natural generalization of monotone complexity to all (not necessarily monotone) Boolean functions. Thus, we can apply known monotone complexity lower bounds to find lower bounds on the hazard-free complexity. We also lift these methods from the monotone setting to prove exponential hazard-free complexity lower bounds for non-monotone functions. As our main upper-bound result we show how to efficiently convert a Boolean circuit into a bounded-bit hazard-free circuit with only a polynomially large blow-up in the number of gates. Previously, the best known method yielded exponentially large circuits in the worst case, so our algorithm gives an exponential improvement. As a side result we establish the NP-completeness of several hazard detection problems.
Export
BibTeX
@online{Ikenmeyer_Komarath2017, TITLE = {On the Complexity of Hazard-free Circuits}, AUTHOR = {Ikenmeyer, Christian and Komarath, Balagopal and Lenzen, Christoph and Lysikov, Vladimir and Mokhov, Andrey and Sreenivasaiah, Karteek}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1711.01904}, EPRINT = {1711.01904}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {The problem of constructing hazard-free Boolean circuits dates back to the 1940s and is an important problem in circuit design. Our main lower-bound result unconditionally shows the existence of functions whose circuit complexity is polynomially bounded while every hazard-free implementation is provably of exponential size. Previous lower bounds on the hazard-free complexity were only valid for depth 2 circuits. The same proof method yields that every subcubic implementation of Boolean matrix multiplication must have hazards. These results follow from a crucial structural insight: Hazard-free complexity is a natural generalization of monotone complexity to all (not necessarily monotone) Boolean functions. Thus, we can apply known monotone complexity lower bounds to find lower bounds on the hazard-free complexity. We also lift these methods from the monotone setting to prove exponential hazard-free complexit