Publications

2016
[1]
H. Ackermann, P. Berenbrink, S. Fischer, and M. Hoefer, “Concurrent Imitation Dynamics in Congestion Games,” Distributed Computing, vol. 29, no. 2, 2016.
Export
BibTeX
@article{Ackermann2016, TITLE = {Concurrent Imitation Dynamics in Congestion Games}, AUTHOR = {Ackermann, Heiner and Berenbrink, Petra and Fischer, Simon and Hoefer, Martin}, LANGUAGE = {eng}, ISSN = {0178-2770}, DOI = {10.1007/s00446-014-0223-6}, PUBLISHER = {Springer International}, ADDRESS = {Berlin}, YEAR = {2016}, DATE = {2016}, JOURNAL = {Distributed Computing}, VOLUME = {29}, NUMBER = {2}, PAGES = {105--125}, }
Endnote
%0 Journal Article %A Ackermann, Heiner %A Berenbrink, Petra %A Fischer, Simon %A Hoefer, Martin %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Concurrent Imitation Dynamics in Congestion Games : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-C479-5 %R 10.1007/s00446-014-0223-6 %7 2014 %D 2016 %J Distributed Computing %V 29 %N 2 %& 105 %P 105 - 125 %I Springer International %C Berlin %@ false
[2]
A. Adamaszek, A. Antoniadis, and T. Mömke, “Airports and Railways: Facility Location Meets Network Design,” in 33rd International Symposium on Theoretical Aspects of Computer Science (STACS 2016), Orléans, France, 2016.
Export
BibTeX
@inproceedings{AdamaszekSTACS2016, TITLE = {Airports and Railways: {F}acility Location Meets Network Design}, AUTHOR = {Adamaszek, Anna and Antoniadis, Antonios and M{\"o}mke, Tobias}, LANGUAGE = {eng}, ISSN = {1868-896}, ISBN = {978-3-95977-001-9}, URL = {urn:nbn:de:0030-drops-57074}, DOI = {10.4230/LIPIcs.STACS.2016.6}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2016}, BOOKTITLE = {33rd International Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, EDITOR = {Ollinger, Nicolas and Vollmer, Heribert}, PAGES = {1--14}, EID = {6}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {47}, ADDRESS = {Orl{\'e}ans, France}, }
Endnote
%0 Conference Proceedings %A Adamaszek, Anna %A Antoniadis, Antonios %A Mömke, Tobias %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Airports and Railways: Facility Location Meets Network Design : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-4312-A %R 10.4230/LIPIcs.STACS.2016.6 %U urn:nbn:de:0030-drops-57074 %D 2016 %B 33rd International Symposium on Theoretical Aspects of Computer Science %Z date of event: 2016-02-17 - 2016-02-20 %C Orléans, France %B 33rd International Symposium on Theoretical Aspects of Computer Science %E Ollinger, Nicolas; Vollmer, Heribert %P 1 - 14 %Z sequence number: 6 %I Schloss Dagstuhl %@ 978-3-95977-001-9 %B Leibniz International Proceedings in Informatics %N 47 %@ false %U http://drops.dagstuhl.de/opus/volltexte/2016/5707/http://drops.dagstuhl.de/doku/urheberrecht1.html
[3]
A. Adamaszek, P. Chalermsook, A. Ene, and A. Wiese, “Submodular Unsplittable Flow on Trees,” in Integer Programming and Combinatorial Optimization (IPCO 2016), Liège, Belgium, 2016.
Export
BibTeX
@inproceedings{AdamaszekIPCO2016, TITLE = {Submodular Unsplittable Flow on Trees}, AUTHOR = {Adamaszek, Anna and Chalermsook, Parinya and Ene, Alina and Wiese, Andreas}, LANGUAGE = {eng}, ISBN = {978-3-319-33460-8}, DOI = {10.1007/978-3-319-33461-5_28}, PUBLISHER = {Springer}, YEAR = {2016}, DATE = {2016}, BOOKTITLE = {Integer Programming and Combinatorial Optimization (IPCO 2016)}, EDITOR = {Louveaux, Quentin and Skutella, Martin}, PAGES = {337--349}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9682}, ADDRESS = {Li{\`e}ge, Belgium}, }
Endnote
%0 Conference Proceedings %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/11858/00-001M-0000-002B-0244-8 %R 10.1007/978-3-319-33461-5_28 %D 2016 %B 18th Conference on Integer Programming and Combinatorial Optimization %Z date of event: 2016-06-01 - 2016-06-03 %C Liège, Belgium %B Integer Programming and Combinatorial Optimization %E Louveaux, Quentin; Skutella, Martin %P 337 - 349 %I Springer %@ 978-3-319-33460-8 %B Lecture Notes in Computer Science %N 9682
[4]
A. Antoniadis, N. Barcelo, M. Nugent, K. Pruhs, K. Schewior, and M. Scquizzato, “Chasing Convex Bodies and Functions,” in LATIN 2016: Theoretical Informatics, Ensenada, Mexico, 2016.
Export
BibTeX
@inproceedings{AntoniadisLATIN2016, TITLE = {Chasing Convex Bodies and Functions}, AUTHOR = {Antoniadis, Antonios and Barcelo, Neal and Nugent, Michael and Pruhs, Kirk and Schewior, Kevin and Scquizzato, Michele}, LANGUAGE = {eng}, ISBN = {978-3-662-49528-5}, DOI = {10.1007/978-3-662-49529-2_6}, PUBLISHER = {Springer}, YEAR = {2016}, DATE = {2016}, BOOKTITLE = {LATIN 2016: Theoretical Informatics}, EDITOR = {Kranakis, Evangelos and Navarro, Gonzalo and Ch{\'a}vez, Edgar}, PAGES = {68--81}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9644}, ADDRESS = {Ensenada, Mexico}, }
Endnote
%0 Conference Proceedings %A Antoniadis, Antonios %A Barcelo, Neal %A Nugent, Michael %A Pruhs, Kirk %A Schewior, Kevin %A Scquizzato, Michele %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations External Organizations %T Chasing Convex Bodies and Functions : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-48D5-E %R 10.1007/978-3-662-49529-2_6 %D 2016 %B 12th Latin American Theoretical Informatics Symposium %Z date of event: 2016-04-11 - 2016-04-15 %C Ensenada, Mexico %B LATIN 2016: Theoretical Informatics %E Kranakis, Evangelos; Navarro, Gonzalo; Chávez, Edgar %P 68 - 81 %I Springer %@ 978-3-662-49528-5 %B Lecture Notes in Computer Science %N 9644
[5]
R. Becker, M. Sagraloff, V. Sharma, J. Xu, and C. Yap, “Complexity Analysis of Root Clustering for a Complex Polynomial,” in ISSAC 2016, 41st International Symposium on Symbolic and Algebraic Computation, Waterloo, Ontario, Canada, 2016.
Export
BibTeX
@inproceedings{BeckerISSAC2016, TITLE = {Complexity Analysis of Root Clustering for a Complex Polynomial}, AUTHOR = {Becker, Ruben and Sagraloff, Michael and Sharma, Vikram and Xu, Juan and Yap, Chee}, LANGUAGE = {eng}, ISBN = {978-1-4503-4380-0}, DOI = {10.1145/2930889.2930939}, PUBLISHER = {ACM}, YEAR = {2016}, DATE = {2016}, BOOKTITLE = {ISSAC 2016, 41st International Symposium on Symbolic and Algebraic Computation}, EDITOR = {Rosenkranz, Markus}, PAGES = {71--78}, ADDRESS = {Waterloo, Ontario, Canada}, }
Endnote
%0 Conference Proceedings %A Becker, Ruben %A Sagraloff, Michael %A Sharma, Vikram %A Xu, Juan %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 External Organizations %T Complexity Analysis of Root Clustering for a Complex Polynomial : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002B-02C0-E %R 10.1145/2930889.2930939 %D 2016 %B 41st International Symposium on Symbolic and Algebraic Computation %Z date of event: 2016-06-19 - 2016-06-22 %C Waterloo, Ontario, Canada %B ISSAC 2016 %E Rosenkranz, Markus %P 71 - 78 %I ACM %@ 978-1-4503-4380-0
[6]
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,” 2016. [Online]. Available: http://arxiv.org/abs/1509.06231. (arXiv: 1509.06231)
Abstract
We describe a subdivision algorithm for isolating the complex roots of a polynomial $F\in\mathbb{C}[x]$. Our model assumes that each coefficient of $F$ has an oracle to return an approximation to any absolute error bound. Given any box $\mathcal{B}$ in the complex plane containing only simple roots of $F$, our algorithm returns disjoint isolating disks for the roots in $\mathcal{B}$. Our complexity analysis bounds the absolute error to which the coefficients of $F$ have to be provided, the total number of iterations, and the overall bit complexity. This analysis shows that the complexity of our algorithm is controlled by the geometry of the roots in a near neighborhood of the input box $\mathcal{B}$, namely, the number of roots and their pairwise distances. The number of subdivision steps is near-optimal. For the \emph{benchmark problem}, namely, to isolate all the roots of an integer polynomial of degree $n$ with coefficients of bitsize less than $\tau$, our algorithm needs $\tilde{O}(n^3+n^2\tau)$ bit operations, which is comparable to the record bound of Pan (2002). It is the first time that such a bound has been achieved using subdivision methods, and independent of divide-and-conquer techniques such as Sch\"onhage's splitting circle technique. Our algorithm uses the quadtree construction of Weyl (1924) with two key ingredients: using Pellet's Theorem (1881) combined with Graeffe iteration, we derive a soft test to count the number of roots in a disk. Using Newton iteration combined with bisection, in a form inspired by the quadratic interval method from Abbot (2006), we achieve quadratic convergence towards root clusters. Relative to the divide-conquer algorithms, our algorithm is simple with the potential of being practical. This paper is self-contained: we provide pseudo-code for all subroutines used by our algorithm.
Export
BibTeX
@online{BeckerarXiv2016, 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}, URL = {http://arxiv.org/abs/1509.06231}, EPRINT = {1509.06231}, EPRINTTYPE = {arXiv}, YEAR = {2016}, ABSTRACT = {We describe a subdivision algorithm for isolating the complex roots of a polynomial $F\in\mathbb{C}[x]$. Our model assumes that each coefficient of $F$ has an oracle to return an approximation to any absolute error bound. Given any box $\mathcal{B}$ in the complex plane containing only simple roots of $F$, our algorithm returns disjoint isolating disks for the roots in $\mathcal{B}$. Our complexity analysis bounds the absolute error to which the coefficients of $F$ have to be provided, the total number of iterations, and the overall bit complexity. This analysis shows that the complexity of our algorithm is controlled by the geometry of the roots in a near neighborhood of the input box $\mathcal{B}$, namely, the number of roots and their pairwise distances. The number of subdivision steps is near-optimal. For the \emph{benchmark problem}, namely, to isolate all the roots of an integer polynomial of degree $n$ with coefficients of bitsize less than $\tau$, our algorithm needs $\tilde{O}(n^3+n^2\tau)$ bit operations, which is comparable to the record bound of Pan (2002). It is the first time that such a bound has been achieved using subdivision methods, and independent of divide-and-conquer techniques such as Sch\"onhage's splitting circle technique. Our algorithm uses the quadtree construction of Weyl (1924) with two key ingredients: using Pellet's Theorem (1881) combined with Graeffe iteration, we derive a soft test to count the number of roots in a disk. Using Newton iteration combined with bisection, in a form inspired by the quadratic interval method from Abbot (2006), we achieve quadratic convergence towards root clusters. Relative to the divide-conquer algorithms, our algorithm is simple with the potential of being practical. This paper is self-contained: we provide pseudo-code for all subroutines used by our algorithm.}, }
Endnote
%0 Report %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-002B-02B8-2 %U http://arxiv.org/abs/1509.06231 %D 2016 %X We describe a subdivision algorithm for isolating the complex roots of a polynomial $F\in\mathbb{C}[x]$. Our model assumes that each coefficient of $F$ has an oracle to return an approximation to any absolute error bound. Given any box $\mathcal{B}$ in the complex plane containing only simple roots of $F$, our algorithm returns disjoint isolating disks for the roots in $\mathcal{B}$. Our complexity analysis bounds the absolute error to which the coefficients of $F$ have to be provided, the total number of iterations, and the overall bit complexity. This analysis shows that the complexity of our algorithm is controlled by the geometry of the roots in a near neighborhood of the input box $\mathcal{B}$, namely, the number of roots and their pairwise distances. The number of subdivision steps is near-optimal. For the \emph{benchmark problem}, namely, to isolate all the roots of an integer polynomial of degree $n$ with coefficients of bitsize less than $\tau$, our algorithm needs $\tilde{O}(n^3+n^2\tau)$ bit operations, which is comparable to the record bound of Pan (2002). It is the first time that such a bound has been achieved using subdivision methods, and independent of divide-and-conquer techniques such as Sch\"onhage's splitting circle technique. Our algorithm uses the quadtree construction of Weyl (1924) with two key ingredients: using Pellet's Theorem (1881) combined with Graeffe iteration, we derive a soft test to count the number of roots in a disk. Using Newton iteration combined with bisection, in a form inspired by the quadratic interval method from Abbot (2006), we achieve quadratic convergence towards root clusters. Relative to the divide-conquer algorithms, our algorithm is simple with the potential of being practical. This paper is self-contained: we provide pseudo-code for all subroutines used by our algorithm. %K Computer Science, Numerical Analysis, cs.NA,Computer Science, Symbolic Computation, cs.SC,Mathematics, Numerical Analysis, math.NA
[7]
R. Becker, M. Fickert, and A. Karrenbauer, “A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem,” in ALENEX16, Meeting on Algorithm Engineering & Experiments, Arlington, VA, USA, 2016.
Export
BibTeX
@inproceedings{BeckerALENEX2016, TITLE = {A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem}, AUTHOR = {Becker, Ruben and Fickert, Maximilian and Karrenbauer, Andreas}, LANGUAGE = {eng}, ISBN = {978-1-61197-431-7}, DOI = {10.1137/1.9781611974317.13}, PUBLISHER = {SIAM}, YEAR = {2016}, BOOKTITLE = {ALENEX16, Meeting on Algorithm Engineering \& Experiments}, EDITOR = {Goodrich, Michael and Mitzenmacher, Michael}, PAGES = {151--159}, ADDRESS = {Arlington, VA, USA}, }
Endnote
%0 Conference Proceedings %A Becker, Ruben %A Fickert, Maximilian %A Karrenbauer, Andreas %+ 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 A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0029-4AD0-6 %R 10.1137/1.9781611974317.13 %D 2016 %B Meeting on Algorithm Engineering & Experiments %Z date of event: 2016-01-10 - 2016-01-10 %C Arlington, VA, USA %B ALENEX16 %E Goodrich, Michael; Mitzenmacher, Michael %P 151 - 159 %I SIAM %@ 978-1-61197-431-7
[8]
X. Bei, W. Chen, J. Garg, M. Hoefer, and X. Sun, “Learning Market Parameters Using Aggregate Demand Queries,” in Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, Phoenix, AZ, USA, 2016.
Export
BibTeX
@inproceedings{BeiAAAI2016, TITLE = {Learning Market Parameters Using Aggregate Demand Queries}, AUTHOR = {Bei, Xiaohui and Chen, Wei and Garg, Jugal and Hoefer, Martin and Sun, Xiaoming}, LANGUAGE = {eng}, PUBLISHER = {AAAI}, YEAR = {2016}, BOOKTITLE = {Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence}, PAGES = {404--410}, ADDRESS = {Phoenix, AZ, USA}, }
Endnote
%0 Conference Proceedings %A Bei, Xiaohui %A Chen, Wei %A Garg, Jugal %A Hoefer, Martin %A Sun, Xiaoming %+ 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 Learning Market Parameters Using Aggregate Demand Queries : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0029-AC36-C %D 2016 %B Thirtieth AAAI Conference on Artificial Intelligence %Z date of event: 2016-02-12 - 2016-02-17 %C Phoenix, AZ, USA %B Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence %P 404 - 410 %I AAAI %U http://www.aaai.org/ocs/index.php/AAAI/AAAI16/paper/view/12052/11612
[9]
X. Bei, J. Garg, M. Hoefer, and K. Mehlhorn, “Computing Equilibria in Markets with Budget-Additive Utilities,” in Algorithms -- ESA, Aarhus, Denmark. (Accepted/in press)
Export
BibTeX
@inproceedings{BeiESA2016, TITLE = {Computing Equilibria in Markets with Budget-Additive Utilities}, AUTHOR = {Bei, Xiaohui and Garg, Jugal and Hoefer, Martin and Mehlhorn, Kurt}, LANGUAGE = {eng}, YEAR = {2016}, PUBLREMARK = {Accepted}, BOOKTITLE = {Algorithms -- ESA}, ADDRESS = {Aarhus, Denmark}, }
Endnote
%0 Conference Proceedings %A Bei, Xiaohui %A Garg, Jugal %A Hoefer, Martin %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 %T Computing Equilibria in Markets with Budget-Additive Utilities : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002B-479B-5 %D 2016 %B 24th Annual European Symposium on Algorithms %Z date of event: 2016-08-22 - 2016-08-26 %C Aarhus, Denmark %B Algorithms -- ESA
[10]
X. Bei, J. Garg, M. Hoefer, and K. Mehlhorn, “Computing Equilibria in Markets with Budget-Additive Utilities,” 2016. [Online]. Available: http://arxiv.org/abs/1603.07210. (arXiv: 1603.07210)
Abstract
We present the first analysis of Fisher markets with buyers that have budget-additive utility functions. Budget-additive utilities are elementary concave functions with numerous applications in online adword markets and revenue optimization problems. They extend the standard case of linear utilities and have been studied in a variety of other market models. In contrast to the frequently studied CES utilities, they have a global satiation point which can imply multiple market equilibria with quite different characteristics. Our main result is an efficient combinatorial algorithm to compute a market equilibrium with a Pareto-optimal allocation of goods. It relies on a new descending-price approach and, as a special case, also implies a novel combinatorial algorithm for computing a market equilibrium in linear Fisher markets. We complement these positive results with a number of hardness results for related computational questions. We prove that it is NP-hard to compute a market equilibrium that maximizes social welfare, and it is PPAD-hard to find any market equilibrium with utility functions with separate satiation points for each buyer and each good.
Export
BibTeX
@online{BeiGargHoeferMehlhorn2016, TITLE = {Computing Equilibria in Markets with Budget-Additive Utilities}, AUTHOR = {Bei, Xiaohui and Garg, Jugal and Hoefer, Martin and Mehlhorn, Kurt}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1603.07210}, EPRINT = {1603.07210}, EPRINTTYPE = {arXiv}, YEAR = {2016}, ABSTRACT = {We present the first analysis of Fisher markets with buyers that have budget-additive utility functions. Budget-additive utilities are elementary concave functions with numerous applications in online adword markets and revenue optimization problems. They extend the standard case of linear utilities and have been studied in a variety of other market models. In contrast to the frequently studied CES utilities, they have a global satiation point which can imply multiple market equilibria with quite different characteristics. Our main result is an efficient combinatorial algorithm to compute a market equilibrium with a Pareto-optimal allocation of goods. It relies on a new descending-price approach and, as a special case, also implies a novel combinatorial algorithm for computing a market equilibrium in linear Fisher markets. We complement these positive results with a number of hardness results for related computational questions. We prove that it is NP-hard to compute a market equilibrium that maximizes social welfare, and it is PPAD-hard to find any market equilibrium with utility functions with separate satiation points for each buyer and each good.}, }
Endnote
%0 Report %A Bei, Xiaohui %A Garg, Jugal %A Hoefer, Martin %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 %T Computing Equilibria in Markets with Budget-Additive Utilities : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-FCC0-C %U http://arxiv.org/abs/1603.07210 %D 2016 %X We present the first analysis of Fisher markets with buyers that have budget-additive utility functions. Budget-additive utilities are elementary concave functions with numerous applications in online adword markets and revenue optimization problems. They extend the standard case of linear utilities and have been studied in a variety of other market models. In contrast to the frequently studied CES utilities, they have a global satiation point which can imply multiple market equilibria with quite different characteristics. Our main result is an efficient combinatorial algorithm to compute a market equilibrium with a Pareto-optimal allocation of goods. It relies on a new descending-price approach and, as a special case, also implies a novel combinatorial algorithm for computing a market equilibrium in linear Fisher markets. We complement these positive results with a number of hardness results for related computational questions. We prove that it is NP-hard to compute a market equilibrium that maximizes social welfare, and it is PPAD-hard to find any market equilibrium with utility functions with separate satiation points for each buyer and each good. %K Computer Science, Computer Science and Game Theory, cs.GT,Computer Science, Data Structures and Algorithms, cs.DS
[11]
C. Brand and M. Sagraloff, “On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection,” in ISSAC 2016, 41st International Symposium on Symbolic and Algebraic Computation, Waterloo, Ontario, Canada, 2016.
Export
BibTeX
@inproceedings{BrandISSAC2016, TITLE = {On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection}, AUTHOR = {Brand, Cornelius and Sagraloff, Michael}, LANGUAGE = {eng}, ISBN = {978-1-4503-4380-0}, DOI = {10.1145/2930889.2930934}, PUBLISHER = {ACM}, YEAR = {2016}, DATE = {2016}, BOOKTITLE = {ISSAC 2016, 41st International Symposium on Symbolic and Algebraic Computation}, EDITOR = {Rosenkranz, Markus}, PAGES = {151--158}, ADDRESS = {Waterloo, Ontario, Canada}, }
Endnote
%0 Conference Proceedings %A Brand, Cornelius %A Sagraloff, Michael %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002B-02B2-E %R 10.1145/2930889.2930934 %D 2016 %B 41st International Symposium on Symbolic and Algebraic Computation %Z date of event: 2016-06-19 - 2016-06-22 %C Waterloo, Ontario, Canada %B ISSAC 2016 %E Rosenkranz, Markus %P 151 - 158 %I ACM %@ 978-1-4503-4380-0
[12]
C. Brand and M. Sagraloff, “On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection,” 2016. [Online]. Available: http://arxiv.org/abs/1604.08944. (arXiv: 1604.08944)
Abstract
Given a zero-dimensional polynomial system consisting of n integer polynomials in n variables, we propose a certified and complete method to compute all complex solutions of the system as well as a corresponding separating linear form l with coefficients of small bit size. For computing l, we need to project the solutions into one dimension along O(n) distinct directions but no further algebraic manipulations. The solutions are then directly reconstructed from the considered projections. The first step is deterministic, whereas the second step uses randomization, thus being Las-Vegas. The theoretical analysis of our approach shows that the overall cost for the two problems considered above is dominated by the cost of carrying out the projections. We also give bounds on the bit complexity of our algorithms that are exclusively stated in terms of the number of variables, the total degree and the bitsize of the input polynomials.
Export
BibTeX
@online{BrandarXiv2016, TITLE = {On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection}, AUTHOR = {Brand, Cornelius and Sagraloff, Michael}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1604.08944}, EPRINT = {1604.08944}, EPRINTTYPE = {arXiv}, YEAR = {2016}, ABSTRACT = {Given a zero-dimensional polynomial system consisting of n integer polynomials in n variables, we propose a certified and complete method to compute all complex solutions of the system as well as a corresponding separating linear form l with coefficients of small bit size. For computing l, we need to project the solutions into one dimension along O(n) distinct directions but no further algebraic manipulations. The solutions are then directly reconstructed from the considered projections. The first step is deterministic, whereas the second step uses randomization, thus being Las-Vegas. The theoretical analysis of our approach shows that the overall cost for the two problems considered above is dominated by the cost of carrying out the projections. We also give bounds on the bit complexity of our algorithms that are exclusively stated in terms of the number of variables, the total degree and the bitsize of the input polynomials.}, }
Endnote
%0 Report %A Brand, Cornelius %A Sagraloff, Michael %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002B-02AF-7 %U http://arxiv.org/abs/1604.08944 %D 2016 %X Given a zero-dimensional polynomial system consisting of n integer polynomials in n variables, we propose a certified and complete method to compute all complex solutions of the system as well as a corresponding separating linear form l with coefficients of small bit size. For computing l, we need to project the solutions into one dimension along O(n) distinct directions but no further algebraic manipulations. The solutions are then directly reconstructed from the considered projections. The first step is deterministic, whereas the second step uses randomization, thus being Las-Vegas. The theoretical analysis of our approach shows that the overall cost for the two problems considered above is dominated by the cost of carrying out the projections. We also give bounds on the bit complexity of our algorithms that are exclusively stated in terms of the number of variables, the total degree and the bitsize of the input polynomials. %K Computer Science, Symbolic Computation, cs.SC,Computer Science, Computational Complexity, cs.CC
[13]
J. Case and T. Kötzing, “Topological Separations in Inductive Inference,” Theoretical Computer Science, vol. 260, 2016.
Export
BibTeX
@article{CaseKotzing2016, TITLE = {Topological Separations in Inductive Inference}, AUTHOR = {Case, John and K{\"o}tzing, Timo}, LANGUAGE = {eng}, ISSN = {0304-3975}, DOI = {10.1016/j.tcs.2015.10.036}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2016}, DATE = {2016}, JOURNAL = {Theoretical Computer Science}, VOLUME = {260}, PAGES = {33--45}, }
Endnote
%0 Journal Article %A Case, John %A Kötzing, Timo %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Topological Separations in Inductive Inference : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-1A2D-8 %R 10.1016/j.tcs.2015.10.036 %7 2015-10-30 %D 2016 %J Theoretical Computer Science %V 260 %& 33 %P 33 - 45 %I Elsevier %C Amsterdam %@ false
[14]
P. Chalermsook, M. Goswami, L. Kozma, K. Mehlhorn, and T. Saranurak, “The Landscape of Bounds for Binary Search Trees,” 2016. [Online]. Available: http://arxiv.org/abs/1603.04892. (arXiv: 1603.04892)
Abstract
Binary search trees (BSTs) with rotations can adapt to various kinds of structure in search sequences, achieving amortized access times substantially better than the Theta(log n) worst-case guarantee. Classical examples of structural properties include static optimality, sequential access, working set, key-independent optimality, and dynamic finger, all of which are now known to be achieved by the two famous online BST algorithms (Splay and Greedy). (...) In this paper, we introduce novel properties that explain the efficiency of sequences not captured by any of the previously known properties, and which provide new barriers to the dynamic optimality conjecture. We also establish connections between various properties, old and new. For instance, we show the following. (i) A tight bound of O(n log d) on the cost of Greedy for d-decomposable sequences. The result builds on the recent lazy finger result of Iacono and Langerman (SODA 2016). On the other hand, we show that lazy finger alone cannot explain the efficiency of pattern avoiding sequences even in some of the simplest cases. (ii) A hierarchy of bounds using multiple lazy fingers, addressing a recent question of Iacono and Langerman. (iii) The optimality of the Move-to-root heuristic in the key-independent setting introduced by Iacono (Algorithmica 2005). (iv) A new tool that allows combining any finite number of sound structural properties. As an application, we show an upper bound on the cost of a class of sequences that all known properties fail to capture. (v) The equivalence between two families of BST properties. The observation on which this connection is based was known before - we make it explicit, and apply it to classical BST properties. (...)
Export
BibTeX
@online{Chalermsook2016PP, TITLE = {The Landscape of Bounds for Binary Search Trees}, AUTHOR = {Chalermsook, Parinya and Goswami, Mayank and Kozma, L{\'a}szl{\'o} and Mehlhorn, Kurt and Saranurak, Thatchaphol}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1603.04892}, EPRINT = {1603.04892}, EPRINTTYPE = {arXiv}, YEAR = {2016}, ABSTRACT = {Binary search trees (BSTs) with rotations can adapt to various kinds of structure in search sequences, achieving amortized access times substantially better than the Theta(log n) worst-case guarantee. Classical examples of structural properties include static optimality, sequential access, working set, key-independent optimality, and dynamic finger, all of which are now known to be achieved by the two famous online BST algorithms (Splay and Greedy). (...) In this paper, we introduce novel properties that explain the efficiency of sequences not captured by any of the previously known properties, and which provide new barriers to the dynamic optimality conjecture. We also establish connections between various properties, old and new. For instance, we show the following. (i) A tight bound of O(n log d) on the cost of Greedy for d-decomposable sequences. The result builds on the recent lazy finger result of Iacono and Langerman (SODA 2016). On the other hand, we show that lazy finger alone cannot explain the efficiency of pattern avoiding sequences even in some of the simplest cases. (ii) A hierarchy of bounds using multiple lazy fingers, addressing a recent question of Iacono and Langerman. (iii) The optimality of the Move-to-root heuristic in the key-independent setting introduced by Iacono (Algorithmica 2005). (iv) A new tool that allows combining any finite number of sound structural properties. As an application, we show an upper bound on the cost of a class of sequences that all known properties fail to capture. (v) The equivalence between two families of BST properties. The observation on which this connection is based was known before -- we make it explicit, and apply it to classical BST properties. (...)}, }
Endnote
%0 Report %A Chalermsook, Parinya %A Goswami, Mayank %A Kozma, László %A Mehlhorn, Kurt %A Saranurak, Thatchaphol %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T The Landscape of Bounds for Binary Search Trees : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-FCC9-9 %U http://arxiv.org/abs/1603.04892 %D 2016 %X Binary search trees (BSTs) with rotations can adapt to various kinds of structure in search sequences, achieving amortized access times substantially better than the Theta(log n) worst-case guarantee. Classical examples of structural properties include static optimality, sequential access, working set, key-independent optimality, and dynamic finger, all of which are now known to be achieved by the two famous online BST algorithms (Splay and Greedy). (...) In this paper, we introduce novel properties that explain the efficiency of sequences not captured by any of the previously known properties, and which provide new barriers to the dynamic optimality conjecture. We also establish connections between various properties, old and new. For instance, we show the following. (i) A tight bound of O(n log d) on the cost of Greedy for d-decomposable sequences. The result builds on the recent lazy finger result of Iacono and Langerman (SODA 2016). On the other hand, we show that lazy finger alone cannot explain the efficiency of pattern avoiding sequences even in some of the simplest cases. (ii) A hierarchy of bounds using multiple lazy fingers, addressing a recent question of Iacono and Langerman. (iii) The optimality of the Move-to-root heuristic in the key-independent setting introduced by Iacono (Algorithmica 2005). (iv) A new tool that allows combining any finite number of sound structural properties. As an application, we show an upper bound on the cost of a class of sequences that all known properties fail to capture. (v) The equivalence between two families of BST properties. The observation on which this connection is based was known before - we make it explicit, and apply it to classical BST properties. (...) %K Computer Science, Data Structures and Algorithms, cs.DS
[15]
A. Choudhary, M. Kerber, and S. Raghvendra, “Polynomial-Sized Topological Approximations Using The Permutahedron,” 2016. [Online]. Available: http://arxiv.org/abs/1601.02732. (arXiv: 1601.02732)
Abstract
Classical methods to model topological properties of point clouds, such as the Vietoris-Rips complex, suffer from the combinatorial explosion of complex sizes. We propose a novel technique to approximate a multi-scale filtration of the Rips complex with improved bounds for size: precisely, for $n$ points in $\mathbb{R}^d$, we obtain a $O(d)$-approximation with at most $n2^{O(d \log k)}$ simplices of dimension $k$ or lower. In conjunction with dimension reduction techniques, our approach yields a $O(\mathrm{polylog} (n))$-approximation of size $n^{O(1)}$ for Rips filtrations on arbitrary metric spaces. This result stems from high-dimensional lattice geometry and exploits properties of the permutahedral lattice, a well-studied structure in discrete geometry. Building on the same geometric concept, we also present a lower bound result on the size of an approximate filtration: we construct a point set for which every $(1+\epsilon)$-approximation of the \v{C}ech filtration has to contain $n^{\Omega(\log\log n)}$ features, provided that $\epsilon <\frac{1}{\log^{1+c} n}$ for $c\in(0,1)$.
Export
BibTeX
@online{ChoudharyarXiv2016, TITLE = {Polynomial-Sized Topological Approximations Using The Permutahedron}, AUTHOR = {Choudhary, Aruni and Kerber, Michael and Raghvendra, Sharath}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1601.02732}, EPRINT = {1601.02732}, EPRINTTYPE = {arXiv}, YEAR = {2016}, ABSTRACT = {Classical methods to model topological properties of point clouds, such as the Vietoris-Rips complex, suffer from the combinatorial explosion of complex sizes. We propose a novel technique to approximate a multi-scale filtration of the Rips complex with improved bounds for size: precisely, for $n$ points in $\mathbb{R}^d$, we obtain a $O(d)$-approximation with at most $n2^{O(d \log k)}$ simplices of dimension $k$ or lower. In conjunction with dimension reduction techniques, our approach yields a $O(\mathrm{polylog} (n))$-approximation of size $n^{O(1)}$ for Rips filtrations on arbitrary metric spaces. This result stems from high-dimensional lattice geometry and exploits properties of the permutahedral lattice, a well-studied structure in discrete geometry. Building on the same geometric concept, we also present a lower bound result on the size of an approximate filtration: we construct a point set for which every $(1+\epsilon)$-approximation of the \v{C}ech filtration has to contain $n^{\Omega(\log\log n)}$ features, provided that $\epsilon <\frac{1}{\log^{1+c} n}$ for $c\in(0,1)$.}, }
Endnote
%0 Report %A Choudhary, Aruni %A Kerber, Michael %A Raghvendra, Sharath %+ 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/11858/00-001M-0000-002B-0280-D %U http://arxiv.org/abs/1601.02732 %D 2016 %X Classical methods to model topological properties of point clouds, such as the Vietoris-Rips complex, suffer from the combinatorial explosion of complex sizes. We propose a novel technique to approximate a multi-scale filtration of the Rips complex with improved bounds for size: precisely, for $n$ points in $\mathbb{R}^d$, we obtain a $O(d)$-approximation with at most $n2^{O(d \log k)}$ simplices of dimension $k$ or lower. In conjunction with dimension reduction techniques, our approach yields a $O(\mathrm{polylog} (n))$-approximation of size $n^{O(1)}$ for Rips filtrations on arbitrary metric spaces. This result stems from high-dimensional lattice geometry and exploits properties of the permutahedral lattice, a well-studied structure in discrete geometry. Building on the same geometric concept, we also present a lower bound result on the size of an approximate filtration: we construct a point set for which every $(1+\epsilon)$-approximation of the \v{C}ech filtration has to contain $n^{\Omega(\log\log n)}$ features, provided that $\epsilon <\frac{1}{\log^{1+c} n}$ for $c\in(0,1)$. %K Computer Science, Computational Geometry, cs.CG,Mathematics, Algebraic Topology, math.AT,
[16]
A. Choudhary, M. Kerber, and S. Raghvendra, “Polynomial-Sized Topological Approximations Using the Permutahedron,” in 32nd International Symposium on Computational Geometry (SoCG 2016), Boston, MA, USA, 2016.
Export
BibTeX
@inproceedings{ChoudharySoCG2016, TITLE = {Polynomial-Sized Topological Approximations Using the Permutahedron}, AUTHOR = {Choudhary, Aruni and Kerber, Michael and Raghvendra, Sharat}, LANGUAGE = {eng}, ISBN = {978-3-95977-009-5}, URL = {urn:nbn:de:0030-drops-59236}, DOI = {10.4230/LIPIcs.SoCG.2016.31}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2016}, BOOKTITLE = {32nd International Symposium on Computational Geometry (SoCG 2016)}, EDITOR = {Fekete, S{\'a}ndor and Lubiw, Anna}, EID = {31}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {51}, ADDRESS = {Boston, MA, USA}, }
Endnote
%0 Conference Proceedings %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/11858/00-001M-0000-002B-025D-1 %R 10.4230/LIPIcs.SoCG.2016.31 %U urn:nbn:de:0030-drops-59236 %D 2016 %B 32nd International Symposium on Computational Geometry %Z date of event: 2016-06-14 - 2016-06-17 %C Boston, MA, USA %B 32nd International Symposium on Computational Geometry %E Fekete, S&#225;ndor; Lubiw, Anna %Z sequence number: 31 %I Schloss Dagstuhl %@ 978-3-95977-009-5 %B Leibniz International Proceedings in Informatics %N 51 %U http://drops.dagstuhl.de/doku/urheberrecht1.htmlhttp://drops.dagstuhl.de/opus/volltexte/2016/5923/
[17]
O. Darwish and K. Mehlhorn, “Improved Balanced Flow Computation Using Parametric Flow,” Information Processing Letters, vol. 116, no. 9, 2016.
Export
BibTeX
@article{DarwishMehlhorn2016, TITLE = {Improved Balanced Flow Computation Using Parametric Flow}, AUTHOR = {Darwish, Omar and Mehlhorn, Kurt}, LANGUAGE = {eng}, ISSN = {0020-0190}, DOI = {10.1016/j.ipl.2016.04.008}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2016}, DATE = {2016}, JOURNAL = {Information Processing Letters}, VOLUME = {116}, NUMBER = {9}, PAGES = {560--563}, }
Endnote
%0 Journal Article %A Darwish, Omar %A Mehlhorn, Kurt %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Improved Balanced Flow Computation Using Parametric Flow : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-FC7B-A %R 10.1016/j.ipl.2016.04.008 %7 2016-04-22 %D 2016 %J Information Processing Letters %V 116 %N 9 %& 560 %P 560 - 563 %I Elsevier %C Amsterdam %@ false
[18]
B. Doerr, C. Doerr, S. Moran, and S. Moran, “Simple and Optimal Randomized Fault-tolerant Rumor Spreading,” Distributed Computing, vol. 29, no. 2, 2016.
Export
BibTeX
@article{Doerr2016, TITLE = {Simple and Optimal Randomized Fault-tolerant Rumor Spreading}, AUTHOR = {Doerr, Benjamin and Doerr, Carola and Moran, Shay and Moran, Shlomo}, LANGUAGE = {eng}, ISSN = {0178-2770}, DOI = {10.1007/s00446-014-0238-z}, PUBLISHER = {Springer International}, ADDRESS = {Berlin}, YEAR = {2016}, DATE = {2016}, JOURNAL = {Distributed Computing}, VOLUME = {29}, NUMBER = {2}, PAGES = {89--104}, }
Endnote
%0 Journal Article %A Doerr, Benjamin %A Doerr, Carola %A Moran, Shay %A Moran, Shlomo %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Simple and Optimal Randomized Fault-tolerant Rumor Spreading : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-C4BD-B %R 10.1007/s00446-014-0238-z %7 2014 %D 2016 %J Distributed Computing %V 29 %N 2 %& 89 %P 89 - 104 %I Springer International %C Berlin %@ false
[19]
B. Doerr and M. Künnemann, “Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem,” in 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), Rome, Italy, 2016.
Export
BibTeX
@inproceedings{DoerrICALP2016, TITLE = {Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem}, AUTHOR = {Doerr, Benjamin and K{\"u}nnemann, Marvin}, LANGUAGE = {eng}, ISBN = {978-3-95977-013-2}, URL = {urn:nbn:de:0030-drops-62946}, DOI = {10.4230/LIPIcs.ICALP.2016.150}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2016}, BOOKTITLE = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, EDITOR = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, EID = {150}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {55}, ADDRESS = {Rome, Italy}, }
Endnote
%0 Conference Proceedings %A Doerr, Benjamin %A K&#252;nnemann, Marvin %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002B-4289-F %R 10.4230/LIPIcs.ICALP.2016.150 %U urn:nbn:de:0030-drops-62946 %D 2016 %B 43rd International Colloquium on Automata, Languages, and Programming %Z date of event: 2016-07-12 - 2016-07-15 %C Rome, Italy %B 43rd International Colloquium on Automata, Languages, and Programming %E Chatzigiannakis, Ioannis; Mitzenmacher, Michael; Rabani, Yuval; Sangiorgi, Davide %Z sequence number: 150 %I Schloss Dagstuhl %@ 978-3-95977-013-2 %B Leibniz International Proceedings in Informatics %N 55 %U http://drops.dagstuhl.de/opus/volltexte/2016/6294http://drops.dagstuhl.de/doku/urheberrecht1.html
[20]
D. Dolev, K. Heljanko, M. Järvisalo, J. H. Korhonen, C. Lenzen, J. Rybicki, J. Suomela, and S. Wieringa, “Synchronous Counting and Computational Algorithm Design,” Journal of Computer and System Sciences, vol. 82, no. 2, 2016.
Export
BibTeX
@article{Dolev2016, TITLE = {Synchronous Counting and Computational Algorithm Design}, AUTHOR = {Dolev, Danny and Heljanko, Keijo and J{\"a}rvisalo, Matti and Korhonen, Janne H. and Lenzen, Christoph and Rybicki, Joel and Suomela, Jukka and Wieringa, Siert}, LANGUAGE = {eng}, ISSN = {0022-0000}, DOI = {10.1016/j.jcss.2015.09.002}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2016}, DATE = {2016}, JOURNAL = {Journal of Computer and System Sciences}, VOLUME = {82}, NUMBER = {2}, PAGES = {310--332}, }
Endnote
%0 Journal Article %A Dolev, Danny %A Heljanko, Keijo %A J&#228;rvisalo, Matti %A Korhonen, Janne H. %A Lenzen, Christoph %A Rybicki, Joel %A Suomela, Jukka %A Wieringa, Siert %+ External Organizations External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Synchronous Counting and Computational Algorithm Design : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0029-4258-B %R 10.1016/j.jcss.2015.09.002 %D 2016 %J Journal of Computer and System Sciences %V 82 %N 2 %& 310 %P 310 - 332 %I Elsevier %C Amsterdam %@ false
[21]
D. Dolev, M. Függer, C. Lenzen, M. Perner, and U. Schmid, “HEX: Scaling Honeycombs is Easier than Scaling Clock Trees,” Journal of Computer and System Sciences, vol. 82, no. 5, 2016.
Export
BibTeX
@article{Dolev2016, TITLE = {{HEX}: {S}caling Honeycombs is Easier than Scaling Clock Trees}, AUTHOR = {Dolev, Danny and F{\"u}gger, Matthias and Lenzen, Christoph and Perner, Martin and Schmid, Ulrich}, LANGUAGE = {eng}, ISSN = {0022-0000}, DOI = {10.1016/j.jcss.2016.03.001}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2016}, DATE = {2016}, JOURNAL = {Journal of Computer and System Sciences}, VOLUME = {82}, NUMBER = {5}, PAGES = {929--956}, }
Endnote
%0 Journal Article %A Dolev, Danny %A F&#252;gger, Matthias %A Lenzen, Christoph %A Perner, Martin %A Schmid, Ulrich %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T HEX: Scaling Honeycombs is Easier than Scaling Clock Trees : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-41BE-F %R 10.1016/j.jcss.2016.03.001 %7 2016-03-15 %D 2016 %J Journal of Computer and System Sciences %V 82 %N 5 %& 929 %P 929 - 956 %I Elsevier %C Amsterdam %@ false
[22]
R. Duan, J. Garg, and K. Mehlhorn, “Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market,” in Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), Arlington, VA, USA, 2016.
Export
BibTeX
@inproceedings{DuanSODA2016, TITLE = {Improved Combinatorial Polynomial Algorithm for the Linear {Arrow}-{Debreu} Market}, AUTHOR = {Duan, Ran and Garg, Jugal and Mehlhorn, Kurt}, LANGUAGE = {eng}, ISBN = {978-1-61197-433-1}, DOI = {10.1137/1.9781611974331.ch7}, PUBLISHER = {SIAM}, YEAR = {2016}, DATE = {2016}, BOOKTITLE = {Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016)}, EDITOR = {Krauthgamer, Robert}, PAGES = {90--106}, ADDRESS = {Arlington, VA, USA}, }
Endnote
%0 Conference Proceedings %A Duan, Ran %A Garg, Jugal %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 Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-81DD-9 %R 10.1137/1.9781611974331.ch7 %D 2016 %B Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2016-01-10 - 2016-01-12 %C Arlington, VA, USA %B Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms %E Krauthgamer, Robert %P 90 - 106 %I SIAM %@ 978-1-61197-433-1
[23]
F. V. Fomin, P. Heggernes, and E. J. van Leeuwen, “The Firefighter Problem on Graph Classes,” Theoretical Computer Science, vol. 613, 2016.
Export
BibTeX
@article{FominTCS2016, TITLE = {The {Firefighter} Problem on Graph Classes}, AUTHOR = {Fomin, Fedor V. and Heggernes, Pinar and van Leeuwen, Erik Jan}, LANGUAGE = {eng}, ISSN = {0304-3975}, DOI = {10.1016/j.tcs.2015.11.024}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2016}, DATE = {2016}, JOURNAL = {Theoretical Computer Science}, VOLUME = {613}, PAGES = {38--50}, }
Endnote
%0 Journal Article %A Fomin, Fedor V. %A Heggernes, Pinar %A van Leeuwen, Erik Jan %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T The Firefighter Problem on Graph Classes : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0029-B8FB-F %R 10.1016/j.tcs.2015.11.024 %7 2015-11-23 %D 2016 %J Theoretical Computer Science %V 613 %& 38 %P 38 - 50 %I Elsevier %C Amsterdam %@ false
[24]
S. Friedrichs, M. Hemmer, J. King, and C. Schmidt, “The Continuous 1.5D Terrain Guarding Problem: Discretization, Optimal Solutions, and PTAS,” Journal of Computational Geometry, vol. 7, no. 1, 2016.
Export
BibTeX
@article{FriedrichsHemmerSchmidt2016, TITLE = {The Continuous 1.5{D} Terrain Guarding Problem: {D}iscretization, Optimal Solutions, and {PTAS}}, AUTHOR = {Friedrichs, Stephan and Hemmer, Michael and King, James and Schmidt, Christiane}, LANGUAGE = {eng}, ISSN = {1920-180X}, YEAR = {2016}, JOURNAL = {Journal of Computational Geometry}, VOLUME = {7}, NUMBER = {1}, PAGES = {256--284}, }
Endnote
%0 Journal Article %A Friedrichs, Stephan %A Hemmer, Michael %A King, James %A Schmidt, Christiane %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T The Continuous 1.5D Terrain Guarding Problem: Discretization, Optimal Solutions, and PTAS : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-C405-7 %7 2016 %D 2016 %J Journal of Computational Geometry %O JoCG %V 7 %N 1 %& 256 %P 256 - 284 %@ false %U http://jocg.org/index.php/jocg/article/view/242
[25]
S. Friedrichs and C. Lenzen, “Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford,” in SPAA’16, 28th ACM Symposium on Parallelism in Algorithms and Architectures, Pacific Grove, CA, USA, 2016.
Export
BibTeX
@inproceedings{FriedrichsSPAA2016, TITLE = {Parallel Metric Tree Embedding based on an Algebraic View on {Moore}-{Bellman-{Ford}}, AUTHOR = {Friedrichs, Stephan and Lenzen, Christoph}, LANGUAGE = {eng}, ISBN = {978-1-4503-4210-0}, DOI = {10.1145/2935764.2935777}, PUBLISHER = {ACM}, YEAR = {2016}, DATE = {2016}, BOOKTITLE = {SPAA'16, 28th ACM Symposium on Parallelism in Algorithms and Architectures}, DEBUG = {author: Gilbert, Seth}, EDITOR = {Scheideler, Christian}, PAGES = {455--466}, ADDRESS = {Pacific Grove, CA, USA}, }
Endnote
%0 Conference Proceedings %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/11858/00-001M-0000-002B-0302-3 %R 10.1145/2935764.2935777 %D 2016 %B 28th ACM Symposium on Parallelism in Algorithms and Architectures %Z date of event: 2016-07-11 - 2016-07-13 %C Pacific Grove, CA, USA %B SPAA'16 %E Scheideler, Christian; Gilbert, Seth %P 455 - 466 %I ACM %@ 978-1-4503-4210-0
[26]
S. Friedrichs, M. Függer, and C. Lenzen, “Metastability-Containing Circuits,” 2016. [Online]. Available: http://arxiv.org/abs/1606.06570. (arXiv: 1606.06570)
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
@online{Friedrichs_Fuegger_Lenzen2016, TITLE = {Metastability-Containing Circuits}, AUTHOR = {Friedrichs, Stephan and F{\"u}gger, Matthias and Lenzen, Christoph}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1606.06570}, EPRINT = {1606.06570}, EPRINTTYPE = {arXiv}, YEAR = {2016}, 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.}, }
Endnote
%0 Report %A Friedrichs, Stephan %A F&#252;gger, Matthias %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 %T Metastability-Containing Circuits : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002B-0304-0 %U http://arxiv.org/abs/1606.06570 %D 2016 %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
[27]
M. Függer, T. Nowak, and U. Schmid, “Unfaithful Glitch Propagation in Existing Binary Circuit Models,” IEEE Transactions on Computers, vol. 65, no. 3, 2016.
Export
BibTeX
@article{Fuegger2016, TITLE = {Unfaithful Glitch Propagation in Existing Binary Circuit Models}, AUTHOR = {F{\"u}gger, Matthias and Nowak, Thomas and Schmid, Ulrich}, LANGUAGE = {eng}, ISSN = {0018-9340}, DOI = {10.1109/TC.2015.2435791}, PUBLISHER = {IEEE}, ADDRESS = {Piscataway, NJ}, YEAR = {2016}, DATE = {2016}, JOURNAL = {IEEE Transactions on Computers}, VOLUME = {65}, NUMBER = {3}, PAGES = {964--978}, }
Endnote
%0 Journal Article %A F&#252;gger, Matthias %A Nowak, Thomas %A Schmid, Ulrich %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Unfaithful Glitch Propagation in Existing Binary Circuit Models : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-1161-D %R 10.1109/TC.2015.2435791 %7 2016 %D 2016 %J IEEE Transactions on Computers %V 65 %N 3 %& 964 %P 964 - 978 %I IEEE %C Piscataway, NJ %@ false
[28]
S. Garg and G. Philip, “Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee,” in Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), Arlington, VA, USA, 2016.
Export
BibTeX
@inproceedings{GargSODA2015, TITLE = {Raising The Bar For Vertex Cover: {F}ixed-parameter Tractability Above A Higher Guarantee}, AUTHOR = {Garg, Shivam and Philip, Geevarghese}, LANGUAGE = {eng}, ISBN = {978-1-61197-433-1}, DOI = {10.1137/1.9781611974331.ch80}, PUBLISHER = {SIAM}, YEAR = {2016}, BOOKTITLE = {Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016)}, EDITOR = {Krauthgamer, Robert}, PAGES = {1152--1166}, ADDRESS = {Arlington, VA, USA}, }
Endnote
%0 Conference Proceedings %A Garg, Shivam %A Philip, Geevarghese %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-8205-0 %R 10.1137/1.9781611974331.ch80 %D 2016 %B Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2016-01-10 - 2016-01-12 %C Arlington, VA, USA %B Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms %E Krauthgamer, Robert %P 1152 - 1166 %I SIAM %@ 978-1-61197-433-1
[29]
P. A. Golovach, D. Paulusma, and E. J. van Leeuwen, “Induced Disjoint Paths in Circular-Arc Graphs in Linear Time,” Theoretical Computer Science, vol. 640, 2016.
Export
BibTeX
@article{GolovachTCS2016, TITLE = {Induced Disjoint Paths in Circular-Arc Graphs in Linear Time}, AUTHOR = {Golovach, Petr A. and Paulusma, Dani{\"e}l and van Leeuwen, Erik Jan}, LANGUAGE = {eng}, ISSN = {0304-3975}, DOI = {10.1016/j.tcs.2016.06.003}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2016}, DATE = {2016}, JOURNAL = {Theoretical Computer Science}, VOLUME = {640}, PAGES = {70--83}, }
Endnote
%0 Journal Article %A Golovach, Petr A. %A Paulusma, Dani&#235;l %A van Leeuwen, Erik Jan %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Induced Disjoint Paths in Circular-Arc Graphs in Linear Time : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002B-459D-2 %R 10.1016/j.tcs.2016.06.003 %7 2016 %D 2016 %J Theoretical Computer Science %V 640 %& 70 %P 70 - 83 %I Elsevier %C Amsterdam %@ false
[30]
S. Heydrich and R. van Stee, “Beating the Harmonic Lower Bound for Online Bin Packing,” in 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), Rome, Italy, 2016.
Export
BibTeX
@inproceedings{HeydrichICALP2016, TITLE = {Beating the Harmonic Lower Bound for Online Bin Packing}, AUTHOR = {Heydrich, Sandy and van Stee, Rob}, LANGUAGE = {eng}, ISBN = {978-3-95977-013-2}, URL = {urn:nbn:de:0030-drops-63214}, DOI = {10.4230/LIPIcs.ICALP.2016.41}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2016}, BOOKTITLE = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, EDITOR = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, EID = {41}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {55}, ADDRESS = {Rome, Italy}, }
Endnote
%0 Conference Proceedings %A Heydrich, Sandy %A van Stee, Rob %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Beating the Harmonic Lower Bound for Online Bin Packing : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002B-4294-6 %R 10.4230/LIPIcs.ICALP.2016.41 %U urn:nbn:de:0030-drops-63214 %D 2016 %B 43rd International Colloquium on Automata, Languages, and Programming %Z date of event: 2016-07-12 - 2016-07-15 %C Rome, Italy %B 43rd International Colloquium on Automata, Languages, and Programming %E Chatzigiannakis, Ioannis; Mitzenmacher, Michael; Rabani, Yuval; Sangiorgi, Davide %Z sequence number: 41 %I Schloss Dagstuhl %@ 978-3-95977-013-2 %B Leibniz International Proceedings in Informatics %N 55 %U http://drops.dagstuhl.de/opus/volltexte/2016/6321/http://drops.dagstuhl.de/doku/urheberrecht1.html
[31]
M. Hoefer, T. Kesselheim, and B. Vöcking, “Truthfulness and Stochastic Dominance with Monetary Transfers,” ACM Transactions on Economics and Computation, vol. 4, no. 2, 2016.
Export
BibTeX
@article{HoeferTEC2016, TITLE = {Truthfulness and Stochastic Dominance with Monetary Transfers}, AUTHOR = {Hoefer, Martin and Kesselheim, Thomas and V{\"o}cking, Berthold}, LANGUAGE = {eng}, DOI = {10.1145/2847522}, PUBLISHER = {ACM}, ADDRESS = {New York, NY}, YEAR = {2016}, DATE = {2016}, JOURNAL = {ACM Transactions on Economics and Computation}, VOLUME = {4}, NUMBER = {2}, EID = {11}, }
Endnote
%0 Journal Article %A Hoefer, Martin %A Kesselheim, Thomas %A V&#246;cking, Berthold %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Truthfulness and Stochastic Dominance with Monetary Transfers : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002B-0216-0 %R 10.1145/2847522 %7 2016 %D 2016 %J ACM Transactions on Economics and Computation %V 4 %N 2 %Z sequence number: 11 %I ACM %C New York, NY
[32]
C.-C. Huang, T. Kavitha, K. Mehlhorn, and D. Michail, “Fair Matchings and Related Problems,” Algorithmica, vol. 74, no. 3, 2016.
Export
BibTeX
@article{Huang2016, TITLE = {Fair Matchings and Related Problems}, AUTHOR = {Huang, Chien-Chung and Kavitha, Telikepalli and Mehlhorn, Kurt and Michail, Dimitrios}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-015-9994-9}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2016}, DATE = {2016}, JOURNAL = {Algorithmica}, VOLUME = {74}, NUMBER = {3}, PAGES = {1184--1203}, }
Endnote
%0 Journal Article %A Huang, Chien-Chung %A Kavitha, Telikepalli %A Mehlhorn, Kurt %A Michail, Dimitrios %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Fair Matchings and Related Problems : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-115F-4 %R 10.1007/s00453-015-9994-9 %7 2016 %D 2016 %J Algorithmica %V 74 %N 3 %& 1184 %P 1184 - 1203 %I Springer %C New York, NY %@ false
[33]
A. Jeż, “One-variable Word Equations in Linear Time,” Algorithmica, vol. 74, no. 1, 2016.
Export
BibTeX
@article{JezAlgorithmica2016, TITLE = {One-variable Word Equations in Linear Time}, AUTHOR = {Je{\.z}, Artur}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-014-9931-3}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2016}, DATE = {2016}, JOURNAL = {Algorithmica}, VOLUME = {74}, NUMBER = {1}, PAGES = {1--48}, }
Endnote
%0 Journal Article %A Je&#380;, Artur %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society %T One-variable Word Equations in Linear Time : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0029-75F8-F %R 10.1007/s00453-014-9931-3 %7 2014 %D 2016 %J Algorithmica %V 74 %N 1 %& 1 %P 1 - 48 %I Springer %C New York, NY %@ false
[34]
M. Kerber, D. R. Sheehy, and P. Skraba, “Persistent Homology and Nested Dissection,” in Proceedings of the Twenty-Seventh ACM-SIAM Annual Symposium on Discrete Algorithms (SODA 2016), Arlington, VA, USA, 2016.
Export
BibTeX
@inproceedings{KerberSODA2015, TITLE = {Persistent Homology and Nested Dissection}, AUTHOR = {Kerber, Michael and Sheehy, Donald R. and Skraba, Primoz}, LANGUAGE = {eng}, ISBN = {978-1-61197-433-1}, DOI = {10.1137/1.9781611974331.ch86}, PUBLISHER = {SIAM}, YEAR = {2016}, DATE = {2016}, BOOKTITLE = {Proceedings of the Twenty-Seventh ACM-SIAM Annual Symposium on Discrete Algorithms (SODA 2016)}, EDITOR = {Krauthgamer, Robert}, PAGES = {1234--1245}, ADDRESS = {Arlington, VA, USA}, }
Endnote
%0 Conference Proceedings %A Kerber, Michael %A Sheehy, Donald R. %A Skraba, Primoz %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Persistent Homology and Nested Dissection : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002B-0267-9 %R 10.1137/1.9781611974331.ch86 %D 2016 %B Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2016-01-10 - 2016-01-12 %C Arlington, VA, USA %B Proceedings of the Twenty-Seventh ACM-SIAM Annual Symposium on Discrete Algorithms %E Krauthgamer, Robert %P 1234 - 1245 %I SIAM %@ 978-1-61197-433-1
[35]
M. Kerber, D. Morozov, and A. Nigmetov, “Geometry Helps to Compare Persistence Diagrams,” in ALENEX16, Meeting on Algorithm Engineering & Experiments, Arlington, VA, USA, 2016.
Export
BibTeX
@inproceedings{KerberALENEX2016, TITLE = {Geometry Helps to Compare Persistence Diagrams}, AUTHOR = {Kerber, Michael and Morozov, Dimitriy and Nigmetov, Amur}, LANGUAGE = {eng}, ISBN = {978-1-61197-431-7}, DOI = {10.1137/1.9781611974317.9}, PUBLISHER = {SIAM}, YEAR = {2016}, BOOKTITLE = {ALENEX16, Meeting on Algorithm Engineering \& Experiments}, EDITOR = {Goodrich, Michael and Mitzenmacher, Michael}, PAGES = {103--112}, ADDRESS = {Arlington, VA, USA}, }
Endnote
%0 Conference Proceedings %A Kerber, Michael %A Morozov, Dimitriy %A Nigmetov, Amur %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Geometry Helps to Compare Persistence Diagrams : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002B-0259-9 %R 10.1137/1.9781611974317.9 %D 2016 %B Meeting on Algorithm Engineering & Experiments %Z date of event: 2016-01-10 - 2016-01-10 %C Arlington, VA, USA %B ALENEX16 %E Goodrich, Michael; Mitzenmacher, Michael %P 103 - 112 %I SIAM %@ 978-1-61197-431-7
[36]
M. Kerber, D. Morozov, and A. Nigmetov, “Geometry Helps to Compare Persistence Diagrams,” 2016. [Online]. Available: http://arxiv.org/abs/1606.03357. (arXiv: 1606.03357)
Abstract
Exploiting geometric structure to improve the asymptotic complexity of discrete assignment problems is a well-studied subject. In contrast, the practical advantages of using geometry for such problems have not been explored. We implement geometric variants of the Hopcroft--Karp algorithm for bottleneck matching (based on previous work by Efrat el al.) and of the auction algorithm by Bertsekas for Wasserstein distance computation. Both implementations use k-d trees to replace a linear scan with a geometric proximity query. Our interest in this problem stems from the desire to compute distances between persistence diagrams, a problem that comes up frequently in topological data analysis. We show that our geometric matching algorithms lead to a substantial performance gain, both in running time and in memory consumption, over their purely combinatorial counterparts. Moreover, our implementation significantly outperforms the only other implementation available for comparing persistence diagrams.
Export
BibTeX
@online{KerberarXiv2016, TITLE = {Geometry Helps to Compare Persistence Diagrams}, AUTHOR = {Kerber, Michael and Morozov, Dmitriy and Nigmetov, Arnur}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1606.03357}, EPRINT = {1606.03357}, EPRINTTYPE = {arXiv}, YEAR = {2016}, ABSTRACT = {Exploiting geometric structure to improve the asymptotic complexity of discrete assignment problems is a well-studied subject. In contrast, the practical advantages of using geometry for such problems have not been explored. We implement geometric variants of the Hopcroft--Karp algorithm for bottleneck matching (based on previous work by Efrat el al.) and of the auction algorithm by Bertsekas for Wasserstein distance computation. Both implementations use k-d trees to replace a linear scan with a geometric proximity query. Our interest in this problem stems from the desire to compute distances between persistence diagrams, a problem that comes up frequently in topological data analysis. We show that our geometric matching algorithms lead to a substantial performance gain, both in running time and in memory consumption, over their purely combinatorial counterparts. Moreover, our implementation significantly outperforms the only other implementation available for comparing persistence diagrams.}, }
Endnote
%0 Report %A Kerber, Michael %A Morozov, Dmitriy %A Nigmetov, Arnur %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Geometry Helps to Compare Persistence Diagrams : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002B-029A-6 %U http://arxiv.org/abs/1606.03357 %D 2016 %X Exploiting geometric structure to improve the asymptotic complexity of discrete assignment problems is a well-studied subject. In contrast, the practical advantages of using geometry for such problems have not been explored. We implement geometric variants of the Hopcroft--Karp algorithm for bottleneck matching (based on previous work by Efrat el al.) and of the auction algorithm by Bertsekas for Wasserstein distance computation. Both implementations use k-d trees to replace a linear scan with a geometric proximity query. Our interest in this problem stems from the desire to compute distances between persistence diagrams, a problem that comes up frequently in topological data analysis. We show that our geometric matching algorithms lead to a substantial performance gain, both in running time and in memory consumption, over their purely combinatorial counterparts. Moreover, our implementation significantly outperforms the only other implementation available for comparing persistence diagrams. %K Computer Science, Computational Geometry, cs.CG
[37]
A. Kobel, F. Rouillier, and M. Sagraloff, “Computing Real Roots of Real Polynomials ... and now For Real!,” in ISSAC 2016, 41st International Symposium on Symbolic and Algebraic Computation, Waterloo, Ontario, Canada, 2016.
Export
BibTeX
@inproceedings{KobelISSAC2016, TITLE = {Computing Real Roots of Real Polynomials ... and now For Real!}, AUTHOR = {Kobel, Alexander and Rouillier, Fabrice and Sagraloff, Michael}, LANGUAGE = {eng}, ISBN = {978-1-4503-4380-0}, DOI = {10.1145/2930889.2930937}, PUBLISHER = {ACM}, YEAR = {2016}, DATE = {2016}, BOOKTITLE = {ISSAC 2016, 41st International Symposium on Symbolic and Algebraic Computation}, EDITOR = {Rosenkranz, Markus}, PAGES = {303--310}, ADDRESS = {Waterloo, Ontario, Canada}, }
Endnote
%0 Conference Proceedings %A Kobel, Alexander %A Rouillier, Fabrice %A Sagraloff, Michael %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Computing Real Roots of Real Polynomials ... and now For Real! : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002B-02AB-F %R 10.1145/2930889.2930937 %D 2016 %B 41st International Symposium on Symbolic and Algebraic Computation %Z date of event: 2016-06-19 - 2016-06-22 %C Waterloo, Ontario, Canada %B ISSAC 2016 %E Rosenkranz, Markus %P 303 - 310 %I ACM %@ 978-1-4503-4380-0
[38]
A. Kobel, F. Rouillier, and M. Sagraloff, “Computing Real Roots of Real Polynomials ... and now For Real!,” 2016. [Online]. Available: http://arxiv.org/abs/1605.00410. (arXiv: 1605.00410)
Abstract
Very recent work introduces an asymptotically fast subdivision algorithm, denoted ANewDsc, for isolating the real roots of a univariate real polynomial. The method combines Descartes' Rule of Signs to test intervals for the existence of roots, Newton iteration to speed up convergence against clusters of roots, and approximate computation to decrease the required precision. It achieves record bounds on the worst-case complexity for the considered problem, matching the complexity of Pan's method for computing all complex roots and improving upon the complexity of other subdivision methods by several magnitudes. In the article at hand, we report on an implementation of ANewDsc on top of the RS root isolator. RS is a highly efficient realization of the classical Descartes method and currently serves as the default real root solver in Maple. We describe crucial design changes within ANewDsc and RS that led to a high-performance implementation without harming the theoretical complexity of the underlying algorithm. With an excerpt of our extensive collection of benchmarks, available online at http://anewdsc.mpi-inf.mpg.de/, we illustrate that the theoretical gain in performance of ANewDsc over other subdivision methods also transfers into practice. These experiments also show that our new implementation outperforms both RS and mature competitors by magnitudes for notoriously hard instances with clustered roots. For all other instances, we avoid almost any overhead by integrating additional optimizations and heuristics.
Export
BibTeX
@online{KobelarXiv2016, TITLE = {Computing Real Roots of Real Polynomials ... and now For Real!}, AUTHOR = {Kobel, Alexander and Rouillier, Fabrice and Sagraloff, Michael}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1605.00410}, EPRINT = {1605.00410}, EPRINTTYPE = {arXiv}, YEAR = {2016}, ABSTRACT = {Very recent work introduces an asymptotically fast subdivision algorithm, denoted ANewDsc, for isolating the real roots of a univariate real polynomial. The method combines Descartes' Rule of Signs to test intervals for the existence of roots, Newton iteration to speed up convergence against clusters of roots, and approximate computation to decrease the required precision. It achieves record bounds on the worst-case complexity for the considered problem, matching the complexity of Pan's method for computing all complex roots and improving upon the complexity of other subdivision methods by several magnitudes. In the article at hand, we report on an implementation of ANewDsc on top of the RS root isolator. RS is a highly efficient realization of the classical Descartes method and currently serves as the default real root solver in Maple. We describe crucial design changes within ANewDsc and RS that led to a high-performance implementation without harming the theoretical complexity of the underlying algorithm. With an excerpt of our extensive collection of benchmarks, available online at http://anewdsc.mpi-inf.mpg.de/, we illustrate that the theoretical gain in performance of ANewDsc over other subdivision methods also transfers into practice. These experiments also show that our new implementation outperforms both RS and mature competitors by magnitudes for notoriously hard instances with clustered roots. For all other instances, we avoid almost any overhead by integrating additional optimizations and heuristics.}, }
Endnote
%0 Report %A Kobel, Alexander %A Rouillier, Fabrice %A Sagraloff, Michael %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Computing Real Roots of Real Polynomials ... and now For Real! : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002B-029D-F %U http://arxiv.org/abs/1605.00410 %D 2016 %X Very recent work introduces an asymptotically fast subdivision algorithm, denoted ANewDsc, for isolating the real roots of a univariate real polynomial. The method combines Descartes' Rule of Signs to test intervals for the existence of roots, Newton iteration to speed up convergence against clusters of roots, and approximate computation to decrease the required precision. It achieves record bounds on the worst-case complexity for the considered problem, matching the complexity of Pan's method for computing all complex roots and improving upon the complexity of other subdivision methods by several magnitudes. In the article at hand, we report on an implementation of ANewDsc on top of the RS root isolator. RS is a highly efficient realization of the classical Descartes method and currently serves as the default real root solver in Maple. We describe crucial design changes within ANewDsc and RS that led to a high-performance implementation without harming the theoretical complexity of the underlying algorithm. With an excerpt of our extensive collection of benchmarks, available online at http://anewdsc.mpi-inf.mpg.de/, we illustrate that the theoretical gain in performance of ANewDsc over other subdivision methods also transfers into practice. These experiments also show that our new implementation outperforms both RS and mature competitors by magnitudes for notoriously hard instances with clustered roots. For all other instances, we avoid almost any overhead by integrating additional optimizations and heuristics. %K Computer Science, Mathematical Software, cs.MS,Computer Science, Numerical Analysis, cs.NA,Computer Science, Symbolic Computation, cs.SC,Mathematics, Numerical Analysis, math.NA,
[39]
P. Kolev and K. Mehlhorn, “A Note On Spectral Clustering,” in Algorithms -- ESA, Aarhus, Denmark. (Accepted/in press)
Export
BibTeX
@inproceedings{KolevESA2016, TITLE = {A Note On Spectral Clustering}, AUTHOR = {Kolev, Pavel and Mehlhorn, Kurt}, LANGUAGE = {eng}, YEAR = {2016}, PUBLREMARK = {Accepted}, BOOKTITLE = {Algorithms -- ESA}, ADDRESS = {Aarhus, Denmark}, }
Endnote
%0 Conference Proceedings %A Kolev, Pavel %A Mehlhorn, Kurt %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Note On Spectral Clustering : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002B-4797-D %D 2016 %B 24th Annual European Symposium on Algorithms %Z date of event: 2016-08-22 - 2016-08-26 %C Aarhus, Denmark %B Algorithms -- ESA
[40]
G. Kol, S. Moran, A. Shpilka, and A. Yehudayoff, “Direct Sum Fails for Zero-Error Average Communication,” Algorithmica, vol. First Online, 2016.
Export
BibTeX
@article{Kol2016, TITLE = {Direct Sum Fails for Zero-Error Average Communication}, AUTHOR = {Kol, Gillat and Moran, Shay and Shpilka, Amir and Yehudayoff, Amir}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-016-0144-9}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2016}, JOURNAL = {Algorithmica}, VOLUME = {First Online}, }
Endnote
%0 Journal Article %A Kol, Gillat %A Moran, Shay %A Shpilka, Amir %A Yehudayoff, Amir %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Direct Sum Fails for Zero-Error Average Communication : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-41D1-1 %R 10.1007/s00453-016-0144-9 %7 2016-03-28 %D 2016 %8 28.03.2016 %J Algorithmica %V First Online %I Springer %C New York, NY %@ false
[41]
S. Kratsch, D. Marx, and M. Wahlström, “Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems,” ACM Transactions on Computation Theory, vol. 8, no. 1, 2016.
Export
BibTeX
@article{Kratsch2016, TITLE = {Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems}, AUTHOR = {Kratsch, Stefan and Marx, D{\'a}niel and Wahlstr{\"o}m, Magnus}, LANGUAGE = {eng}, DOI = {10.1145/2858787}, PUBLISHER = {ACM}, ADDRESS = {New York, NY}, YEAR = {2016}, DATE = {2016}, JOURNAL = {ACM Transactions on Computation Theory}, VOLUME = {8}, NUMBER = {1}, EID = {1}, }
Endnote
%0 Journal Article %A Kratsch, Stefan %A Marx, D&#225;niel %A Wahlstr&#246;m, Magnus %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-4326-D %R 10.1145/2858787 %7 2016 %D 2016 %J ACM Transactions on Computation Theory %O TOCT %V 8 %N 1 %Z sequence number: 1 %I ACM %C New York, NY
[42]
S. Kratsch, G. Philip, and S. Ray, “Point Line Cover: The Easy Kernel is Essentially Tight,” ACM Transactions on Algorithms, vol. 12, no. 3, 2016.
Export
BibTeX
@article{Kratsch2016TALG, TITLE = {Point Line Cover: The Easy Kernel is Essentially Tight}, AUTHOR = {Kratsch, Stefan and Philip, Geevarghese and Ray, Saurabh}, LANGUAGE = {eng}, ISSN = {1549-6325}, DOI = {10.1145/2832912}, PUBLISHER = {Association for Computing Machinery}, ADDRESS = {New York, NY}, YEAR = {2016}, DATE = {2016}, JOURNAL = {ACM Transactions on Algorithms}, VOLUME = {12}, NUMBER = {3}, EID = {40}, }
Endnote
%0 Journal Article %A Kratsch, Stefan %A Philip, Geevarghese %A Ray, Saurabh %+ 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 Point Line Cover: The Easy Kernel is Essentially Tight : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002B-195B-8 %R 10.1145/2832912 %7 2016 %D 2016 %J ACM Transactions on Algorithms %V 12 %N 3 %Z sequence number: 40 %I Association for Computing Machinery %C New York, NY %@ false
[43]
M. Künnemann, “Tight(er) Bounds for Similarity Measures, Smoothed Approximation and Broadcasting,” Universität des Saarlandes, Saarbrücken, 2016.
Export
BibTeX
@phdthesis{Kuennemannphd2016, TITLE = {Tight(er) Bounds for Similarity Measures, Smoothed Approximation and Broadcasting}, AUTHOR = {K{\"u}nnemann, Marvin}, LANGUAGE = {eng}, URL = {urn:nbn:de:bsz:291-scidok-65991}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2016}, DATE = {2016}, }
Endnote
%0 Thesis %A K&#252;nnemann, Marvin %Y Doerr, Benjamin %A referee: Mehlhorn, Kurt %A referee: Welzl, Emo %+ 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 Tight(er) Bounds for Similarity Measures, Smoothed Approximation and Broadcasting : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002B-423A-3 %U urn:nbn:de:bsz:291-scidok-65991 %I Universit&#228;t des Saarlandes %C Saarbr&#252;cken %D 2016 %P XI, 223 p. %V phd %9 phd %U http://scidok.sulb.uni-saarland.de/volltexte/2016/6599/http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=de
[44]
A. Kurpisz, M. Mastrolilli, C. Mathieu, T. Mömke, V. Verdugo, and A. Wiese, “Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines,” in Integer Programming and Combinatorial Optimization (IPCO 2016), Liège, Belgium, 2016.
Export
BibTeX
@inproceedings{KurpiszIPCO2016, 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}, ISBN = {978-3-319-33460-8}, DOI = {10.1007/978-3-319-33461-5_13}, PUBLISHER = {Springer}, YEAR = {2016}, DATE = {2016}, BOOKTITLE = {Integer Programming and Combinatorial Optimization (IPCO 2016)}, EDITOR = {Louveaux, Quentin and Skutella, Martin}, PAGES = {152--163}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9682}, ADDRESS = {Li{\`e}ge, Belgium}, }
Endnote
%0 Conference Proceedings %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/11858/00-001M-0000-002B-0240-0 %R 10.1007/978-3-319-33461-5_13 %D 2016 %B 18th Conference on Integer Programming and Combinatorial Optimization %Z date of event: 2016-06-01 - 2016-06-03 %C Li&#232;ge, Belgium %B Integer Programming and Combinatorial Optimization %E Louveaux, Quentin; Skutella, Martin %P 152 - 163 %I Springer %@ 978-3-319-33460-8 %B Lecture Notes in Computer Science %N 9682
[45]
D. Lokshtanov, M. Pilipczuk, and E. J. van Leeuwen, “Independence and Efficient Domination on P6-free Graphs,” in Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), Arlington, VA, USA, 2016.
Export
BibTeX
@inproceedings{LokshtanovSODA2015, TITLE = {Independence and Efficient Domination on $P_6$-free Graphs}, AUTHOR = {Lokshtanov, Daniel and Pilipczuk, Marcin and van Leeuwen, Erik Jan}, LANGUAGE = {eng}, ISBN = {978-1-61197-433-1}, DOI = {10.1137/1.9781611974331.ch124}, PUBLISHER = {SIAM}, YEAR = {2016}, DATE = {2016}, BOOKTITLE = {Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016)}, EDITOR = {Krauthgamer, Robert}, PAGES = {1784--1803}, ADDRESS = {Arlington, VA, USA}, }
Endnote
%0 Conference Proceedings %A Lokshtanov, Daniel %A Pilipczuk, Marcin %A van Leeuwen, Erik Jan %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Independence and Efficient Domination on P6-free Graphs : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0029-2497-D %R 10.1137/1.9781611974331.ch124 %D 2016 %B Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2016-01-10 - 2016-01-12 %C Arlington, VA, USA %B Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms %E Krauthgamer, Robert %P 1784 - 1803 %I SIAM %@ 978-1-61197-433-1
[46]
K. Mehlhorn, “Algorithms and Programs : Erasmus Lecture 2014,” European review, vol. 24, no. 1, 2016.
Export
BibTeX
@article{MehlhornErasmus2014, TITLE = {Algorithms and Programs : Erasmus Lecture 2014}, AUTHOR = {Mehlhorn, Kurt}, LANGUAGE = {eng}, ISSN = {1062-7987}, DOI = {10.1017/S1062798715000381}, PUBLISHER = {Cambridge University Press}, ADDRESS = {Cambridge}, YEAR = {2016}, DATE = {2016}, JOURNAL = {European review}, VOLUME = {24}, NUMBER = {1}, PAGES = {4--16}, }
Endnote
%0 Journal Article %A Mehlhorn, Kurt %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Algorithms and Programs : Erasmus Lecture 2014 : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-07A2-A %R 10.1017/S1062798715000381 %7 2016 %D 2016 %J European review %V 24 %N 1 %& 4 %P 4 - 16 %I Cambridge University Press %C Cambridge %@ false
[47]
A. Mehrabian and A. Pourmiri, “Randomized Rumor Spreading in Poorly Connected Small-world Networks,” Random Structures and Algorithms, vol. 49, no. 1, 2016.
Export
BibTeX
@article{Mehrabian2015, TITLE = {Randomized Rumor Spreading in Poorly Connected Small-world Networks}, AUTHOR = {Mehrabian, Abbas and Pourmiri, Ali}, LANGUAGE = {eng}, ISSN = {1042-9832}, DOI = {10.1002/rsa.20624}, PUBLISHER = {Wiley}, ADDRESS = {New York, NY}, YEAR = {2016}, DATE = {2016}, JOURNAL = {Random Structures and Algorithms}, VOLUME = {49}, NUMBER = {1}, PAGES = {185--208}, }
Endnote
%0 Journal Article %A Mehrabian, Abbas %A Pourmiri, Ali %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Randomized Rumor Spreading in Poorly Connected Small-world Networks : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0029-087E-7 %R 10.1002/rsa.20624 %7 2015-11-19 %D 2016 %J Random Structures and Algorithms %V 49 %N 1 %& 185 %P 185 - 208 %I Wiley %C New York, NY %@ false
[48]
M. Mnich and E. J. van Leeuwen, “Polynomial Kernels for Deletion to Classes of Acyclic Digraphs,” in 33rd International Symposium on Theoretical Aspects of Computer Science (STACS 2016), Orléans, France, 2016.
Export
BibTeX
@inproceedings{MnichSTACS2016, TITLE = {Polynomial Kernels for Deletion to Classes of Acyclic Digraphs}, AUTHOR = {Mnich, Matthias and van Leeuwen, Erik Jan}, LANGUAGE = {eng}, ISSN = {1868-896}, ISBN = {978-3-95977-001-9}, URL = {urn:nbn:de:0030-drops-57569}, DOI = {10.4230/LIPIcs.STACS.2016.55}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2016}, BOOKTITLE = {33rd International Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, EDITOR = {Ollinger, Nicolas and Vollmer, Heribert}, PAGES = {1--13}, EID = {55}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {47}, ADDRESS = {Orl{\'e}ans, France}, }
Endnote
%0 Conference Proceedings %A Mnich, Matthias %A van Leeuwen, Erik Jan %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Polynomial Kernels for Deletion to Classes of Acyclic Digraphs : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-431F-0 %R 10.4230/LIPIcs.STACS.2016.55 %U urn:nbn:de:0030-drops-57569 %D 2016 %B 33rd International Symposium on Theoretical Aspects of Computer Science %Z date of event: 2016-02-17 - 2016-02-20 %C Orl&#233;ans, France %B 33rd International Symposium on Theoretical Aspects of Computer Science %E Ollinger, Nicolas; Vollmer, Heribert %P 1 - 13 %Z sequence number: 55 %I Schloss Dagstuhl %@ 978-3-95977-001-9 %B Leibniz International Proceedings in Informatics %N 47 %@ false %U http://drops.dagstuhl.de/doku/urheberrecht1.htmlhttp://drops.dagstuhl.de/opus/volltexte/2016/5756/
[49]
S. Moran and A. Yehudayoff, “Sample Compression Schemes for VC Classes,” Journal of the ACM, vol. 63, no. 3, 2016.
Export
BibTeX
@article{MoranJACM2016, TITLE = {Sample Compression Schemes for {VC} Classes}, AUTHOR = {Moran, Shay and Yehudayoff, Amir}, LANGUAGE = {eng}, DOI = {10.1145/2890490}, YEAR = {2016}, DATE = {2016}, JOURNAL = {Journal of the ACM}, VOLUME = {63}, NUMBER = {3}, EID = {21}, }
Endnote
%0 Journal Article %A Moran, Shay %A Yehudayoff, Amir %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Sample Compression Schemes for VC Classes : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002B-0C0A-7 %R 10.1145/2890490 %7 2016 %D 2016 %J Journal of the ACM %O JACM %V 63 %N 3 %Z sequence number: 21
[50]
S. Moran and A. Yehudayoff, “A Note on Average-case Sorting,” Order, vol. 33, no. 1, 2016.
Export
BibTeX
@article{Moran2016, TITLE = {A Note on Average-case Sorting}, AUTHOR = {Moran, Shay and Yehudayoff, Amir}, LANGUAGE = {eng}, ISSN = {0167-8094}, DOI = {10.1007/s11083-015-9347-y}, PUBLISHER = {Springer}, ADDRESS = {Dordrecht}, YEAR = {2016}, DATE = {2016}, JOURNAL = {Order}, VOLUME = {33}, NUMBER = {1}, PAGES = {23--28}, }
Endnote
%0 Journal Article %A Moran, Shay %A Yehudayoff, Amir %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T A Note on Average-case Sorting : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0029-D223-7 %R 10.1007/s11083-015-9347-y %7 2016 %D 2016 %J Order %V 33 %N 1 %& 23 %P 23 - 28 %I Springer %C Dordrecht %@ false
[51]
G. Nadiradze and A. Wiese, “On Approximating Strip Packing with a Better Ratio than 3/2,” in Proceedings of the Twenty-Seventh ACM-SIAM Annual Symposium on Discrete Algorithms (SODA 2016), Arlington, VA, USA, 2016.
Export
BibTeX
@inproceedings{NadiradzeSODA2015, TITLE = {On Approximating Strip Packing with a Better Ratio than 3/2}, AUTHOR = {Nadiradze, Giorgi and Wiese, Andreas}, LANGUAGE = {eng}, ISBN = {978-1-61197-433-1}, DOI = {10.1137/1.9781611974331.ch102}, PUBLISHER = {SIAM}, YEAR = {2016}, DATE = {2016}, BOOKTITLE = {Proceedings of the Twenty-Seventh ACM-SIAM Annual Symposium on Discrete Algorithms (SODA 2016)}, EDITOR = {Krauthgamer, Robert}, PAGES = {1491--1510}, ADDRESS = {Arlington, VA, USA}, }
Endnote
%0 Conference Proceedings %A Nadiradze, Giorgi %A Wiese, Andreas %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T On Approximating Strip Packing with a Better Ratio than 3/2 : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-81FA-7 %R 10.1137/1.9781611974331.ch102 %D 2016 %B Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2016-01-10 - 2016-01-12 %C Arlington, VA, USA %B Proceedings of the Twenty-Seventh ACM-SIAM Annual Symposium on Discrete Algorithms %E Krauthgamer, Robert %P 1491 - 1510 %I SIAM %@ 978-1-61197-433-1
[52]
S. Neumann and A. Wiese, “This House Proves That Debating is Harder Than Soccer,” in 8th International Conference on Fun with Algorithms, La Maddalena, Italy, 2016.
Export
BibTeX
@inproceedings{NeumannFUN2016, TITLE = {This House Proves That Debating is Harder Than Soccer}, AUTHOR = {Neumann, Stefan and Wiese, Andreas}, LANGUAGE = {eng}, ISBN = {978-3-95977-005-7}, URL = {urn:nbn:de:0030-drops-58716}, DOI = {10.4230/LIPIcs.FUN.2016.25}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2016}, BOOKTITLE = {8th International Conference on Fun with Algorithms}, EDITOR = {Demaine, Erik D. and Grandoni, Fabrizio}, EID = {25}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {49}, ADDRESS = {La Maddalena, Italy}, }
Endnote
%0 Conference Proceedings %A Neumann, Stefan %A Wiese, Andreas %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T This House Proves That Debating is Harder Than Soccer : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002B-0231-1 %R 10.4230/LIPIcs.FUN.2016.25 %U urn:nbn:de:0030-drops-58716 %D 2016 %B 8th International Conference on Fun with Algorithms %Z date of event: 2016-06-08 - 2016-06-10 %C La Maddalena, Italy %B 8th International Conference on Fun with Algorithms %E Demaine, Erik D.; Grandoni, Fabrizio %Z sequence number: 25 %I Schloss Dagstuhl %@ 978-3-95977-005-7 %B Leibniz International Proceedings in Informatics %N 49 %U http://drops.dagstuhl.de/opus/volltexte/2016/5871/http://drops.dagstuhl.de/doku/urheberrecht1.html
[53]
S. Neumann and A. Wiese, “This House Proves that Debating is Harder than Soccer,” 2016. [Online]. Available: http://arxiv.org/abs/1605.03063. (arXiv: 1605.03063)
Abstract
During the last twenty years, a lot of research was conducted on the sport elimination problem: Given a sports league and its remaining matches, we have to decide whether a given team can still possibly win the competition, i.e., place first in the league at the end. Previously, the computational complexity of this problem was investigated only for games with two participating teams per game. In this paper we consider Debating Tournaments and Debating Leagues in the British Parliamentary format, where four teams are participating in each game. We prove that it is NP-hard to decide whether a given team can win a Debating League, even if at most two matches are remaining for each team. This contrasts settings like football where two teams play in each game since there this case is still polynomial time solvable. We prove our result even for a fictitious restricted setting with only three teams per game. On the other hand, for the common setting of Debating Tournaments we show that this problem is fixed parameter tractable if the parameter is the number of remaining rounds $k$. This also holds for the practically very important question of whether a team can still qualify for the knock-out phase of the tournament and the combined parameter $k + b$ where $b$ denotes the threshold rank for qualifying. Finally, we show that the latter problem is polynomial time solvable for any constant $k$ and arbitrary values $b$ that are part of the input.
Export
BibTeX
@online{NeumannarXiv2016, TITLE = {This House Proves that Debating is Harder than Soccer}, AUTHOR = {Neumann, Stefan and Wiese, Andreas}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1605.03063}, EPRINT = {1605.03063}, EPRINTTYPE = {arXiv}, YEAR = {2016}, ABSTRACT = {During the last twenty years, a lot of research was conducted on the sport elimination problem: Given a sports league and its remaining matches, we have to decide whether a given team can still possibly win the competition, i.e., place first in the league at the end. Previously, the computational complexity of this problem was investigated only for games with two participating teams per game. In this paper we consider Debating Tournaments and Debating Leagues in the British Parliamentary format, where four teams are participating in each game. We prove that it is NP-hard to decide whether a given team can win a Debating League, even if at most two matches are remaining for each team. This contrasts settings like football where two teams play in each game since there this case is still polynomial time solvable. We prove our result even for a fictitious restricted setting with only three teams per game. On the other hand, for the common setting of Debating Tournaments we show that this problem is fixed parameter tractable if the parameter is the number of remaining rounds $k$. This also holds for the practically very important question of whether a team can still qualify for the knock-out phase of the tournament and the combined parameter $k + b$ where $b$ denotes the threshold rank for qualifying. Finally, we show that the latter problem is polynomial time solvable for any constant $k$ and arbitrary values $b$ that are part of the input.}, }
Endnote
%0 Report %A Neumann, Stefan %A Wiese, Andreas %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T This House Proves that Debating is Harder than Soccer : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002B-0246-4 %U http://arxiv.org/abs/1605.03063 %D 2016 %X During the last twenty years, a lot of research was conducted on the sport elimination problem: Given a sports league and its remaining matches, we have to decide whether a given team can still possibly win the competition, i.e., place first in the league at the end. Previously, the computational complexity of this problem was investigated only for games with two participating teams per game. In this paper we consider Debating Tournaments and Debating Leagues in the British Parliamentary format, where four teams are participating in each game. We prove that it is NP-hard to decide whether a given team can win a Debating League, even if at most two matches are remaining for each team. This contrasts settings like football where two teams play in each game since there this case is still polynomial time solvable. We prove our result even for a fictitious restricted setting with only three teams per game. On the other hand, for the common setting of Debating Tournaments we show that this problem is fixed parameter tractable if the parameter is the number of remaining rounds $k$. This also holds for the practically very important question of whether a team can still qualify for the knock-out phase of the tournament and the combined parameter $k + b$ where $b$ denotes the threshold rank for qualifying. Finally, we show that the latter problem is polynomial time solvable for any constant $k$ and arbitrary values $b$ that are part of the input. %K Computer Science, Computational Complexity, cs.CC
[54]
S. Ott, “Algorithms for Classical and Modern Scheduling Problems,” Universität des Saarlandes, Saarbrücken, 2016.
Export
BibTeX
@phdthesis{Ott_PhD2016, TITLE = {Algorithms for Classical and Modern Scheduling Problems}, AUTHOR = {Ott, Sebastian}, LANGUAGE = {eng}, URL = {urn:nbn:de:bsz:291-scidok-65763}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2016}, DATE = {2016}, }
Endnote
%0 Thesis %A Ott, Sebastian %Y Mehlhorn, Kurt %A referee: Huang, Chien-Chung %+ 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 Algorithms for Classical and Modern Scheduling Problems : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002B-0C1B-1 %U urn:nbn:de:bsz:291-scidok-65763 %I Universit&#228;t des Saarlandes %C Saarbr&#252;cken %D 2016 %P IX, 109 p. %V phd %9 phd %U http://scidok.sulb.uni-saarland.de/volltexte/2016/6576/http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=de
[55]
S. Pritam and M. Kerber, “Homotopy Equivalence Between Voronoi Medusa and Delaunay Medusa,” 2016. [Online]. Available: http://arxiv.org/abs/1604.03302. (arXiv: 1604.03302)
Abstract
We trace movements of certain points in space-time along their corresponding continuous path. We partition the space at every moment of time using alpha-Complexes, Voronoi medusa is then the collection or union of restricted Voronoi cells at every moment in time. We can imagine them as a four dimensional structure formed when three dimensional restricted Voronoi cells sweeps continuously through the extra dimension of time. Similarly Delaunay medusa is the collection of the corresponding Delaunay triangulations at each moment in time. In this article we prove that these two structures are homotopic.
Export
BibTeX
@online{PritamarXiv2016, TITLE = {Homotopy Equivalence Between {V}oronoi Medusa and {D}elaunay Medusa}, AUTHOR = {Pritam, Siddharth and Kerber, Michael}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1604.03302}, EPRINT = {1604.03302}, EPRINTTYPE = {arXiv}, YEAR = {2016}, ABSTRACT = {We trace movements of certain points in space-time along their corresponding continuous path. We partition the space at every moment of time using alpha-Complexes, Voronoi medusa is then the collection or union of restricted Voronoi cells at every moment in time. We can imagine them as a four dimensional structure formed when three dimensional restricted Voronoi cells sweeps continuously through the extra dimension of time. Similarly Delaunay medusa is the collection of the corresponding Delaunay triangulations at each moment in time. In this article we prove that these two structures are homotopic.}, }
Endnote
%0 Report %A Pritam, Siddharth %A Kerber, Michael %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Homotopy Equivalence Between Voronoi Medusa and Delaunay Medusa : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002B-0293-3 %U http://arxiv.org/abs/1604.03302 %D 2016 %X We trace movements of certain points in space-time along their corresponding continuous path. We partition the space at every moment of time using alpha-Complexes, Voronoi medusa is then the collection or union of restricted Voronoi cells at every moment in time. We can imagine them as a four dimensional structure formed when three dimensional restricted Voronoi cells sweeps continuously through the extra dimension of time. Similarly Delaunay medusa is the collection of the corresponding Delaunay triangulations at each moment in time. In this article we prove that these two structures are homotopic. %K Computer Science, Computational Geometry, cs.CG
[56]
M. Sagraloff and K. Mehlhorn, “Computing Real Roots of Real Polynomials,” Journal of Symbolic Computation, vol. 73, 2016.
Export
BibTeX
@article{SagraloffJSC2016, TITLE = {Computing Real Roots of Real Polynomials}, AUTHOR = {Sagraloff, Michael and Mehlhorn, Kurt}, LANGUAGE = {eng}, ISSN = {0747-7171}, DOI = {10.1016/j.jsc.2015.03.004}, PUBLISHER = {Academic Press}, ADDRESS = {London}, YEAR = {2016}, DATE = {2016}, JOURNAL = {Journal of Symbolic Computation}, VOLUME = {73}, PAGES = {46--86}, }
Endnote
%0 Journal Article %A Sagraloff, Michael %A Mehlhorn, Kurt %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Computing Real Roots of Real Polynomials : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0025-0B82-A %R 10.1016/j.jsc.2015.03.004 %7 2015 %D 2016 %J Journal of Symbolic Computation %V 73 %& 46 %P 46 - 86 %I Academic Press %C London %@ false
[57]
A. Wiese, “Independent Set of Convex Polygons: From nϵ to 1+ϵ via Shrinking,” in LATIN 2016: Theoretical Informatics, Ensenada, Mexico, 2016.
Export
BibTeX
@inproceedings{WieseLATIN2016, TITLE = {Independent Set of Convex Polygons: From n&#1013; to 1+&#1013; via Shrinking}, AUTHOR = {Wiese, Andreas}, LANGUAGE = {eng}, ISBN = {978-3-662-49528-5}, DOI = {10.1007/978-3-662-49529-2_52}, PUBLISHER = {Springer}, YEAR = {2016}, DATE = {2016}, BOOKTITLE = {LATIN 2016: Theoretical Informatics}, EDITOR = {Kranakis, Evangelos and Navarro, Gonzalo and Ch{\'a}vez, Edgar}, PAGES = {700--711}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9644}, ADDRESS = {Ensenada, Mexico}, }
Endnote
%0 Conference Proceedings %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-002A-48AF-4 %R 10.1007/978-3-662-49529-2_52 %D 2016 %B 12th Latin American Theoretical Informatics Symposium %Z date of event: 2016-04-11 - 2016-04-15 %C Ensenada, Mexico %B LATIN 2016: Theoretical Informatics %E Kranakis, Evangelos; Navarro, Gonzalo; Ch&#225;vez, Edgar %P 700 - 711 %I Springer %@ 978-3-662-49528-5 %B Lecture Notes in Computer Science %N 9644
2015
[58]
F. Abed, “Coordinating Selfsh Players in Scheduling Games,” Universität des Saarlandes, Saarbrücken, 2015.
Export
BibTeX
@phdthesis{AbedPhd15, TITLE = {Coordinating Selfsh Players in Scheduling Games}, AUTHOR = {Abed, Fidaa}, LANGUAGE = {eng}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, }
Endnote
%0 Thesis %A Abed, Fidaa %Y Mehlhorn, Kurt %A referee: Megow, Nicole %+ 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 Coordinating Selfsh Players in Scheduling Games : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-4BBB-1 %I Universit&#228;t des Saarlandes %C Saarbr&#252;cken %D 2015 %P 70 p. %V phd %9 phd %U http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=dehttp://scidok.sulb.uni-saarland.de/volltexte/2015/6234/
[59]
F. Abed, P. Chalermsook, J. Correa, A. Karrenbauer, P. Pérez-Lantero, J. A. Soto, and A. Wiese, “On Guillotine Cutting Sequences,” in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015), Princeton, NJ, USA, 2015.
Export
BibTeX
@inproceedings{AbedAPPROX2015, TITLE = {On Guillotine Cutting Sequences}, AUTHOR = {Abed, Fidaa and Chalermsook, Parinya and Correa, Jos{\'e} and Karrenbauer, Andreas and P{\'e}rez-Lantero, Pablo and Soto, Jos{\'e} A. and Wiese, Andreas}, LANGUAGE = {eng}, ISBN = {978-3-939897-89-7}, URL = {urn:nbn:de:0030-drops-52917}, DOI = {10.4230/LIPIcs.APPROX-RANDOM.2015.1}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)}, EDITOR = {Garg, Naveen and Jansen, Klaus and Rau, Anup and Rolim, Jos{\'e} D. P.}, PAGES = {1--19}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {40}, ADDRESS = {Princeton, NJ, USA}, }
Endnote
%0 Conference Proceedings %A Abed, Fidaa %A Chalermsook, Parinya %A Correa, Jos&#233; %A Karrenbauer, Andreas %A P&#233;rez-Lantero, Pablo %A Soto, Jos&#233; A. %A Wiese, Andreas %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T On Guillotine Cutting Sequences : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-8F71-7 %R 10.4230/LIPIcs.APPROX-RANDOM.2015.1 %U urn:nbn:de:0030-drops-52917 %D 2015 %B 18th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems / 19th International Workshop on Randomization and Computation %Z date of event: 2015-08-24 - 2015-08-26 %C Princeton, NJ, USA %B Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques %E Garg, Naveen; Jansen, Klaus; Rau, Anup; Rolim, Jos&#233; D. P. %P 1 - 19 %I Schloss Dagstuhl %@ 978-3-939897-89-7 %B Leibniz International Proceedings in Informatics %N 40 %U http://drops.dagstuhl.de/opus/volltexte/2015/5291/http://drops.dagstuhl.de/doku/urheberrecht1.html
[60]
F. Abed and C.-C. Huang, “Coordinating Oligopolistic Players in Unrelated Machine Scheduling,” Theoretical Computer Science, vol. 570, 2015.
Abstract
We consider the following machine scheduling game. Jobs, controlled by selfish players, are to be assigned to unrelated machines. A player cares only about the finishing time of his job(s), while disregarding the welfare of other players. The outcome of such games is measured by the makespan. Our goal is to design coordination mechanisms to schedule the jobs so as to minimize the price of anarchy. We introduce oligopolistic players. Each such player controls a set of jobs, with the aim of minimizing the sum of the completion times of his jobs. Our model of oligopolistic players is a natural generalization of the conventional model, where each player controls only a single job. In our setting, previous mechanisms designed for players with single jobs are inadequate, e.g., having large price of anarchy, or not guaranteeing pure Nash equilibria. To meet this challenge, we design three mechanisms that are adapted/generalized from Caragiannis' ACOORD. All our mechanisms induce pure Nash equilibria while guaranteeing relatively small price of anarchy. (C) 2015 Elsevier B.V. All rights reserved.
Export
BibTeX
@article{AbedHuangTCS2015, TITLE = {Coordinating Oligopolistic Players in Unrelated Machine Scheduling}, AUTHOR = {Abed, Fidaa and Huang, Chien-Chung}, LANGUAGE = {eng}, ISSN = {0304-3975}, DOI = {10.1016/j.tcs.2014.12.022}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, ABSTRACT = {We consider the following machine scheduling game. Jobs, controlled by selfish players, are to be assigned to unrelated machines. A player cares only about the finishing time of his job(s), while disregarding the welfare of other players. The outcome of such games is measured by the makespan. Our goal is to design coordination mechanisms to schedule the jobs so as to minimize the price of anarchy. We introduce oligopolistic players. Each such player controls a set of jobs, with the aim of minimizing the sum of the completion times of his jobs. Our model of oligopolistic players is a natural generalization of the conventional model, where each player controls only a single job. In our setting, previous mechanisms designed for players with single jobs are inadequate, e.g., having large price of anarchy, or not guaranteeing pure Nash equilibria. To meet this challenge, we design three mechanisms that are adapted/generalized from Caragiannis' ACOORD. All our mechanisms induce pure Nash equilibria while guaranteeing relatively small price of anarchy. (C) 2015 Elsevier B.V. All rights reserved.}, JOURNAL = {Theoretical Computer Science}, VOLUME = {570}, PAGES = {40--54}, }
Endnote
%0 Journal Article %A Abed, Fidaa %A Huang, Chien-Chung %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Coordinating Oligopolistic Players in Unrelated Machine Scheduling : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0025-7584-A %F ISI: 000349499600005 %R 10.1016/j.tcs.2014.12.022 %7 2015 %D 2015 %X We consider the following machine scheduling game. Jobs, controlled by selfish players, are to be assigned to unrelated machines. A player cares only about the finishing time of his job(s), while disregarding the welfare of other players. The outcome of such games is measured by the makespan. Our goal is to design coordination mechanisms to schedule the jobs so as to minimize the price of anarchy. We introduce oligopolistic players. Each such player controls a set of jobs, with the aim of minimizing the sum of the completion times of his jobs. Our model of oligopolistic players is a natural generalization of the conventional model, where each player controls only a single job. In our setting, previous mechanisms designed for players with single jobs are inadequate, e.g., having large price of anarchy, or not guaranteeing pure Nash equilibria. To meet this challenge, we design three mechanisms that are adapted/generalized from Caragiannis' ACOORD. All our mechanisms induce pure Nash equilibria while guaranteeing relatively small price of anarchy. (C) 2015 Elsevier B.V. All rights reserved. %J Theoretical Computer Science %V 570 %& 40 %P 40 - 54 %I Elsevier %C Amsterdam %@ false
[61]
A. Adamaszek, G. Blin, and A. Popa, “Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem,” in Combinatorial Algorithms (IWOCA 2014), Duluth, MN, USA, 2015.
Export
BibTeX
@inproceedings{AdamaszekIWOCA2014, TITLE = {Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem}, AUTHOR = {Adamaszek, Anna and Blin, Guillaume and Popa, Alexandru}, LANGUAGE = {eng}, ISBN = {978-3-319-19314-4}, DOI = {10.1007/978-3-319-19315-1_2}, PUBLISHER = {Springer}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Combinatorial Algorithms (IWOCA 2014)}, EDITOR = {Kratchov{\'i}l, Jan and Miller, Mirka and Froncek, Dalibor}, PAGES = {13--23}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {8986}, ADDRESS = {Duluth, MN, USA}, }
Endnote
%0 Conference Proceedings %A Adamaszek, Anna %A Blin, Guillaume %A Popa, Alexandru %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0029-2ACE-0 %R 10.1007/978-3-319-19315-1_2 %D 2015 %B 25th International Workshop on Combinatorial Algorithms %Z date of event: 2014-10-15 - 2014-10-17 %C Duluth, MN, USA %B Combinatorial Algorithms %E Kratchov&#237;l, Jan; Miller, Mirka; Froncek, Dalibor %P 13 - 23 %I Springer %@ 978-3-319-19314-4 %B Lecture Notes in Computer Science %N 8986
[62]
A. Adamaszek and A. Popa, “Algorithmic and Hardness Results for the Colorful Components Problems,” Algorithmica, vol. 73, no. 2, 2015.
Export
BibTeX
@article{Adamaszek_Algorithmica2015, TITLE = {Algorithmic and Hardness Results for the Colorful Components Problems}, AUTHOR = {Adamaszek, Anna and Popa, Alexandru}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-014-9926-0}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Algorithmica}, VOLUME = {73}, NUMBER = {2}, PAGES = {371--388}, }
Endnote
%0 Journal Article %A Adamaszek, Anna %A Popa, Alexandru %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Algorithmic and Hardness Results for the Colorful Components Problems : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-66B9-D %R 10.1007/s00453-014-9926-0 %7 2015 %D 2015 %J Algorithmica %V 73 %N 2 %& 371 %P 371 - 388 %I Springer %C New York, NY %@ false
[63]
A. Adamaszek and A. Wiese, “A Quasi-PTAS for the Two-dimensional Geometric Knapsack Problem,” in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), San Diego, CA, USA, 2015.
Export
BibTeX
@inproceedings{AdamaszekWieseSODA2015, TITLE = {A Quasi-{PTAS} for the Two-Dimensional Geometric Knapsack Problem}, AUTHOR = {Adamaszek, Anna and Wiese, Andreas}, LANGUAGE = {eng}, ISBN = {978-1-61197-374-7}, DOI = {10.1137/1.9781611973730.98}, PUBLISHER = {SIAM}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015)}, EDITOR = {Indyk, Piotr}, PAGES = {1491--1505}, ADDRESS = {San Diego, CA, USA}, }
Endnote
%0 Conference Proceedings %A Adamaszek, Anna %A Wiese, Andreas %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Quasi-PTAS for the Two-dimensional Geometric Knapsack Problem : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-4A1D-A %R 10.1137/1.9781611973730.98 %D 2015 %B Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2015-01-04 - 2015-01-06 %C San Diego, CA, USA %B Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms %E Indyk, Piotr %P 1491 - 1505 %I SIAM %@ 978-1-61197-374-7
[64]
M. Adamaszek and J. Hladky, “Dense Flag Triangulations of 3-manifolds via Extremal Graph Theory,” Transactions of the American Mathematical Society, vol. 367, no. 4, 2015.
Export
BibTeX
@article{AdamaszekHladky, TITLE = {Dense Flag Triangulations of 3-manifolds via Extremal Graph Theory}, AUTHOR = {Adamaszek, Michal and Hladky, Jan}, LANGUAGE = {eng}, ISSN = {0002-9947}, DOI = {10.1090/S0002-9947-2014-06153-9}, PUBLISHER = {American Mathematical Society}, ADDRESS = {Providence, R.I.}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Transactions of the American Mathematical Society}, VOLUME = {367}, NUMBER = {4}, PAGES = {2743--2764}, }
Endnote
%0 Journal Article %A Adamaszek, Michal %A Hladky, Jan %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Dense Flag Triangulations of 3-manifolds via Extremal Graph Theory : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-44D3-D %R 10.1090/S0002-9947-2014-06153-9 %7 2014-08-08 %D 2015 %J Transactions of the American Mathematical Society %O Trans. Amer. Math. Soc. %V 367 %N 4 %& 2743 %P 2743 - 2764 %I American Mathematical Society %C Providence, R.I. %@ false
[65]
S. Albers, A. Antoniadis, and G. Greiner, “On Multi-processor Speed Scaling with Migration,” Journal of Computer and System Sciences, vol. 81, no. 7, 2015.
Export
BibTeX
@article{AlbersAntoniadisGreiner2015, TITLE = {On Multi-processor Speed Scaling with Migration}, AUTHOR = {Albers, Susanne and Antoniadis, Antonios and Greiner, Gera}, LANGUAGE = {eng}, ISSN = {0022-0000}, DOI = {10.1016/j.jcss.2015.03.001}, PUBLISHER = {Academic Press}, ADDRESS = {Orlando, Fla.}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Journal of Computer and System Sciences}, VOLUME = {81}, NUMBER = {7}, PAGES = {1194--1209}, }
Endnote
%0 Journal Article %A Albers, Susanne %A Antoniadis, Antonios %A Greiner, Gera %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T On Multi-processor Speed Scaling with Migration : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0027-D2BE-B %R 10.1016/j.jcss.2015.03.001 %7 2015-03-30 %D 2015 %J Journal of Computer and System Sciences %V 81 %N 7 %& 1194 %P 1194 - 1209 %I Academic Press %C Orlando, Fla. %@ false
[66]
E. Althaus, B. Beber, J. Kupilas, and C. Scholl, “Improving Interpolants for Linear Arithmetic,” in Automated Technologyfor Verification and Analysis (ATVA 2015), Shanghai, China, 2015.
Export
BibTeX
@inproceedings{AlthausATVA2015, TITLE = {Improving Interpolants for Linear Arithmetic}, AUTHOR = {Althaus, Ernst and Beber, Bj{\"o}rn and Kupilas, Joschka and Scholl, Christoph}, LANGUAGE = {eng}, ISBN = {978-3-319-24952-0}, DOI = {10.1007/978-3-319-24953-7_5}, PUBLISHER = {Springer}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Automated Technologyfor Verification and Analysis (ATVA 2015)}, EDITOR = {Finkbeiner, Bernd and Pu, Geguang and Zhang, Lijun}, PAGES = {48--63}, SERIES = {Lecture Notes in Computer SCience}, VOLUME = {9364}, ADDRESS = {Shanghai, China}, }
Endnote
%0 Conference Proceedings %A Althaus, Ernst %A Beber, Bj&#246;rn %A Kupilas, Joschka %A Scholl, 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 External Organizations %T Improving Interpolants for Linear Arithmetic : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-5A54-C %R 10.1007/978-3-319-24953-7_5 %D 2015 %B 13th International Symposium on Automated Technology for Verification and Analysis %Z date of event: 2015-10-12 - 2015-10-15 %C Shanghai, China %B Automated Technologyfor Verification and Analysis %E Finkbeiner, Bernd; Pu, Geguang; Zhang, Lijun %P 48 - 63 %I Springer %@ 978-3-319-24952-0 %B Lecture Notes in Computer SCience %N 9364
[67]
V. Alvarez, K. Bringmann, R. Curticapean, and S. Ray, “Counting Triangulations and Other Crossing-free Structures via Onion Layers,” Discrete & Computational Geometry, vol. 53, no. 4, 2015.
Export
BibTeX
@article{Alvarez2015, TITLE = {Counting Triangulations and Other Crossing-free Structures via Onion Layers}, AUTHOR = {Alvarez, Victor and Bringmann, Karl and Curticapean, Radu and Ray, Saurabh}, LANGUAGE = {eng}, ISSN = {0179-5376}, DOI = {10.1007/s00454-015-9672-3}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Discrete \& Computational Geometry}, VOLUME = {53}, NUMBER = {4}, PAGES = {675--690}, }
Endnote
%0 Journal Article %A Alvarez, Victor %A Bringmann, Karl %A Curticapean, Radu %A Ray, Saurabh %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Counting Triangulations and Other Crossing-free Structures via Onion Layers : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0026-DB7C-C %R 10.1007/s00454-015-9672-3 %7 2015 %D 2015 %J Discrete & Computational Geometry %V 53 %N 4 %& 675 %P 675 - 690 %I Springer %C New York, NY %@ false
[68]
A. Antoniadis, N. Barcelo, M. Nugent, K. Pruhs, and M. Scquizzato, “A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line,” in Approximation and Online Algorithms (WAOA 2014), Wrocław, Poland, 2015.
Export
BibTeX
@inproceedings{ABNPS14-1, 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}, ISBN = {978-3-319-18263-6}, DOI = {10.1007/978-3-319-18263-6_2}, PUBLISHER = {Springer}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Approximation and Online Algorithms (WAOA 2014)}, PAGES = {11--22}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {8952}, ADDRESS = {Wroc{\l}aw, Poland}, }
Endnote
%0 Conference Proceedings %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/11858/00-001M-0000-0024-43DB-5 %R 10.1007/978-3-319-18263-6_2 %D 2015 %B 12th Workshop on Approximation and Online Algorithms %Z date of event: 2014-09-11 - 2014-09-12 %C Wroc&#322;aw, Poland %B Approximation and Online Algorithms %P 11 - 22 %I Springer %@ 978-3-319-18263-6 %B Lecture Notes in Computer Science %N 8952
[69]
A. Antoniadis, C.-C. Huang, and S. Ott, “A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State,” in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), San Diego, CA, USA, 2015.
Export
BibTeX
@inproceedings{AHO2015, TITLE = {A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State}, AUTHOR = {Antoniadis, Antonios and Huang, Chien-Chung and Ott, Sebastian}, LANGUAGE = {eng}, ISBN = {978-1-61197-374-7}, DOI = {10.1137/1.9781611973730.74}, PUBLISHER = {SIAM}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015)}, EDITOR = {Indyk, Piotr}, PAGES = {1102--1113}, ADDRESS = {San Diego, CA, USA}, }
Endnote
%0 Conference Proceedings %A Antoniadis, Antonios %A Huang, Chien-Chung %A Ott, Sebastian %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-42DB-9 %R 10.1137/1.9781611973730.74 %D 2015 %B Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2015-01-04 - 2015-01-06 %C San Diego, CA, USA %K Computer Science, Data Structures and Algorithms, cs.DS %B Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms %E Indyk, Piotr %P 1102 - 1113 %I SIAM %@ 978-1-61197-374-7
[70]
M. Babenko, P. Gawrychowski, T. Kociumaka, and T. Starikovskaya, “Wavelet Trees Meet Suffix Trees,” in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), San Diego, CA, USA, 2015.
Export
BibTeX
@inproceedings{BabenkoWaveletSODA2015, TITLE = {Wavelet Trees Meet Suffix Trees}, AUTHOR = {Babenko, Maxim and Gawrychowski, Pawel and Kociumaka, Tomasz and Starikovskaya, Tatiana}, LANGUAGE = {eng}, ISBN = {978-1-61197-374-7}, DOI = {10.1137/1.9781611973730.39}, PUBLISHER = {SIAM}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015)}, EDITOR = {Indyk, Piotr}, PAGES = {572--591}, ADDRESS = {San Diego, CA, USA}, }
Endnote
%0 Conference Proceedings %A Babenko, Maxim %A Gawrychowski, Pawel %A Kociumaka, Tomasz %A Starikovskaya, Tatiana %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Wavelet Trees Meet Suffix Trees : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-4A09-5 %R 10.1137/1.9781611973730.39 %D 2015 %B Twenty-Sixth ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2015-01-04 - 2015-01-06 %C San Diego, CA, USA %B Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms %E Indyk, Piotr %P 572 - 591 %I SIAM %@ 978-1-61197-374-7
[71]
J. Batra, N. Garg, A. Kumar, T. Mömke, and A. Wiese, “New Approximation Schemes for Unsplittable Flow on a Path,” in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), San Diego, CA, USA, 2015.
Export
BibTeX
@inproceedings{UFPSODA2015, TITLE = {New Approximation Schemes for Unsplittable Flow on a Path}, AUTHOR = {Batra, Jatin and Garg, Naveen and Kumar, Amit and M{\"o}mke, Tobias and Wiese, Andreas}, LANGUAGE = {eng}, ISBN = {978-1-61197-374-7}, DOI = {10.1137/1.9781611973730.5}, PUBLISHER = {SIAM}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015)}, EDITOR = {Indyk, Piotr}, PAGES = {47--58}, ADDRESS = {San Diego, CA, USA}, }
Endnote
%0 Conference Proceedings %A Batra, Jatin %A Garg, Naveen %A Kumar, Amit %A M&#246;mke, Tobias %A Wiese, Andreas %+ 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 Algorithms and Complexity, MPI for Informatics, Max Planck Society %T New Approximation Schemes for Unsplittable Flow on a Path : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-43B4-C %R 10.1137/1.9781611973730.5 %D 2015 %B Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2015-01-04 - 2015-01-06 %C San Diego, CA, USA %B Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms %E Indyk, Piotr %P 47 - 58 %I SIAM %@ 978-1-61197-374-7
[72]
X. Bei, N. Chen, and S. Zhang, “Solving Linear Programming with Constraints Unknown,” in Automata, Languages, and Programming (ICALP 2015), Kyoto, Japan, 2015.
Export
BibTeX
@inproceedings{Bei_ICALP2015, TITLE = {Solving Linear Programming with Constraints Unknown}, AUTHOR = {Bei, Xiaohui and Chen, Ning and Zhang, Shengyu}, LANGUAGE = {eng}, ISBN = {978-3-662-47671-0}, DOI = {10.1007/978-3-662-47672-7_11}, PUBLISHER = {Springer}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Automata, Languages, and Programming (ICALP 2015)}, EDITOR = {Halldorsson, Magnus and Iwama, Kazuo and Kobayashi, Naoki and Speckmann, Bettina}, PAGES = {129--142}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9134}, ADDRESS = {Kyoto, Japan}, }
Endnote
%0 Conference Proceedings %A Bei, Xiaohui %A Chen, Ning %A Zhang, Shengyu %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Solving Linear Programming with Constraints Unknown : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0029-2276-5 %R 10.1007/978-3-662-47672-7_11 %D 2015 %B 42nd International Colloquium on Automata, Languages, and Programming %Z date of event: 2015-07-06 - 2015-07-10 %C Kyoto, Japan %B Automata, Languages, and Programming %E Halldorsson, Magnus; Iwama, Kazuo; Kobayashi, Naoki; Speckmann, Bettina %P 129 - 142 %I Springer %@ 978-3-662-47671-0 %B Lecture Notes in Computer Science %N 9134
[73]
D. Belazzougui, T. Gagie, P. Gawrychowski, J. Kärkäinnen, A. Ordóñez, S. J. Puglisi, and Y. Tabei, “Queries on LZ-Bounded Encodings,” in DCC 2015, Data Compression Conference, Snowbird, UT, USA, 2015.
Export
BibTeX
@inproceedings{GawrychowskiDCC2015, TITLE = {Queries on {LZ}-Bounded Encodings}, AUTHOR = {Belazzougui, Djamal and Gagie, Travis and Gawrychowski, Pawe{\l} and K{\"a}rk{\"a}innen, Juha and Ord{\'o}{\~n}ez, Alberto and Puglisi, Simon J. and Tabei, Yasuo}, LANGUAGE = {eng}, ISBN = {978-1-4799-8430-5}, DOI = {10.1109/DCC.2015.69}, PUBLISHER = {IEEE}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {DCC 2015, Data Compression Conference}, PAGES = {83--92}, ADDRESS = {Snowbird, UT, USA}, }
Endnote
%0 Conference Proceedings %A Belazzougui, Djamal %A Gagie, Travis %A Gawrychowski, Pawe&#322; %A K&#228;rk&#228;innen, Juha %A Ord&#243;&#241;ez, Alberto %A Puglisi, Simon J. %A Tabei, Yasuo %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations %T Queries on LZ-Bounded Encodings : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002B-430F-E %R 10.1109/DCC.2015.69 %D 2015 %B Data Compression Conference %Z date of event: 2015-04-07 - 2015-04-09 %C Snowbird, UT, USA %B DCC 2015 %P 83 - 92 %I IEEE %@ 978-1-4799-8430-5
[74]
P. Bertrand and C. Lenzen, “The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm,” in ALENEX15, Seventeenth Workshop on Algorithm Engineering and Experiments, San Diego, CA, USA, 2015.
Abstract
In this work, we examine a generic class of simple distributed balls-into-bins algorithms. Exploiting the strong concentration bounds that apply to balls-into-bins games, we provide an iterative method to compute accurate estimates of the remaining balls and the load distribution after each round. Each algorithm is classified by (i) the load that bins accept in a given round, (ii) the number of messages each ball sends in a given round, and (iii) whether each such message is given a rank expressing the sender's inclination to commit to the receiving bin (if feasible). This novel ranking mechanism results in notable improvements, in particular in the number of balls that may commit to a bin in the first round of the algorithm. Simulations independently verify the correctness of the results and confirm that our approximation is highly accurate even for a moderate number of $10^6$ balls and bins.
Export
BibTeX
@inproceedings{BertrandL15, TITLE = {The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm}, AUTHOR = {Bertrand, Pierre and Lenzen, Christoph}, LANGUAGE = {eng}, ISBN = {978-1-61197-375-4}, URL = {http://groups.csail.mit.edu/tds/papers/Lenzen/BL15toolkit-alenex.pdf}, DOI = {10.1137/1.9781611973754.5}, PUBLISHER = {SIAM}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, ABSTRACT = {In this work, we examine a generic class of simple distributed balls-into-bins algorithms. Exploiting the strong concentration bounds that apply to balls-into-bins games, we provide an iterative method to compute accurate estimates of the remaining balls and the load distribution after each round. Each algorithm is classified by (i) the load that bins accept in a given round, (ii) the number of messages each ball sends in a given round, and (iii) whether each such message is given a rank expressing the sender's inclination to commit to the receiving bin (if feasible). This novel ranking mechanism results in notable improvements, in particular in the number of balls that may commit to a bin in the first round of the algorithm. Simulations independently verify the correctness of the results and confirm that our approximation is highly accurate even for a moderate number of $10^6$ balls and bins.}, BOOKTITLE = {ALENEX15, Seventeenth Workshop on Algorithm Engineering and Experiments}, EDITOR = {Brandes, Ulrik and Eppstein, David}, PAGES = {44--54}, ADDRESS = {San Diego, CA, USA}, }
Endnote
%0 Conference Proceedings %A Bertrand, Pierre %A Lenzen, Christoph %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-48BB-3 %R 10.1137/1.9781611973754.5 %U http://groups.csail.mit.edu/tds/papers/Lenzen/BL15toolkit-alenex.pdf %D 2015 %B Seventeenth Workshop on Algorithm Engineering and Experiments %Z date of event: 2015-01-05 - 2015-01-05 %C San Diego, CA, USA %X In this work, we examine a generic class of simple distributed balls-into-bins algorithms. Exploiting the strong concentration bounds that apply to balls-into-bins games, we provide an iterative method to compute accurate estimates of the remaining balls and the load distribution after each round. Each algorithm is classified by (i) the load that bins accept in a given round, (ii) the number of messages each ball sends in a given round, and (iii) whether each such message is given a rank expressing the sender's inclination to commit to the receiving bin (if feasible). This novel ranking mechanism results in notable improvements, in particular in the number of balls that may commit to a bin in the first round of the algorithm. Simulations independently verify the correctness of the results and confirm that our approximation is highly accurate even for a moderate number of $10^6$ balls and bins. %K Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC %B ALENEX15 %E Brandes, Ulrik; Eppstein, David %P 44 - 54 %I SIAM %@ 978-1-61197-375-4
[75]
S. Bhadra and M. Hein, “Correction of Noisy Labels via Mutual Consistency Check,” Neurocomputing, vol. 160, 2015.
Export
BibTeX
@article{BhadraNeurocomputing2015, TITLE = {Correction of Noisy Labels via Mutual Consistency Check}, AUTHOR = {Bhadra, Sahely and Hein, Matthias}, LANGUAGE = {eng}, ISSN = {0925-2312}, DOI = {10.1016/j.neucom.2014.10.083}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Neurocomputing}, VOLUME = {160}, PAGES = {34--52}, }
Endnote
%0 Journal Article %A Bhadra, Sahely %A Hein, Matthias %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Correction of Noisy Labels via Mutual Consistency Check : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0027-78F4-5 %R 10.1016/j.neucom.2014.10.083 %7 2015 %D 2015 %J Neurocomputing %V 160 %& 34 %P 34 - 52 %I Elsevier %C Amsterdam %@ false
[76]
A. Bhattacharya, D. Issac, R. Jaiswal, and A. Kumar, “Sampling in Space Restricted Settings,” in Computing and Combinatorics (COCOON 2015), Beijing, China, 2015.
Export
BibTeX
@inproceedings{BhattacharyaCOCOON2015, TITLE = {Sampling in Space Restricted Settings}, AUTHOR = {Bhattacharya, Anup and Issac, Davis and Jaiswal, Ragesh and Kumar, Amit}, LANGUAGE = {eng}, ISSN = {0302-9743}, ISBN = {978-3-319-21397-2}, DOI = {10.1007/978-3-319-21398-9_38}, PUBLISHER = {Springer}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Computing and Combinatorics (COCOON 2015)}, EDITOR = {Dachuan, Xu and Du, Donglei and Du, Dingzhu}, PAGES = {483--494}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9198}, ADDRESS = {Beijing, China}, }
Endnote
%0 Conference Proceedings %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/11858/00-001M-0000-0029-07D3-D %R 10.1007/978-3-319-21398-9_38 %D 2015 %B 21st International Conference on Computing and Combinatorics %Z date of event: 2015-08-04 - 2015-08-06 %C Beijing, China %B Computing and Combinatorics %E Dachuan, Xu; Du, Donglei; Du, Dingzhu %P 483 - 494 %I Springer %@ 978-3-319-21397-2 %B Lecture Notes in Computer Science %N 9198 %@ false
[77]
S. Bhattacharya, M. Hoefer, C.-C. Huang, T. Kavitha, and L. Wagner, “Maintaining Near-popular Matchings,” in Automata, Languages, and Programming (ICALP 2015), Kyoto, Japan, 2015.
Export
BibTeX
@inproceedings{Bhattacharya_ICALP2015, TITLE = {Maintaining Near-popular Matchings}, AUTHOR = {Bhattacharya, Sayan and Hoefer, Martin and Huang, Chien-Chung and Kavitha, Telikepalli and Wagner, Lisa}, LANGUAGE = {eng}, ISBN = {978-3-662-47665-9}, DOI = {10.1007/978-3-662-47666-6_40}, PUBLISHER = {Springer}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Automata, Languages, and Programming (ICALP 2015)}, EDITOR = {Halldorsson, Magnus and Iwama, Kazuo and Kobayashi, Naoki and Speckmann, Bettina}, PAGES = {504--515}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9135}, ADDRESS = {Kyoto, Japan}, }
Endnote
%0 Conference Proceedings %A Bhattacharya, Sayan %A Hoefer, Martin %A Huang, Chien-Chung %A Kavitha, Telikepalli %A Wagner, Lisa %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Maintaining Near-popular Matchings : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-79DD-6 %R 10.1007/978-3-662-47666-6_40 %D 2015 %B 42nd International Colloquium on Automata, Languages, and Programming %Z date of event: 2015-07-06 - 2015-07-10 %C Kyoto, Japan %B Automata, Languages, and Programming %E Halldorsson, Magnus; Iwama, Kazuo; Kobayashi, Naoki; Speckmann, Bettina %P 504 - 515 %I Springer %@ 978-3-662-47665-9 %B Lecture Notes in Computer Science %N 9135
[78]
A. Bishnu, S. Desai, A. Ghosh, M. Goswami, and S. Paul, “Uniformity of Point Samples in Metric Spaces Using Gap Ratio,” in Theory and Applications of Models of Computation (TAMC 2015), Singapore, 2015.
Export
BibTeX
@inproceedings{BishnuTAMC2015, TITLE = {Uniformity of Point Samples in Metric Spaces Using Gap Ratio}, AUTHOR = {Bishnu, Arijit and Desai, Sameer and Ghosh, Arijit and Goswami, Mayank and Paul, Subhabrata}, LANGUAGE = {eng}, ISBN = {978-3-319-17141-8}, DOI = {10.1007/978-3-319-17142-5_30}, PUBLISHER = {Springer}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Theory and Applications of Models of Computation (TAMC 2015)}, EDITOR = {Jain, Rahul and Jain, Sanjay and Stephan, Frank}, PAGES = {347--358}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9076}, ADDRESS = {Singapore}, }
Endnote
%0 Conference Proceedings %A Bishnu, Arijit %A Desai, Sameer %A Ghosh, Arijit %A Goswami, Mayank %A Paul, Subhabrata %+ 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 Uniformity of Point Samples in Metric Spaces Using Gap Ratio : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-E134-C %R 10.1007/978-3-319-17142-5_30 %D 2015 %B 12th Annual Conference on Theory and Applications of Models of Computation %Z date of event: 2015-05-18 - 2015-05-20 %C Singapore %B Theory and Applications of Models of Computation %E Jain, Rahul; Jain, Sanjay; Stephan, Frank %P 347 - 358 %I Springer %@ 978-3-319-17141-8 %B Lecture Notes in Computer Science %N 9076
[79]
J.-D. Boissonnat, R. Dyer, and A. Ghosh, “A Probabilistic Approach to Reducing the Algebraic Complexity of Computing Delaunay Triangulations,” 2015. [Online]. Available: http://arxiv.org/abs/1505.05454. (arXiv: 1505.05454)
Abstract
Computing Delaunay triangulations in $\mathbb{R}^d$ involves evaluating the so-called in\_sphere predicate that determines if a point $x$ lies inside, on or outside the sphere circumscribing $d+1$ points $p_0,\ldots ,p_d$. This predicate reduces to evaluating the sign of a multivariate polynomial of degree $d+2$ in the coordinates of the points $x, \, p_0,\, \ldots,\, p_d$. Despite much progress on exact geometric computing, the fact that the degree of the polynomial increases with $d$ makes the evaluation of the sign of such a polynomial problematic except in very low dimensions. In this paper, we propose a new approach that is based on the witness complex, a weak form of the Delaunay complex introduced by Carlsson and de Silva. The witness complex $\mathrm{Wit} (L,W)$ is defined from two sets $L$ and $W$ in some metric space $X$: a finite set of points $L$ on which the complex is built, and a set $W$ of witnesses that serves as an approximation of $X$. A fundamental result of de Silva states that $\mathrm{Wit}(L,W)=\mathrm{Del} (L)$ if $W=X=\mathbb{R}^d$. In this paper, we give conditions on $L$ that ensure that the witness complex and the Delaunay triangulation coincide when $W$ is a finite set, and we introduce a new perturbation scheme to compute a perturbed set $L'$ close to $L$ such that $\mathrm{Del} (L')= \mathrm{wit} (L', W)$. Our perturbation algorithm is a geometric application of the Moser-Tardos constructive proof of the Lov\'asz local lemma. The only numerical operations we use are (squared) distance comparisons (i.e., predicates of degree 2). The time-complexity of the algorithm is sublinear in $|W|$. Interestingly, although the algorithm does not compute any measure of simplex quality, a lower bound on the thickness of the output simplices can be guaranteed.
Export
BibTeX
@online{Boissonnat_arXiv2015, TITLE = {A Probabilistic Approach to Reducing the Algebraic Complexity of Computing {Delaunay} Triangulations}, AUTHOR = {Boissonnat, Jean-Daniel and Dyer, Ramsay and Ghosh, Arijit}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1505.05454}, EPRINT = {1505.05454}, EPRINTTYPE = {arXiv}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Computing Delaunay triangulations in $\mathbb{R}^d$ involves evaluating the so-called in\_sphere predicate that determines if a point $x$ lies inside, on or outside the sphere circumscribing $d+1$ points $p_0,\ldots ,p_d$. This predicate reduces to evaluating the sign of a multivariate polynomial of degree $d+2$ in the coordinates of the points $x, \, p_0,\, \ldots,\, p_d$. Despite much progress on exact geometric computing, the fact that the degree of the polynomial increases with $d$ makes the evaluation of the sign of such a polynomial problematic except in very low dimensions. In this paper, we propose a new approach that is based on the witness complex, a weak form of the Delaunay complex introduced by Carlsson and de Silva. The witness complex $\mathrm{Wit} (L,W)$ is defined from two sets $L$ and $W$ in some metric space $X$: a finite set of points $L$ on which the complex is built, and a set $W$ of witnesses that serves as an approximation of $X$. A fundamental result of de Silva states that $\mathrm{Wit}(L,W)=\mathrm{Del} (L)$ if $W=X=\mathbb{R}^d$. In this paper, we give conditions on $L$ that ensure that the witness complex and the Delaunay triangulation coincide when $W$ is a finite set, and we introduce a new perturbation scheme to compute a perturbed set $L'$ close to $L$ such that $\mathrm{Del} (L')= \mathrm{wit} (L', W)$. Our perturbation algorithm is a geometric application of the Moser-Tardos constructive proof of the Lov\'asz local lemma. The only numerical operations we use are (squared) distance comparisons (i.e., predicates of degree 2). The time-complexity of the algorithm is sublinear in $|W|$. Interestingly, although the algorithm does not compute any measure of simplex quality, a lower bound on the thickness of the output simplices can be guaranteed.}, }
Endnote
%0 Report %A Boissonnat, Jean-Daniel %A Dyer, Ramsay %A Ghosh, Arijit %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Probabilistic Approach to Reducing the Algebraic Complexity of Computing Delaunay Triangulations : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-6694-0 %U http://arxiv.org/abs/1505.05454 %D 2015 %X Computing Delaunay triangulations in $\mathbb{R}^d$ involves evaluating the so-called in\_sphere predicate that determines if a point $x$ lies inside, on or outside the sphere circumscribing $d+1$ points $p_0,\ldots ,p_d$. This predicate reduces to evaluating the sign of a multivariate polynomial of degree $d+2$ in the coordinates of the points $x, \, p_0,\, \ldots,\, p_d$. Despite much progress on exact geometric computing, the fact that the degree of the polynomial increases with $d$ makes the evaluation of the sign of such a polynomial problematic except in very low dimensions. In this paper, we propose a new approach that is based on the witness complex, a weak form of the Delaunay complex introduced by Carlsson and de Silva. The witness complex $\mathrm{Wit} (L,W)$ is defined from two sets $L$ and $W$ in some metric space $X$: a finite set of points $L$ on which the complex is built, and a set $W$ of witnesses that serves as an approximation of $X$. A fundamental result of de Silva states that $\mathrm{Wit}(L,W)=\mathrm{Del} (L)$ if $W=X=\mathbb{R}^d$. In this paper, we give conditions on $L$ that ensure that the witness complex and the Delaunay triangulation coincide when $W$ is a finite set, and we introduce a new perturbation scheme to compute a perturbed set $L'$ close to $L$ such that $\mathrm{Del} (L')= \mathrm{wit} (L', W)$. Our perturbation algorithm is a geometric application of the Moser-Tardos constructive proof of the Lov\'asz local lemma. The only numerical operations we use are (squared) distance comparisons (i.e., predicates of degree 2). The time-complexity of the algorithm is sublinear in $|W|$. Interestingly, although the algorithm does not compute any measure of simplex quality, a lower bound on the thickness of the output simplices can be guaranteed. %K Computer Science, Computational Geometry, cs.CG,
[80]
J.-D. Boissonnat, R. Dyer, and A. Ghosh, “A Probabilistic Approach to Reducing Algebraic Complexity of Delaunay Triangulations,” in Algorithms -- ESA 2015, Patras, Greece, 2015.
Export
BibTeX
@inproceedings{BoissonnatESA2015, TITLE = {A Probabilistic Approach to Reducing Algebraic Complexity of {Delaunay} Triangulations}, AUTHOR = {Boissonnat, Jean-Daniel and Dyer, Ramsay and Ghosh, Arijit}, LANGUAGE = {eng}, ISBN = {978-3-662-48349-7}, DOI = {10.1007/978-3-662-48350-3_50}, PUBLISHER = {Springer}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Algorithms -- ESA 2015}, EDITOR = {Bansal, Nikhil and Finocchi, Irene}, PAGES = {595--606}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9294}, ADDRESS = {Patras, Greece}, }
Endnote
%0 Conference Proceedings %A Boissonnat, Jean-Daniel %A Dyer, Ramsay %A Ghosh, Arijit %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Probabilistic Approach to Reducing Algebraic Complexity of Delaunay Triangulations : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-6690-7 %R 10.1007/978-3-662-48350-3_50 %D 2015 %B 23rd Annual European Symposium on Algorithms %Z date of event: 2015-09-14 - 2015-09-16 %C Patras, Greece %B Algorithms -- ESA 2015 %E Bansal, Nikhil; Finocchi, Irene %P 595 - 606 %I Springer %@ 978-3-662-48349-7 %B Lecture Notes in Computer Science %N 9294
[81]
P. Boufounos, V. Cevher, A. C. Gilbert, Y. Li, and M. J. Strauss, “What’s the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid,” Algorithmica, vol. 73, no. 2, 2015.
Export
BibTeX
@article{Boufounos_Algorithmica2015, TITLE = {What&#8217;s the Frequency, {Kenneth}?: {S}ublinear {Fourier} Sampling Off the Grid}, AUTHOR = {Boufounos, Petros and Cevher, Volkan and Gilbert, Anna C. and Li, Yi and Strauss, Martin J.}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-014-9918-0}, PUBLISHER = {Springer}, ADDRESS = {New York. NY}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Algorithmica}, VOLUME = {73}, NUMBER = {2}, PAGES = {261--288}, }
Endnote
%0 Journal Article %A Boufounos, Petros %A Cevher, Volkan %A Gilbert, Anna C. %A Li, Yi %A Strauss, Martin J. %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T What&#8217;s the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-66B0-0 %R 10.1007/s00453-014-9918-0 %7 2015 %D 2015 %J Algorithmica %V 73 %N 2 %& 261 %P 261 - 288 %I Springer %C New York. NY %@ false
[82]
R. Bredereck, T. Köhler, A. Nichterlein, R. Niedermeier, and G. Philip, “Using Patterns to Form Homogeneous Teams,” Algorithmica, vol. 71, no. 2, 2015.
Export
BibTeX
@article{PhilpAlgorithmica2015, TITLE = {Using Patterns to Form Homogeneous Teams}, AUTHOR = {Bredereck, Robert and K{\"o}hler, Thomas and Nichterlein, Andr{\'e} and Niedermeier, Rolf and Philip, Geevarghese}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-013-9821-0}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Algorithmica}, VOLUME = {71}, NUMBER = {2}, PAGES = {517--538}, }
Endnote
%0 Journal Article %A Bredereck, Robert %A K&#246;hler, Thomas %A Nichterlein, Andr&#233; %A Niedermeier, Rolf %A Philip, Geevarghese %+ External Organizations External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Using Patterns to Form Homogeneous Teams : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0026-C657-9 %R 10.1007/s00453-013-9821-0 %D 2015 %J Algorithmica %V 71 %N 2 %& 517 %P 517 - 538 %I Springer %C New York, NY %@ false
[83]
K. Bringmann, C. Engels, B. Manthey, and B. V. Raghavendra Rao, “Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems,” Algorithmica, vol. 73, no. 1, 2015.
Export
BibTeX
@article{bringmann_shortest_2014, TITLE = {Random Shortest Paths: {Non-Euclidean} Instances for Metric Optimization Problems}, AUTHOR = {Bringmann, Karl and Engels, Christian and Manthey, Bodo and Raghavendra Rao, B. V.}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-014-9901-9}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Algorithmica}, VOLUME = {73}, NUMBER = {1}, PAGES = {42--62}, }
Endnote
%0 Journal Article %A Bringmann, Karl %A Engels, Christian %A Manthey, Bodo %A Raghavendra Rao, B. V. %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-4211-B %R 10.1007/s00453-014-9901-9 %7 2014 %D 2015 %K Random shortest paths; First passage percolation; Approximation algorithms; Random metrics %J Algorithmica %V 73 %N 1 %& 42 %P 42 - 62 %I Springer %C New York, NY %@ false %U http://dx.doi.org/10.1007/s00453-014-9901-9
[84]
K. Bringmann, B. Doerr, A. Neumann, and J. Sliacan, “Online Checkpointing with Improved Worst-case Guarantees,” INFORMS Journal on Computing, vol. 27, no. 3, 2015.
Abstract
In the online checkpointing problem, the task is to continuously maintain a set of k checkpoints that allow to rewind an ongoing computation faster than by a full restart. The only operation allowed is to replace an old checkpoint by the current state. Our aim are checkpoint placement strategies that minimize rewinding cost, i.e., such that at all times T when requested to rewind to some time t ≤ T the number of computation steps that need to be redone to get to t from a checkpoint before t is as small as possible. In particular, we want that the closest checkpoint earlier than t is not further away from t than q_k times the ideal distance T / (k+1), where q_k is a small constant. Improving over earlier work showing 1 + 1/k ≤ q_k ≤ 2, we show that q_k can be chosen asymptotically less than 2. We present algorithms with asymptotic discrepancy q_k ≤ 1.59 + o(1) valid for all k and q_k ≤ \ln(4) + o(1) ≤ 1.39 + o(1) valid for k being a power of two. Experiments indicate the uniform bound p_k ≤ 1.7 for all k. For small k, we show how to use a linear programming approach to compute good checkpointing algorithms. This gives discrepancies of less than 1.55 for all k < 60. We prove the first lower bound that is asymptotically more than one, namely q_k ≥ 1.30 - o(1). We also show that optimal algorithms (yielding the infimum discrepancy) exist for all~k.
Export
BibTeX
@article{BringmannDoerrNeumannSliacan2015, TITLE = {Online Checkpointing with Improved Worst-case Guarantees}, AUTHOR = {Bringmann, Karl and Doerr, Benjamin and Neumann, Adrian and Sliacan, Jakub}, LANGUAGE = {eng}, ISSN = {1091-9856}, DOI = {10.1287/ijoc.2014.0639}, PUBLISHER = {Institute for Operations Research and the Manageme}, ADDRESS = {Linthicum, MD}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, ABSTRACT = {In the online checkpointing problem, the task is to continuously maintain a set of k checkpoints that allow to rewind an ongoing computation faster than by a full restart. The only operation allowed is to replace an old checkpoint by the current state. Our aim are checkpoint placement strategies that minimize rewinding cost, i.e., such that at all times T when requested to rewind to some time t $\leq$ T the number of computation steps that need to be redone to get to t from a checkpoint before t is as small as possible. In particular, we want that the closest checkpoint earlier than t is not further away from t than q_k times the ideal distance T / (k+1), where q_k is a small constant. Improving over earlier work showing 1 + 1/k $\leq$ q_k $\leq$ 2, we show that q_k can be chosen asymptotically less than 2. We present algorithms with asymptotic discrepancy q_k $\leq$ 1.59 + o(1) valid for all k and q_k $\leq$ \ln(4) + o(1) $\leq$ 1.39 + o(1) valid for k being a power of two. Experiments indicate the uniform bound p_k $\leq$ 1.7 for all k. For small k, we show how to use a linear programming approach to compute good checkpointing algorithms. This gives discrepancies of less than 1.55 for all k < 60. We prove the first lower bound that is asymptotically more than one, namely q_k $\geq$ 1.30 -- o(1). We also show that optimal algorithms (yielding the infimum discrepancy) exist for all~k.}, JOURNAL = {INFORMS Journal on Computing}, VOLUME = {27}, NUMBER = {3}, PAGES = {478--490}, }
Endnote
%0 Journal Article %A Bringmann, Karl %A Doerr, Benjamin %A Neumann, Adrian %A Sliacan, Jakub %+ 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 Online Checkpointing with Improved Worst-case Guarantees : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0029-01E0-A %R 10.1287/ijoc.2014.0639 %7 2015-07-31 %D 2015 %X In the online checkpointing problem, the task is to continuously maintain a set of k checkpoints that allow to rewind an ongoing computation faster than by a full restart. The only operation allowed is to replace an old checkpoint by the current state. Our aim are checkpoint placement strategies that minimize rewinding cost, i.e., such that at all times T when requested to rewind to some time t &#8804; T the number of computation steps that need to be redone to get to t from a checkpoint before t is as small as possible. In particular, we want that the closest checkpoint earlier than t is not further away from t than q_k times the ideal distance T / (k+1), where q_k is a small constant. Improving over earlier work showing 1 + 1/k &#8804; q_k &#8804; 2, we show that q_k can be chosen asymptotically less than 2. We present algorithms with asymptotic discrepancy q_k &#8804; 1.59 + o(1) valid for all k and q_k &#8804; \ln(4) + o(1) &#8804; 1.39 + o(1) valid for k being a power of two. Experiments indicate the uniform bound p_k &#8804; 1.7 for all k. For small k, we show how to use a linear programming approach to compute good checkpointing algorithms. This gives discrepancies of less than 1.55 for all k < 60. We prove the first lower bound that is asymptotically more than one, namely q_k &#8805; 1.30 - o(1). We also show that optimal algorithms (yielding the infimum discrepancy) exist for all~k. %J INFORMS Journal on Computing %V 27 %N 3 %& 478 %P 478 - 490 %I Institute for Operations Research and the Manageme %C Linthicum, MD %@ false
[85]
K. Bringmann, T. Friedrich, M. Hoefer, R. Rothenberger, and T. Sauerwald, “Ultra-fast Load Balancing on Scale-free Networks,” in Automata, Languages, and Programming (ICALP 2015), Kyoto, Japan, 2015.
Export
BibTeX
@inproceedings{Bringmann_ICALP2015, TITLE = {Ultra-fast Load Balancing on Scale-free Networks}, AUTHOR = {Bringmann, Karl and Friedrich, Tobias and Hoefer, Martin and Rothenberger, Ralf and Sauerwald, Thomas}, LANGUAGE = {eng}, ISBN = {978-3-662-47665-9}, DOI = {10.1007/978-3-662-47666-6_41}, PUBLISHER = {Springer}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Automata, Languages, and Programming (ICALP 2015)}, EDITOR = {Halldorsson, Magnus and Iwama, Kazuo and Kobayashi, Naoki and Speckmann, Bettina}, PAGES = {516--527}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9135}, ADDRESS = {Kyoto, Japan}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Friedrich, Tobias %A Hoefer, Martin %A Rothenberger, Ralf %A Sauerwald, Thomas %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Ultra-fast Load Balancing on Scale-free Networks : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-79E7-E %R 10.1007/978-3-662-47666-6_41 %D 2015 %B 42nd International Colloquium on Automata, Languages, and Programming %Z date of event: 2015-07-06 - 2015-07-10 %C Kyoto, Japan %B Automata, Languages, and Programming %E Halldorsson, Magnus; Iwama, Kazuo; Kobayashi, Naoki; Speckmann, Bettina %P 516 - 527 %I Springer %@ 978-3-662-47665-9 %B Lecture Notes in Computer Science %N 9135
[86]
K. Bringmann and M. Künnemann, “Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds,” in Algorithms and Computation (ISAAC 2015), Nagoya, Japan, 2015.
Export
BibTeX
@inproceedings{BringmannISAAC2015, 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 = {0302-9743}, ISBN = {978-3-662-48970-3}, DOI = {10.1007/978-3-662-48971-0_44}, PUBLISHER = {Springer}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Algorithms and Computation (ISAAC 2015)}, EDITOR = {Elbassioni, Khaled and Makino, Kazuhisa}, PAGES = {516--528}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9472}, ADDRESS = {Nagoya, Japan}, }
Endnote
%0 Conference Proceedings %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/11858/00-001M-0000-002A-1A2A-E %R 10.1007/978-3-662-48971-0_44 %D 2015 %B 26th International Symposium on Algorithms and Computation %Z date of event: 2015-12-09 - 2015-12-11 %C Nagoya, Japan %B Algorithms and Computation %E Elbassioni, Khaled; Makino, Kazuhisa %P 516 - 528 %I Springer %@ 978-3-662-48970-3 %B Lecture Notes in Computer Science %N 9472 %@ false
[87]
K. Bringmann and M. Künnemann, “Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping,” in FOCS 2015, IEEE 56th Annual Symposium on Foundations of Computer Science, Berkeley, CA, USA, 2015.
Export
BibTeX
@inproceedings{BringmannFOCS2015, TITLE = {Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping}, AUTHOR = {Bringmann, Karl and K{\"u}nnemann, Marvin}, LANGUAGE = {eng}, DOI = {10.1109/FOCS.2015.15}, PUBLISHER = {IEEE}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {FOCS 2015, IEEE 56th Annual Symposium on Foundations of Computer Science}, PAGES = {79--97}, ADDRESS = {Berkeley, CA, USA}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A K&#252;nnemann, Marvin %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-1A28-1 %R 10.1109/FOCS.2015.15 %D 2015 %B IEEE 56th Annual Symposium on Foundations of Computer Science %Z date of event: 2015-10-18 - 2015-10-20 %C Berkeley, CA, USA %B FOCS 2015 %P 79 - 97 %I IEEE
[88]
K. Bringmann, D. Hermelin, M. Mnich, and E. J. van Leeuwen, “Parameterized Complexity Dichotomy for Steiner Multicut,” in 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015), Munich, Germany, 2015.
Export
BibTeX
@inproceedings{BringmannHMvL2015, TITLE = {Parameterized Complexity Dichotomy for {Steiner} Multicut}, AUTHOR = {Bringmann, Karl and Hermelin, Danny and Mnich, Matthias and van Leeuwen, Erik Jan}, LANGUAGE = {eng}, ISSN = {1868-896}, ISBN = {978-3-939897-78-1}, URL = {urn:nbn:de:0030-drops-49115}, DOI = {10.4230/LIPIcs.STACS.2015.157}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, EDITOR = {Mayr, Ernst W. and Ollinger, Nicolas}, PAGES = {157--170}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {30}, ADDRESS = {Munich, Germany}, }
Endnote
%0 Conference Proceedings %A Bringmann, Karl %A Hermelin, Danny %A Mnich, Matthias %A van Leeuwen, Erik Jan %+ 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 Parameterized Complexity Dichotomy for Steiner Multicut : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-A364-4 %R 10.4230/LIPIcs.STACS.2015.157 %U urn:nbn:de:0030-drops-49115 %D 2015 %B 32nd International Symposium on Theoretical Aspects of Computer Science %Z date of event: 2015-03-04 - 2015-03-07 %C Munich, Germany %B 32nd International Symposium on Theoretical Aspects of Computer Science %E Mayr, Ernst W.; Ollinger, Nicolas %P 157 - 170 %I Schloss Dagstuhl %@ 978-3-939897-78-1 %B Leibniz International Proceedings in Informatics %N 30 %@ false %U http://drops.dagstuhl.de/doku/urheberrecht1.htmlhttp://drops.dagstuhl.de/opus/volltexte/2015/4911/
[89]
J. Byrka, A. Karrenbauer, and L. Sanità, “The Interval Constrained 3-coloring Problem,” Theoretical Computer Science, vol. 593, 2015.
Export
BibTeX
@article{Byrka2015, TITLE = {The Interval Constrained 3-coloring Problem}, AUTHOR = {Byrka, Jaroslaw and Karrenbauer, Andreas and Sanit{\`a}, Laura}, LANGUAGE = {eng}, ISSN = {0304-3975}, DOI = {10.1016/j.tcs.2015.04.037}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Theoretical Computer Science}, VOLUME = {593}, PAGES = {42--50}, }
Endnote
%0 Journal Article %A Byrka, Jaroslaw %A Karrenbauer, Andreas %A Sanit&#224;, Laura %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T The Interval Constrained 3-coloring Problem : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-5029-4 %R 10.1016/j.tcs.2015.04.037 %7 2015 %D 2015 %J Theoretical Computer Science %V 593 %& 42 %P 42 - 50 %I Elsevier %C Amsterdam %@ false
[90]
T. Byrnes, D. Rosseau, M. Khosla, A. Pyrkov, A. Thomasen, T. Mukai, S. Koyama, A. Abdelrahman, and E. Ilo-Okeke, “Macroscopic Quantum Information Processing Using Spin Coherent States,” Optics Communications, vol. 337, 2015.
Abstract
Abstract Previously a new scheme of quantum information processing based on spin coherent states of two component Bose–Einstein condensates was proposed (Byrnes et al. Phys. Rev. A 85, 40306(R)). In this paper we give a more detailed exposition of the scheme, expanding on several aspects that were not discussed in full previously. The basic concept of the scheme is that spin coherent states are used instead of qubits to encode qubit information, and manipulated using collective spin operators. The scheme goes beyond the continuous variable regime such that the full space of the Bloch sphere is used. We construct a general framework for quantum algorithms to be executed using multiple spin coherent states, which are individually controlled. We illustrate the scheme by applications to quantum information protocols, and discuss possible experimental implementations. Decoherence effects are analyzed under both general conditions and for the experimental implementation proposed.
Export
BibTeX
@article{Byrnes2015102, TITLE = {Macroscopic Quantum Information Processing Using Spin Coherent States}, AUTHOR = {Byrnes, Tim and Rosseau, Daniel and Khosla, Megha and Pyrkov, Alexey and Thomasen, Andreas and Mukai, Tetsuya and Koyama, Shinsuke and Abdelrahman, Ahmed and Ilo-Okeke, Ebubechukwu}, LANGUAGE = {eng}, ISSN = {0030-4018}, DOI = {10.1016/j.optcom.2014.08.017}, PUBLISHER = {North-Holland}, ADDRESS = {Amsterdam}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, ABSTRACT = {Abstract Previously a new scheme of quantum information processing based on spin coherent states of two component Bose--Einstein condensates was proposed (Byrnes et al. Phys. Rev. A 85, 40306(R)). In this paper we give a more detailed exposition of the scheme, expanding on several aspects that were not discussed in full previously. The basic concept of the scheme is that spin coherent states are used instead of qubits to encode qubit information, and manipulated using collective spin operators. The scheme goes beyond the continuous variable regime such that the full space of the Bloch sphere is used. We construct a general framework for quantum algorithms to be executed using multiple spin coherent states, which are individually controlled. We illustrate the scheme by applications to quantum information protocols, and discuss possible experimental implementations. Decoherence effects are analyzed under both general conditions and for the experimental implementation proposed.}, JOURNAL = {Optics Communications}, VOLUME = {337}, PAGES = {102--109}, }
Endnote
%0 Journal Article %A Byrnes, Tim %A Rosseau, Daniel %A Khosla, Megha %A Pyrkov, Alexey %A Thomasen, Andreas %A Mukai, Tetsuya %A Koyama, Shinsuke %A Abdelrahman, Ahmed %A Ilo-Okeke, Ebubechukwu %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations External Organizations External Organizations %T Macroscopic Quantum Information Processing Using Spin Coherent States : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-4912-8 %R 10.1016/j.optcom.2014.08.017 %7 2014-08-22 %D 2015 %X Abstract Previously a new scheme of quantum information processing based on spin coherent states of two component Bose&#8211;Einstein condensates was proposed (Byrnes et al. Phys. Rev. A 85, 40306(R)). In this paper we give a more detailed exposition of the scheme, expanding on several aspects that were not discussed in full previously. The basic concept of the scheme is that spin coherent states are used instead of qubits to encode qubit information, and manipulated using collective spin operators. The scheme goes beyond the continuous variable regime such that the full space of the Bloch sphere is used. We construct a general framework for quantum algorithms to be executed using multiple spin coherent states, which are individually controlled. We illustrate the scheme by applications to quantum information protocols, and discuss possible experimental implementations. Decoherence effects are analyzed under both general conditions and for the experimental implementation proposed. %K Bose&#8211;Einstein condensates %J Optics Communications %V 337 %& 102 %P 102 - 109 %I North-Holland %C Amsterdam %@ false %U http://www.sciencedirect.com/science/article/pii/S0030401814007639
[91]
K. Censor-Hillel, P. Kaski, J. H. Korhonen, C. Lenzen, A. Paz, and J. Suomela, “Algebraic Methods in the Congested Clique,” in PODC’15, ACM Symposium on Principles of Distributed Computing, Donostia-San Sebastián, Spain, 2015.
Export
BibTeX
@inproceedings{Censor-Hill_PODC2015, TITLE = {Algebraic Methods in the Congested Clique}, AUTHOR = {Censor-Hillel, Keren and Kaski, Petteri and Korhonen, Janne H. and Lenzen, Christoph and Paz, Ami and Suomela, Jukka}, LANGUAGE = {eng}, DOI = {10.1145/2767386.2767414}, PUBLISHER = {ACM}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {PODC'15, ACM Symposium on Principles of Distributed Computing}, PAGES = {143--152}, ADDRESS = {Donostia-San Sebasti{\'a}n, Spain}, }
Endnote
%0 Conference Proceedings %A Censor-Hillel, Keren %A Kaski, Petteri %A Korhonen, Janne H. %A Lenzen, Christoph %A Paz, Ami %A Suomela, Jukka %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Algebraic Methods in the Congested Clique : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-07B2-6 %R 10.1145/2767386.2767414 %D 2015 %B ACM Symposium on Principles of Distributed Computing %Z date of event: 2015-07-21 - 2015-07-23 %C Donostia-San Sebasti&#225;n, Spain %B PODC'15 %P 143 - 152 %I ACM
[92]
K. Censor-Hillel, P. Kaski, J. H. Korhonen, C. Lenzen, A. Paz, and J. Suomela, “Algebraic Methods in the Congested Clique,” 2015. [Online]. Available: http://arxiv.org/abs/1503.04963. (arXiv: 1503.04963)
Abstract
In this work, we use algebraic methods for studying distance computation and subgraph detection tasks in the congested clique model. Specifically, we adapt parallel matrix multiplication implementations to the congested clique, obtaining an $O(n^{1-2/\omega})$ round matrix multiplication algorithm, where $\omega < 2.3728639$ is the exponent of matrix multiplication. In conjunction with known techniques from centralised algorithmics, this gives significant improvements over previous best upper bounds in the congested clique model. The highlight results include: -- triangle and 4-cycle counting in $O(n^{0.158})$ rounds, improving upon the $O(n^{1/3})$ triangle detection algorithm of Dolev et al. [DISC 2012], -- a $(1 + o(1))$-approximation of all-pairs shortest paths in $O(n^{0.158})$ rounds, improving upon the $\tilde{O} (n^{1/2})$-round $(2 + o(1))$-approximation algorithm of Nanongkai [STOC 2014], and -- computing the girth in $O(n^{0.158})$ rounds, which is the first non-trivial solution in this model. In addition, we present a novel constant-round combinatorial algorithm for detecting 4-cycles.
Export
BibTeX
@online{Censor-Hill_arXiv2015, TITLE = {Algebraic Methods in the Congested Clique}, AUTHOR = {Censor-Hillel, Keren and Kaski, Petteri and Korhonen, Janne H. and Lenzen, Christoph and Paz, Ami and Suomela, Jukka}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1503.04963}, EPRINT = {1503.04963}, EPRINTTYPE = {arXiv}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, ABSTRACT = {In this work, we use algebraic methods for studying distance computation and subgraph detection tasks in the congested clique model. Specifically, we adapt parallel matrix multiplication implementations to the congested clique, obtaining an $O(n^{1-2/\omega})$ round matrix multiplication algorithm, where $\omega < 2.3728639$ is the exponent of matrix multiplication. In conjunction with known techniques from centralised algorithmics, this gives significant improvements over previous best upper bounds in the congested clique model. The highlight results include: -- triangle and 4-cycle counting in $O(n^{0.158})$ rounds, improving upon the $O(n^{1/3})$ triangle detection algorithm of Dolev et al. [DISC 2012], -- a $(1 + o(1))$-approximation of all-pairs shortest paths in $O(n^{0.158})$ rounds, improving upon the $\tilde{O} (n^{1/2})$-round $(2 + o(1))$-approximation algorithm of Nanongkai [STOC 2014], and -- computing the girth in $O(n^{0.158})$ rounds, which is the first non-trivial solution in this model. In addition, we present a novel constant-round combinatorial algorithm for detecting 4-cycles.}, }
Endnote
%0 Report %A Censor-Hillel, Keren %A Kaski, Petteri %A Korhonen, Janne H. %A Lenzen, Christoph %A Paz, Ami %A Suomela, Jukka %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Algebraic Methods in the Congested Clique : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-07AA-9 %U http://arxiv.org/abs/1503.04963 %D 2015 %X In this work, we use algebraic methods for studying distance computation and subgraph detection tasks in the congested clique model. Specifically, we adapt parallel matrix multiplication implementations to the congested clique, obtaining an $O(n^{1-2/\omega})$ round matrix multiplication algorithm, where $\omega < 2.3728639$ is the exponent of matrix multiplication. In conjunction with known techniques from centralised algorithmics, this gives significant improvements over previous best upper bounds in the congested clique model. The highlight results include: -- triangle and 4-cycle counting in $O(n^{0.158})$ rounds, improving upon the $O(n^{1/3})$ triangle detection algorithm of Dolev et al. [DISC 2012], -- a $(1 + o(1))$-approximation of all-pairs shortest paths in $O(n^{0.158})$ rounds, improving upon the $\tilde{O} (n^{1/2})$-round $(2 + o(1))$-approximation algorithm of Nanongkai [STOC 2014], and -- computing the girth in $O(n^{0.158})$ rounds, which is the first non-trivial solution in this model. In addition, we present a novel constant-round combinatorial algorithm for detecting 4-cycles. %K Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC,Computer Science, Data Structures and Algorithms, cs.DS
[93]
P. Chalermsook, M. Goswami, L. Kozma, K. Mehlhorn, and T. Saranurak, “Pattern-avoiding Access in Binary Search Trees,” in FOCS 2015, IEEE 56th Annual Symposium on Foundations of Computer Science, Berkeley, CA, USA, 2015.
Export
BibTeX
@inproceedings{ChalermsookFOCS2015, TITLE = {Pattern-avoiding Access in Binary Search Trees}, AUTHOR = {Chalermsook, Parinya and Goswami, Mayank and Kozma, L{\'a}szl{\'o} and Mehlhorn, Kurt and Saranurak, Thatchaphol}, LANGUAGE = {eng}, DOI = {10.1109/FOCS.2015.32}, PUBLISHER = {IEEE}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {FOCS 2015, IEEE 56th Annual Symposium on Foundations of Computer Science}, PAGES = {410--423}, ADDRESS = {Berkeley, CA, USA}, }
Endnote
%0 Conference Proceedings %A Chalermsook, Parinya %A Goswami, Mayank %A Kozma, L&#225;szl&#243; %A Mehlhorn, Kurt %A Saranurak, Thatchaphol %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Pattern-avoiding Access in Binary Search Trees : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-078B-F %R 10.1109/FOCS.2015.32 %D 2015 %B IEEE 56th Annual Symposium on Foundations of Computer Science %Z date of event: 2015-10-18 - 2015-10-20 %C Berkeley, CA, USA %B FOCS 2015 %P 410 - 423 %I IEEE
[94]
P. Chalermsook, M. Goswami, L. Kozma, K. Mehlhorn, and T. Saranurak, “Pattern-avoiding Access in Binary Search Trees,” 2015. [Online]. Available: http://arxiv.org/abs/1507.06953. (arXiv: 1507.06953)
Abstract
The dynamic optimality conjecture is perhaps the most fundamental open question about binary search trees (BST). It postulates the existence of an asymptotically optimal online BST, i.e. one that is constant factor competitive with any BST on any input access sequence. The two main candidates for dynamic optimality in the literature are splay trees [Sleator and Tarjan, 1985], and Greedy [Lucas, 1988; Munro, 2000; Demaine et al. 2009] [..] Dynamic optimality is trivial for almost all sequences: the optimum access cost of most length-n sequences is Theta(n log n), achievable by any balanced BST. Thus, the obvious missing step towards the conjecture is an understanding of the "easy" access sequences. [..] The difficulty of proving dynamic optimality is witnessed by highly restricted special cases that remain unresolved; one prominent example is the traversal conjecture [Sleator and Tarjan, 1985], which states that preorder sequences (whose optimum is linear) are linear-time accessed by splay trees; no online BST is known to satisfy this conjecture. In this paper, we prove two different relaxations of the traversal conjecture for Greedy: (i) Greedy is almost linear for preorder traversal, (ii) if a linear-time preprocessing is allowed, Greedy is in fact linear. These statements are corollaries of our more general results that express the complexity of access sequences in terms of a pattern avoidance parameter k. [..] To our knowledge, these are the first upper bounds for Greedy that are not known to hold for any other online BST. To obtain these results we identify an input-revealing property of Greedy. Informally, this means that the execution log partially reveals the structure of the access sequence. This property facilitates the use of rich technical tools from forbidden submatrix theory. [Abridged]
Export
BibTeX
@online{ChalermsookArXiv2015, TITLE = {Pattern-avoiding Access in Binary Search Trees}, AUTHOR = {Chalermsook, Parinya and Goswami, Mayank and Kozma, L{\'a}szl{\'o} and Mehlhorn, Kurt and Saranurak, Thatchaphol}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1507.06953}, EPRINT = {1507.06953}, EPRINTTYPE = {arXiv}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, ABSTRACT = {The dynamic optimality conjecture is perhaps the most fundamental open question about binary search trees (BST). It postulates the existence of an asymptotically optimal online BST, i.e. one that is constant factor competitive with any BST on any input access sequence. The two main candidates for dynamic optimality in the literature are splay trees [Sleator and Tarjan, 1985], and Greedy [Lucas, 1988; Munro, 2000; Demaine et al. 2009] [..] Dynamic optimality is trivial for almost all sequences: the optimum access cost of most length-n sequences is Theta(n log n), achievable by any balanced BST. Thus, the obvious missing step towards the conjecture is an understanding of the "easy" access sequences. [..] The difficulty of proving dynamic optimality is witnessed by highly restricted special cases that remain unresolved; one prominent example is the traversal conjecture [Sleator and Tarjan, 1985], which states that preorder sequences (whose optimum is linear) are linear-time accessed by splay trees; no online BST is known to satisfy this conjecture. In this paper, we prove two different relaxations of the traversal conjecture for Greedy: (i) Greedy is almost linear for preorder traversal, (ii) if a linear-time preprocessing is allowed, Greedy is in fact linear. These statements are corollaries of our more general results that express the complexity of access sequences in terms of a pattern avoidance parameter k. [..] To our knowledge, these are the first upper bounds for Greedy that are not known to hold for any other online BST. To obtain these results we identify an input-revealing property of Greedy. Informally, this means that the execution log partially reveals the structure of the access sequence. This property facilitates the use of rich technical tools from forbidden submatrix theory. [Abridged]}, }
Endnote
%0 Report %A Chalermsook, Parinya %A Goswami, Mayank %A Kozma, L&#225;szl&#243; %A Mehlhorn, Kurt %A Saranurak, Thatchaphol %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Pattern-avoiding Access in Binary Search Trees : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-8F4C-0 %U http://arxiv.org/abs/1507.06953 %D 2015 %X The dynamic optimality conjecture is perhaps the most fundamental open question about binary search trees (BST). It postulates the existence of an asymptotically optimal online BST, i.e. one that is constant factor competitive with any BST on any input access sequence. The two main candidates for dynamic optimality in the literature are splay trees [Sleator and Tarjan, 1985], and Greedy [Lucas, 1988; Munro, 2000; Demaine et al. 2009] [..] Dynamic optimality is trivial for almost all sequences: the optimum access cost of most length-n sequences is Theta(n log n), achievable by any balanced BST. Thus, the obvious missing step towards the conjecture is an understanding of the "easy" access sequences. [..] The difficulty of proving dynamic optimality is witnessed by highly restricted special cases that remain unresolved; one prominent example is the traversal conjecture [Sleator and Tarjan, 1985], which states that preorder sequences (whose optimum is linear) are linear-time accessed by splay trees; no online BST is known to satisfy this conjecture. In this paper, we prove two different relaxations of the traversal conjecture for Greedy: (i) Greedy is almost linear for preorder traversal, (ii) if a linear-time preprocessing is allowed, Greedy is in fact linear. These statements are corollaries of our more general results that express the complexity of access sequences in terms of a pattern avoidance parameter k. [..] To our knowledge, these are the first upper bounds for Greedy that are not known to hold for any other online BST. To obtain these results we identify an input-revealing property of Greedy. Informally, this means that the execution log partially reveals the structure of the access sequence. This property facilitates the use of rich technical tools from forbidden submatrix theory. [Abridged] %K Computer Science, Data Structures and Algorithms, cs.DS,Mathematics, Combinatorics, math.CO
[95]
P. Chalermsook, M. Goswami, L. Kozma, K. Mehlhorn, and T. Saranurak, “Greedy Is an Almost Optimal Deque,” in Algorithms and Data Structures (WADS 2015), Victoria, Canada, 2015.
Export
BibTeX
@inproceedings{ChalermsookWADS2015, TITLE = {Greedy Is an Almost Optimal Deque}, AUTHOR = {Chalermsook, Parinya and Goswami, Mayank and Kozma, L{\'a}sl{\'o} and Mehlhorn, Kurt and Saranurak, Thatchaphol}, LANGUAGE = {eng}, ISBN = {978-3-319-21839-7}, DOI = {10.1007/978-3-319-21840-3_13}, PUBLISHER = {Springer}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Algorithms and Data Structures (WADS 2015)}, EDITOR = {Dehne, Frank and Sack, J{\"o}rg-R{\"u}diger and Stege, Ulrike}, PAGES = {152--165}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9214}, ADDRESS = {Victoria, Canada}, }
Endnote
%0 Conference Proceedings %A Chalermsook, Parinya %A Goswami, Mayank %A Kozma, L&#225;sl&#243; %A Mehlhorn, Kurt %A Saranurak, Thatchaphol %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Greedy Is an Almost Optimal Deque : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-8F41-6 %R 10.1007/978-3-319-21840-3_13 %D 2015 %B 14th International Symposium on Algorithms and Data Structure %Z date of event: 2015-08-05 - 2015-08-07 %C Victoria, Canada %B Algorithms and Data Structures %E Dehne, Frank; Sack, J&#246;rg-R&#252;diger; Stege, Ulrike %P 152 - 165 %I Springer %@ 978-3-319-21839-7 %B Lecture Notes in Computer Science %N 9214
[96]
P. Chalermsook, M. Goswami, L. Kozma, K. Mehlhorn, and T. Saranurak, “Self-Adjusting Binary Search Trees: What Makes Them Tick?,” in Algorithms -- ESA 2015, Patras, Greece, 2015.
Export
BibTeX
@inproceedings{ChalermsookESA2015, TITLE = {Self-Adjusting Binary Search Trees: {W}hat Makes Them Tick?}, AUTHOR = {Chalermsook, Parinya and Goswami, Mayank and Kozma, Laszlo and Mehlhorn, Kurt and Saranurak, Thatchaphol}, LANGUAGE = {eng}, ISBN = {978-3-662-4834}, DOI = {10.1007/978-3-662-48350-3_26}, PUBLISHER = {Springer}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Algorithms -- ESA 2015}, EDITOR = {Bansal, Nikhil and Finocchi, Irene}, PAGES = {300--312}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9294}, ADDRESS = {Patras, Greece}, }
Endnote
%0 Conference Proceedings %A Chalermsook, Parinya %A Goswami, Mayank %A Kozma, Laszlo %A Mehlhorn, Kurt %A Saranurak, Thatchaphol %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Self-Adjusting Binary Search Trees: What Makes Them Tick? : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-667A-C %R 10.1007/978-3-662-48350-3_26 %D 2015 %B 23rd Annual European Symposium on Algorithms %Z date of event: 2015-09-14 - 2015-09-16 %C Patras, Greece %B Algorithms -- ESA 2015 %E Bansal, Nikhil; Finocchi, Irene %P 300 - 312 %I Springer %@ 978-3-662-4834 %B Lecture Notes in Computer Science %N 9294
[97]
P. Chalermsook, H. Imai, and V. Suppakitpaisarn, “Two Lower Bounds for Shortest Double-Base Number System,” IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences - Series A, vol. E98, no. 6, 2015.
Export
BibTeX
@article{Chalermsook2015, TITLE = {Two Lower Bounds for Shortest Double-Base Number System}, AUTHOR = {Chalermsook, Parinya and Imai, Hiroshi and Suppakitpaisarn, Vorapong}, LANGUAGE = {eng}, ISSN = {0916-8508}, DOI = {10.1587/transfun.E98.A.1310}, PUBLISHER = {Institute of Electronics, Information and Communication Engineers}, ADDRESS = {Tokyo, Japan}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, JOURNAL = {IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences -- Series A}, VOLUME = {E98}, NUMBER = {6}, PAGES = {1310--1312}, }
Endnote
%0 Journal Article %A Chalermsook, Parinya %A Imai, Hiroshi %A Suppakitpaisarn, Vorapong %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Two Lower Bounds for Shortest Double-Base Number System : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-5299-9 %R 10.1587/transfun.E98.A.1310 %7 2015 %D 2015 %J IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences - Series A %V E98 %N 6 %& 1310 %P 1310 - 1312 %I Institute of Electronics, Information and Communication Engineers %C Tokyo, Japan %@ false
[98]
P. Chalermsook, F. Grandoni, and B. Laekhanukit, “On Survivable Set Connectivity,” in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), San Diego, CA, USA, 2015.
Export
BibTeX
@inproceedings{ChalermsookGL2015, TITLE = {On Survivable Set Connectivity}, AUTHOR = {Chalermsook, Parinya and Grandoni, Fabrizio and Laekhanukit, Bundit}, LANGUAGE = {eng}, ISBN = {978-1-61197-374-7}, DOI = {10.1137/1.9781611973730.3}, PUBLISHER = {SIAM}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015)}, EDITOR = {Indyk, Piotr}, PAGES = {25--36}, ADDRESS = {San Diego, CA, USA}, }
Endnote
%0 Conference Proceedings %A Chalermsook, Parinya %A Grandoni, Fabrizio %A Laekhanukit, Bundit %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T On Survivable Set Connectivity : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-90FD-1 %R 10.1137/1.9781611973730.3 %D 2015 %B Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2015-01-04 - 2015-01-06 %C San Diego, CA, USA %B Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms %E Indyk, Piotr %P 25 - 36 %I SIAM %@ 978-1-61197-374-7
[99]
P. Chalermsook, M. Goswami, L. Kozma, K. Mehlhorn, and T. Saranurak, “Self-Adjusting Binary Search Trees: What Makes Them Tick?,” 2015. [Online]. Available: http://arxiv.org/abs/1503.03105. (arXiv: 1503.03105)
Abstract
Splay trees (Sleator and Tarjan) satisfy the so-called access lemma. Many of the nice properties of splay trees follow from it. What makes self-adjusting binary search trees (BSTs) satisfy the access lemma? After each access, self-adjusting BSTs replace the search path by a tree on the same set of nodes (the after-tree). We identify two simple combinatorial properties of the search path and the after-tree that imply the access lemma. Our main result (i) implies the access lemma for all minimally self-adjusting BST algorithms for which it was known to hold: splay trees and their generalization to the class of local algorithms (Subramanian, Georgakopoulos and Mc-Clurkin), as well as Greedy BST, introduced by Demaine et al. and shown to satisfy the access lemma by Fox, (ii) implies that BST algorithms based on "strict" depth-halving satisfy the access lemma, addressing an open question that was raised several times since 1985, and (iii) yields an extremely short proof for the O(log n log log n) amortized access cost for the path-balance heuristic (proposed by Sleator), matching the best known bound (Balasubramanian and Raman) to a lower-order factor. One of our combinatorial properties is locality. We show that any BST-algorithm that satisfies the access lemma via the sum-of-log (SOL) potential is necessarily local. The other property states that the sum of the number of leaves of the after-tree plus the number of side alternations in the search path must be at least a constant fraction of the length of the search path. We show that a weak form of this property is necessary for sequential access to be linear.
Export
BibTeX
@online{Chalermsook/abs/1503.03105, TITLE = {Self-Adjusting Binary Search Trees: What Makes Them Tick?}, AUTHOR = {Chalermsook, Parinya and Goswami, Mayank and Kozma, Laszlo and Mehlhorn, Kurt and Saranurak, Thatchaphol}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1503.03105}, EPRINT = {1503.03105}, EPRINTTYPE = {arXiv}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Splay trees (Sleator and Tarjan) satisfy the so-called access lemma. Many of the nice properties of splay trees follow from it. What makes self-adjusting binary search trees (BSTs) satisfy the access lemma? After each access, self-adjusting BSTs replace the search path by a tree on the same set of nodes (the after-tree). We identify two simple combinatorial properties of the search path and the after-tree that imply the access lemma. Our main result (i) implies the access lemma for all minimally self-adjusting BST algorithms for which it was known to hold: splay trees and their generalization to the class of local algorithms (Subramanian, Georgakopoulos and Mc-Clurkin), as well as Greedy BST, introduced by Demaine et al. and shown to satisfy the access lemma by Fox, (ii) implies that BST algorithms based on "strict" depth-halving satisfy the access lemma, addressing an open question that was raised several times since 1985, and (iii) yields an extremely short proof for the O(log n log log n) amortized access cost for the path-balance heuristic (proposed by Sleator), matching the best known bound (Balasubramanian and Raman) to a lower-order factor. One of our combinatorial properties is locality. We show that any BST-algorithm that satisfies the access lemma via the sum-of-log (SOL) potential is necessarily local. The other property states that the sum of the number of leaves of the after-tree plus the number of side alternations in the search path must be at least a constant fraction of the length of the search path. We show that a weak form of this property is necessary for sequential access to be linear.}, }
Endnote
%0 Report %A Chalermsook, Parinya %A Goswami, Mayank %A Kozma, Laszlo %A Mehlhorn, Kurt %A Saranurak, Thatchaphol %+ 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 Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Self-Adjusting Binary Search Trees: What Makes Them Tick? : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0027-D3FB-E %U http://arxiv.org/abs/1503.03105 %D 2015 %X Splay trees (Sleator and Tarjan) satisfy the so-called access lemma. Many of the nice properties of splay trees follow from it. What makes self-adjusting binary search trees (BSTs) satisfy the access lemma? After each access, self-adjusting BSTs replace the search path by a tree on the same set of nodes (the after-tree). We identify two simple combinatorial properties of the search path and the after-tree that imply the access lemma. Our main result (i) implies the access lemma for all minimally self-adjusting BST algorithms for which it was known to hold: splay trees and their generalization to the class of local algorithms (Subramanian, Georgakopoulos and Mc-Clurkin), as well as Greedy BST, introduced by Demaine et al. and shown to satisfy the access lemma by Fox, (ii) implies that BST algorithms based on "strict" depth-halving satisfy the access lemma, addressing an open question that was raised several times since 1985, and (iii) yields an extremely short proof for the O(log n log log n) amortized access cost for the path-balance heuristic (proposed by Sleator), matching the best known bound (Balasubramanian and Raman) to a lower-order factor. One of our combinatorial properties is locality. We show that any BST-algorithm that satisfies the access lemma via the sum-of-log (SOL) potential is necessarily local. The other property states that the sum of the number of leaves of the after-tree plus the number of side alternations in the search path must be at least a constant fraction of the length of the search path. We show that a weak form of this property is necessary for sequential access to be linear. %K Computer Science, Data Structures and Algorithms, cs.DS
[100]
P. Chalermsook, M. Goswami, L. Kozma, K. Mehlhorn, and T. Saranurak, “Greedy Is an Almost Optimal Deque,” 2015. [Online]. Available: http://arxiv.org/abs/1506.08319. (arXiv: 1506.08319)
Abstract
In this paper we extend the geometric binary search tree (BST) model of Demaine, Harmon, Iacono, Kane, and Patrascu (DHIKP) to accommodate for insertions and deletions. Within this extended model, we study the online Greedy BST algorithm introduced by DHIKP. Greedy BST is known to be equivalent to a maximally greedy (but inherently offline) algorithm introduced independently by Lucas in 1988 and Munro in 2000, conjectured to be dynamically optimal. With the application of forbidden-submatrix theory, we prove a quasilinear upper bound on the performance of Greedy BST on deque sequences. It has been conjectured (Tarjan, 1985) that splay trees (Sleator and Tarjan, 1983) can serve such sequences in linear time. Currently neither splay trees, nor other general-purpose BST algorithms are known to fulfill this requirement. As a special case, we show that Greedy BST can serve output-restricted deque sequences in linear time. A similar result is known for splay trees (Tarjan, 1985; Elmasry, 2004). As a further application of the insert-delete model, we give a simple proof that, given a set U of permutations of [n], the access cost of any BST algorithm is Omega(log |U| + n) on "most" of the permutations from U. In particular, this implies that the access cost for a random permutation of [n] is Omega(n log n) with high probability. Besides the splay tree noted before, Greedy BST has recently emerged as a plausible candidate for dynamic optimality. Compared to splay trees, much less effort has gone into analyzing Greedy BST. Our work is intended as a step towards a full understanding of Greedy BST, and we remark that forbidden-submatrix arguments seem particularly well suited for carrying out this program.
Export
BibTeX
@online{Chalermsookabs/1506.08319, TITLE = {Greedy Is an Almost Optimal Deque}, AUTHOR = {Chalermsook, Parinya and Goswami, Mayank and Kozma, Laszlo and Mehlhorn, Kurt and Saranurak, Thatchaphol}, URL = {http://arxiv.org/abs/1506.08319}, EPRINT = {1506.08319}, EPRINTTYPE = {arXiv}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, ABSTRACT = {In this paper we extend the geometric binary search tree (BST) model of Demaine, Harmon, Iacono, Kane, and Patrascu (DHIKP) to accommodate for insertions and deletions. Within this extended model, we study the online Greedy BST algorithm introduced by DHIKP. Greedy BST is known to be equivalent to a maximally greedy (but inherently offline) algorithm introduced independently by Lucas in 1988 and Munro in 2000, conjectured to be dynamically optimal. With the application of forbidden-submatrix theory, we prove a quasilinear upper bound on the performance of Greedy BST on deque sequences. It has been conjectured (Tarjan, 1985) that splay trees (Sleator and Tarjan, 1983) can serve such sequences in linear time. Currently neither splay trees, nor other general-purpose BST algorithms are known to fulfill this requirement. As a special case, we show that Greedy BST can serve output-restricted deque sequences in linear time. A similar result is known for splay trees (Tarjan, 1985; Elmasry, 2004). As a further application of the insert-delete model, we give a simple proof that, given a set U of permutations of [n], the access cost of any BST algorithm is Omega(log |U| + n) on "most" of the permutations from U. In particular, this implies that the access cost for a random permutation of [n] is Omega(n log n) with high probability. Besides the splay tree noted before, Greedy BST has recently emerged as a plausible candidate for dynamic optimality. Compared to splay trees, much less effort has gone into analyzing Greedy BST. Our work is intended as a step towards a full understanding of Greedy BST, and we remark that forbidden-submatrix arguments seem particularly well suited for carrying out this program.}, }
Endnote
%0 Report %A Chalermsook, Parinya %A Goswami, Mayank %A Kozma, Laszlo %A Mehlhorn, Kurt %A Saranurak, Thatchaphol %+ 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 Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Greedy Is an Almost Optimal Deque : %U http://hdl.handle.net/11858/00-001M-0000-0027-D400-5 %U http://arxiv.org/abs/1506.08319 %D 2015 %X In this paper we extend the geometric binary search tree (BST) model of Demaine, Harmon, Iacono, Kane, and Patrascu (DHIKP) to accommodate for insertions and deletions. Within this extended model, we study the online Greedy BST algorithm introduced by DHIKP. Greedy BST is known to be equivalent to a maximally greedy (but inherently offline) algorithm introduced independently by Lucas in 1988 and Munro in 2000, conjectured to be dynamically optimal. With the application of forbidden-submatrix theory, we prove a quasilinear upper bound on the performance of Greedy BST on deque sequences. It has been conjectured (Tarjan, 1985) that splay trees (Sleator and Tarjan, 1983) can serve such sequences in linear time. Currently neither splay trees, nor other general-purpose BST algorithms are known to fulfill this requirement. As a special case, we show that Greedy BST can serve output-restricted deque sequences in linear time. A similar result is known for splay trees (Tarjan, 1985; Elmasry, 2004). As a further application of the insert-delete model, we give a simple proof that, given a set U of permutations of [n], the access cost of any BST algorithm is Omega(log |U| + n) on "most" of the permutations from U. In particular, this implies that the access cost for a random permutation of [n] is Omega(n log n) with high probability. Besides the splay tree noted before, Greedy BST has recently emerged as a plausible candidate for dynamic optimality. Compared to splay trees, much less effort has gone into analyzing Greedy BST. Our work is intended as a step towards a full understanding of Greedy BST, and we remark that forbidden-submatrix arguments seem particularly well suited for carrying out this program. %K Computer Science, Data Structures and Algorithms, cs.DS
[101]
B. Charron-Bost, M. Függer, and T. Nowak, “Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms,” in Automata, Languages, and Programming (ICALP 2015), Kyoto, Japan, 2015.
Export
BibTeX
@inproceedings{FueggerICALP2015, TITLE = {Approximate Consensus in Highly Dynamic Networks: {T}he Role of Averaging Algorithms}, AUTHOR = {Charron-Bost, Bernadette and F{\"u}gger, Matthias and Nowak, Thomas}, LANGUAGE = {eng}, ISBN = {978-3-662-47665-9}, DOI = {10.1007/978-3-662-47666-6_42}, PUBLISHER = {Springer}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Automata, Languages, and Programming (ICALP 2015)}, EDITOR = {Halld{\'o}rsson, Magn{\'u}s M. and Iwama, Kazuo and Kobayashi, Naoki and Speckmann, Bettina}, PAGES = {528--539}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9135}, ADDRESS = {Kyoto, Japan}, }
Endnote
%0 Conference Proceedings %A Charron-Bost, Bernadette %A F&#252;gger, Matthias %A Nowak, Thomas %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0029-1A84-6 %R 10.1007/978-3-662-47666-6_42 %D 2015 %B 42nd International Colloquium on Automata, Languages and Programming %Z date of event: 2015-07-06 - 2015-07-10 %C Kyoto, Japan %B Automata, Languages, and Programming %E Halld&#243;rsson, Magn&#250;s M.; Iwama, Kazuo; Kobayashi, Naoki; Speckmann, Bettina %P 528 - 539 %I Springer %@ 978-3-662-47665-9 %B Lecture Notes in Computer Science %N 9135
[102]
N. Chen, M. Hoefer, M. Künnemann, C. Lin, and P. Miao, “Secretary Markets with Local Information,” in Automata, Languages, and Programming (ICALP 2015), Kyoto, Japan, 2015.
Export
BibTeX
@inproceedings{Chen_ICALP2015, 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}, ISBN = {978-3-662-47665-9}, DOI = {10.1007/978-3-662-47666-6_44}, PUBLISHER = {Springer}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Automata, Languages, and Programming (ICALP 2015)}, EDITOR = {Halldorsson, Magnus and Iwama, Kazuo and Kobayashi, Naoki and Speckmann, Bettina}, PAGES = {552--563}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9135}, ADDRESS = {Kyoto, Japan}, }
Endnote
%0 Conference Proceedings %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/11858/00-001M-0000-0028-79EB-6 %R 10.1007/978-3-662-47666-6_44 %D 2015 %B 42nd International Colloquium on Automata, Languages, and Programming %Z date of event: 2015-07-06 - 2015-07-10 %C Kyoto, Japan %B Automata, Languages, and Programming %E Halldorsson, Magnus; Iwama, Kazuo; Kobayashi, Naoki; Speckmann, Bettina %P 552 - 563 %I Springer %@ 978-3-662-47665-9 %B Lecture Notes in Computer Science %N 9135
[103]
Y. K. Cheung, M. Henzinger, M. Hoefer, and M. Starnberger, “Combinatorial Auctions with Conflict-based Externalities,” in Web and Internet Economics (WINE 2015), Amsterdam, The Netherlands, 2015.
Export
BibTeX
@inproceedings{DBLP:conf/wine/CheungHHS15, TITLE = {Combinatorial Auctions with Conflict-based Externalities}, AUTHOR = {Cheung, Yun Kuen and Henzinger, Monika and Hoefer, Martin and Starnberger, Martin}, LANGUAGE = {eng}, ISBN = {978-3-662-48994-9}, DOI = {10.1007/978-3-662-48995-6_17}, PUBLISHER = {Springer}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Web and Internet Economics (WINE 2015)}, PAGES = {230--243}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9470}, ADDRESS = {Amsterdam, The Netherlands}, }
Endnote
%0 Conference Proceedings %A Cheung, Yun Kuen %A Henzinger, Monika %A Hoefer, Martin %A Starnberger, Martin %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Combinatorial Auctions with Conflict-based Externalities : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0029-76CE-7 %R 10.1007/978-3-662-48995-6_17 %D 2015 %B 11th International Conference on Web and Internet Economics %Z date of event: 2015-12-09 - 2015-12-12 %C Amsterdam, The Netherlands %B Web and Internet Economics %P 230 - 243 %I Springer %@ 978-3-662-48994-9 %B Lecture Notes in Computer Science %N 9470 %U http://dx.doi.org/10.1007/978-3-662-48995-6_17
[104]
J. Cibulka, P. Gao, M. Krčál, T. Valla, and P. Valtr, “On the Geometric Ramsey Number of Outerplanar Graphs,” Discrete & Computational Geometry, vol. 53, no. 1, 2015.
Export
BibTeX
@article{Cibulka2015, TITLE = {On the Geometric {Ramsey} Number of Outerplanar Graphs}, AUTHOR = {Cibulka, Josef and Gao, Pu and Kr{\v c}{\'a}l, Marek and Valla, Tom{\'a}{\v s} and Valtr, Pavel}, LANGUAGE = {eng}, ISSN = {0179-5376}, DOI = {10.1007/s00454-014-9646-x}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Discrete \& Computational Geometry}, VOLUME = {53}, NUMBER = {1}, PAGES = {64--79}, }
Endnote
%0 Journal Article %A Cibulka, Josef %A Gao, Pu %A Kr&#269;&#225;l, Marek %A Valla, Tom&#225;&#353; %A Valtr, Pavel %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T On the Geometric Ramsey Number of Outerplanar Graphs : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-9F30-4 %R 10.1007/s00454-014-9646-x %7 2015 %D 2015 %J Discrete & Computational Geometry %V 53 %N 1 %& 64 %P 64 - 79 %I Springer %C New York, NY %@ false
[105]
J. R. Correa and N. Megow, “Clique Partitioning with Value-monotone Submodular Cost,” Discrete Optimization, vol. 15, 2015.
Abstract
Abstract We consider the problem of partitioning a graph into cliques of bounded cardinality. The goal is to find a partition that minimizes the sum of clique costs where the cost of a clique is given by a set function on the nodes. We present a general algorithmic solution based on solving the problem variant without the cardinality constraint. We obtain constant factor approximations depending on the solvability of this relaxation for a large class of submodular cost functions which we call value-monotone submodular functions. For special graph classes we give optimal algorithms.
Export
BibTeX
@article{CorreaM2015, TITLE = {Clique Partitioning with Value-monotone Submodular Cost}, AUTHOR = {Correa, Jos{\'e} R. and Megow, Nicole}, LANGUAGE = {eng}, ISSN = {1572-5286}, DOI = {http://dx.doi.org/10.1016/j.disopt.2014.11.001}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, ABSTRACT = {Abstract We consider the problem of partitioning a graph into cliques of bounded cardinality. The goal is to find a partition that minimizes the sum of clique costs where the cost of a clique is given by a set function on the nodes. We present a general algorithmic solution based on solving the problem variant without the cardinality constraint. We obtain constant factor approximations depending on the solvability of this relaxation for a large class of submodular cost functions which we call value-monotone submodular functions. For special graph classes we give optimal algorithms.}, JOURNAL = {Discrete Optimization}, VOLUME = {15}, PAGES = {26--36}, }
Endnote
%0 Journal Article %A Correa, Jos&#233; R. %A Megow, Nicole %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Clique Partitioning with Value-monotone Submodular Cost : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-4E79-5 %R http://dx.doi.org/10.1016/j.disopt.2014.11.001 %7 2014-12-08 %D 2015 %X Abstract We consider the problem of partitioning a graph into cliques of bounded cardinality. The goal is to find a partition that minimizes the sum of clique costs where the cost of a clique is given by a set function on the nodes. We present a general algorithmic solution based on solving the problem variant without the cardinality constraint. We obtain constant factor approximations depending on the solvability of this relaxation for a large class of submodular cost functions which we call value-monotone submodular functions. For special graph classes we give optimal algorithms. %K Partition into cliques %J Discrete Optimization %V 15 %& 26 %P 26 - 36 %I Elsevier %C Amsterdam %@ false
[106]
R. Curticapean and M. Künnemann, “A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems,” Algorithmica, vol. 73, no. 3, 2015.
Export
BibTeX
@article{CurticapeanK2015, TITLE = {A Quantization Framework for Smoothed Analysis of {Euclidean} Optimization Problems}, AUTHOR = {Curticapean, Radu and K{\"u}nnemann, Marvin}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-015-0043-5}, LOCALID = {Local-ID: A71CF031B5078233C1257C69004C023A-CurticapeanK2013}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Algorithmica}, VOLUME = {73}, NUMBER = {3}, PAGES = {483--510}, }
Endnote
%0 Journal Article %A Curticapean, Radu %A K&#252;nnemann, Marvin %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-F685-9 %F OTHER: Local-ID: A71CF031B5078233C1257C69004C023A-CurticapeanK2013 %R 10.1007/s00453-015-0043-5 %7 2015 %D 2015 %J Algorithmica %V 73 %N 3 %& 483 %P 483 - 510 %I Springer %C New York, NY %@ false
[107]
J. Dams, M. Hoefer, and T. Kesselheim, “Scheduling in Wireless Networks with Rayleigh-fading Interference,” IEEE Transactions on Mobile Computing, vol. 14, no. 7, 2015.
Export
BibTeX
@article{DamsHoeferKesselheim2015, TITLE = {Scheduling in Wireless Networks with {Rayleigh}-fading Interference}, AUTHOR = {Dams, Johannes and Hoefer, Martin and Kesselheim, Thomas}, LANGUAGE = {eng}, ISSN = {1536-1233}, DOI = {10.1109/TMC.2014.2352278}, PUBLISHER = {IEEE}, ADDRESS = {Piscataway, NJ}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {IEEE Transactions on Mobile Computing}, VOLUME = {14}, NUMBER = {7}, PAGES = {1503--1514}, }
Endnote
%0 Journal Article %A Dams, Johannes %A Hoefer, Martin %A Kesselheim, Thomas %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Scheduling in Wireless Networks with Rayleigh-fading Interference : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-5236-5 %R 10.1109/TMC.2014.2352278 %7 2015 %D 2015 %J IEEE Transactions on Mobile Computing %V 14 %N 7 %& 1503 %P 1503 - 1514 %I IEEE %C Piscataway, NJ %@ false
[108]
O. Darwish, A. Elmasry, and J. Katajainen, “Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls,” 2015. [Online]. Available: http://arxiv.org/abs/1510.07185. (arXiv: 1510.07185)
Abstract
We consider space-bounded computations on a random-access machine (RAM) where the input is given on a read-only random-access medium, the output is to be produced to a write-only sequential-access medium, and the available workspace allows random reads and writes but is of limited capacity. The length of the input is $N$ elements, the length of the output is limited by the computation, and the capacity of the workspace is $O(S)$ bits for some predetermined parameter $S$. We present a state-of-the-art priority queue---called an adjustable navigation pile---for this restricted RAM model. Under some reasonable assumptions, our priority queue supports $\mathit{minimum}$ and $\mathit{insert}$ in $O(1)$ worst-case time and $\mathit{extract}$ in $O(N/S + \lg{} S)$ worst-case time for any $S \geq \lg{} N$. We show how to use this data structure to sort $N$ elements and to compute the convex hull of $N$ points in the two-dimensional Euclidean space in $O(N^2/S + N \lg{} S)$ worst-case time for any $S \geq \lg{} N$. Following a known lower bound for the space-time product of any branching program for finding unique elements, both our sorting and convex-hull algorithms are optimal. The adjustable navigation pile has turned out to be useful when designing other space-efficient algorithms, and we expect that it will find its way to yet other applications.
Export
BibTeX
@online{escidoc:2242951, TITLE = {Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls}, AUTHOR = {Darwish, Omar and Elmasry, Amr and Katajainen, Jyrki}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1510.07185}, EPRINT = {1510.07185}, EPRINTTYPE = {arXiv}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We consider space-bounded computations on a random-access machine (RAM) where the input is given on a read-only random-access medium, the output is to be produced to a write-only sequential-access medium, and the available workspace allows random reads and writes but is of limited capacity. The length of the input is $N$ elements, the length of the output is limited by the computation, and the capacity of the workspace is $O(S)$ bits for some predetermined parameter $S$. We present a state-of-the-art priority queue---called an adjustable navigation pile---for this restricted RAM model. Under some reasonable assumptions, our priority queue supports $\mathit{minimum}$ and $\mathit{insert}$ in $O(1)$ worst-case time and $\mathit{extract}$ in $O(N/S + \lg{} S)$ worst-case time for any $S \geq \lg{} N$. We show how to use this data structure to sort $N$ elements and to compute the convex hull of $N$ points in the two-dimensional Euclidean space in $O(N^2/S + N \lg{} S)$ worst-case time for any $S \geq \lg{} N$. Following a known lower bound for the space-time product of any branching program for finding unique elements, both our sorting and convex-hull algorithms are optimal. The adjustable navigation pile has turned out to be useful when designing other space-efficient algorithms, and we expect that it will find its way to yet other applications.}, }
Endnote
%0 Report %A Darwish, Omar %A Elmasry, Amr %A Katajainen, Jyrki %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0029-5F2C-8 %U http://arxiv.org/abs/1510.07185 %D 2015 %8 24.10.2015 %X We consider space-bounded computations on a random-access machine (RAM) where the input is given on a read-only random-access medium, the output is to be produced to a write-only sequential-access medium, and the available workspace allows random reads and writes but is of limited capacity. The length of the input is $N$ elements, the length of the output is limited by the computation, and the capacity of the workspace is $O(S)$ bits for some predetermined parameter $S$. We present a state-of-the-art priority queue---called an adjustable navigation pile---for this restricted RAM model. Under some reasonable assumptions, our priority queue supports $\mathit{minimum}$ and $\mathit{insert}$ in $O(1)$ worst-case time and $\mathit{extract}$ in $O(N/S + \lg{} S)$ worst-case time for any $S \geq \lg{} N$. We show how to use this data structure to sort $N$ elements and to compute the convex hull of $N$ points in the two-dimensional Euclidean space in $O(N^2/S + N \lg{} S)$ worst-case time for any $S \geq \lg{} N$. Following a known lower bound for the space-time product of any branching program for finding unique elements, both our sorting and convex-hull algorithms are optimal. The adjustable navigation pile has turned out to be useful when designing other space-efficient algorithms, and we expect that it will find its way to yet other applications. %K Computer Science, Data Structures and Algorithms, cs.DS
[109]
O. Darwish and K. Mehlhorn, “Improved Balanced Flow Computation Using Parametric Flow,” 2015. [Online]. Available: http://arxiv.org/abs/1512.05974. (arXiv: 1512.05974)
Abstract
We present a new algorithm for computing balanced flows in equality networks arising in market equilibrium computations. The current best time bound for computing balanced flows in such networks requires $O(n)$ maxflow computations, where $n$ is the number of nodes in the network [Devanur et al. 2008]. Our algorithm requires only a single parametric flow computation. The best algorithm for computing parametric flows [Gallo et al. 1989] is only by a logarithmic factor slower than the best algorithms for computing maxflows. Hence, the running time of the algorithms in [Devanur et al. 2008] and [Duan and Mehlhorn 2015] for computing market equilibria in linear Fisher and Arrow-Debreu markets improve by almost a factor of $n$.
Export
BibTeX
@online{DarwishMehlhorn2015, TITLE = {Improved Balanced Flow Computation Using Parametric Flow}, AUTHOR = {Darwish, Omar and Mehlhorn, Kurt}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1512.05974}, EPRINT = {1512.05974}, EPRINTTYPE = {arXiv}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We present a new algorithm for computing balanced flows in equality networks arising in market equilibrium computations. The current best time bound for computing balanced flows in such networks requires $O(n)$ maxflow computations, where $n$ is the number of nodes in the network [Devanur et al. 2008]. Our algorithm requires only a single parametric flow computation. The best algorithm for computing parametric flows [Gallo et al. 1989] is only by a logarithmic factor slower than the best algorithms for computing maxflows. Hence, the running time of the algorithms in [Devanur et al. 2008] and [Duan and Mehlhorn 2015] for computing market equilibria in linear Fisher and Arrow-Debreu markets improve by almost a factor of $n$.}, }
Endnote
%0 Report %A Darwish, Omar %A Mehlhorn, Kurt %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Improved Balanced Flow Computation Using Parametric Flow : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0029-4A62-F %U http://arxiv.org/abs/1512.05974 %D 2015 %X We present a new algorithm for computing balanced flows in equality networks arising in market equilibrium computations. The current best time bound for computing balanced flows in such networks requires $O(n)$ maxflow computations, where $n$ is the number of nodes in the network [Devanur et al. 2008]. Our algorithm requires only a single parametric flow computation. The best algorithm for computing parametric flows [Gallo et al. 1989] is only by a logarithmic factor slower than the best algorithms for computing maxflows. Hence, the running time of the algorithms in [Devanur et al. 2008] and [Duan and Mehlhorn 2015] for computing market equilibria in linear Fisher and Arrow-Debreu markets improve by almost a factor of $n$. %K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Computer Science and Game Theory, cs.GT
[110]
M. Dirnberger, T. Kehl, and A. Neumann, “NEFI: Network Extraction From Images,” Scientific Reports, vol. 5, 2015.
Export
BibTeX
@article{Dirnberger2015, TITLE = {{NEFI}: {N}etwork Extraction From Images}, AUTHOR = {Dirnberger, Michael and Kehl, Tim and Neumann, Adrian}, LANGUAGE = {eng}, DOI = {10.1038/srep15669}, PUBLISHER = {Nature Publishing Group}, ADDRESS = {London, UK}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, JOURNAL = {Scientific Reports}, VOLUME = {5}, EID = {15669}, }
Endnote
%0 Journal Article %A Dirnberger, Michael %A Kehl, Tim %A Neumann, Adrian %+ 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 NEFI: Network Extraction From Images : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0029-07C9-5 %R 10.1038/srep15669 %7 2015-11-02 %D 2015 %8 02.11.2015 %J Scientific Reports %O Sci. Rep. %V 5 %Z sequence number: 15669 %I Nature Publishing Group %C London, UK
[111]
B. Doerr and M. Künnemann, “Optimizing Linear Functions with the Evolutionary Algorithm -- Different Asymptotic Runtimes for Different Instances,” Theoretical Computer Science, vol. 561, 2015.
Export
BibTeX
@article{DoerrK14journalaccept, TITLE = {Optimizing Linear Functions with the Evolutionary Algorithm -- Different Asymptotic Runtimes for Different Instances}, AUTHOR = {Doerr, Benjamin and K{\"u}nnemann, Marvin}, LANGUAGE = {eng}, ISSN = {0304-3975}, DOI = {10.1016/j.tcs.2014.03.015}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Theoretical Computer Science}, VOLUME = {561}, PAGES = {3--23}, }
Endnote
%0 Journal Article %A Doerr, Benjamin %A K&#252;nnemann, Marvin %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Optimizing Linear Functions with the Evolutionary Algorithm -- Different Asymptotic Runtimes for Different Instances : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-43D2-8 %R 10.1016/j.tcs.2014.03.015 %7 2014-04-24 %D 2015 %K Population-based \EA\ %J Theoretical Computer Science %V 561 %& 3 %P 3 - 23 %I Elsevier %C Amsterdam %@ false
[112]
B. Doerr, C. Doerr, and F. Ebel, “From Black-Box Complexity to Designing New Genetic Algorithms,” Theoretical Computer Science, vol. 567, 2015.
Export
BibTeX
@article{DoerrDE14, TITLE = {From Black-Box Complexity to Designing New Genetic Algorithms}, AUTHOR = {Doerr, Benjamin and Doerr, Carola and Ebel, Franziska}, LANGUAGE = {eng}, ISSN = {0304-3975}, DOI = {10.1016/j.tcs.2014.11.028}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Theoretical Computer Science}, VOLUME = {567}, PAGES = {87--104}, }
Endnote
%0 Journal Article %A Doerr, Benjamin %A Doerr, Carola %A Ebel, Franziska %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T From Black-Box Complexity to Designing New Genetic Algorithms : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-5466-4 %R 10.1016/j.tcs.2014.11.028 %7 2014-12-04 %D 2015 %J Theoretical Computer Science %V 567 %& 87 %P 87 - 104 %I Elsevier %C Amsterdam %@ false
[113]
D. Dolev, M. Függer, C. Lenzen, U. Schmid, and A. Steininger, “Fault-tolerant Distributed Systems in Hardware,” Bulletin of EATCS, vol. 116, 2015.
Export
BibTeX
@article{DolevEATCS2015, TITLE = {Fault-tolerant Distributed Systems in Hardware}, AUTHOR = {Dolev, Danny and F{\"u}gger, Matthias and Lenzen, Christoph and Schmid, Ulrich and Steininger, Andreas}, LANGUAGE = {eng}, PUBLISHER = {EATCS}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, JOURNAL = {Bulletin of EATCS}, VOLUME = {116}, EID = {348}, }
Endnote
%0 Journal Article %A Dolev, Danny %A F&#252;gger, Matthias %A Lenzen, Christoph %A Schmid, Ulrich %A Steininger, Andreas %+ 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 Fault-tolerant Distributed Systems in Hardware : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-07CE-A %7 2015 %D 2015 %J Bulletin of EATCS %V 116 %Z sequence number: 348 %I EATCS %U http://bulletin.eatcs.org/index.php/beatcs/article/view/348
[114]
R. Duan and K. Mehlhorn, “A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market,” Information and Computation, vol. 243, 2015.
Export
BibTeX
@article{Duan2015, TITLE = {A Combinatorial Polynomial Algorithm for the Linear {Arrow}-{Debreu} Market}, AUTHOR = {Duan, Ran and Mehlhorn, Kurt}, LANGUAGE = {eng}, ISSN = {0890-5401}, DOI = {10.1016/j.ic.2014.12.009}, PUBLISHER = {Academic Press}, ADDRESS = {San Diego}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Information and Computation}, VOLUME = {243}, PAGES = {112--132}, }
Endnote
%0 Journal Article %A Duan, Ran %A Mehlhorn, Kurt %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0027-AC93-6 %R 10.1016/j.ic.2014.12.009 %7 2015 %D 2015 %J Information and Computation %V 243 %& 112 %P 112 - 132 %I Academic Press %C San Diego %@ false
[115]
K. Dutta and A. Prasad, “Combinatorics of Finite Abelian Groups and Weil Representations,” Pacific Journal of Mathematics, vol. 275, no. 2, 2015.
Abstract
The Weil representation of the symplectic group associated to a finite abelian group of odd order is shown to have a multiplicity-free decomposition. When the abelian group is p-primary, the irreducible representations occurring in the Weil representation are parametrized by a partially ordered set which is independent of p. As p varies, the dimension of the irreducible representation corresponding to each parameter is shown to be a polynomial in p which is calculated explicitly. The commuting algebra of the Weil representation has a basis indexed by another partially ordered set which is independent of p. The expansions of the projection operators onto the irreducible invariant subspaces in terms of this basis are calculated. The coefficients are again polynomials in p. These results remain valid in the more general setting of finitely generated torsion modules over a Dedekind domain.
Export
BibTeX
@article{Dutta:1301026a, TITLE = {Combinatorics of Finite Abelian Groups and {W}eil Representations}, AUTHOR = {Dutta, Kunal and Prasad, Amritanshu}, LANGUAGE = {eng}, ISSN = {0030-8730}, DOI = {10.2140/pjm.2015.275.295}, PUBLISHER = {Mathematical Sciences Publisher}, ADDRESS = {Berkeley, CA}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, ABSTRACT = {The Weil representation of the symplectic group associated to a finite abelian group of odd order is shown to have a multiplicity-free decomposition. When the abelian group is p-primary, the irreducible representations occurring in the Weil representation are parametrized by a partially ordered set which is independent of p. As p varies, the dimension of the irreducible representation corresponding to each parameter is shown to be a polynomial in p which is calculated explicitly. The commuting algebra of the Weil representation has a basis indexed by another partially ordered set which is independent of p. The expansions of the projection operators onto the irreducible invariant subspaces in terms of this basis are calculated. The coefficients are again polynomials in p. These results remain valid in the more general setting of finitely generated torsion modules over a Dedekind domain.}, JOURNAL = {Pacific Journal of Mathematics}, VOLUME = {275}, NUMBER = {2}, PAGES = {295--324}, }
Endnote
%0 Journal Article %A Dutta, Kunal %A Prasad, Amritanshu %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Combinatorics of Finite Abelian Groups and Weil Representations : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-48C9-3 %R 10.2140/pjm.2015.275.295 %7 2015 %D 2015 %X The Weil representation of the symplectic group associated to a finite abelian group of odd order is shown to have a multiplicity-free decomposition. When the abelian group is p-primary, the irreducible representations occurring in the Weil representation are parametrized by a partially ordered set which is independent of p. As p varies, the dimension of the irreducible representation corresponding to each parameter is shown to be a polynomial in p which is calculated explicitly. The commuting algebra of the Weil representation has a basis indexed by another partially ordered set which is independent of p. The expansions of the projection operators onto the irreducible invariant subspaces in terms of this basis are calculated. The coefficients are again polynomials in p. These results remain valid in the more general setting of finitely generated torsion modules over a Dedekind domain. %K Mathematics, Representation Theory, math.RT,Mathematics, Combinatorics, math.CO,Mathematics, Number Theory, math.NT, %J Pacific Journal of Mathematics %V 275 %N 2 %& 295 %P 295 - 324 %I Mathematical Sciences Publisher %C Berkeley, CA %@ false
[116]
P. Dütting, T. Kesselheim, and É. Tardos, “Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round,” in EC’15, ACM Conference on Economics and Computation, Portland, OR, USA, 2015.
Export
BibTeX
@inproceedings{DBLP:conf/sigecom/DuttingKT15, TITLE = {Algorithms as Mechanisms: {The} Price of Anarchy of Relax-and-Round}, AUTHOR = {D{\"u}tting, Paul and Kesselheim, Thomas and Tardos, {\'E}va}, LANGUAGE = {eng}, ISBN = {978-1-4503-3410-5}, DOI = {10.1145/2764468.2764486}, PUBLISHER = {ACM}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {EC{\textquoteright}15, ACM Conference on Economics and Computation}, PAGES = {187--201}, ADDRESS = {Portland, OR, USA}, }
Endnote
%0 Conference Proceedings %A D&#252;tting, Paul %A Kesselheim, Thomas %A Tardos, &#201;va %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0029-56E3-C %R 10.1145/2764468.2764486 %D 2015 %B ACM Conference on Economics and Computation %Z date of event: 2015-06-15 - 2015-06-19 %C Portland, OR, USA %B EC&#8217;15 %P 187 - 201 %I ACM %@ 978-1-4503-3410-5
[117]
P. Dütting and T. Kesselheim, “Algorithms against Anarchy: Understanding Non-truthful Mechanisms,” in EC’15, ACM Conference on Economics and Computation, Portland, OR, USA, 2015.
Export
BibTeX
@inproceedings{DBLP:conf/sigecom/DuttingK15, TITLE = {Algorithms against Anarchy: Understanding Non-truthful Mechanisms}, AUTHOR = {D{\"u}tting, Paul and Kesselheim, Thomas}, LANGUAGE = {eng}, ISBN = {978-1-4503-3410-5}, DOI = {10.1145/2764468.2764507}, PUBLISHER = {ACM}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {EC{\textquoteright}15, ACM Conference on Economics and Computation}, PAGES = {239--255}, ADDRESS = {Portland, OR, USA}, }
Endnote
%0 Conference Proceedings %A D&#252;tting, Paul %A Kesselheim, Thomas %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Algorithms against Anarchy: Understanding Non-truthful Mechanisms : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0029-56EC-9 %R 10.1145/2764468.2764507 %D 2015 %B ACM Conference on Economics and Computation %Z date of event: 2015-06-15 - 2015-06-19 %C Portland, OR, USA %B EC&#8217;15 %P 239 - 255 %I ACM %@ 978-1-4503-3410-5
[118]
F. Eisenbrand, S. Moran, R. Pinchasi, and M. Skutella, “Node-balancing by Edge-increments,” in Algorithms -- ESA 2015, Patras, Greece, 2015.
Export
BibTeX
@inproceedings{EisenbrandESA2015, TITLE = {Node-balancing by Edge-increments}, AUTHOR = {Eisenbrand, Friedrich and Moran, Shay and Pinchasi, Rom and Skutella, Martin}, LANGUAGE = {eng}, ISBN = {978-3-662-48349-7}, DOI = {10.1007/978-3-662-48350-3_38}, PUBLISHER = {Springer}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Algorithms -- ESA 2015}, EDITOR = {Bansal, Nikhil and Finocchi, Irene}, PAGES = {450--458}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9294}, ADDRESS = {Patras, Greece}, }
Endnote
%0 Conference Proceedings %A Eisenbrand, Friedrich %A Moran, Shay %A Pinchasi, Rom %A Skutella, Martin %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Node-balancing by Edge-increments : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-6683-5 %R 10.1007/978-3-662-48350-3_38 %D 2015 %B 23rd Annual European Symposium on Algorithms %Z date of event: 2015-09-14 - 2015-09-16 %C Patras, Greece %B Algorithms -- ESA 2015 %E Bansal, Nikhil; Finocchi, Irene %P 450 - 458 %I Springer %@ 978-3-662-48349-7 %B Lecture Notes in Computer Science %N 9294
[119]
F. Eisenbrand, S. Moran, R. Pinchasi, and M. Skutella, “Node-balancing by Edge-increments,” 2015. [Online]. Available: http://arxiv.org/abs/1504.06919. (arXiv: 1504.06919)
Abstract
Suppose you are given a graph $G=(V,E)$ with a weight assignment $w:V\rightarrow\mathbb{Z}$ and that your objective is to modify $w$ using legal steps such that all vertices will have the same weight, where in each legal step you are allowed to choose an edge and increment the weights of its end points by $1$. In this paper we study several variants of this problem for graphs and hypergraphs. On the combinatorial side we show connections with fundamental results from matching theory such as Hall's Theorem and Tutte's Theorem. On the algorithmic side we study the computational complexity of associated decision problems. Our main results are a characterization of the graphs for which any initial assignment can be balanced by edge-increments and a strongly polynomial-time algorithm that computes a balancing sequence of increments if one exists.
Export
BibTeX
@online{EisenbrandarXiv2015, TITLE = {Node-balancing by Edge-increments}, AUTHOR = {Eisenbrand, Friedrich and Moran, Shay and Pinchasi, Rom and Skutella, Martin}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1504.06919}, EPRINT = {1504.06919}, EPRINTTYPE = {arXiv}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Suppose you are given a graph $G=(V,E)$ with a weight assignment $w:V\rightarrow\mathbb{Z}$ and that your objective is to modify $w$ using legal steps such that all vertices will have the same weight, where in each legal step you are allowed to choose an edge and increment the weights of its end points by $1$. In this paper we study several variants of this problem for graphs and hypergraphs. On the combinatorial side we show connections with fundamental results from matching theory such as Hall's Theorem and Tutte's Theorem. On the algorithmic side we study the computational complexity of associated decision problems. Our main results are a characterization of the graphs for which any initial assignment can be balanced by edge-increments and a strongly polynomial-time algorithm that computes a balancing sequence of increments if one exists.}, }
Endnote
%0 Report %A Eisenbrand, Friedrich %A Moran, Shay %A Pinchasi, Rom %A Skutella, Martin %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Node-balancing by Edge-increments : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-667E-4 %U http://arxiv.org/abs/1504.06919 %D 2015 %X Suppose you are given a graph $G=(V,E)$ with a weight assignment $w:V\rightarrow\mathbb{Z}$ and that your objective is to modify $w$ using legal steps such that all vertices will have the same weight, where in each legal step you are allowed to choose an edge and increment the weights of its end points by $1$. In this paper we study several variants of this problem for graphs and hypergraphs. On the combinatorial side we show connections with fundamental results from matching theory such as Hall's Theorem and Tutte's Theorem. On the algorithmic side we study the computational complexity of associated decision problems. Our main results are a characterization of the graphs for which any initial assignment can be balanced by edge-increments and a strongly polynomial-time algorithm that computes a balancing sequence of increments if one exists. %K Computer Science, Discrete Mathematics, cs.DM
[120]
K. Elbassioni, K. Mehlhorn, and F. Ramezani, “Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design,” in Algorithmic Game Theory (SAGT 2015), Saarbrücken, Germany, 2015.
Export
BibTeX
@inproceedings{ElbassioniSAGT2015, TITLE = {Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design}, AUTHOR = {Elbassioni, Khaled and Mehlhorn, Kurt and Ramezani, Fahimeh}, LANGUAGE = {eng}, ISBN = {978-3-662-48432-6}, DOI = {10.1007/978-3-662-48433-3_8}, PUBLISHER = {Springer}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Algorithmic Game Theory (SAGT 2015)}, EDITOR = {Hoefer, Martin}, PAGES = {98--109}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9347}, ADDRESS = {Saarbr{\"u}cken, Germany}, }
Endnote
%0 Conference Proceedings %A Elbassioni, Khaled %A Mehlhorn, Kurt %A Ramezani, Fahimeh %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-8F3C-3 %R 10.1007/978-3-662-48433-3_8 %D 2015 %B 8th International Symposium on Algorithmic Game Theory %Z date of event: 2015-09-28 - 2015-09-30 %C Saarbr&#252;cken, Germany %B Algorithmic Game Theory %E Hoefer, Martin %P 98 - 109 %I Springer %@ 978-3-662-48432-6 %B Lecture Notes in Computer Science %N 9347
[121]
K. Elbassioni, K. Makino, K. Mehlhorn, and F. Ramezani, “On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets,” Algorithmica, vol. 73, no. 2, 2015.
Export
BibTeX
@article{Elbassioni_Algorithmica73, TITLE = {On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets}, AUTHOR = {Elbassioni, Khaled and Makino, Kazuhisa and Mehlhorn, Kurt and Ramezani, Fahimeh}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-014-9902-8}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Algorithmica}, VOLUME = {73}, NUMBER = {2}, PAGES = {441--459}, }
Endnote
%0 Journal Article %A Elbassioni, Khaled %A Makino, Kazuhisa %A Mehlhorn, Kurt %A Ramezani, Fahimeh %+ 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 On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-669E-B %R 10.1007/s00453-014-9902-8 %7 2015 %D 2015 %J Algorithmica %V 73 %N 2 %& 441 %P 441 - 459 %I Springer %C New York, NY %@ false
[122]
A. Farzan, A. López-Ortiz, P. K. Nicholson, and A. Salinger, “Algorithms in the Ultra-Wide Word Model,” in Theory and Applications of Models of Computation (TAMC 2015), Singapore, 2015.
Export
BibTeX
@inproceedings{FarzanTAMC2015, TITLE = {Algorithms in the Ultra-Wide Word Model}, AUTHOR = {Farzan, Arash and L{\'o}pez-Ortiz, Alejandro and Nicholson, Patrick K. and Salinger, Alejandro}, LANGUAGE = {eng}, ISBN = {978-3-319-17141-8}, DOI = {10.1007/978-3-319-17142-5_29}, PUBLISHER = {Springer}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Theory and Applications of Models of Computation (TAMC 2015)}, EDITOR = {Jain, Rahul and Jain, Sanjay and Stephan, Frank}, PAGES = {335--346}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9076}, ADDRESS = {Singapore}, }
Endnote
%0 Conference Proceedings %A Farzan, Arash %A L&#243;pez-Ortiz, Alejandro %A Nicholson, Patrick K. %A Salinger, Alejandro %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Algorithms in the Ultra-Wide Word Model : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-E137-6 %R 10.1007/978-3-319-17142-5_29 %D 2015 %B 12th Annual Conference on Theory and Applications of Models of Computation %Z date of event: 2015-05-18 - 2015-05-20 %C Singapore %B Theory and Applications of Models of Computation %E Jain, Rahul; Jain, Sanjay; Stephan, Frank %P 335 - 346 %I Springer %@ 978-3-319-17141-8 %B Lecture Notes in Computer Science %N 9076
[123]
H. Fernau, F. V. Fomin, G. Philip, and S. Saurabh, “On the Parameterized Complexity of Vertex Cover and Edge Cover with Connectivity Constraints,” Theoretical Computer Science, vol. 565, 2015.
Export
BibTeX
@article{FernauFominPhilipSaurabh, TITLE = {On the Parameterized Complexity of Vertex Cover and Edge Cover with Connectivity Constraints}, AUTHOR = {Fernau, Henning and Fomin, Fedor V. and Philip, Geevarghese and Saurabh, Saket}, LANGUAGE = {eng}, ISSN = {0304-3975}, DOI = {10.1016/j.tcs.2014.10.035}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Theoretical Computer Science}, VOLUME = {565}, PAGES = {1--15}, }
Endnote
%0 Journal Article %A Fernau, Henning %A Fomin, Fedor V. %A Philip, Geevarghese %A Saurabh, Saket %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T On the Parameterized Complexity of Vertex Cover and Edge Cover with Connectivity Constraints : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-4764-F %R 10.1016/j.tcs.2014.10.035 %7 2014-10-28 %D 2015 %J Theoretical Computer Science %V 565 %& 1 %P 1 - 15 %I Elsevier %C Amsterdam %@ false
[124]
F. V. Fomin, G. Philip, and Y. Villanger, “Minimum Fill-in of Sparse Graphs: Kernelization and Approximation,” Algorithmica, vol. 71, no. 1, 2015.
Abstract
The Minimum Fill-in problem is to decide if a graph can be triangulated by adding at most k edges. The problem has important applications in numerical algebra, in particular in sparse matrix computations. We develop kernelization algorithms for the problem on several classes of sparse graphs. We obtain linear kernels on planar graphs, and kernels of size in graphs excluding some fixed graph as a minor and in graphs of bounded degeneracy. As a byproduct of our results, we obtain approximation algorithms with approximation ratios on planar graphs and on H-minor-free graphs. These results significantly improve the previously known kernelization and approximation results for Minimum Fill-in on sparse graphs.
Export
BibTeX
@article{FominPhilipVillanger2015, TITLE = {Minimum Fill-in of Sparse Graphs: {Kernelization} and Approximation}, AUTHOR = {Fomin, Fedor V. and Philip, Geevarghese and Villanger, Yngve}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-013-9776-1}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, ABSTRACT = {The Minimum Fill-in problem is to decide if a graph can be triangulated by adding at most k edges. The problem has important applications in numerical algebra, in particular in sparse matrix computations. We develop kernelization algorithms for the problem on several classes of sparse graphs. We obtain linear kernels on planar graphs, and kernels of size in graphs excluding some fixed graph as a minor and in graphs of bounded degeneracy. As a byproduct of our results, we obtain approximation algorithms with approximation ratios on planar graphs and on H-minor-free graphs. These results significantly improve the previously known kernelization and approximation results for Minimum Fill-in on sparse graphs.}, JOURNAL = {Algorithmica}, VOLUME = {71}, NUMBER = {1}, PAGES = {1--20}, }
Endnote
%0 Journal Article %A Fomin, Fedor V. %A Philip, Geevarghese %A Villanger, Yngve %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Minimum Fill-in of Sparse Graphs: Kernelization and Approximation : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0025-7592-A %F ISI: 000348206400001 %R 10.1007/s00453-013-9776-1 %7 2015 %D 2015 %X The Minimum Fill-in problem is to decide if a graph can be triangulated by adding at most k edges. The problem has important applications in numerical algebra, in particular in sparse matrix computations. We develop kernelization algorithms for the problem on several classes of sparse graphs. We obtain linear kernels on planar graphs, and kernels of size in graphs excluding some fixed graph as a minor and in graphs of bounded degeneracy. As a byproduct of our results, we obtain approximation algorithms with approximation ratios on planar graphs and on H-minor-free graphs. These results significantly improve the previously known kernelization and approximation results for Minimum Fill-in on sparse graphs. %K DOMINATING SET; TRIANGULATION; TRACTABILITY; ALGORITHMSComputer Science; Mathematics; Parameterized complexity; Kernelization; Minimum fill-in; Planar graphs; Linear kernel; d-Degenerate graphs; %J Algorithmica %V 71 %N 1 %& 1 %P 1 - 20 %I Springer %C New York, NY %@ false
[125]
S. Friedrichs, M. Hemmer, J. King, and C. Schmidt, “The Continuous 1.5D Terrain Guarding Problem: Discretization, Optimal Solutions, and PTAS,” 2015. [Online]. Available: http://arxiv.org/abs/1509.08285. (arXiv: 1509.08285)
Abstract
In the NP-hard continuous 1.5D Terrain Guarding Problem (TGP) we are given an x-monotone chain of line segments in the plain (the terrain $T$), and ask for the minimum number of guards (located anywhere on $T$) required to guard all of $T$. We construct guard candidate and witness sets $G, W \subset T$ of polynomial size, such that any feasible (optimal) guard cover $G' \subseteq G$ for $W$ is also feasible (optimal) for the continuous TGP. This discretization allows us to: (1) settle NP-completeness for the continuous TGP; (2) provide a Polynomial Time Approximation Scheme (PTAS) for the continuous TGP using the existing PTAS for the discrete TGP by Gibson et al.; (3) formulate the continuous TGP as an Integer Linear Program (IP). Furthermore, we propose several filtering techniques reducing the size of our discretization, allowing us to devise an efficient IP-based algorithm that reliably provides optimal guard placements for terrains with up to 1000000 vertices within minutes on a standard desktop computer.
Export
BibTeX
@online{FriedrichsHemmerSchmidt2015, TITLE = {The Continuous 1.5{D} Terrain Guarding Problem: {D}iscretization, Optimal Solutions, and {PTAS}}, AUTHOR = {Friedrichs, Stephan and Hemmer, Michael and King, James and Schmidt, Christiane}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1509.08285}, EPRINT = {1509.08285}, EPRINTTYPE = {arXiv}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, ABSTRACT = {In the NP-hard continuous 1.5D Terrain Guarding Problem (TGP) we are given an x-monotone chain of line segments in the plain (the terrain $T$), and ask for the minimum number of guards (located anywhere on $T$) required to guard all of $T$. We construct guard candidate and witness sets $G, W \subset T$ of polynomial size, such that any feasible (optimal) guard cover $G' \subseteq G$ for $W$ is also feasible (optimal) for the continuous TGP. This discretization allows us to: (1) settle NP-completeness for the continuous TGP; (2) provide a Polynomial Time Approximation Scheme (PTAS) for the continuous TGP using the existing PTAS for the discrete TGP by Gibson et al.; (3) formulate the continuous TGP as an Integer Linear Program (IP). Furthermore, we propose several filtering techniques reducing the size of our discretization, allowing us to devise an efficient IP-based algorithm that reliably provides optimal guard placements for terrains with up to 1000000 vertices within minutes on a standard desktop computer.}, }
Endnote
%0 Report %A Friedrichs, Stephan %A Hemmer, Michael %A King, James %A Schmidt, Christiane %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T The Continuous 1.5D Terrain Guarding Problem: Discretization, Optimal Solutions, and PTAS : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0029-4A50-8 %U http://arxiv.org/abs/1509.08285 %D 2015 %X In the NP-hard continuous 1.5D Terrain Guarding Problem (TGP) we are given an x-monotone chain of line segments in the plain (the terrain $T$), and ask for the minimum number of guards (located anywhere on $T$) required to guard all of $T$. We construct guard candidate and witness sets $G, W \subset T$ of polynomial size, such that any feasible (optimal) guard cover $G' \subseteq G$ for $W$ is also feasible (optimal) for the continuous TGP. This discretization allows us to: (1) settle NP-completeness for the continuous TGP; (2) provide a Polynomial Time Approximation Scheme (PTAS) for the continuous TGP using the existing PTAS for the discrete TGP by Gibson et al.; (3) formulate the continuous TGP as an Integer Linear Program (IP). Furthermore, we propose several filtering techniques reducing the size of our discretization, allowing us to devise an efficient IP-based algorithm that reliably provides optimal guard placements for terrains with up to 1000000 vertices within minutes on a standard desktop computer. %K Computer Science, Computational Geometry, cs.CG
[126]
S. Friedrichs and C. Lenzen, “Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford,” 2015. [Online]. Available: http://arxiv.org/abs/1509.09047. (arXiv: 1509.09047)
Abstract
A \emph{metric tree embedding} of expected \emph{stretch $\alpha$} maps a weighted $n$-node graph $G = (V, E, \omega)$ to a weighted tree $T = (V_T, E_T, \omega_T)$ with $V \subseteq V_T$ such that $\operatorname{dist}(v, w, G) \leq \operatorname{dist}(v, w, T)$ and $\E[\operatorname{dist}(v, w, T)] \leq \alpha \operatorname{dist}(v, w, G)$ for all $v, w \in V$. Such embeddings are highly useful for designing fast approximation algorithms, as many hard problems are easy to solve on tree instances. However, to date the best parallel $\operatorname{polylog} n$ depth algorithm that achieves an asymptotically optimal expected stretch of $\alpha \in \operatorname{O}(\log n)$ requires $\operatorname{\Omega}(n^2)$ work and requires a metric as input. In this paper, we show how to achieve the same guarantees using $\operatorname{\tilde{O}}(m^{1+\epsilon})$ work, where $m$ is the number of edges of $G$ and $\epsilon > 0$ is an arbitrarily small constant. Moreover, one may reduce the work further to $\operatorname{\tilde{O}}(m + n^{1+\epsilon})$, at the expense of increasing the expected stretch $\alpha$ to $\operatorname{O}(\epsilon^{-1} \log n)$. Our main tool in deriving these parallel algorithms is an algebraic characterization of a generalization of the classic Moore-Bellman-Ford algorithm. We consider this framework, which subsumes a variety of previous "Moore-Bellman-Ford-flavored" algorithms, to be of independent interest.
Export
BibTeX
@online{FriedrichsLenzen2015, TITLE = {Parallel Metric Tree Embedding based on an Algebraic View on {Moore}-{Bellman}-{Ford}}, AUTHOR = {Friedrichs, Stephan and Lenzen, Christoph}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1509.09047}, EPRINT = {1509.09047}, EPRINTTYPE = {arXiv}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, ABSTRACT = {A \emph{metric tree embedding} of expected \emph{stretch $\alpha$} maps a weighted $n$-node graph $G = (V, E, \omega)$ to a weighted tree $T = (V_T, E_T, \omega_T)$ with $V \subseteq V_T$ such that $\operatorname{dist}(v, w, G) \leq \operatorname{dist}(v, w, T)$ and $\E[\operatorname{dist}(v, w, T)] \leq \alpha \operatorname{dist}(v, w, G)$ for all $v, w \in V$. Such embeddings are highly useful for designing fast approximation algorithms, as many hard problems are easy to solve on tree instances. However, to date the best parallel $\operatorname{polylog} n$ depth algorithm that achieves an asymptotically optimal expected stretch of $\alpha \in \operatorname{O}(\log n)$ requires $\operatorname{\Omega}(n^2)$ work and requires a metric as input. In this paper, we show how to achieve the same guarantees using $\operatorname{\tilde{O}}(m^{1+\epsilon})$ work, where $m$ is the number of edges of $G$ and $\epsilon > 0$ is an arbitrarily small constant. Moreover, one may reduce the work further to $\operatorname{\tilde{O}}(m + n^{1+\epsilon})$, at the expense of increasing the expected stretch $\alpha$ to $\operatorname{O}(\epsilon^{-1} \log n)$. Our main tool in deriving these parallel algorithms is an algebraic characterization of a generalization of the classic Moore-Bellman-Ford algorithm. We consider this framework, which subsumes a variety of previous "Moore-Bellman-Ford-flavored" algorithms, to be of independent interest.}, }
Endnote
%0 Report %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/11858/00-001M-0000-0029-4A48-B %U http://arxiv.org/abs/1509.09047 %D 2015 %X A \emph{metric tree embedding} of expected \emph{stretch $\alpha$} maps a weighted $n$-node graph $G = (V, E, \omega)$ to a weighted tree $T = (V_T, E_T, \omega_T)$ with $V \subseteq V_T$ such that $\operatorname{dist}(v, w, G) \leq \operatorname{dist}(v, w, T)$ and $\E[\operatorname{dist}(v, w, T)] \leq \alpha \operatorname{dist}(v, w, G)$ for all $v, w \in V$. Such embeddings are highly useful for designing fast approximation algorithms, as many hard problems are easy to solve on tree instances. However, to date the best parallel $\operatorname{polylog} n$ depth algorithm that achieves an asymptotically optimal expected stretch of $\alpha \in \operatorname{O}(\log n)$ requires $\operatorname{\Omega}(n^2)$ work and requires a metric as input. In this paper, we show how to achieve the same guarantees using $\operatorname{\tilde{O}}(m^{1+\epsilon})$ work, where $m$ is the number of edges of $G$ and $\epsilon > 0$ is an arbitrarily small constant. Moreover, one may reduce the work further to $\operatorname{\tilde{O}}(m + n^{1+\epsilon})$, at the expense of increasing the expected stretch $\alpha$ to $\operatorname{O}(\epsilon^{-1} \log n)$. Our main tool in deriving these parallel algorithms is an algebraic characterization of a generalization of the classic Moore-Bellman-Ford algorithm. We consider this framework, which subsumes a variety of previous "Moore-Bellman-Ford-flavored" algorithms, to be of independent interest. %K Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC
[127]
J. Gao and M. Goswami, “Medial Axis Based Routing Has Constant Load Balancing Factor,” in Algorithms -- ESA 2015, Patras, Greece, 2015.
Export
BibTeX
@inproceedings{GaoESA2015, TITLE = {Medial Axis Based Routing Has Constant Load Balancing Factor}, AUTHOR = {Gao, Jii and Goswami, Mayank}, LANGUAGE = {eng}, ISBN = {978-3-662-48349-7}, DOI = {10.1007/978-3-662-48350-3_47}, PUBLISHER = {Springer}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Algorithms -- ESA 2015}, EDITOR = {Bansal, Nikhil and Finocchi, Irene}, PAGES = {557--569}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9294}, ADDRESS = {Patras, Greece}, }
Endnote
%0 Conference Proceedings %A Gao, Jii %A Goswami, Mayank %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Medial Axis Based Routing Has Constant Load Balancing Factor : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-6689-A %R 10.1007/978-3-662-48350-3_47 %D 2015 %B 23rd Annual European Symposium on Algorithms %Z date of event: 2015-09-14 - 2015-09-16 %C Patras, Greece %B Algorithms -- ESA 2015 %E Bansal, Nikhil; Finocchi, Irene %P 557 - 569 %I Springer %@ 978-3-662-48349-7 %B Lecture Notes in Computer Science %N 9294
[128]
P. Gao and N. Wormald, “Orientability Thresholds for Random Hypergraph,” Combinatorics, Probability and Computing, vol. 24, no. 5, 2015.
Export
BibTeX
@article{GaoWormald2015, TITLE = {Orientability Thresholds for Random Hypergraph}, AUTHOR = {Gao, Pu and Wormald, Nicholas}, LANGUAGE = {eng}, ISSN = {0963-5483}, DOI = {10.1017/S096354831400073X}, PUBLISHER = {Cambridge University Press}, ADDRESS = {Cambridge, England}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Combinatorics, Probability and Computing}, VOLUME = {24}, NUMBER = {5}, PAGES = {774--824}, }
Endnote
%0 Journal Article %A Gao, Pu %A Wormald, Nicholas %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Orientability Thresholds for Random Hypergraph : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-4CC4-1 %R 10.1017/S096354831400073X %7 2015 %D 2015 %J Combinatorics, Probability and Computing %V 24 %N 5 %& 774 %P 774 - 824 %I Cambridge University Press %C Cambridge, England %@ false
[129]
I. García-Marco, P. Koiran, and S. Tavenas, “Log-Concavity and Lower Bounds for Arithmetic Circuits,” in Mathematical Foundations of Computer Science 2015 (MFCS 2015), Milan, Italy, 2015.
Export
BibTeX
@inproceedings{Garcia-MarcoMFCS2015, TITLE = {Log-Concavity and Lower Bounds for Arithmetic Circuits}, AUTHOR = {Garc{\'i}a-Marco, Ignacio and Koiran, Pascal and Tavenas, S{\'e}bastien}, LANGUAGE = {eng}, ISBN = {978-3-662-48053-3}, DOI = {10.1007/978-3-662-48054-0_30}, PUBLISHER = {Springer}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Mathematical Foundations of Computer Science 2015 (MFCS 2015)}, EDITOR = {Italiano, Guiseppe F. and Pighizzini, Giovanni and Sannella, Donald T.}, PAGES = {361--371}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9235}, ADDRESS = {Milan, Italy}, }
Endnote
%0 Conference Proceedings %A Garc&#237;a-Marco, Ignacio %A Koiran, Pascal %A Tavenas, S&#233;bastien %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Log-Concavity and Lower Bounds for Arithmetic Circuits : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-1166-3 %R 10.1007/978-3-662-48054-0_30 %D 2015 %B 40th International Symposium on Mathematical Foundations of Computer Science %Z date of event: 2015-08-24 - 2015-08-28 %C Milan, Italy %B Mathematical Foundations of Computer Science 2015 %E Italiano, Guiseppe F.; Pighizzini, Giovanni; Sannella, Donald T. %P 361 - 371 %I Springer %@ 978-3-662-48053-3 %B Lecture Notes in Computer Science %N 9235
[130]
J. Garg, R. Mehta, V. V. Varzirani, and S. Yazdanbod, “ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria,” in Automata, Languages, and Programming (ICALP 2015), Kyoto, Japan, 2015.
Export
BibTeX
@inproceedings{Garg_ICALP2015, TITLE = {{ETR}-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria}, AUTHOR = {Garg, Jugal and Mehta, Ruta and Varzirani, Vijay V. and Yazdanbod, Sadra}, LANGUAGE = {eng}, ISBN = {978-3-662-47671-0}, DOI = {10.1007/978-3-662-47672-7_45}, PUBLISHER = {Springer}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Automata, Languages, and Programming (ICALP 2015)}, EDITOR = {Halldorsson, Magnus and Iwama, Kazuo and Kobayashi, Naoki and Speckmann, Bettina}, PAGES = {554--566}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9134}, ADDRESS = {Kyoto, Japan}, }
Endnote
%0 Conference Proceedings %A Garg, Jugal %A Mehta, Ruta %A Varzirani, Vijay V. %A Yazdanbod, Sadra %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0029-228A-C %R 10.1007/978-3-662-47672-7_45 %D 2015 %B 42nd International Colloquium on Automata, Languages, and Programming %Z date of event: 2015-07-06 - 2015-07-10 %C Kyoto, Japan %B Automata, Languages, and Programming %E Halldorsson, Magnus; Iwama, Kazuo; Kobayashi, Naoki; Speckmann, Bettina %P 554 - 566 %I Springer %@ 978-3-662-47671-0 %B Lecture Notes in Computer Science %N 9134
[131]
S. Garg and G. Philip, “Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee,” 2015. [Online]. Available: http://arxiv.org/abs/1509.03990. (arXiv: 1509.03990)
Abstract
We investigate the following above-guarantee parameterization of the classical Vertex Cover problem: Given a graph $G$ and $k\in\mathbb{N}$ as input, does $G$ have a vertex cover of size at most $(2LP-MM)+k$? Here $MM$ is the size of a maximum matching of $G$, $LP$ is the value of an optimum solution to the relaxed (standard) LP for Vertex Cover on $G$, and $k$ is the parameter. Since $(2LP-MM)\geq{LP}\geq{MM}$, this is a stricter parameterization than those---namely, above-$MM$, and above-$LP$---which have been studied so far. We prove that Vertex Cover is fixed-parameter tractable for this stricter parameter $k$: We derive an algorithm which solves Vertex Cover in time $O^{*}(3^{k})$, pushing the envelope further on the parameterized tractability of Vertex Cover.
Export
BibTeX
@online{Garg_Philip2015, TITLE = {Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee}, AUTHOR = {Garg, Shivam and Philip, Geevarghese}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1509.03990}, EPRINT = {1509.03990}, EPRINTTYPE = {arXiv}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We investigate the following above-guarantee parameterization of the classical Vertex Cover problem: Given a graph $G$ and $k\in\mathbb{N}$ as input, does $G$ have a vertex cover of size at most $(2LP-MM)+k$? Here $MM$ is the size of a maximum matching of $G$, $LP$ is the value of an optimum solution to the relaxed (standard) LP for Vertex Cover on $G$, and $k$ is the parameter. Since $(2LP-MM)\geq{LP}\geq{MM}$, this is a stricter parameterization than those---namely, above-$MM$, and above-$LP$---which have been studied so far. We prove that Vertex Cover is fixed-parameter tractable for this stricter parameter $k$: We derive an algorithm which solves Vertex Cover in time $O^{*}(3^{k})$, pushing the envelope further on the parameterized tractability of Vertex Cover.}, }
Endnote
%0 Report %A Garg, Shivam %A Philip, Geevarghese %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-8200-9 %U http://arxiv.org/abs/1509.03990 %D 2015 %X We investigate the following above-guarantee parameterization of the classical Vertex Cover problem: Given a graph $G$ and $k\in\mathbb{N}$ as input, does $G$ have a vertex cover of size at most $(2LP-MM)+k$? Here $MM$ is the size of a maximum matching of $G$, $LP$ is the value of an optimum solution to the relaxed (standard) LP for Vertex Cover on $G$, and $k$ is the parameter. Since $(2LP-MM)\geq{LP}\geq{MM}$, this is a stricter parameterization than those---namely, above-$MM$, and above-$LP$---which have been studied so far. We prove that Vertex Cover is fixed-parameter tractable for this stricter parameter $k$: We derive an algorithm which solves Vertex Cover in time $O^{*}(3^{k})$, pushing the envelope further on the parameterized tractability of Vertex Cover. %K Computer Science, Data Structures and Algorithms, cs.DS
[132]
P. Gawrychowski and P. K. Nicholson, “Optimal Encodings for Range Min-Max and Top-k,” in Automata, Languages, and Programming (ICALP 2015), Kyoto, Japan, 2015.
Export
BibTeX
@inproceedings{Gawrychowski_ICALP2015, TITLE = {Optimal Encodings for Range Min-Max and Top-k}, AUTHOR = {Gawrychowski, Pawel and Nicholson, Patrick K.}, LANGUAGE = {eng}, ISBN = {978-3-662-47671-0}, DOI = {10.1007/978-3-662-47672-7_48}, PUBLISHER = {Springer}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Automata, Languages, and Programming (ICALP 2015)}, EDITOR = {Halldorsson, Magnus and Iwama, Kazuo and Kobayashi, Naoki and Speckmann, Bettina}, PAGES = {593--604}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9134}, ADDRESS = {Kyoto, Japan}, }
Endnote
%0 Conference Proceedings %A Gawrychowski, Pawel %A Nicholson, Patrick K. %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Optimal Encodings for Range Min-Max and Top-k : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-66C6-F %R 10.1007/978-3-662-47672-7_48 %D 2015 %B 42nd International Colloquium on Automata, Languages, and Programming %Z date of event: 2015-07-06 - 2015-07-10 %C Kyoto, Japan %B Automata, Languages, and Programming %E Halldorsson, Magnus; Iwama, Kazuo; Kobayashi, Naoki; Speckmann, Bettina %P 593 - 604 %I Springer %@ 978-3-662-47671-0 %B Lecture Notes in Computer Science %N 9134
[133]
M. Ghaffari, A. Karrenbauer, F. Kuhn, C. Lenzen, and B. Patt-Shamir, “Near-Optimal Distributed Maximum Flow,” 2015. [Online]. Available: http://arxiv.org/abs/1508.04747. (arXiv: 1508.04747)
Abstract
We present a near-optimal distributed algorithm for $(1+o(1))$-approximation of single-commodity maximum flow in undirected weighted networks that runs in $(D+ \sqrt{n})\cdot n^{o(1)}$ communication rounds in the \Congest model. Here, $n$ and $D$ denote the number of nodes and the network diameter, respectively. This is the first improvement over the trivial bound of $O(n^2)$, and it nearly matches the $\tilde{\Omega}(D+ \sqrt{n})$ round complexity lower bound. The development of the algorithm contains two results of independent interest: (i) A $(D+\sqrt{n})\cdot n^{o(1)}$-round distributed construction of a spanning tree of average stretch $n^{o(1)}$. (ii) A $(D+\sqrt{n})\cdot n^{o(1)}$-round distributed construction of an $n^{o(1)}$-congestion approximator consisting of the cuts induced by $O(\log n)$ virtual trees. The distributed representation of the cut approximator allows for evaluation in $(D+\sqrt{n})\cdot n^{o(1)}$ rounds. All our algorithms make use of randomization and succeed with high probability.
Export
BibTeX
@online{GhaffariArXiv2015, TITLE = {Near-Optimal Distributed Maximum Flow}, AUTHOR = {Ghaffari, Mohsen and Karrenbauer, Andreas and Kuhn, Fabian and Lenzen, Christoph and Patt-Shamir, Boaz}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1508.04747}, EPRINT = {1508.04747}, EPRINTTYPE = {arXiv}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We present a near-optimal distributed algorithm for $(1+o(1))$-approximation of single-commodity maximum flow in undirected weighted networks that runs in $(D+ \sqrt{n})\cdot n^{o(1)}$ communication rounds in the \Congest model. Here, $n$ and $D$ denote the number of nodes and the network diameter, respectively. This is the first improvement over the trivial bound of $O(n^2)$, and it nearly matches the $\tilde{\Omega}(D+ \sqrt{n})$ round complexity lower bound. The development of the algorithm contains two results of independent interest: (i) A $(D+\sqrt{n})\cdot n^{o(1)}$-round distributed construction of a spanning tree of average stretch $n^{o(1)}$. (ii) A $(D+\sqrt{n})\cdot n^{o(1)}$-round distributed construction of an $n^{o(1)}$-congestion approximator consisting of the cuts induced by $O(\log n)$ virtual trees. The distributed representation of the cut approximator allows for evaluation in $(D+\sqrt{n})\cdot n^{o(1)}$ rounds. All our algorithms make use of randomization and succeed with high probability.}, }
Endnote
%0 Report %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/11858/00-001M-0000-0028-8F60-D %U http://arxiv.org/abs/1508.04747 %D 2015 %X We present a near-optimal distributed algorithm for $(1+o(1))$-approximation of single-commodity maximum flow in undirected weighted networks that runs in $(D+ \sqrt{n})\cdot n^{o(1)}$ communication rounds in the \Congest model. Here, $n$ and $D$ denote the number of nodes and the network diameter, respectively. This is the first improvement over the trivial bound of $O(n^2)$, and it nearly matches the $\tilde{\Omega}(D+ \sqrt{n})$ round complexity lower bound. The development of the algorithm contains two results of independent interest: (i) A $(D+\sqrt{n})\cdot n^{o(1)}$-round distributed construction of a spanning tree of average stretch $n^{o(1)}$. (ii) A $(D+\sqrt{n})\cdot n^{o(1)}$-round distributed construction of an $n^{o(1)}$-congestion approximator consisting of the cuts induced by $O(\log n)$ virtual trees. The distributed representation of the cut approximator allows for evaluation in $(D+\sqrt{n})\cdot n^{o(1)}$ rounds. All our algorithms make use of randomization and succeed with high probability. %K Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC
[134]
M. Ghaffari, A. Karrenbauer, F. Kuhn, C. Lenzen, and B. Patt-Shamir, “Near-Optimal Distributed Maximum Flow: Extended Abstract,” in PODC’15, ACM Symposium on Principles of Distributed Computing, Donostia - San Sebastián, Spain, 2015.
Export
BibTeX
@inproceedings{GhaffariPODC2015, TITLE = {Near-Optimal Distributed Maximum Flow: Extended Abstract}, AUTHOR = {Ghaffari, Mohsen and Karrenbauer, Andreas and Kuhn, Fabian and Lenzen, Christoph and Patt-Shamir, Boaz}, LANGUAGE = {eng}, ISBN = {978-1-4503-3617-8}, DOI = {10.1145/2767386.2767440}, PUBLISHER = {ACM}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {PODC'15, ACM Symposium on Principles of Distributed Computing}, PAGES = {81--90}, ADDRESS = {Donostia -- San Sebasti{\'a}n, Spain}, }
Endnote
%0 Conference Proceedings %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: Extended Abstract : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-8F5D-A %R 10.1145/2767386.2767440 %D 2015 %B ACM Symposium on Principles of Distributed Computing %Z date of event: 2015-07-21 - 2015-07-23 %C Donostia - San Sebasti&#225;n, Spain %B PODC'15 %P 81 - 90 %I ACM %@ 978-1-4503-3617-8
[135]
O. Göbel, T. Kesselheim, and A. Tönnis, “Online Appointment Scheduling in the Random Order Model,” in Algorithms -- ESA 2015, Patras, Greece, 2015.
Export
BibTeX
@inproceedings{GoebelESA2015, TITLE = {Online Appointment Scheduling in the Random Order Model}, AUTHOR = {G{\"o}bel, Oliver and Kesselheim, Thomas and T{\"o}nnis, Andreas}, LANGUAGE = {eng}, ISBN = {978-3-662-48349-7}, DOI = {10.1007/978-3-662-48350-3_57}, PUBLISHER = {Springer}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Algorithms -- ESA 2015}, EDITOR = {Bansal, Nikhil and Finocchi, Irene}, PAGES = {680--692}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9294}, ADDRESS = {Patras, Greece}, }
Endnote
%0 Conference Proceedings %A G&#246;bel, Oliver %A Kesselheim, Thomas %A T&#246;nnis, Andreas %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Online Appointment Scheduling in the Random Order Model : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0029-4791-E %R 10.1007/978-3-662-48350-3_57 %D 2015 %B 23rd Annual European Symposium on Algorithms %Z date of event: 2015-09-14 - 2015-09-16 %C Patras, Greece %B Algorithms -- ESA 2015 %E Bansal, Nikhil; Finocchi, Irene %P 680 - 692 %I Springer %@ 978-3-662-48349-7 %B Lecture Notes in Computer Science %N 9294
[136]
P. A. Golovach, D. Paulusma, and E. J. van Leeuwen, “Induced Disjoint Paths in Claw-Free Graphs,” SIAM Journal on Discrete Mathematics, vol. 29, no. 1, 2015.
Export
BibTeX
@article{GPvL2014, TITLE = {Induced Disjoint Paths in Claw-Free Graphs}, AUTHOR = {Golovach, Petr A. and Paulusma, Dani{\"e}l and van Leeuwen, Erik Jan}, LANGUAGE = {eng}, ISSN = {0895-4801}, PUBLISHER = {SIAM}, ADDRESS = {Philadelphia, Pa.}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {SIAM Journal on Discrete Mathematics}, VOLUME = {29}, NUMBER = {1}, PAGES = {348--375}, }
Endnote
%0 Journal Article %A Golovach, Petr A. %A Paulusma, Dani&#235;l %A van Leeuwen, Erik Jan %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Induced Disjoint Paths in Claw-Free Graphs : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-4114-F %7 2015 %D 2015 %J SIAM Journal on Discrete Mathematics %V 29 %N 1 %& 348 %P 348 - 375 %I SIAM %C Philadelphia, Pa. %@ false
[137]
M. Goswami, A. Grønlund, K. G. Larsen, and R. Pagh, “Approximate Range Emptiness in Constant Time and Optimal Space,” in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), San Diego, CA, USA, 2015.
Abstract
This paper studies the \emph{$\varepsilon$-approximate range emptiness} problem, where the task is to represent a set $S$ of $n$ points from $\{0,\ldots,U-1\}$ and answer emptiness queries of the form "$[a ; b]\cap S \neq \emptyset$ ?" with a probability of \emph{false positives} allowed. This generalizes the functionality of \emph{Bloom filters} from single point queries to any interval length $L$. Setting the false positive rate to $\varepsilon/L$ and performing $L$ queries, Bloom filters yield a solution to this problem with space $O(n \lg(L/\varepsilon))$ bits, false positive probability bounded by $\varepsilon$ for intervals of length up to $L$, using query time $O(L \lg(L/\varepsilon))$. Our first contribution is to show that the space/error trade-off cannot be improved asymptotically: Any data structure for answering approximate range emptiness queries on intervals of length up to $L$ with false positive probability $\varepsilon$, must use space $\Omega(n \lg(L/\varepsilon)) - O(n)$ bits. On the positive side we show that the query time can be improved greatly, to constant time, while matching our space lower bound up to a lower order additive term. This result is achieved through a succinct data structure for (non-approximate 1d) range emptiness/reporting queries, which may be of independent interest.
Export
BibTeX
@inproceedings{GoswamiSODA2015, TITLE = {Approximate Range Emptiness in Constant Time and Optimal Space}, AUTHOR = {Goswami, Mayank and Gr{\o}nlund, Allan and Larsen, Kasper Green and Pagh, Rasmus}, LANGUAGE = {eng}, ISBN = {978-1-61197-374-7}, DOI = {10.1137/1.9781611973730.52}, PUBLISHER = {SIAM}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, ABSTRACT = {This paper studies the \emph{$\varepsilon$-approximate range emptiness} problem, where the task is to represent a set $S$ of $n$ points from $\{0,\ldots,U-1\}$ and answer emptiness queries of the form "$[a ; b]\cap S \neq \emptyset$ ?" with a probability of \emph{false positives} allowed. This generalizes the functionality of \emph{Bloom filters} from single point queries to any interval length $L$. Setting the false positive rate to $\varepsilon/L$ and performing $L$ queries, Bloom filters yield a solution to this problem with space $O(n \lg(L/\varepsilon))$ bits, false positive probability bounded by $\varepsilon$ for intervals of length up to $L$, using query time $O(L \lg(L/\varepsilon))$. Our first contribution is to show that the space/error trade-off cannot be improved asymptotically: Any data structure for answering approximate range emptiness queries on intervals of length up to $L$ with false positive probability $\varepsilon$, must use space $\Omega(n \lg(L/\varepsilon)) -- O(n)$ bits. On the positive side we show that the query time can be improved greatly, to constant time, while matching our space lower bound up to a lower order additive term. This result is achieved through a succinct data structure for (non-approximate 1d) range emptiness/reporting queries, which may be of independent interest.}, BOOKTITLE = {Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015)}, EDITOR = {Indyk, Piotr}, PAGES = {769--775}, ADDRESS = {San Diego, CA, USA}, }
Endnote
%0 Conference Proceedings %A Goswami, Mayank %A Gr&#248;nlund, Allan %A Larsen, Kasper Green %A Pagh, Rasmus %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Approximate Range Emptiness in Constant Time and Optimal Space : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-454F-2 %R 10.1137/1.9781611973730.52 %D 2015 %B Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2015-01-04 - 2015-01-06 %C San Diego, CA, USA %X This paper studies the \emph{$\varepsilon$-approximate range emptiness} problem, where the task is to represent a set $S$ of $n$ points from $\{0,\ldots,U-1\}$ and answer emptiness queries of the form "$[a ; b]\cap S \neq \emptyset$ ?" with a probability of \emph{false positives} allowed. This generalizes the functionality of \emph{Bloom filters} from single point queries to any interval length $L$. Setting the false positive rate to $\varepsilon/L$ and performing $L$ queries, Bloom filters yield a solution to this problem with space $O(n \lg(L/\varepsilon))$ bits, false positive probability bounded by $\varepsilon$ for intervals of length up to $L$, using query time $O(L \lg(L/\varepsilon))$. Our first contribution is to show that the space/error trade-off cannot be improved asymptotically: Any data structure for answering approximate range emptiness queries on intervals of length up to $L$ with false positive probability $\varepsilon$, must use space $\Omega(n \lg(L/\varepsilon)) - O(n)$ bits. On the positive side we show that the query time can be improved greatly, to constant time, while matching our space lower bound up to a lower order additive term. This result is achieved through a succinct data structure for (non-approximate 1d) range emptiness/reporting queries, which may be of independent interest. %K Computer Science, Data Structures and Algorithms, cs.DS %B Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms %E Indyk, Piotr %P 769 - 775 %I SIAM %@ 978-1-61197-374-7
[138]
Z. Guo and H. Sun, “Gossip vs. Markov Chains, and Randomness-efficient Rumor Spreading,” in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), San Diego, CA, USA, 2015.
Abstract
We study gossip algorithms for the rumor spreading problem which asks one node to deliver a rumor to all nodes in an unknown network. We present the first protocol for any expander graph $G$ with $n$ nodes such that, the protocol informs every node in $O(\log n)$ rounds with high probability, and uses $\tilde{O}(\log n)$ random bits in total. The runtime of our protocol is tight, and the randomness requirement of $\tilde{O}(\log n)$ random bits almost matches the lower bound of $\Omega(\log n)$ random bits for dense graphs. We further show that, for many graph families, polylogarithmic number of random bits in total suffice to spread the rumor in $O(\mathrm{poly}\log n)$ rounds. These results together give us an almost complete understanding of the randomness requirement of this fundamental gossip process. Our analysis relies on unexpectedly tight connections among gossip processes, Markov chains, and branching programs. First, we establish a connection between rumor spreading processes and Markov chains, which is used to approximate the rumor spreading time by the mixing time of Markov chains. Second, we show a reduction from rumor spreading processes to branching programs, and this reduction provides a general framework to derandomize gossip processes. In addition to designing rumor spreading protocols, these novel techniques may have applications in studying parallel and multiple random walks, and randomness complexity of distributed algorithms.
Export
BibTeX
@inproceedings{DBLP:conf/soda/GS15, TITLE = {Gossip vs. {M}arkov Chains, and Randomness-efficient Rumor Spreading}, AUTHOR = {Guo, Zeyu and Sun, He}, LANGUAGE = {eng}, ISBN = {978-1-61197-374-7}, DOI = {10.1137/1.9781611973730.29}, PUBLISHER = {SIAM}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, ABSTRACT = {We study gossip algorithms for the rumor spreading problem which asks one node to deliver a rumor to all nodes in an unknown network. We present the first protocol for any expander graph $G$ with $n$ nodes such that, the protocol informs every node in $O(\log n)$ rounds with high probability, and uses $\tilde{O}(\log n)$ random bits in total. The runtime of our protocol is tight, and the randomness requirement of $\tilde{O}(\log n)$ random bits almost matches the lower bound of $\Omega(\log n)$ random bits for dense graphs. We further show that, for many graph families, polylogarithmic number of random bits in total suffice to spread the rumor in $O(\mathrm{poly}\log n)$ rounds. These results together give us an almost complete understanding of the randomness requirement of this fundamental gossip process. Our analysis relies on unexpectedly tight connections among gossip processes, Markov chains, and branching programs. First, we establish a connection between rumor spreading processes and Markov chains, which is used to approximate the rumor spreading time by the mixing time of Markov chains. Second, we show a reduction from rumor spreading processes to branching programs, and this reduction provides a general framework to derandomize gossip processes. In addition to designing rumor spreading protocols, these novel techniques may have applications in studying parallel and multiple random walks, and randomness complexity of distributed algorithms.}, BOOKTITLE = {Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015)}, EDITOR = {Indyk, Piotr}, PAGES = {411--430}, ADDRESS = {San Diego, CA, USA}, }
Endnote
%0 Conference Proceedings %A Guo, Zeyu %A Sun, He %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Gossip vs. Markov Chains, and Randomness-efficient Rumor Spreading : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-A256-C %R 10.1137/1.9781611973730.29 %D 2015 %B Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2015-01-04 - 2015-01-06 %C San Diego, CA, USA %X We study gossip algorithms for the rumor spreading problem which asks one node to deliver a rumor to all nodes in an unknown network. We present the first protocol for any expander graph $G$ with $n$ nodes such that, the protocol informs every node in $O(\log n)$ rounds with high probability, and uses $\tilde{O}(\log n)$ random bits in total. The runtime of our protocol is tight, and the randomness requirement of $\tilde{O}(\log n)$ random bits almost matches the lower bound of $\Omega(\log n)$ random bits for dense graphs. We further show that, for many graph families, polylogarithmic number of random bits in total suffice to spread the rumor in $O(\mathrm{poly}\log n)$ rounds. These results together give us an almost complete understanding of the randomness requirement of this fundamental gossip process. Our analysis relies on unexpectedly tight connections among gossip processes, Markov chains, and branching programs. First, we establish a connection between rumor spreading processes and Markov chains, which is used to approximate the rumor spreading time by the mixing time of Markov chains. Second, we show a reduction from rumor spreading processes to branching programs, and this reduction provides a general framework to derandomize gossip processes. In addition to designing rumor spreading protocols, these novel techniques may have applications in studying parallel and multiple random walks, and randomness complexity of distributed algorithms. %K Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC,Computer Science, Computational Complexity, cs.CC,Computer Science, Data Structures and Algorithms, cs.DS,Mathematics, Probability, math.PR %B Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms %E Indyk, Piotr %P 411 - 430 %I SIAM %@ 978-1-61197-374-7
[139]
D. Halperin, M. Kerber, and D. Shaharabani, “The Offset Filtration of Convex Objects,” in Algorithms -- ESA 2015, Patras, Greece, 2015.
Export
BibTeX
@inproceedings{HalperinESA2015, TITLE = {The Offset Filtration of Convex Objects}, AUTHOR = {Halperin, Dan and Kerber, Michael and Shaharabani, Doron}, LANGUAGE = {eng}, ISBN = {978-3-662-48349-7}, DOI = {10.1007/978-3-662-48350-3_59}, PUBLISHER = {Springer}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Algorithms -- ESA 2015}, EDITOR = {Bansal, Nikhil and Finocchi, Irene}, PAGES = {705--716}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9294}, ADDRESS = {Patras, Greece}, }
Endnote
%0 Conference Proceedings %A Halperin, Dan %A Kerber, Michael %A Shaharabani, Doron %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T The Offset Filtration of Convex Objects : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0029-4753-9 %R 10.1007/978-3-662-48350-3_59 %D 2015 %B 23rd Annual European Symposium on Algorithms %Z date of event: 2015-09-14 - 2015-09-16 %C Patras, Greece %B Algorithms -- ESA 2015 %E Bansal, Nikhil; Finocchi, Irene %P 705 - 716 %I Springer %@ 978-3-662-48349-7 %B Lecture Notes in Computer Science %N 9294
[140]
R. Harren and W. Kern, “Improved Lower Bound for Online Strip Packing,” Theory of Computing Systems, vol. 56, no. 1, 2015.
Abstract
We study the online strip packing problem and derive an improved lower bound of rho a parts per thousand yen2.589aEuro broken vertical bar for the competitive ratio of this problem. The construction is based on modified "Brown-Baker-Katseff sequences" (Brown et al. in Acta Inform. 18:207-225, 1982) using only two types of rectangles. In addition, we present an online algorithm with competitive ratio for packing instances of this type.
Export
BibTeX
@article{HarrenTCS2015, TITLE = {Improved Lower Bound for Online Strip Packing}, AUTHOR = {Harren, Rolf and Kern, Walter}, LANGUAGE = {eng}, ISSN = {1432-4350}, DOI = {10.1007/s00224-013-9494-8}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, ABSTRACT = {We study the online strip packing problem and derive an improved lower bound of rho a parts per thousand yen2.589aEuro broken vertical bar for the competitive ratio of this problem. The construction is based on modified "Brown-Baker-Katseff sequences" (Brown et al. in Acta Inform. 18:207-225, 1982) using only two types of rectangles. In addition, we present an online algorithm with competitive ratio for packing instances of this type.}, JOURNAL = {Theory of Computing Systems}, VOLUME = {56}, NUMBER = {1}, PAGES = {41--72}, }
Endnote
%0 Journal Article %A Harren, Rolf %A Kern, Walter %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Improved Lower Bound for Online Strip Packing : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-E518-4 %F OTHER: WOS:000348448100004 %R 10.1007/s00224-013-9494-8 %7 2015 %D 2015 %X We study the online strip packing problem and derive an improved lower bound of rho a parts per thousand yen2.589aEuro broken vertical bar for the competitive ratio of this problem. The construction is based on modified "Brown-Baker-Katseff sequences" (Brown et al. in Acta Inform. 18:207-225, 1982) using only two types of rectangles. In addition, we present an online algorithm with competitive ratio for packing instances of this type. %K Strip packing Rectangle packing Online algorithms Lower bounds PARALLEL JOBS ALGORITHMS Computer Science, Theory & Methods Mathematics %J Theory of Computing Systems %V 56 %N 1 %& 41 %P 41 - 72 %I Springer %C New York, NY %@ false
[141]
P. Heggernes, P. van ’t Hof, E. J. van Leeuwen, and R. Saei, “Finding Disjoint Paths in Split Graphs,” Theory of Computing Systems, vol. 57, no. 1, 2015.
Export
BibTeX
@article{HHvLS2014, TITLE = {Finding Disjoint Paths in Split Graphs}, AUTHOR = {Heggernes, Pinar and van 't Hof, Pim and van Leeuwen, Erik Jan and Saei, Reza}, LANGUAGE = {eng}, ISSN = {1432-4350}, DOI = {10.1007/s00224-014-9580-6}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Theory of Computing Systems}, VOLUME = {57}, NUMBER = {1}, PAGES = {140--159}, }
Endnote
%0 Journal Article %A Heggernes, Pinar %A van 't Hof, Pim %A van Leeuwen, Erik Jan %A Saei, Reza %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Finding Disjoint Paths in Split Graphs : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-407E-9 %R 10.1007/s00224-014-9580-6 %7 2014-09-28 %D 2015 %J Theory of Computing Systems %V 57 %N 1 %& 140 %P 140 - 159 %I Springer %C New York, NY %@ false
[142]
D. Hermelin, S. Kratsch, K. Soltys, M. Wahlström, and X. Wu, “A Completeness Theory for Polynomial (Turing) Kernelization,” Algorithmica, vol. 71, no. 3, 2015.
Export
BibTeX
@article{HermlinAlgorithmica2015, TITLE = {A Completeness Theory for Polynomial ({Turing}) Kernelization}, AUTHOR = {Hermelin, Danny and Kratsch, Stefan and Soltys, Karolina and Wahlstr{\"o}m, Magnus and Wu, Xi}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-014-9910-8}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Algorithmica}, VOLUME = {71}, NUMBER = {3}, PAGES = {702--730}, }
Endnote
%0 Journal Article %A Hermelin, Danny %A Kratsch, Stefan %A Soltys, Karolina %A Wahlstr&#246;m, Magnus %A Wu, Xi %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T A Completeness Theory for Polynomial (Turing) Kernelization : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0026-A0CF-F %R 10.1007/s00453-014-9910-8 %7 2015 %D 2015 %J Algorithmica %V 71 %N 3 %& 702 %P 702 - 730 %I Springer %C New York, NY %@ false
[143]
S. Heydrich and R. van Stee, “Dividing Connected Chores Fairly,” Theoretical Computer Science, vol. 593, 2015.
Export
BibTeX
@article{Heydrich2015, TITLE = {Dividing Connected Chores Fairly}, AUTHOR = {Heydrich, Sandy and van Stee, Rob}, LANGUAGE = {eng}, ISSN = {0304-3975}, DOI = {10.1016/j.tcs.2015.05.041}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Theoretical Computer Science}, VOLUME = {593}, PAGES = {51--61}, }
Endnote
%0 Journal Article %A Heydrich, Sandy %A van Stee, Rob %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Dividing Connected Chores Fairly : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-501E-D %R 10.1016/j.tcs.2015.05.041 %7 2015 %D 2015 %J Theoretical Computer Science %V 593 %& 51 %P 51 - 61 %I Elsevier %C Amsterdam %@ false
[144]
M. Hoefer, D. Vaz, and L. Wagner, “Hedonic Coalition Formation in Networks,” in Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence and the Twenty-Seventh Innovative Applications of Artificial Intelligence Conference, Austin, TX, USA, 2015.
Export
BibTeX
@inproceedings{DBLP:conf/aaai/HoeferVW15, TITLE = {Hedonic Coalition Formation in Networks}, AUTHOR = {Hoefer, Martin and Vaz, Daniel and Wagner, Lisa}, LANGUAGE = {eng}, ISBN = {978-1-57735-698-1}, PUBLISHER = {AAAI Press}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence and the Twenty-Seventh Innovative Applications of Artificial Intelligence Conference}, PAGES = {929--935}, ADDRESS = {Austin, TX, USA}, }
Endnote
%0 Conference Proceedings %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 Hedonic Coalition Formation in Networks : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-411C-0 %D 2015 %B Twenty-Ninth AAAI Conference on Artificial Intelligence %Z date of event: 2015-01-25 - 2015-01-30 %C Austin, TX, USA %B Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence and the Twenty-Seventh Innovative Applications of Artificial Intelligence Conference %P 929 - 935 %I AAAI Press %@ 978-1-57735-698-1 %U http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9617
[145]
M. Hoefer and A. Kesselmann, “Secondary Spectrum Auctions for Symmetric and Submodular Bidders,” ACM Transactions on Economics and Computation, vol. 3, no. 2, 2015.
Export
BibTeX
@article{DBLP:journals/teco/HoeferK15, TITLE = {Secondary Spectrum Auctions for Symmetric and Submodular Bidders}, AUTHOR = {Hoefer, Martin and Kesselmann, Alexander}, LANGUAGE = {eng}, ISSN = {2167-8375}, DOI = {10.1145/2739041}, PUBLISHER = {ACM}, ADDRESS = {New York, NY}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {ACM Transactions on Economics and Computation}, VOLUME = {3}, NUMBER = {2}, PAGES = {1--25}, EID = {9}, BOOKTITLE = {Special Issue on EC'12 Part 2}, }
Endnote
%0 Journal Article %A Hoefer, Martin %A Kesselmann, Alexander %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Secondary Spectrum Auctions for Symmetric and Submodular Bidders : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0029-56B1-B %R 10.1145/2739041 %7 2015 %D 2015 %J ACM Transactions on Economics and Computation %V 3 %N 2 %& 1 %P 1 - 25 %Z sequence number: 9 %I ACM %C New York, NY %@ false %B Special Issue on EC'12 Part 2 %O 13th ACM Conference on Electronic Commerce
[146]
A. Jeż, “Faster Fully Compressed Pattern Matching by Recompression,” ACM Transactions on Algorithms, vol. 11, no. 3, 2015.
Abstract
In this article, a fully compressed pattern matching problem is studied. The compression is represented by straight-line programs (SLPs)-that is, context-free grammars generating exactly one string; the term fully means that both the pattern and the text are given in the compressed form. The problem is approached using a recently developed technique of local recompression: the SLPs are refactored so that substrings of the pattern and text are encoded in both SLPs in the same way. To this end, the SLPs are locally decompressed and then recompressed in a uniform way. This technique yields an O((n + m) log M) algorithm for compressed pattern matching, assuming that M fits in O(1) machine words, where n (m) is the size of the compressed representation of the text (pattern, respectively), and M is the size of the decompressed pattern. If only m + n fits in O(1) machine words, the running time increases to O((n + m) log M log(n + m)). The previous best algorithm due to Lifshits has O(n(2)m) running time.
Export
BibTeX
@article{Jez2015TALG, TITLE = {Faster Fully Compressed Pattern Matching by Recompression}, AUTHOR = {Je{\.z}, Artur}, LANGUAGE = {eng}, ISSN = {1549-6325}, DOI = {10.1145/2631920}, PUBLISHER = {ACM}, ADDRESS = {New York, NY}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, ABSTRACT = {In this article, a fully compressed pattern matching problem is studied. The compression is represented by straight-line programs (SLPs)-that is, context-free grammars generating exactly one string; the term fully means that both the pattern and the text are given in the compressed form. The problem is approached using a recently developed technique of local recompression: the SLPs are refactored so that substrings of the pattern and text are encoded in both SLPs in the same way. To this end, the SLPs are locally decompressed and then recompressed in a uniform way. This technique yields an O((n + m) log M) algorithm for compressed pattern matching, assuming that M fits in O(1) machine words, where n (m) is the size of the compressed representation of the text (pattern, respectively), and M is the size of the decompressed pattern. If only m + n fits in O(1) machine words, the running time increases to O((n + m) log M log(n + m)). The previous best algorithm due to Lifshits has O(n(2)m) running time.}, JOURNAL = {ACM Transactions on Algorithms}, VOLUME = {11}, NUMBER = {3}, PAGES = {1--43}, EID = {20}, }
Endnote
%0 Journal Article %A Je&#380;, Artur %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Faster Fully Compressed Pattern Matching by Recompression : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-CD10-E %F OTHER: WOS:000348204800005 %R 10.1145/2631920 %7 2015 %D 2015 %X In this article, a fully compressed pattern matching problem is studied. The compression is represented by straight-line programs (SLPs)-that is, context-free grammars generating exactly one string; the term fully means that both the pattern and the text are given in the compressed form. The problem is approached using a recently developed technique of local recompression: the SLPs are refactored so that substrings of the pattern and text are encoded in both SLPs in the same way. To this end, the SLPs are locally decompressed and then recompressed in a uniform way. This technique yields an O((n + m) log M) algorithm for compressed pattern matching, assuming that M fits in O(1) machine words, where n (m) is the size of the compressed representation of the text (pattern, respectively), and M is the size of the decompressed pattern. If only m + n fits in O(1) machine words, the running time increases to O((n + m) log M log(n + m)). The previous best algorithm due to Lifshits has O(n(2)m) running time. %K Pattern matching compressed pattern matching algorithms for compressed data straight-line programs Lempel-Ziv compression GRAMMAR-BASED COMPRESSION APPROXIMATION ALGORITHM SEQUENCES STRINGS TIME Computer Science, Theory & Methods Mathematics, Applied %J ACM Transactions on Algorithms %V 11 %N 3 %& 1 %P 1 - 43 %Z sequence number: 20 %I ACM %C New York, NY %@ false
[147]
G. Jindal and P. Kolev, “An Efficient Parallel Algorithm for Spectral Sparsification of Laplacian and SDDM Matrix Polynomials,” 2015. [Online]. Available: http://arxiv.org/abs/1507.07497. (arXiv: 1507.07497)
Abstract
For "large" class $\mathcal{C}$ of continuous probability density functions (p.d.f.), we demonstrate that for every $w\in\mathcal{C}$ there is mixture of discrete Binomial distributions (MDBD) with $T\geq N\sqrt{\phi_{w}/\delta}$ distinct Binomial distributions $B(\cdot,N)$ that $\delta$-approximates a \emph{discretized} p.d.f. $\hat{w}(i/N)\triangleq w(i/N)/[\sum_{\ell=0}^{N}w(\ell/N)]$ for all $i\in[3:N-3]$, where $\phi_{w}\geq\max_{x\in[0,1]}|w(x)|$. Also, we give two efficient parallel algorithms to find such MDBD. Moreover, we propose a sequential algorithm that on input MDBD with $N=2^k$ for $k\in\mathbb{N}_{+}$ that induces a discretized p.d.f. $\beta$, $B=D-M$ that is either Laplacian or SDDM matrix and parameter $\epsilon\in(0,1)$, outputs in $\hat{O}(\epsilon^{-2}m + \epsilon^{-4}nT)$ time a spectral sparsifier $D-\hat{M}_{N} \approx_{\epsilon} D-D\sum_{i=0}^{N}\beta_{i}(D^{-1} M)^i$ of a matrix-polynomial, where $\hat{O}(\cdot)$ notation hides $\mathrm{poly}(\log n,\log N)$ factors. This improves the Cheng et al.'s\cite{CCLPT15} algorithm whose run time is $\hat{O}(\epsilon^{-2} m N^2 + NT)$. Furthermore, our algorithm is parallelizable and runs in work $\hat{O}(\epsilon^{-2}m + \epsilon^{-4}nT)$ and depth $O(\log N\cdot\mathrm{poly}(\log n)+\log T)$. Our main algorithmic contribution is to propose the first efficient parallel algorithm that on input continuous p.d.f. $w\in\mathcal{C}$, matrix $B=D-M$ as above, outputs a spectral sparsifier of matrix-polynomial whose coefficients approximate component-wise the discretized p.d.f. $\hat{w}$. Our results yield the first efficient and parallel algorithm that runs in nearly linear work and poly-logarithmic depth and analyzes the long term behaviour of Markov chains in non-trivial settings. In addition, we strengthen the Spielman and Peng's\cite{PS14} parallel SDD solver.
Export
BibTeX
@online{Jindal_arXiv2015, TITLE = {An Efficient Parallel Algorithm for Spectral Sparsification of {Laplacian} and {SDDM} Matrix Polynomials}, AUTHOR = {Jindal, Gorav and Kolev, Pavel}, URL = {http://arxiv.org/abs/1507.07497}, EPRINT = {1507.07497}, EPRINTTYPE = {arXiv}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, ABSTRACT = {For "large" class $\mathcal{C}$ of continuous probability density functions (p.d.f.), we demonstrate that for every $w\in\mathcal{C}$ there is mixture of discrete Binomial distributions (MDBD) with $T\geq N\sqrt{\phi_{w}/\delta}$ distinct Binomial distributions $B(\cdot,N)$ that $\delta$-approximates a \emph{discretized} p.d.f. $\hat{w}(i/N)\triangleq w(i/N)/[\sum_{\ell=0}^{N}w(\ell/N)]$ for all $i\in[3:N-3]$, where $\phi_{w}\geq\max_{x\in[0,1]}|w(x)|$. Also, we give two efficient parallel algorithms to find such MDBD. Moreover, we propose a sequential algorithm that on input MDBD with $N=2^k$ for $k\in\mathbb{N}_{+}$ that induces a discretized p.d.f. $\beta$, $B=D-M$ that is either Laplacian or SDDM matrix and parameter $\epsilon\in(0,1)$, outputs in $\hat{O}(\epsilon^{-2}m + \epsilon^{-4}nT)$ time a spectral sparsifier $D-\hat{M}_{N} \approx_{\epsilon} D-D\sum_{i=0}^{N}\beta_{i}(D^{-1} M)^i$ of a matrix-polynomial, where $\hat{O}(\cdot)$ notation hides $\mathrm{poly}(\log n,\log N)$ factors. This improves the Cheng et al.'s\cite{CCLPT15} algorithm whose run time is $\hat{O}(\epsilon^{-2} m N^2 + NT)$. Furthermore, our algorithm is parallelizable and runs in work $\hat{O}(\epsilon^{-2}m + \epsilon^{-4}nT)$ and depth $O(\log N\cdot\mathrm{poly}(\log n)+\log T)$. Our main algorithmic contribution is to propose the first efficient parallel algorithm that on input continuous p.d.f. $w\in\mathcal{C}$, matrix $B=D-M$ as above, outputs a spectral sparsifier of matrix-polynomial whose coefficients approximate component-wise the discretized p.d.f. $\hat{w}$. Our results yield the first efficient and parallel algorithm that runs in nearly linear work and poly-logarithmic depth and analyzes the long term behaviour of Markov chains in non-trivial settings. In addition, we strengthen the Spielman and Peng's\cite{PS14} parallel SDD solver.}, }
Endnote
%0 Report %A Jindal, Gorav %A Kolev, Pavel %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T An Efficient Parallel Algorithm for Spectral Sparsification of Laplacian and SDDM Matrix Polynomials : %U http://hdl.handle.net/11858/00-001M-0000-002A-08D2-7 %U http://arxiv.org/abs/1507.07497 %D 2015 %X For "large" class $\mathcal{C}$ of continuous probability density functions (p.d.f.), we demonstrate that for every $w\in\mathcal{C}$ there is mixture of discrete Binomial distributions (MDBD) with $T\geq N\sqrt{\phi_{w}/\delta}$ distinct Binomial distributions $B(\cdot,N)$ that $\delta$-approximates a \emph{discretized} p.d.f. $\hat{w}(i/N)\triangleq w(i/N)/[\sum_{\ell=0}^{N}w(\ell/N)]$ for all $i\in[3:N-3]$, where $\phi_{w}\geq\max_{x\in[0,1]}|w(x)|$. Also, we give two efficient parallel algorithms to find such MDBD. Moreover, we propose a sequential algorithm that on input MDBD with $N=2^k$ for $k\in\mathbb{N}_{+}$ that induces a discretized p.d.f. $\beta$, $B=D-M$ that is either Laplacian or SDDM matrix and parameter $\epsilon\in(0,1)$, outputs in $\hat{O}(\epsilon^{-2}m + \epsilon^{-4}nT)$ time a spectral sparsifier $D-\hat{M}_{N} \approx_{\epsilon} D-D\sum_{i=0}^{N}\beta_{i}(D^{-1} M)^i$ of a matrix-polynomial, where $\hat{O}(\cdot)$ notation hides $\mathrm{poly}(\log n,\log N)$ factors. This improves the Cheng et al.'s\cite{CCLPT15} algorithm whose run time is $\hat{O}(\epsilon^{-2} m N^2 + NT)$. Furthermore, our algorithm is parallelizable and runs in work $\hat{O}(\epsilon^{-2}m + \epsilon^{-4}nT)$ and depth $O(\log N\cdot\mathrm{poly}(\log n)+\log T)$. Our main algorithmic contribution is to propose the first efficient parallel algorithm that on input continuous p.d.f. $w\in\mathcal{C}$, matrix $B=D-M$ as above, outputs a spectral sparsifier of matrix-polynomial whose coefficients approximate component-wise the discretized p.d.f. $\hat{w}$. Our results yield the first efficient and parallel algorithm that runs in nearly linear work and poly-logarithmic depth and analyzes the long term behaviour of Markov chains in non-trivial settings. In addition, we strengthen the Spielman and Peng's\cite{PS14} parallel SDD solver. %K Computer Science, Discrete Mathematics, cs.DM,Computer Science, Data Structures and Algorithms, cs.DS
[148]
M. Johnson, D. Paulusma, and E. J. van Leeuwen, “Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs,” Social Networks, vol. 41, 2015.
Export
BibTeX
@article{JohnsonPaulusmavL2015, TITLE = {Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs}, AUTHOR = {Johnson, Matthew and Paulusma, Daniel and van Leeuwen, Erik Jan}, LANGUAGE = {eng}, ISSN = {0378-8733}, DOI = {10.1016/j.socnet.2015.01.001}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Social Networks}, VOLUME = {41}, PAGES = {48--55}, }
Endnote
%0 Journal Article %A Johnson, Matthew %A Paulusma, Daniel %A van Leeuwen, Erik Jan %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-AFB8-C %R 10.1016/j.socnet.2015.01.001 %7 2015 %D 2015 %J Social Networks %V 41 %& 48 %P 48 - 55 %I Elsevier %C Amsterdam %@ false
[149]
M. Kerber and M. Sagraloff, “Root Refinement for Real Polynomials using Quadratic Interval Refinement,” Journal of Computational and Applied Mathematics, vol. 280, 2015.
Export
BibTeX
@article{KerberSagraloffJCAM2015, TITLE = {Root Refinement for Real Polynomials using Quadratic Interval Refinement}, AUTHOR = {Kerber, Michael and Sagraloff, Michael}, LANGUAGE = {eng}, ISSN = {0377-0427}, DOI = {10.1016/j.cam.2014.11.031}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Journal of Computational and Applied Mathematics}, VOLUME = {280}, PAGES = {377--395}, }
Endnote
%0 Journal Article %A Kerber, Michael %A Sagraloff, Michael %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Root Refinement for Real Polynomials using Quadratic Interval Refinement : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-4471-9 %R 10.1016/j.cam.2014.11.031 %7 2014 %D 2015 %J Journal of Computational and Applied Mathematics %V 280 %& 377 %P 377 - 395 %I Elsevier %C Amsterdam %@ false
[150]
T. Kesselheim, R. Kleinberg, and R. Niazadeh, “Secretary Problems with Non-Uniform Arrival Order,” in STOC’15, Forty-Seventh Annual ACM Symposium on Theory ofComputing, Portland, OR, USA, 2015.
Export
BibTeX
@inproceedings{DBLP:conf/stoc/KesselheimKN15, TITLE = {Secretary Problems with Non-Uniform Arrival Order}, AUTHOR = {Kesselheim, Thomas and Kleinberg, Robert and Niazadeh, Rad}, LANGUAGE = {eng}, ISBN = {978-1-4503-3536-2}, DOI = {10.1145/2746539.2746602}, PUBLISHER = {ACM}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {STOC'15, Forty-Seventh Annual ACM Symposium on Theory ofComputing}, PAGES = {879--888}, ADDRESS = {Portland, OR, USA}, }
Endnote
%0 Conference Proceedings %A Kesselheim, Thomas %A Kleinberg, Robert %A Niazadeh, Rad %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Secretary Problems with Non-Uniform Arrival Order : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0029-56F6-2 %R 10.1145/2746539.2746602 %D 2015 %B Forty-Seventh Annual ACM Symposium on Theory ofComputing %Z date of event: 2015-06-15 - 2015-06-17 %C Portland, OR, USA %B STOC'15 %P 879 - 888 %I ACM %@ 978-1-4503-3536-2
[151]
T. Kesselheim, R. Kleinberg, and É. Tardos, “Smooth Online Mechanisms: A Game-theoretic Problem in Renewable Energy Markets,” in EC’15, ACM Conference on Economics and Computation, Portland, OR, USA, 2015.
Export
BibTeX
@inproceedings{DBLP:conf/sigecom/KesselheimKT15, TITLE = {Smooth Online Mechanisms: {A} Game-theoretic Problem in Renewable Energy Markets}, AUTHOR = {Kesselheim, Thomas and Kleinberg, Robert and Tardos, {\'E}va}, LANGUAGE = {eng}, ISBN = {978-1-4503-3410-5}, DOI = {10.1145/2764468.2764487}, PUBLISHER = {ACM}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {EC{\textquoteright}15, ACM Conference on Economics and Computation}, PAGES = {203--220}, ADDRESS = {Portland, OR, USA}, }
Endnote
%0 Conference Proceedings %A Kesselheim, Thomas %A Kleinberg, Robert %A Tardos, &#201;va %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Smooth Online Mechanisms: A Game-theoretic Problem in Renewable Energy Markets : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0029-56E8-2 %R 10.1145/2764468.2764487 %D 2015 %B ACM Conference on Economics and Computation %Z date of event: 2015-06-15 - 2015-06-19 %C Portland, OR, USA %B EC&#8217;15 %P 203 - 220 %I ACM %@ 978-1-4503-3410-5
[152]
E. J. Kim, C. Paul, and G. Philip, “A Single-exponential FPT Algorithm for the K4-MINOR COVER Problem,” Journal of Computer and System Sciences, vol. 81, no. 1, 2015.
Export
BibTeX
@article{KimPaulPhilip2015, TITLE = {A Single-exponential {FPT} Algorithm for the {K}4-Minor Cover Problem}, AUTHOR = {Kim, Eun Jung and Paul, Christophe and Philip, Geevarghese}, LANGUAGE = {eng}, ISSN = {0022-0000}, DOI = {10.1016/j.jcss.2014.05.001}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Journal of Computer and System Sciences}, VOLUME = {81}, NUMBER = {1}, PAGES = {186--207}, }
Endnote
%0 Journal Article %A Kim, Eun Jung %A Paul, Christophe %A Philip, Geevarghese %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Single-exponential FPT Algorithm for the K4-MINOR COVER Problem : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-44BF-E %R 10.1016/j.jcss.2014.05.001 %7 2014-05-14 %D 2015 %J Journal of Computer and System Sciences %V 81 %N 1 %& 186 %P 186 - 207 %I Elsevier %C Amsterdam %@ false %U http://dx.doi.org/10.1016/j.jcss.2014.05.001
[153]
A. Kobel and M. Sagraloff, “On the Complexity of Computing with Planar Algebraic Curves,” Journal of Complexity, vol. 31, no. 2, 2015.
Export
BibTeX
@article{Kobel2014JOC, TITLE = {On the Complexity of Computing with Planar Algebraic Curves}, AUTHOR = {Kobel, Alexander and Sagraloff, Michael}, LANGUAGE = {eng}, ISSN = {0885-064X}, DOI = {10.1016/j.jco.2014.08.002}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Journal of Complexity}, VOLUME = {31}, NUMBER = {2}, PAGES = {206--236}, }
Endnote
%0 Journal Article %A Kobel, Alexander %A Sagraloff, Michael %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T On the Complexity of Computing with Planar Algebraic Curves : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-43CB-9 %R 10.1016/j.jco.2014.08.002 %7 2014-08-12 %D 2015 %K Bivariate systems %J Journal of Complexity %V 31 %N 2 %& 206 %P 206 - 236 %I Elsevier %C Amsterdam %@ false %U http://arxiv.org/abs/1401.5690
[154]
P. Kolev and K. Mehlhorn, “A Note On Spectral Clustering,” 2015. [Online]. Available: http://arxiv.org/abs/1509.09188. (arXiv: 1509.09188)
Abstract
Let $G=(V,E)$ be an undirected graph, $\lambda_k$ the $k$th smallest eigenvalue of the normalized Laplacian matrix of $G$, and $\rho(k)$ the smallest value of the maximal conductance over all $k$-way partitions $S_1,\dots,S_k$ of $V$. Peng et al. [PSZ15] gave the first rigorous analysis of $k$-clustering algorithms that use spectral embedding and $k$-means clustering algorithms to partition the vertices of a graph $G$ into $k$ disjoint subsets. Their analysis builds upon a gap parameter $\Upsilon=\rho(k)/\lambda_{k+1}$ that was introduced by Oveis Gharan and Trevisan [GT14]. In their analysis Peng et al. [PSZ15] assume a gap assumption $\Upsilon\geq\Omega(\mathrm{APR}\cdot k^3)$, where $\mathrm{APR}>1$ is the approximation ratio of a $k$-means clustering algorithm. We exhibit an error in one of their Lemmas and provide a correction. With the correction the proof by Peng et al. [PSZ15] requires a stronger gap assumption $\Upsilon\geq\Omega(\mathrm{APR}\cdot k^4)$. Our main contribution is to improve the analysis in [PSZ15] by an $O(k)$ factor. We demonstrate that a gap assumption $\Psi\geq \Omega(\mathrm{APR}\cdot k^3)$ suffices, where $\Psi=\rho_{avr}(k)/\lambda_{k+1}$ and $\rho_{avr}(k)$ is the value of the average conductance of a partition $S_1,\dots,S_k$ of $V$ that yields $\rho(k)$.
Export
BibTeX
@online{KolevArXiv2015, TITLE = {A Note On Spectral Clustering}, AUTHOR = {Kolev, Pavel and Mehlhorn, Kurt}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1509.09188}, EPRINT = {1509.09188}, EPRINTTYPE = {arXiv}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Let $G=(V,E)$ be an undirected graph, $\lambda_k$ the $k$th smallest eigenvalue of the normalized Laplacian matrix of $G$, and $\rho(k)$ the smallest value of the maximal conductance over all $k$-way partitions $S_1,\dots,S_k$ of $V$. Peng et al. [PSZ15] gave the first rigorous analysis of $k$-clustering algorithms that use spectral embedding and $k$-means clustering algorithms to partition the vertices of a graph $G$ into $k$ disjoint subsets. Their analysis builds upon a gap parameter $\Upsilon=\rho(k)/\lambda_{k+1}$ that was introduced by Oveis Gharan and Trevisan [GT14]. In their analysis Peng et al. [PSZ15] assume a gap assumption $\Upsilon\geq\Omega(\mathrm{APR}\cdot k^3)$, where $\mathrm{APR}>1$ is the approximation ratio of a $k$-means clustering algorithm. We exhibit an error in one of their Lemmas and provide a correction. With the correction the proof by Peng et al. [PSZ15] requires a stronger gap assumption $\Upsilon\geq\Omega(\mathrm{APR}\cdot k^4)$. Our main contribution is to improve the analysis in [PSZ15] by an $O(k)$ factor. We demonstrate that a gap assumption $\Psi\geq \Omega(\mathrm{APR}\cdot k^3)$ suffices, where $\Psi=\rho_{avr}(k)/\lambda_{k+1}$ and $\rho_{avr}(k)$ is the value of the average conductance of a partition $S_1,\dots,S_k$ of $V$ that yields $\rho(k)$.}, }
Endnote
%0 Report %A Kolev, Pavel %A Mehlhorn, Kurt %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Note On Spectral Clustering : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-8F4F-A %U http://arxiv.org/abs/1509.09188 %D 2015 %X Let $G=(V,E)$ be an undirected graph, $\lambda_k$ the $k$th smallest eigenvalue of the normalized Laplacian matrix of $G$, and $\rho(k)$ the smallest value of the maximal conductance over all $k$-way partitions $S_1,\dots,S_k$ of $V$. Peng et al. [PSZ15] gave the first rigorous analysis of $k$-clustering algorithms that use spectral embedding and $k$-means clustering algorithms to partition the vertices of a graph $G$ into $k$ disjoint subsets. Their analysis builds upon a gap parameter $\Upsilon=\rho(k)/\lambda_{k+1}$ that was introduced by Oveis Gharan and Trevisan [GT14]. In their analysis Peng et al. [PSZ15] assume a gap assumption $\Upsilon\geq\Omega(\mathrm{APR}\cdot k^3)$, where $\mathrm{APR}>1$ is the approximation ratio of a $k$-means clustering algorithm. We exhibit an error in one of their Lemmas and provide a correction. With the correction the proof by Peng et al. [PSZ15] requires a stronger gap assumption $\Upsilon\geq\Omega(\mathrm{APR}\cdot k^4)$. Our main contribution is to improve the analysis in [PSZ15] by an $O(k)$ factor. We demonstrate that a gap assumption $\Psi\geq \Omega(\mathrm{APR}\cdot k^3)$ suffices, where $\Psi=\rho_{avr}(k)/\lambda_{k+1}$ and $\rho_{avr}(k)$ is the value of the average conductance of a partition $S_1,\dots,S_k$ of $V$ that yields $\rho(k)$. %K Computer Science, Discrete Mathematics, cs.DM
[155]
S. Kratsch, M. Pilipczuk, M. Pilipczuk, and M. Wahlström, “Fixed-parameter Tractability of Multicut in Directed Acyclic Graphs,” SIAM Journal on Discrete Mathematics, vol. 29, no. 1, 2015.
Export
BibTeX
@article{MCDAG-SIDMA14, TITLE = {Fixed-parameter Tractability of Multicut in Directed Acyclic Graphs}, AUTHOR = {Kratsch, Stefan and Pilipczuk, Marcin and Pilipczuk, Micha and Wahlstr{\"o}m, Magnus}, LANGUAGE = {eng}, ISSN = {0895-4801}, DOI = {10.1137/120904202}, PUBLISHER = {SIAM}, ADDRESS = {Philadelphia, Pa.}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {SIAM Journal on Discrete Mathematics}, VOLUME = {29}, NUMBER = {1}, PAGES = {122--144}, }
Endnote
%0 Journal Article %A Kratsch, Stefan %A Pilipczuk, Marcin %A Pilipczuk, Micha %A Wahlstr&#246;m, Magnus %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Fixed-parameter Tractability of Multicut in Directed Acyclic Graphs : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-5B8C-3 %R 10.1137/120904202 %7 2015 %D 2015 %J SIAM Journal on Discrete Mathematics %V 29 %N 1 %& 122 %P 122 - 144 %I SIAM %C Philadelphia, Pa. %@ false
[156]
M. Künnemann and B. Manthey, “Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic,” in Automata, Languages, and Programming (ICALP 2015), Kyoto, Japan, 2015.
Export
BibTeX
@inproceedings{Kunnemann_ICALP2015, TITLE = {Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic}, AUTHOR = {K{\"u}nnemann, Marvin and Manthey, Bodo}, LANGUAGE = {eng}, ISBN = {978-3-662-47671-0}, DOI = {10.1007/978-3-662-47672-7_70}, PUBLISHER = {Springer}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Automata, Languages, and Programming (ICALP 2015)}, EDITOR = {Halldorsson, Magnus and Iwama, Kazuo and Kobayashi, Naoki and Speckmann, Bettina}, PAGES = {859--871}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9134}, ADDRESS = {Kyoto, Japan}, }
Endnote
%0 Conference Proceedings %A K&#252;nnemann, Marvin %A Manthey, Bodo %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-66D5-D %R 10.1007/978-3-662-47672-7_70 %D 2015 %B 42nd International Colloquium on Automata, Languages, and Programming %Z date of event: 2015-07-06 - 2015-07-10 %C Kyoto, Japan %B Automata, Languages, and Programming %E Halldorsson, Magnus; Iwama, Kazuo; Kobayashi, Naoki; Speckmann, Bettina %P 859 - 871 %I Springer %@ 978-3-662-47671-0 %B Lecture Notes in Computer Science %N 9134
[157]
C. Lenzen, P. Sommer, and R. Wattenhofer, “PulseSync: An Efficient and Scalable Clock Synchronization Protocol,” IEEE/ACM Transactions on Networking, vol. 23, no. 3, 2015.
Export
BibTeX
@article{LenzenTNET2015, TITLE = {{PulseSync}: {An} Efficient and Scalable Clock Synchronization Protocol}, AUTHOR = {Lenzen, Christoph and Sommer, Philipp and Wattenhofer, Roger}, LANGUAGE = {eng}, DOI = {10.1109/TNET.2014.2309805}, PUBLISHER = {IEEE}, ADDRESS = {Piscataway, NJ}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {IEEE/ACM Transactions on Networking}, VOLUME = {23}, NUMBER = {3}, PAGES = {717--727}, }
Endnote
%0 Journal Article %A Lenzen, Christoph %A Sommer, Philipp %A Wattenhofer, Roger %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T PulseSync: An Efficient and Scalable Clock Synchronization Protocol : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-07DD-8 %R 10.1109/TNET.2014.2309805 %7 2015 %D 2015 %J IEEE/ACM Transactions on Networking %V 23 %N 3 %& 717 %P 717 - 727 %I IEEE %C Piscataway, NJ
[158]
C. Lenzen and B. Patt-Shamir, “Fast Partial Distance Estimation and Applications,” in PODC’15, ACM Symposium on Principles of Distributed Computing, Donostia-San Sebastián, Spain, 2015.
Export
BibTeX
@inproceedings{Lenzen_PODC2015, TITLE = {Fast Partial Distance Estimation and Applications}, AUTHOR = {Lenzen, Christoph and Patt-Shamir, Boaz}, LANGUAGE = {eng}, DOI = {10.1145/2767386.2767398}, PUBLISHER = {ACM}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {PODC'15, ACM Symposium on Principles of Distributed Computing}, PAGES = {153--162}, ADDRESS = {Donostia-San Sebasti{\'a}n, Spain}, }
Endnote
%0 Conference Proceedings %A Lenzen, Christoph %A Patt-Shamir, Boaz %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Fast Partial Distance Estimation and Applications : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-07B8-9 %R 10.1145/2767386.2767398 %D 2015 %B ACM Symposium on Principles of Distributed Computing %Z date of event: 2015-07-21 - 2015-07-23 %C Donostia-San Sebasti&#225;n, Spain %B PODC'15 %P 153 - 162 %I ACM
[159]
C. Lenzen and J. Rybicki, “Efficient Counting with Optimal Resilience,” in Distributed Computing (DISC 2015), Tokyo, Japan, 2015.
Export
BibTeX
@inproceedings{LenzenDISC2015, TITLE = {Efficient Counting with Optimal Resilience}, AUTHOR = {Lenzen, Christoph and Rybicki, Joel}, LANGUAGE = {eng}, ISBN = {978-3-662-48652-8}, DOI = {10.1007/978-3-662-48653-5_2}, PUBLISHER = {Springer}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Distributed Computing (DISC 2015)}, EDITOR = {Moses, Yoram}, PAGES = {16--30}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9363}, ADDRESS = {Tokyo, Japan}, }
Endnote
%0 Conference Proceedings %A Lenzen, Christoph %A Rybicki, Joel %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Efficient Counting with Optimal Resilience : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-6722-6 %R 10.1007/978-3-662-48653-5_2 %D 2015 %B 29th International Symposium on Distributed Computing %Z date of event: 2015-10-05 - 2015-10-09 %C Tokyo, Japan %B Distributed Computing %E Moses, Yoram %P 16 - 30 %I Springer %@ 978-3-662-48652-8 %B Lecture Notes in Computer Science %N 9363
[160]
C. Lenzen and J. Rybicki, “Efficient Counting with Optimal Resilience,” 2015. [Online]. Available: http://arxiv.org/abs/1508.02535. (arXiv: 1508.02535)
Abstract
In the synchronous $c$-counting problem, we are given a synchronous system of $n$ nodes, where up to $f$ of the nodes may be Byzantine, that is, have arbitrary faulty behaviour. The task is to have all of the correct nodes count modulo $c$ in unison in a self-stabilising manner: regardless of the initial state of the system and the faulty nodes' behavior, eventually rounds are consistently labelled by a counter modulo $c$ at all correct nodes. We provide a deterministic solution with resilience $f<n/3$ that stabilises in $O(f)$ rounds and every correct node broadcasts $O(\log^2 f)$ bits per round. We build and improve on a recent result offering stabilisation time $O(f)$ and communication complexity $O(\log^2 f /\log \log f)$ but with sub-optimal resilience $f = n^{1-o(1)}$ (PODC 2015). Our new algorithm has optimal resilience, asymptotically optimal stabilisation time, and low communication complexity. Finally, we modify the algorithm to guarantee that after stabilisation very little communication occurs. In particular, for optimal resilience and polynomial counter size $c=n^{O(1)}$, the algorithm broadcasts only $O(1)$ bits per node every $\Theta(n)$ rounds without affecting the other properties of the algorithm; communication-wise this is asymptotically optimal.
Export
BibTeX
@online{LenzenarXiv2015, TITLE = {Efficient Counting with Optimal Resilience}, AUTHOR = {Lenzen, Christoph and Rybicki, Joel}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1508.02535}, EPRINT = {1508.02535}, EPRINTTYPE = {arXiv}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, ABSTRACT = {In the synchronous $c$-counting problem, we are given a synchronous system of $n$ nodes, where up to $f$ of the nodes may be Byzantine, that is, have arbitrary faulty behaviour. The task is to have all of the correct nodes count modulo $c$ in unison in a self-stabilising manner: regardless of the initial state of the system and the faulty nodes' behavior, eventually rounds are consistently labelled by a counter modulo $c$ at all correct nodes. We provide a deterministic solution with resilience $f<n/3$ that stabilises in $O(f)$ rounds and every correct node broadcasts $O(\log^2 f)$ bits per round. We build and improve on a recent result offering stabilisation time $O(f)$ and communication complexity $O(\log^2 f /\log \log f)$ but with sub-optimal resilience $f = n^{1-o(1)}$ (PODC 2015). Our new algorithm has optimal resilience, asymptotically optimal stabilisation time, and low communication complexity. Finally, we modify the algorithm to guarantee that after stabilisation very little communication occurs. In particular, for optimal resilience and polynomial counter size $c=n^{O(1)}$, the algorithm broadcasts only $O(1)$ bits per node every $\Theta(n)$ rounds without affecting the other properties of the algorithm; communication-wise this is asymptotically optimal.}, }
Endnote
%0 Report %A Lenzen, Christoph %A Rybicki, Joel %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Efficient Counting with Optimal Resilience : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-6675-5 %U http://arxiv.org/abs/1508.02535 %D 2015 %X In the synchronous $c$-counting problem, we are given a synchronous system of $n$ nodes, where up to $f$ of the nodes may be Byzantine, that is, have arbitrary faulty behaviour. The task is to have all of the correct nodes count modulo $c$ in unison in a self-stabilising manner: regardless of the initial state of the system and the faulty nodes' behavior, eventually rounds are consistently labelled by a counter modulo $c$ at all correct nodes. We provide a deterministic solution with resilience $f<n/3$ that stabilises in $O(f)$ rounds and every correct node broadcasts $O(\log^2 f)$ bits per round. We build and improve on a recent result offering stabilisation time $O(f)$ and communication complexity $O(\log^2 f /\log \log f)$ but with sub-optimal resilience $f = n^{1-o(1)}$ (PODC 2015). Our new algorithm has optimal resilience, asymptotically optimal stabilisation time, and low communication complexity. Finally, we modify the algorithm to guarantee that after stabilisation very little communication occurs. In particular, for optimal resilience and polynomial counter size $c=n^{O(1)}$, the algorithm broadcasts only $O(1)$ bits per node every $\Theta(n)$ rounds without affecting the other properties of the algorithm; communication-wise this is asymptotically optimal. %K Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC
[161]
C. Lenzen, J. Rybicki, and J. Suomela, “Towards Optimal Synchronous Counting,” 2015. [Online]. Available: http://arxiv.org/abs/1503.06702. (arXiv: 1503.06702)
Abstract
Consider a complete communication network of $n$ nodes, where the nodes receive a common clock pulse. We study the synchronous $c$-counting problem: given any starting state and up to $f$ faulty nodes with arbitrary behaviour, the task is to eventually have all correct nodes counting modulo $c$ in agreement. Thus, we are considering algorithms that are self-stabilizing despite Byzantine failures. In this work, we give new algorithms for the synchronous counting problem that (1) are deterministic, (2) have linear stabilisation time in $f$, (3) use a small number of states, and (4) achieve almost-optimal resilience. Prior algorithms either resort to randomisation, use a large number of states, or have poor resilience. In particular, we achieve an exponential improvement in the space complexity of deterministic algorithms, while still achieving linear stabilisation time and almost-linear resilience.
Export
BibTeX
@online{Lenzen2_arXiv2015, TITLE = {Towards Optimal Synchronous Counting}, AUTHOR = {Lenzen, Christoph and Rybicki, Joel and Suomela, Jukka}, URL = {http://arxiv.org/abs/1503.06702}, EPRINT = {1503.06702}, EPRINTTYPE = {arXiv}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Consider a complete communication network of $n$ nodes, where the nodes receive a common clock pulse. We study the synchronous $c$-counting problem: given any starting state and up to $f$ faulty nodes with arbitrary behaviour, the task is to eventually have all correct nodes counting modulo $c$ in agreement. Thus, we are considering algorithms that are self-stabilizing despite Byzantine failures. In this work, we give new algorithms for the synchronous counting problem that (1) are deterministic, (2) have linear stabilisation time in $f$, (3) use a small number of states, and (4) achieve almost-optimal resilience. Prior algorithms either resort to randomisation, use a large number of states, or have poor resilience. In particular, we achieve an exponential improvement in the space complexity of deterministic algorithms, while still achieving linear stabilisation time and almost-linear resilience.}, }
Endnote
%0 Report %A Lenzen, Christoph %A Rybicki, Joel %A Suomela, Jukka %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Towards Optimal Synchronous Counting : %U http://hdl.handle.net/11858/00-001M-0000-002A-07C2-2 %U http://arxiv.org/abs/1503.06702 %D 2015 %X Consider a complete communication network of $n$ nodes, where the nodes receive a common clock pulse. We study the synchronous $c$-counting problem: given any starting state and up to $f$ faulty nodes with arbitrary behaviour, the task is to eventually have all correct nodes counting modulo $c$ in agreement. Thus, we are considering algorithms that are self-stabilizing despite Byzantine failures. In this work, we give new algorithms for the synchronous counting problem that (1) are deterministic, (2) have linear stabilisation time in $f$, (3) use a small number of states, and (4) achieve almost-optimal resilience. Prior algorithms either resort to randomisation, use a large number of states, or have poor resilience. In particular, we achieve an exponential improvement in the space complexity of deterministic algorithms, while still achieving linear stabilisation time and almost-linear resilience. %K Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC
[162]
C. Lenzen, J. Rybicki, and J. Suomela, “Towards Optimal Synchronous Counting,” in PODC’15, ACM Symposium on Principles of Distributed Computing, Donostia-San Sebastián, Spain, 2015.
Export
BibTeX
@inproceedings{Lenzen2_PODC2015, TITLE = {Towards Optimal Synchronous Counting}, AUTHOR = {Lenzen, Christoph and Rybicki, Joel and Suomela, Jukka}, LANGUAGE = {eng}, DOI = {10.1145/2767386.2767423}, PUBLISHER = {ACM}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {PODC'15, ACM Symposium on Principles of Distributed Computing}, PAGES = {441--450}, ADDRESS = {Donostia-San Sebasti{\'a}n, Spain}, }
Endnote
%0 Conference Proceedings %A Lenzen, Christoph %A Rybicki, Joel %A Suomela, Jukka %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Towards Optimal Synchronous Counting : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-07BE-E %R 10.1145/2767386.2767423 %D 2015 %B ACM Symposium on Principles of Distributed Computing %Z date of event: 2015-07-21 - 2015-07-23 %C Donostia-San Sebasti&#225;n, Spain %B PODC'15 %P 441 - 450 %I ACM
[163]
D. Lokshtanov, M. Pilipczuk, and E. J. van Leeuwen, “Independence and Efficient Domination on P6-free Graphs,” 2015. [Online]. Available: http://arxiv.org/abs/1507.02163. (arXiv: 1507.02163)
Abstract
In the Independent set problem, the input is a graph $G$, every vertex has a non-negative integer weight, and the task is to find a set $S$ of pairwise non-adjacent vertices, maximizing the total weight of the vertices in $S$. We give an $n^{O (\log^2 n)}$ time algorithm for this problem on graphs excluding the path $P_6$ on $6$ vertices as an induced subgraph. Currently, there is no constant $k$ known for which Independent Set on $P_{k}$-free graphs becomes NP-complete, and our result implies that if such a $k$ exists, then $k > 6$ unless all problems in NP can be decided in (quasi)polynomial time. Using the combinatorial tools that we develop for the above algorithm, we also give a polynomial-time algorithm for Efficient Dominating Set on $P_6$-free graphs. In this problem, the input is a graph $G$, every vertex has an integer weight, and the objective is to find a set $S$ of maximum weight such that every vertex in $G$ has exactly one vertex in $S$ in its closed neighborhood, or to determine that no such set exists. Prior to our work, the class of $P_6$-free graphs was the only class of graphs defined by a single forbidden induced subgraph on which the computational complexity of Efficient Dominating Set was unknown.
Export
BibTeX
@online{Lokshtanov2015, TITLE = {Independence and Efficient Domination on $P_6$-free Graphs}, AUTHOR = {Lokshtanov, Daniel and Pilipczuk, Marcin and van Leeuwen, Erik Jan}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1507.02163}, EPRINT = {1507.02163}, EPRINTTYPE = {arXiv}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, ABSTRACT = {In the Independent set problem, the input is a graph $G$, every vertex has a non-negative integer weight, and the task is to find a set $S$ of pairwise non-adjacent vertices, maximizing the total weight of the vertices in $S$. We give an $n^{O (\log^2 n)}$ time algorithm for this problem on graphs excluding the path $P_6$ on $6$ vertices as an induced subgraph. Currently, there is no constant $k$ known for which Independent Set on $P_{k}$-free graphs becomes NP-complete, and our result implies that if such a $k$ exists, then $k > 6$ unless all problems in NP can be decided in (quasi)polynomial time. Using the combinatorial tools that we develop for the above algorithm, we also give a polynomial-time algorithm for Efficient Dominating Set on $P_6$-free graphs. In this problem, the input is a graph $G$, every vertex has an integer weight, and the objective is to find a set $S$ of maximum weight such that every vertex in $G$ has exactly one vertex in $S$ in its closed neighborhood, or to determine that no such set exists. Prior to our work, the class of $P_6$-free graphs was the only class of graphs defined by a single forbidden induced subgraph on which the computational complexity of Efficient Dominating Set was unknown.}, }
Endnote
%0 Report %A Lokshtanov, Daniel %A Pilipczuk, Marcin %A van Leeuwen, Erik Jan %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Independence and Efficient Domination on P6-free Graphs : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0029-2494-4 %U http://arxiv.org/abs/1507.02163 %D 2015 %X In the Independent set problem, the input is a graph $G$, every vertex has a non-negative integer weight, and the task is to find a set $S$ of pairwise non-adjacent vertices, maximizing the total weight of the vertices in $S$. We give an $n^{O (\log^2 n)}$ time algorithm for this problem on graphs excluding the path $P_6$ on $6$ vertices as an induced subgraph. Currently, there is no constant $k$ known for which Independent Set on $P_{k}$-free graphs becomes NP-complete, and our result implies that if such a $k$ exists, then $k > 6$ unless all problems in NP can be decided in (quasi)polynomial time. Using the combinatorial tools that we develop for the above algorithm, we also give a polynomial-time algorithm for Efficient Dominating Set on $P_6$-free graphs. In this problem, the input is a graph $G$, every vertex has an integer weight, and the objective is to find a set $S$ of maximum weight such that every vertex in $G$ has exactly one vertex in $S$ in its closed neighborhood, or to determine that no such set exists. Prior to our work, the class of $P_6$-free graphs was the only class of graphs defined by a single forbidden induced subgraph on which the computational complexity of Efficient Dominating Set was unknown. %K Computer Science, Data Structures and Algorithms, cs.DS
[164]
A. Marchetti-Spaccamela, C. Rutten, S. van der Ster, and A. Wiese, “Assigning Sporadic Tasks to Unrelated Machines,” Mathematical Programming / A, vol. 152, no. 1–2, 2015.
Export
BibTeX
@article{Wiese2015Assigning, TITLE = {Assigning Sporadic Tasks to Unrelated Machines}, AUTHOR = {Marchetti-Spaccamela, Alberto and Rutten, Cyriel and van der Ster, Suzanne and Wiese, Andreas}, LANGUAGE = {eng}, ISSN = {0025-5610}, DOI = {10.1007/s10107-014-0786-9}, PUBLISHER = {Springer}, ADDRESS = {Berlin}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Mathematical Programming / A}, VOLUME = {152}, NUMBER = {1-2}, PAGES = {247--274}, }
Endnote
%0 Journal Article %A Marchetti-Spaccamela, Alberto %A Rutten, Cyriel %A van der Ster, Suzanne %A Wiese, Andreas %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Assigning Sporadic Tasks to Unrelated Machines : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-4CA0-4 %R 10.1007/s10107-014-0786-9 %7 2015 %D 2015 %J Mathematical Programming / A %V 152 %N 1-2 %& 247 %P 247 - 274 %I Springer %C Berlin %@ false
[165]
K. Mehlhorn, “From Theory to Library of Efficient Data Types and Algorithms (LEDA) and Algorithm Engineering,” in The Human Face of Computing, London: Imperial College Press, 2015.
Export
BibTeX
@incollection{MehlhornLEDA2015, TITLE = {From Theory to Library of Efficient Data Types and Algorithms ({LEDA}) and Algorithm Engineering}, AUTHOR = {Mehlhorn, Kurt}, LANGUAGE = {eng}, ISBN = {978-1-78326-643-2; 978-1-78326-645-6}, DOI = {10.1142/9781783266449_0005}, PUBLISHER = {Imperial College Press}, ADDRESS = {London}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {The Human Face of Computing}, EDITOR = {Calude, Christian S.}, PAGES = {59--71}, SERIES = {Advances in Computer Science and Engineering: Texts}, VOLUME = {9}, }
Endnote
%0 Book Section %A Mehlhorn, Kurt %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society %T From Theory to Library of Efficient Data Types and Algorithms (LEDA) and Algorithm Engineering : Chapter 5 %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-0799-F %R 10.1142/9781783266449_0005 %D 2015 %B The Human Face of Computing %E Calude, Christian S. %P 59 - 71 %I Imperial College Press %C London %@ 978-1-78326-643-2 978-1-78326-645-6 %S Advances in Computer Science and Engineering: Texts %N 9
[166]
K. Mehlhorn and S. Saxena, “A Still Simpler Way of Introducing the Interior-Point Method for Linear Programming,” 2015. [Online]. Available: http://arxiv.org/abs/1510.03339. (arXiv: 1510.03339)
Abstract
Linear programming is now included in algorithm undergraduate and postgraduate courses for computer science majors. We show that it is possible to teach interior-point methods directly to students with just minimal knowledge of linear algebra.
Export
BibTeX
@online{MehlhornSaxena2015, TITLE = {A Still Simpler Way of Introducing the Interior-Point Method for Linear Programming}, AUTHOR = {Mehlhorn, Kurt and Saxena, Sanjeev}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1510.03339}, EPRINT = {1510.03339}, EPRINTTYPE = {arXiv}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Linear programming is now included in algorithm undergraduate and postgraduate courses for computer science majors. We show that it is possible to teach interior-point methods directly to students with just minimal knowledge of linear algebra.}, }
Endnote
%0 Report %A Mehlhorn, Kurt %A Saxena, Sanjeev %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T A Still Simpler Way of Introducing the Interior-Point Method for Linear Programming : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-F70B-6 %U http://arxiv.org/abs/1510.03339 %D 2015 %X Linear programming is now included in algorithm undergraduate and postgraduate courses for computer science majors. We show that it is possible to teach interior-point methods directly to students with just minimal knowledge of linear algebra. %K Computer Science, Data Structures and Algorithms, cs.DS,Mathematics, Optimization and Control, math.OC
[167]
K. Mehlhorn, “On the Implementation of Combinatorial Algorithms for the Linear Exchange Market,” in Algorithms, Probability, Networks, and Games, Berlin: Springer, 2015.
Export
BibTeX
@incollection{MehlhornLNCS9295, TITLE = {On the Implementation of Combinatorial Algorithms for the Linear Exchange Market}, AUTHOR = {Mehlhorn, Kurt}, LANGUAGE = {eng}, ISBN = {978-3-319-24023-7}, PUBLISHER = {Springer}, ADDRESS = {Berlin}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Algorithms, Probability, Networks, and Games}, EDITOR = {Zaroliagis, Christos and Pantziou, Grammati and Kontogianni, Spyros}, PAGES = {87--94}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9295}, }
Endnote
%0 Book Section %A Mehlhorn, Kurt %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society %T On the Implementation of Combinatorial Algorithms for the Linear Exchange Market : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-8F36-F %D 2015 %B Algorithms, Probability, Networks, and Games %E Zaroliagis, Christos; Pantziou, Grammati; Kontogianni, Spyros; Spirakis, Paul G. %P 87 - 94 %I Springer %C Berlin %@ 978-3-319-24023-7 %S Lecture Notes in Computer Science %N 9295
[168]
K. Mehlhorn, M. Sagraloff, and P. Wang, “From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition,” Journal of Symbolic Computation, vol. 66, 2015.
Export
BibTeX
@article{MehlhornSagraloffWang2015, TITLE = {From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition}, AUTHOR = {Mehlhorn, Kurt and Sagraloff, Michael and Wang, Pengming}, LANGUAGE = {eng}, ISSN = {0747-7171}, DOI = {10.1016/j.jsc.2014.02.001}, PUBLISHER = {Academic Press}, ADDRESS = {London}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Journal of Symbolic Computation}, VOLUME = {66}, PAGES = {34--69}, }
Endnote
%0 Journal Article %A Mehlhorn, Kurt %A Sagraloff, Michael %A Wang, Pengming %+ 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 From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-36CF-A %R 10.1016/j.jsc.2014.02.001 %7 2014-02-21 %D 2015 %J Journal of Symbolic Computation %V 66 %& 34 %P 34 - 69 %I Academic Press %C London %@ false
[169]
T. Mömke and A. Wiese, “A (2+epsilon)-Approximation Algorithm for the Storage Allocation,” in Automata, Languages, and Programming (ICALP 2015), Kyoto, Japan, 2015.
Export
BibTeX
@inproceedings{Moemke_ICALP2015, TITLE = {A {(2+\epsilon)}-Approximation Algorithm for the Storage Allocation}, AUTHOR = {M{\"o}mke, Tobias and Wiese, Andreas}, LANGUAGE = {eng}, ISBN = {978-3-662-47671-0}, DOI = {10.1007/978-3-662-47672-7_79}, PUBLISHER = {Springer}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Automata, Languages, and Programming (ICALP 2015)}, EDITOR = {Halldorsson, Magnus and Iwama, Kazuo and Kobayashi, Naoki and Speckmann, Bettina}, PAGES = {973--984}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9134}, ADDRESS = {Kyoto, Japan}, }
Endnote
%0 Conference Proceedings %A M&#246;mke, Tobias %A Wiese, Andreas %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A (2+epsilon)-Approximation Algorithm for the Storage Allocation : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-79A8-9 %R 10.1007/978-3-662-47672-7_79 %D 2015 %B 42nd International Colloquium on Automata, Languages, and Programming %Z date of event: 2015-07-06 - 2015-07-10 %C Kyoto, Japan %B Automata, Languages, and Programming %E Halldorsson, Magnus; Iwama, Kazuo; Kobayashi, Naoki; Speckmann, Bettina %P 973 - 984 %I Springer %@ 978-3-662-47671-0 %B Lecture Notes in Computer Science %N 9134
[170]
S. Moran, A. Shpilka, A. Wigderson, and A. Yehudayoff, “Compressing and Teaching for Low VC-Dimension,” in FOCS 2015, IEEE 56th Annual Symposium on Foundations of Computer Science, Berkeley, CA, USA, 2015.
Export
BibTeX
@inproceedings{MoranFOCS2015, TITLE = {Compressing and teaching for low {VC}-dimension}, AUTHOR = {Moran, Shay and Shpilka, Amir and Wigderson, Avi and Yehudayoff, Amir}, LANGUAGE = {eng}, DOI = {10.1109/FOCS.2015.12}, PUBLISHER = {IEEE}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {FOCS 2015, IEEE 56th Annual Symposium on Foundations of Computer Science}, PAGES = {40--51}, ADDRESS = {Berkeley, CA, USA}, }
Endnote
%0 Conference Proceedings %A Moran, Shay %A Shpilka, Amir %A Wigderson, Avi %A Yehudayoff, Amir %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Compressing and Teaching for Low VC-Dimension : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002B-195F-F %R 10.1109/FOCS.2015.12 %D 2015 %B IEEE 56th Annual Symposium on Foundations of Computer Science %Z date of event: 2015-10-18 - 2015-10-20 %C Berkeley, CA, USA %B FOCS 2015 %P 40 - 51 %I IEEE
[171]
A. Neumann, “On Efficiency and Reliability in Computer Science,” Universität des Saarlandes, Saarbrücken, 2015.
Export
BibTeX
@phdthesis{NeumannPhd15, TITLE = {On Efficiency and Reliability in Computer Science}, AUTHOR = {Neumann, Adrian}, LANGUAGE = {eng}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, }
Endnote
%0 Thesis %A Neumann, Adrian %Y Mehlhorn, Kurt %A referee: Wiese, Andreas %+ 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 On Efficiency and Reliability in Computer Science : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-FC6A-C %I Universit&#228;t des Saarlandes %C Saarbr&#252;cken %D 2015 %P 95 p. %V phd %9 phd %U http://scidok.sulb.uni-saarland.de/volltexte/2015/6268/http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=de
[172]
M. Niemeier and A. Wiese, “Scheduling with an Orthogonal Resource Constraint,” Algorithmica, vol. 71, no. 4, 2015.
Export
BibTeX
@article{NiemeierAlgorithmica2015, TITLE = {Scheduling with an Orthogonal Resource Constraint}, AUTHOR = {Niemeier, Martin and Wiese, Andreas}, LANGUAGE = {eng}, ISSN = {0178-4617}, DOI = {10.1007/s00453-013-9829-5}, PUBLISHER = {Springer}, ADDRESS = {New York, NY}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Algorithmica}, VOLUME = {71}, NUMBER = {4}, PAGES = {837--858}, }
Endnote
%0 Journal Article %A Niemeier, Martin %A Wiese, Andreas %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Scheduling with an Orthogonal Resource Constraint : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0026-BED8-A %R 10.1007/s00453-013-9829-5 %7 2015 %D 2015 %J Algorithmica %V 71 %N 4 %& 837 %P 837 - 858 %I Springer %C New York, NY %@ false
[173]
K. Panagiotou, X. Pérez-Giménez, T. Sauerwald, and H. Sun, “Randomized Rumour Spreading: The Effect of the Network Topology,” Combinatorics, Probability and Computing, vol. 24, no. 2, 2015.
Abstract
We consider the popular and well-studied push model, which is used to spread information in a given network with n vertices. Initially, some vertex owns a rumour and passes it to one of its neighbours, which is chosen randomly. In each of the succeeding rounds, every vertex that knows the rumour informs a random neighbour. It has been shown on various network topologies that this algorithm succeeds in spreading the rumour within O(log n) rounds. However, many studies are quite coarse and involve huge constants that do not allow for a direct comparison between different network topologies. In this paper, we analyse the push model on several important families of graphs, and obtain tight runtime estimates. We first show that, for any almost-regular graph on n vertices with small spectral expansion, rumour spreading completes after log(2) n + logn + o(log n) rounds with high probability. This is the first result that exhibits a general graph class for which rumour spreading is essentially as fast as on complete graphs. Moreover, for the random graph G(n, p) with p = c log n/n, where c > 1, we determine the runtime of rumour spreading to be log(2) n + gamma(c) log n with high probability, where gamma(c) = c log(c/(c - 1)). In particular, this shows that the assumption of almost regularity in our first result is necessary. Finally, for a hypercube on n = 2(d) vertices, the runtime is with high probability at least (1 + beta) . (log(2) n + log n), where beta > 0. This reveals that the push model on hypercubes is slower than on complete graphs, and thus shows that the assumption of small spectral expansion in our first result is also necessary. In addition, our results combined with the upper bound of O(log n) for the hypercube see [11]) imply that the push model is faster on hypercubes than on a random graph G(n, c log n/n), where c is sufficiently close to 1.
Export
BibTeX
@article{PanagiotouCPC2015, TITLE = {Randomized Rumour Spreading: {T}he Effect of the Network Topology}, AUTHOR = {Panagiotou, Konstantinos and P{\'e}rez-Gim{\'e}nez, Xavier and Sauerwald, Thomas and Sun, He}, LANGUAGE = {eng}, ISSN = {0963-5483}, DOI = {10.1017/s0963548314000194}, PUBLISHER = {Cambridge University Press}, ADDRESS = {Cambridge}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, ABSTRACT = {We consider the popular and well-studied push model, which is used to spread information in a given network with n vertices. Initially, some vertex owns a rumour and passes it to one of its neighbours, which is chosen randomly. In each of the succeeding rounds, every vertex that knows the rumour informs a random neighbour. It has been shown on various network topologies that this algorithm succeeds in spreading the rumour within O(log n) rounds. However, many studies are quite coarse and involve huge constants that do not allow for a direct comparison between different network topologies. In this paper, we analyse the push model on several important families of graphs, and obtain tight runtime estimates. We first show that, for any almost-regular graph on n vertices with small spectral expansion, rumour spreading completes after log(2) n + logn + o(log n) rounds with high probability. This is the first result that exhibits a general graph class for which rumour spreading is essentially as fast as on complete graphs. Moreover, for the random graph G(n, p) with p = c log n/n, where c > 1, we determine the runtime of rumour spreading to be log(2) n + gamma(c) log n with high probability, where gamma(c) = c log(c/(c -- 1)). In particular, this shows that the assumption of almost regularity in our first result is necessary. Finally, for a hypercube on n = 2(d) vertices, the runtime is with high probability at least (1 + beta) . (log(2) n + log n), where beta > 0. This reveals that the push model on hypercubes is slower than on complete graphs, and thus shows that the assumption of small spectral expansion in our first result is also necessary. In addition, our results combined with the upper bound of O(log n) for the hypercube see [11]) imply that the push model is faster on hypercubes than on a random graph G(n, c log n/n), where c is sufficiently close to 1.}, JOURNAL = {Combinatorics, Probability and Computing}, VOLUME = {24}, NUMBER = {2}, PAGES = {457--479}, }
Endnote
%0 Journal Article %A Panagiotou, Konstantinos %A P&#233;rez-Gim&#233;nez, Xavier %A Sauerwald, Thomas %A Sun, He %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Randomized Rumour Spreading: The Effect of the Network Topology : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-CD14-6 %F OTHER: WOS:000348383500005 %R 10.1017/s0963548314000194 %7 2015 %D 2015 %X We consider the popular and well-studied push model, which is used to spread information in a given network with n vertices. Initially, some vertex owns a rumour and passes it to one of its neighbours, which is chosen randomly. In each of the succeeding rounds, every vertex that knows the rumour informs a random neighbour. It has been shown on various network topologies that this algorithm succeeds in spreading the rumour within O(log n) rounds. However, many studies are quite coarse and involve huge constants that do not allow for a direct comparison between different network topologies. In this paper, we analyse the push model on several important families of graphs, and obtain tight runtime estimates. We first show that, for any almost-regular graph on n vertices with small spectral expansion, rumour spreading completes after log(2) n + logn + o(log n) rounds with high probability. This is the first result that exhibits a general graph class for which rumour spreading is essentially as fast as on complete graphs. Moreover, for the random graph G(n, p) with p = c log n/n, where c > 1, we determine the runtime of rumour spreading to be log(2) n + gamma(c) log n with high probability, where gamma(c) = c log(c/(c - 1)). In particular, this shows that the assumption of almost regularity in our first result is necessary. Finally, for a hypercube on n = 2(d) vertices, the runtime is with high probability at least (1 + beta) . (log(2) n + log n), where beta > 0. This reveals that the push model on hypercubes is slower than on complete graphs, and thus shows that the assumption of small spectral expansion in our first result is also necessary. In addition, our results combined with the upper bound of O(log n) for the hypercube see [11]) imply that the push model is faster on hypercubes than on a random graph G(n, c log n/n), where c is sufficiently close to 1. %K GRAPHS ALGORITHMS MATRICES Computer Science, Theory & Methods Mathematics Statistics & Probability %J Combinatorics, Probability and Computing %V 24 %N 2 %& 457 %P 457 - 479 %I Cambridge University Press %C Cambridge %@ false
[174]
K. Panagiotou, X. Pérez-Giménez, T. Sauerwald, and H. Sun, “Randomized Rumor Spreading: the Effect of the Network Topology,” Combinatorics, Probability and Computing, vol. 24, no. 2, 2015.
Export
BibTeX
@article{PerezGPSS2015, TITLE = {Randomized Rumor Spreading: the Effect of the Network Topology}, AUTHOR = {Panagiotou, Konstantinos and P{\'e}rez-Gim{\'e}nez, Xavier and Sauerwald, Thomas and Sun, He}, LANGUAGE = {eng}, ISSN = {0963-5483}, DOI = {10.1017/S0963548314000194}, PUBLISHER = {Cambridge University Press}, ADDRESS = {Cambridge}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Combinatorics, Probability and Computing}, VOLUME = {24}, NUMBER = {2}, PAGES = {457--479}, }
Endnote
%0 Journal Article %A Panagiotou, Konstantinos %A P&#233;rez-Gim&#233;nez, Xavier %A Sauerwald, Thomas %A Sun, He %+ 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 Cluster of Excellence Multimodal Computing and Interaction %T Randomized Rumor Spreading: the Effect of the Network Topology : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-B95C-B %R 10.1017/S0963548314000194 %7 2015 %D 2015 %J Combinatorics, Probability and Computing %V 24 %N 2 %& 457 %P 457 - 479 %I Cambridge University Press %C Cambridge %@ false
[175]
K. Panagiotou, A. Pourmiri, and T. Sauerwald, “Faster Rumor Spreading with Multiple Calls,” The Electronic Journal of Combinatorics, vol. 22, no. 1, 2015.
Abstract
We consider the random phone call model introduced by Demers et al.,which is a well-studied model for information dissemination in networks. One basic protocol in this model is the so-called Push protocol that proceeds in synchronous rounds. Starting with a single node which knows of a rumor, every informed node calls in each round a random neighbor and informs it of the rumor. The Push-Pull protocol works similarly, but additionally every uninformed node calls a random neighbor and may learn the rumor from it. It is well-known that both protocols need Theta(log n) rounds to spread a rumor on a complete network with n nodes. Here we are interested in how much the spread can be speeded up by enabling nodes to make more than one call in each round. We propose a new model where the number of calls of a node is chosen independently according to a probability distribution R. We provide both lower and upper bounds on the rumor spreading time depending on statistical properties of R such as the mean or the variance (if they exist). In particular, if R follows a power law distribution with exponent beta is an element of (2, 3), we show that the Push-Pull protocol spreads a rumor in Theta(log log n) rounds. Moreover, when beta = 3, the Push-Pull protocol spreads a rumor in Theta(log n/log log n) rounds.
Export
BibTeX
@article{PanagiotouEJC2015, TITLE = {Faster Rumor Spreading with Multiple Calls}, AUTHOR = {Panagiotou, Konstantinos and Pourmiri, Ali and Sauerwald, Thomas}, LANGUAGE = {eng}, ISSN = {1077-8926}, URL = {http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i1p23}, PUBLISHER = {N.J. Calkin and H.S. Wilf}, ADDRESS = {Atlanta, Ga.}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We consider the random phone call model introduced by Demers et al.,which is a well-studied model for information dissemination in networks. One basic protocol in this model is the so-called Push protocol that proceeds in synchronous rounds. Starting with a single node which knows of a rumor, every informed node calls in each round a random neighbor and informs it of the rumor. The Push-Pull protocol works similarly, but additionally every uninformed node calls a random neighbor and may learn the rumor from it. It is well-known that both protocols need Theta(log n) rounds to spread a rumor on a complete network with n nodes. Here we are interested in how much the spread can be speeded up by enabling nodes to make more than one call in each round. We propose a new model where the number of calls of a node is chosen independently according to a probability distribution R. We provide both lower and upper bounds on the rumor spreading time depending on statistical properties of R such as the mean or the variance (if they exist). In particular, if R follows a power law distribution with exponent beta is an element of (2, 3), we show that the Push-Pull protocol spreads a rumor in Theta(log log n) rounds. Moreover, when beta = 3, the Push-Pull protocol spreads a rumor in Theta(log n/log log n) rounds.}, JOURNAL = {The Electronic Journal of Combinatorics}, VOLUME = {22}, NUMBER = {1}, EID = {P1.23}, }
Endnote
%0 Journal Article %A Panagiotou, Konstantinos %A Pourmiri, Ali %A Sauerwald, Thomas %+ 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 Faster Rumor Spreading with Multiple Calls : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0025-758E-5 %F ISI: 000349542800007 %U http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i1p23 %7 2015 %D 2015 %X We consider the random phone call model introduced by Demers et al.,which is a well-studied model for information dissemination in networks. One basic protocol in this model is the so-called Push protocol that proceeds in synchronous rounds. Starting with a single node which knows of a rumor, every informed node calls in each round a random neighbor and informs it of the rumor. The Push-Pull protocol works similarly, but additionally every uninformed node calls a random neighbor and may learn the rumor from it. It is well-known that both protocols need Theta(log n) rounds to spread a rumor on a complete network with n nodes. Here we are interested in how much the spread can be speeded up by enabling nodes to make more than one call in each round. We propose a new model where the number of calls of a node is chosen independently according to a probability distribution R. We provide both lower and upper bounds on the rumor spreading time depending on statistical properties of R such as the mean or the variance (if they exist). In particular, if R follows a power law distribution with exponent beta is an element of (2, 3), we show that the Push-Pull protocol spreads a rumor in Theta(log log n) rounds. Moreover, when beta = 3, the Push-Pull protocol spreads a rumor in Theta(log n/log log n) rounds. %K SOCIAL NETWORKS; ALGORITHMSMathematics; %J The Electronic Journal of Combinatorics %V 22 %N 1 %Z sequence number: P1.23 %I N.J. Calkin and H.S. Wilf %C Atlanta, Ga. %@ false
[176]
F. Panolan, G. Philip, and S. Saurabh, “B-Chromatic Number: Beyond NP-Hardness,” in 10th International Symposium on Parameterized and Exact Computation (IPEC 2015), Patras, Greece, 2015.
Export
BibTeX
@inproceedings{PanolanIPEC2015, TITLE = {B-Chromatic Number: {B}eyond {NP}-Hardnesss}, AUTHOR = {Panolan, Fahad and Philip, Geevarghese and Saurabh, Saket}, LANGUAGE = {eng}, ISSN = {1868-896}, ISBN = {978-3-939897-92-7}, URL = {urn:nbn:de:0030-drops-55997}, DOI = {10.4230/LIPIcs.IPEC.2015.389}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, EDITOR = {Husfeldt, Thore and Kanj, Iyad}, PAGES = {169--183}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {43}, ADDRESS = {Patras, Greece}, }
Endnote
%0 Conference Proceedings %A Panolan, Fahad %A Philip, Geevarghese %A Saurabh, Saket %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T B-Chromatic Number: Beyond NP-Hardness : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-08A2-2 %R 10.4230/LIPIcs.IPEC.2015.389 %U urn:nbn:de:0030-drops-55997 %D 2015 %B 10th International Symposium on Parameterized and Exact Computation %Z date of event: 2015-09-16 - 2015-09-18 %C Patras, Greece %B 10th International Symposium on Parameterized and Exact Computation %E Husfeldt, Thore; Kanj, Iyad %P 169 - 183 %I Schloss Dagstuhl %@ 978-3-939897-92-7 %B Leibniz International Proceedings in Informatics %N 43 %@ false %U http://drops.dagstuhl.de/opus/volltexte/2015/5599/http://drops.dagstuhl.de/doku/urheberrecht1.html
[177]
G. Philip, A. Rai, and S. Saurabh, “Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel,” in Mathematical Foundations of Computer Science 2015 (MFCS 2015), Milan, Italy, 2015.
Export
BibTeX
@inproceedings{PhilipMFCS2015, TITLE = {Generalized Pseudoforest Deletion: {A}lgorithms and Uniform Kernel}, AUTHOR = {Philip, Geevarghese and Rai, Ashutosh and Saurabh, Saket}, LANGUAGE = {eng}, ISBN = {978-3-662-48053-3}, DOI = {10.1007/978-3-662-48054-0_43}, PUBLISHER = {Springer}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {Mathematical Foundations of Computer Science 2015 (MFCS 2015)}, EDITOR = {Italiano, Guiseppe F. and Pighizzini, Giovanni and Sannella, Donald T.}, PAGES = {517--528}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {9235}, ADDRESS = {Milan, Italy}, }
Endnote
%0 Conference Proceedings %A Philip, Geevarghese %A Rai, Ashutosh %A Saurabh, Saket %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-7FB1-7 %R 10.1007/978-3-662-48054-0_43 %D 2015 %B 40th International Symposium on Mathematical Foundations of Computer Science %Z date of event: 2015-08-24 - 2015-08-28 %C Milan, Italy %B Mathematical Foundations of Computer Science 2015 %E Italiano, Guiseppe F.; Pighizzini, Giovanni; Sannella, Donald T. %P 517 - 528 %I Springer %@ 978-3-662-48053-3 %B Lecture Notes in Computer Science %N 9235
[178]
A. Pourmiri, “Random Walk-based Algorithms on Networks,” Universität des Saarlandes, Saarbrücken, 2015.
Export
BibTeX
@phdthesis{Pourmiriphd15, TITLE = {Random Walk-based Algorithms on Networks}, AUTHOR = {Pourmiri, Ali}, LANGUAGE = {eng}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, }
Endnote
%0 Thesis %A Pourmiri, Ali %Y Mehlhorn, Kurt %A referee: Sauerwald, Thomas %+ 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 Random Walk-based Algorithms on Networks : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0029-6E73-D %I Universit&#228;t des Saarlandes %C Saarbr&#252;cken %D 2015 %P 112 S. %V phd %9 phd %U http://scidok.sulb.uni-saarland.de/volltexte/2015/6186/http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=de
[179]
F. Ramezani, “Application of Multiplicative Weights Update Method in Algorithmic Game Theory,” Universität des Saarlandes, Saarbrücken, 2015.
Export
BibTeX
@phdthesis{RamezaniPHD2015, TITLE = {Application of Multiplicative Weights Update Method in Algorithmic Game Theory}, AUTHOR = {Ramezani, Fahimeh}, LANGUAGE = {eng}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, }
Endnote
%0 Thesis %A Ramezani, Fahimeh %Y Mehlhorn, Kurt %A referee: Elbassioni, Khaled %+ 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 Application of Multiplicative Weights Update Method in Algorithmic Game Theory : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-4BB9-5 %I Universit&#228;t des Saarlandes %C Saarbr&#252;cken %D 2015 %P 85 p. %V phd %9 phd %U http://scidok.sulb.uni-saarland.de/volltexte/2015/6226/http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=de
[180]
T. Ramiadantsoa, O. Ovaskainen, J. Rybicki, and I. Hanski, “Large-scale Habitat Corridors for Biodiversity Conservation: A Forest Corridor in Madagascar,” PLoS ONE, vol. 10, no. 7, 2015.
Export
BibTeX
@article{Rybicki2015, TITLE = {Large-scale Habitat Corridors for Biodiversity Conservation: {A} Forest Corridor in {Madagascar}}, AUTHOR = {Ramiadantsoa, Tanjona and Ovaskainen, Otso and Rybicki, Joel and Hanski, Ilkka}, LANGUAGE = {eng}, ISSN = {1932-6203}, URL = {http://www.pubmedcentral.nih.gov/articlerender.fcgi?artid=4511669&tool=pmcentrez&rendertype=abstract}, DOI = {10.1371/journal.pone.0132126}, PUBLISHER = {Public Library of Science}, ADDRESS = {San Francisco, CA}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, JOURNAL = {PLoS ONE}, VOLUME = {10}, NUMBER = {7}, EID = {e0132126}, }
Endnote
%0 Journal Article %A Ramiadantsoa, Tanjona %A Ovaskainen, Otso %A Rybicki, Joel %A Hanski, Ilkka %A contributor: Samonds, Karen E. %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Large-scale Habitat Corridors for Biodiversity Conservation: A Forest Corridor in Madagascar : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-1B1D-8 %F OTHER: accessionPMC4511669 %F OTHER: pmcidPMC4511669 %F OTHER: pmc-uid4511669 %R 10.1371/journal.pone.0132126 %F OTHER: publisher-idPONE-D-15-00430 %U http://www.pubmedcentral.nih.gov/articlerender.fcgi?artid=4511669&tool=pmcentrez&rendertype=abstract %7 2015-07-22 %D 2015 %8 22.07.2015 %J PLoS ONE %V 10 %N 7 %Z sequence number: e0132126 %I Public Library of Science %C San Francisco, CA %@ false
[181]
C. Rizkallah, “Verification of Program Computations,” Universität des Saarlandes, Saarbrücken, 2015.
Export
BibTeX
@phdthesis{RizkallahPhd15, TITLE = {Verification of Program Computations}, AUTHOR = {Rizkallah, Christine}, LANGUAGE = {eng}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, }
Endnote
%0 Thesis %A Rizkallah, Christine %Y Mehlhorn, Kurt %A referee: Nipkow, Tobias %+ 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 Verification of Program Computations : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-FD10-A %I Universit&#228;t des Saarlandes %C Saarbr&#252;cken %D 2015 %P 132 p. %V phd %9 phd %U http://scidok.sulb.uni-saarland.de/volltexte/2015/6254/http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=de
[182]
A. Schmid and J. M. Schmidt, “Computing 2-Walks in Polynomial Time,” in 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015), Munich, Germany, 2015.
Export
BibTeX
@inproceedings{ASJMS2015, TITLE = {Computing 2-Walks in Polynomial Time}, AUTHOR = {Schmid, Andreas and Schmidt, Jens M.}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-939897-78-1}, URL = {urn:nbn:de:0030-drops-49502}, DOI = {10.4230/LIPIcs.STACS.2015.676}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, EDITOR = {Mayr, Ernst W. and Ollinger, Nicolas}, PAGES = {676--686}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {30}, ADDRESS = {Munich, Germany}, }
Endnote
%0 Conference Proceedings %A Schmid, Andreas %A Schmidt, Jens M. %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Computing 2-Walks in Polynomial Time : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-5B14-D %R 10.4230/LIPIcs.STACS.2015.676 %U urn:nbn:de:0030-drops-49502 %D 2015 %B 32nd International Symposium on Theoretical Aspects of Computer Science %Z date of event: 2015-03-04 - 2015-03-07 %C Munich, Germany %B 32nd International Symposium on Theoretical Aspects of Computer Science %E Mayr, Ernst W.; Ollinger, Nicolas %P 676 - 686 %I Schloss Dagstuhl %@ 978-3-939897-78-1 %B Leibniz International Proceedings in Informatics %N 30 %@ false %U http://drops.dagstuhl.de/opus/volltexte/2015/4950/http://drops.dagstuhl.de/doku/urheberrecht1.html
[183]
J. Timpner, S. Friedrichs, J. van Balen, and L. Wolf, “k-Stacks: High-Density Valet Parking for Automated Vehicles,” in IV2015, IEEE Intelligent Vehicles Symposium, Seoul, Korea, 2015.
Export
BibTeX
@inproceedings{FriedrichsIV2015, TITLE = {k-Stacks: {H}igh-Density Valet Parking for Automated Vehicles}, AUTHOR = {Timpner, Julian and Friedrichs, Stephan and van Balen, Johannes and Wolf, Lars}, LANGUAGE = {eng}, ISBN = {978-1-4673-7266-4}, DOI = {10.1109/IVS.2015.7225798}, PUBLISHER = {IEEE}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, BOOKTITLE = {IV2015, IEEE Intelligent Vehicles Symposium}, PAGES = {895--900}, ADDRESS = {Seoul, Korea}, }
Endnote
%0 Conference Proceedings %A Timpner, Julian %A Friedrichs, Stephan %A van Balen, Johannes %A Wolf, Lars %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T k-Stacks: High-Density Valet Parking for Automated Vehicles : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0029-4A46-F %R 10.1109/IVS.2015.7225798 %D 2015 %B IEEE Intelligent Vehicles Symposium %Z date of event: 2015-06-28 - 2015-07-01 %C Seoul, Korea %B IV2015 %P 895 - 900 %I IEEE %@ 978-1-4673-7266-4
[184]
D. Vaz, L. Paquete, C. M. Fonseca, K. Klamroth, and M. Sitglmayr, “Representation of the Non-dominated Set in Biobjective Discrete Optimization,” Computers & Operations Research, vol. 63, 2015.
Export
BibTeX
@article{Vaz2015, TITLE = {Representation of the Non-dominated Set in Biobjective Discrete Optimization}, AUTHOR = {Vaz, Daniel and Paquete, Lu{\'i}s and Fonseca, Carlos M. and Klamroth, Kathrin and Sitglmayr, Michael}, LANGUAGE = {eng}, DOI = {10.1016/j.cor.2015.05.003}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, DATE = {2015}, JOURNAL = {Computers \& Operations Research}, VOLUME = {63}, PAGES = {172--186}, }
Endnote
%0 Journal Article %A Vaz, Daniel %A Paquete, Lu&#237;s %A Fonseca, Carlos M. %A Klamroth, Kathrin %A Sitglmayr, Michael %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations %T Representation of the Non-dominated Set in Biobjective Discrete Optimization : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0028-4C95-D %R 10.1016/j.cor.2015.05.003 %7 2015-05-16 %D 2015 %J Computers & Operations Research %V 63 %& 172 %P 172 - 186 %I Elsevier %C Amsterdam
2014
[185]
F. Abed, I. Caragiannis, and A. A. Voudouris, “Near-optimal Asymmetric Binary Matrix Partitions,” 2014. [Online]. Available: http://arxiv.org/abs/1407.8170. (arXiv: 1407.8170)
Abstract
We study the asymmetric binary matrix partition problem that was recently introduced by Alon et al. (WINE 2013) to model the impact of asymmetric information on the revenue of the seller in take-it-or-leave-it sales. Instances of the problem consist of an $n \times m$ binary matrix $A$ and a probability distribution over its columns. A partition scheme $B=(B_1,...,B_n)$ consists of a partition $B_i$ for each row $i$ of $A$. The partition $B_i$ acts as a smoothing operator on row $i$ that distributes the expected value of each partition subset proportionally to all its entries. Given a scheme $B$ that induces a smooth matrix $A^B$, the partition value is the expected maximum column entry of $A^B$. The objective is to find a partition scheme such that the resulting partition value is maximized. We present a $9/10$-approximation algorithm for the case where the probability distribution is uniform and a $(1-1/e)$-approximation algorithm for non-uniform distributions, significantly improving results of Alon et al. Although our first algorithm is combinatorial (and very simple), the analysis is based on linear programming and duality arguments. In our second result we exploit a nice relation of the problem to submodular welfare maximization.
Export
BibTeX
@online{DBLP:journals/corr/AbedCV14, TITLE = {Near-optimal Asymmetric Binary Matrix Partitions}, AUTHOR = {Abed, Fidaa and Caragiannis, Ioannis and Voudouris, Alexandros A.}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1407.8170}, EPRINT = {1407.8170}, EPRINTTYPE = {arXiv}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We study the asymmetric binary matrix partition problem that was recently introduced by Alon et al. (WINE 2013) to model the impact of asymmetric information on the revenue of the seller in take-it-or-leave-it sales. Instances of the problem consist of an $n \times m$ binary matrix $A$ and a probability distribution over its columns. A partition scheme $B=(B_1,...,B_n)$ consists of a partition $B_i$ for each row $i$ of $A$. The partition $B_i$ acts as a smoothing operator on row $i$ that distributes the expected value of each partition subset proportionally to all its entries. Given a scheme $B$ that induces a smooth matrix $A^B$, the partition value is the expected maximum column entry of $A^B$. The objective is to find a partition scheme such that the resulting partition value is maximized. We present a $9/10$-approximation algorithm for the case where the probability distribution is uniform and a $(1-1/e)$-approximation algorithm for non-uniform distributions, significantly improving results of Alon et al. Although our first algorithm is combinatorial (and very simple), the analysis is based on linear programming and duality arguments. In our second result we exploit a nice relation of the problem to submodular welfare maximization.}, }
Endnote
%0 Report %A Abed, Fidaa %A Caragiannis, Ioannis %A Voudouris, Alexandros A. %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Near-optimal Asymmetric Binary Matrix Partitions : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-467B-5 %U http://arxiv.org/abs/1407.8170 %D 2014 %8 30.07.2014 %X We study the asymmetric binary matrix partition problem that was recently introduced by Alon et al. (WINE 2013) to model the impact of asymmetric information on the revenue of the seller in take-it-or-leave-it sales. Instances of the problem consist of an $n \times m$ binary matrix $A$ and a probability distribution over its columns. A partition scheme $B=(B_1,...,B_n)$ consists of a partition $B_i$ for each row $i$ of $A$. The partition $B_i$ acts as a smoothing operator on row $i$ that distributes the expected value of each partition subset proportionally to all its entries. Given a scheme $B$ that induces a smooth matrix $A^B$, the partition value is the expected maximum column entry of $A^B$. The objective is to find a partition scheme such that the resulting partition value is maximized. We present a $9/10$-approximation algorithm for the case where the probability distribution is uniform and a $(1-1/e)$-approximation algorithm for non-uniform distributions, significantly improving results of Alon et al. Although our first algorithm is combinatorial (and very simple), the analysis is based on linear programming and duality arguments. In our second result we exploit a nice relation of the problem to submodular welfare maximization. %K Computer Science, Computer Science and Game Theory, cs.GT,Computer Science, Computational Complexity, cs.CC
[186]
F. Abed, J. R. Correa, and C.-C. Huang, “Optimal Coordination Mechanisms for Multi-job Scheduling Games,” in Algorithms - ESA 2014, Wrocław, Poland, 2014.
Export
BibTeX
@inproceedings{DBLP:conf/esa/AbedCH14, TITLE = {Optimal Coordination Mechanisms for Multi-job Scheduling Games}, AUTHOR = {Abed, Fidaa and Correa, Jos{\'e} R. and Huang, Chien-Chung}, LANGUAGE = {eng}, ISSN = {0302-9743}, ISBN = {978-3-662-44776-5}, DOI = {10.1007/978-3-662-44777-2_2}, PUBLISHER = {Springer}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, DATE = {2014}, BOOKTITLE = {Algorithms -- ESA 2014}, EDITOR = {Schulz, Andreas S. and Wagner, Dorothea}, PAGES = {13--24}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {8737}, ADDRESS = {Wroc{\l}aw, Poland}, }
Endnote
%0 Conference Proceedings %A Abed, Fidaa %A Correa, Jos&#233; R. %A Huang, Chien-Chung %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Optimal Coordination Mechanisms for Multi-job Scheduling Games : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-4678-B %R 10.1007/978-3-662-44777-2_2 %D 2014 %B 22nd Annual European Symposium on Algorithms %Z date of event: 2014-09-08 - 2014-09-10 %C Wroc&#322;aw, Poland %B Algorithms - ESA 2014 %E Schulz, Andreas S.; Wagner, Dorothea %P 13 - 24 %I Springer %@ 978-3-662-44776-5 %B Lecture Notes in Computer Science %N 8737 %@ false
[187]
A. Adamaszek and A. Wiese, “A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices,” in Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), Portland, OR, USA, 2014.
Export
BibTeX
@inproceedings{DBLP:conf/soda/AdamaszekW14, TITLE = {A {QPTAS} for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices}, AUTHOR = {Adamaszek, Anna and Wiese, Andreas}, LANGUAGE = {eng}, DOI = {10.1137/1.9781611973402.49}, PUBLISHER = {SIAM}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, DATE = {2014}, BOOKTITLE = {Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014)}, EDITOR = {Chekuri, Chandra}, PAGES = {645--656}, ADDRESS = {Portland, OR, USA}, }
Endnote
%0 Conference Proceedings %A Adamaszek, Anna %A Wiese, Andreas %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-4385-5 %R 10.1137/1.9781611973402.49 %D 2014 %B Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2014-01-05 - 2014-01-07 %C Portland, OR, USA %B Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms %E Chekuri, Chandra %P 645 - 656 %I SIAM %U http://dx.doi.org/10.1137/1.9781611973402.49
[188]
A. Adamaszek and A. Popa, “Algorithmic and Hardness Results for the Colorful Components Problems,” in LATIN 2014: Theoretical Informatics, Montevideo, Uruguay, 2014.
Export
BibTeX
@inproceedings{DBLP:conf/latin/AdamaszekP14, TITLE = {Algorithmic and Hardness Results for the Colorful Components Problems}, AUTHOR = {Adamaszek, Anna and Popa, Alexandru}, LANGUAGE = {eng}, ISSN = {0302-9743}, ISBN = {978-3-642-54422-4}, DOI = {10.1007/978-3-642-54423-1_59}, PUBLISHER = {Springer}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, DATE = {2014}, BOOKTITLE = {LATIN 2014: Theoretical Informatics}, EDITOR = {Pardo, Alberto and Viola, Alfredo}, PAGES = {683--694}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {8392}, ADDRESS = {Montevideo, Uruguay}, }
Endnote
%0 Conference Proceedings %A Adamaszek, Anna %A Popa, Alexandru %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Algorithmic and Hardness Results for the Colorful Components Problems : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-4537-3 %R 10.1007/978-3-642-54423-1_59 %D 2014 %B 11th Latin American Theoretical Informatics Symposium %Z date of event: 2014-03-31 - 2014-04-04 %C Montevideo, Uruguay %B LATIN 2014: Theoretical Informatics %E Pardo, Alberto; Viola, Alfredo %P 683 - 694 %I Springer %@ 978-3-642-54422-4 %B Lecture Notes in Computer Science %N 8392 %@ false
[189]
A. Adamaszek, M. P. Renault, A. Rosen, and R. van Stee, “Reordering Buffer Management with Advice,” in Approximation and Online Algorithms (WAOA 2013), Sophia Antipolis, France, 2014.
Export
BibTeX
@inproceedings{AdamaszekWAOA2014, TITLE = {Reordering Buffer Management with Advice}, AUTHOR = {Adamaszek, Anna and Renault, Marc P. and Rosen, Adi and van Stee, Rob}, LANGUAGE = {eng}, ISSN = {0302-9743}, ISBN = {978-3-319-08001-7; 978-3-319-08000-0}, DOI = {10.1007/978-3-319-08001-7_12}, PUBLISHER = {Springer}, YEAR = {2013}, MARGINALMARK = {$\bullet$}, DATE = {2014}, BOOKTITLE = {Approximation and Online Algorithms (WAOA 2013)}, EDITOR = {Kaklamanis, Christos and Pruhs, Kirk}, PAGES = {132--143}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {8447}, ADDRESS = {Sophia Antipolis, France}, }
Endnote
%0 Conference Proceedings %A Adamaszek, Anna %A Renault, Marc P. %A Rosen, Adi %A van Stee, Rob %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society external Algorithms and Complexity, MPI for Informatics, Max Planck Society 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-0024-3D09-8 %F ISI: 000342842800012 %R 10.1007/978-3-319-08001-7_12 %D 2014 %B 11th Workshop on Approximation and Online Algorithms %Z date of event: 2013-09-05 - 2013-09-06 %C Sophia Antipolis, France %B Approximation and Online Algorithms %E Kaklamanis, Christos; Pruhs, Kirk %P 132 - 143 %I Springer %@ 978-3-319-08001-7 978-3-319-08000-0 %B Lecture Notes in Computer Science %N 8447 %@ false
[190]
M. Adamaszek, “Face Numbers of Down-sets,” American Mathematical Monthly. (Accepted/in press)
Export
BibTeX
@article{AdamaszekFaceNum, TITLE = {Face Numbers of Down-sets}, AUTHOR = {Adamaszek, Michal}, LANGUAGE = {eng}, PUBLISHER = {MAA}, ADDRESS = {Washington, DC}, YEAR = {2014}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, JOURNAL = {American Mathematical Monthly}, }
Endnote
%0 Journal Article %A Adamaszek, Michal %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Face Numbers of Down-sets : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-45FC-9 %D 2014 %J American Mathematical Monthly %I MAA %C Washington, DC
[191]
M. Adamaszek, H. Adams, F. Frick, C. Peterson, and C. Previte-Johnson, “Nerve Complexes of Circular Arcs,” 2014. [Online]. Available: http://arxiv.org/abs/1410.4336. (arXiv: 1410.4336)
Abstract
We show that the nerve complex of n arcs in the circle is homotopy equivalent to either a point, an odd-dimensional sphere, or a wedge sum of spheres of the same even dimension. Moreover this homotopy type can be computed in time O(n log n). For the particular case of the nerve complex of evenly-spaced arcs of the same length, we determine the dihedral group action on homology, and we relate the complex to a cyclic polytope with n vertices. We give three applications of our knowledge of the homotopy types of nerve complexes of circular arcs. First, we use the connection to cyclic polytopes to give a novel topological proof of a known upper bound on the distance between successive roots of a homogeneous trigonometric polynomial. Second, we show that the Lovasz bound on the chromatic number of a circular complete graph is either sharp or off by one. Third, we show that the Vietoris--Rips simplicial complex of n points in the circle is homotopy equivalent to either a point, an odd-dimensional sphere, or a wedge sum of spheres of the same even dimension, and furthermore this homotopy type can be computed in time O(n log n).
Export
BibTeX
@online{2014arXiv1410.4336A, TITLE = {Nerve Complexes of Circular Arcs}, AUTHOR = {Adamaszek, Michal and Adams, Henry and Frick, Florian and Peterson, Chris and Previte-Johnson, Corrine}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1410.4336}, EPRINT = {1410.4336}, EPRINTTYPE = {arXiv}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We show that the nerve complex of n arcs in the circle is homotopy equivalent to either a point, an odd-dimensional sphere, or a wedge sum of spheres of the same even dimension. Moreover this homotopy type can be computed in time O(n log n). For the particular case of the nerve complex of evenly-spaced arcs of the same length, we determine the dihedral group action on homology, and we relate the complex to a cyclic polytope with n vertices. We give three applications of our knowledge of the homotopy types of nerve complexes of circular arcs. First, we use the connection to cyclic polytopes to give a novel topological proof of a known upper bound on the distance between successive roots of a homogeneous trigonometric polynomial. Second, we show that the Lovasz bound on the chromatic number of a circular complete graph is either sharp or off by one. Third, we show that the Vietoris--Rips simplicial complex of n points in the circle is homotopy equivalent to either a point, an odd-dimensional sphere, or a wedge sum of spheres of the same even dimension, and furthermore this homotopy type can be computed in time O(n log n).}, }
Endnote
%0 Report %A Adamaszek, Michal %A Adams, Henry %A Frick, Florian %A Peterson, Chris %A Previte-Johnson, Corrine %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations %T Nerve Complexes of Circular Arcs : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-4473-5 %U http://arxiv.org/abs/1410.4336 %D 2014 %8 16.10.2014 %X We show that the nerve complex of n arcs in the circle is homotopy equivalent to either a point, an odd-dimensional sphere, or a wedge sum of spheres of the same even dimension. Moreover this homotopy type can be computed in time O(n log n). For the particular case of the nerve complex of evenly-spaced arcs of the same length, we determine the dihedral group action on homology, and we relate the complex to a cyclic polytope with n vertices. We give three applications of our knowledge of the homotopy types of nerve complexes of circular arcs. First, we use the connection to cyclic polytopes to give a novel topological proof of a known upper bound on the distance between successive roots of a homogeneous trigonometric polynomial. Second, we show that the Lovasz bound on the chromatic number of a circular complete graph is either sharp or off by one. Third, we show that the Vietoris--Rips simplicial complex of n points in the circle is homotopy equivalent to either a point, an odd-dimensional sphere, or a wedge sum of spheres of the same even dimension, and furthermore this homotopy type can be computed in time O(n log n). %K Mathematics, Algebraic Topology, math.AT,Mathematics, Combinatorics, math.CO,
[192]
M. Adamaszek, “Transitivity is Not a (Big) Restriction on Homotopy Types,” 2014. [Online]. Available: http://arxiv.org/abs/1409.4966. (arXiv: 1409.4966)
Abstract
For every simplicial complex K there exists a vertex-transitive simplicial complex homotopy equivalent to a wedge of copies of K with some copies of the circle. It follows that every simplicial complex can occur as a homotopy wedge summand in some vertex-transitive complex. One can even demand that the vertex-transitive complex is the clique complex of a Cayley graph or that it is facet-transitive.
Export
BibTeX
@online{2014arXiv1409.4966A, TITLE = {Transitivity is Not a (Big) Restriction on Homotopy Types}, AUTHOR = {Adamaszek, Michal}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1409.4966}, EPRINT = {1409.4966}, EPRINTTYPE = {arXiv}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, ABSTRACT = {For every simplicial complex K there exists a vertex-transitive simplicial complex homotopy equivalent to a wedge of copies of K with some copies of the circle. It follows that every simplicial complex can occur as a homotopy wedge summand in some vertex-transitive complex. One can even demand that the vertex-transitive complex is the clique complex of a Cayley graph or that it is facet-transitive.}, }
Endnote
%0 Report %A Adamaszek, Michal %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Transitivity is Not a (Big) Restriction on Homotopy Types : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-4478-C %U http://arxiv.org/abs/1409.4966 %D 2014 %8 17.09.2014 %X For every simplicial complex K there exists a vertex-transitive simplicial complex homotopy equivalent to a wedge of copies of K with some copies of the circle. It follows that every simplicial complex can occur as a homotopy wedge summand in some vertex-transitive complex. One can even demand that the vertex-transitive complex is the clique complex of a Cayley graph or that it is facet-transitive. %K Mathematics, Combinatorics, math.CO
[193]
K. Afanasev, “Shortest and Alternative Paths in Road Networks,” Universität des Saarlandes, Saarbrücken, 2014.
Export
BibTeX
@mastersthesis{AfanasevMaster2014, TITLE = {Shortest and Alternative Paths in Road Networks}, AUTHOR = {Afanasev, Kirill}, LANGUAGE = {eng}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, DATE = {2014}, }
Endnote
%0 Thesis %A Afanasev, Kirill %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Shortest and Alternative Paths in Road Networks : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0025-07AA-3 %I Universit&#228;t des Saarlandes %C Saarbr&#252;cken %D 2014 %P II, 46 p. %V master %9 master
[194]
E. Alkassar, S. Böhme, K. Mehlhorn, and C. Rizkallah, “A Framework for the Verification of Certifying Computations,” Journal of Automated Reasoning, vol. 52, no. 3, 2014.
Export
BibTeX
@article{AlkassarJAR2014, TITLE = {A Framework for the Verification of Certifying Computations}, AUTHOR = {Alkassar, Eyad and B{\"o}hme, Sascha and Mehlhorn, Kurt and Rizkallah, Christine}, LANGUAGE = {eng}, ISSN = {0168-7433; 1573-0670}, DOI = {10.1007/s10817-013-9289-2}, PUBLISHER = {Springer}, ADDRESS = {Dordrecht, Holland}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, DATE = {2014}, JOURNAL = {Journal of Automated Reasoning}, VOLUME = {52}, NUMBER = {3}, PAGES = {241--273}, }
Endnote
%0 Journal Article %A Alkassar, Eyad %A B&#246;hme, Sascha %A Mehlhorn, Kurt %A Rizkallah, Christine %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Framework for the Verification of Certifying Computations : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-3DF3-7 %R 10.1007/s10817-013-9289-2 %7 2013-06-29 %D 2014 %K Computer Science, Logic in Computer Science, cs.LO,Computer Science, Data Structures and Algorithms, cs.DS,Computer Science, Formal Languages and Automata Theory, cs.FL %J Journal of Automated Reasoning %V 52 %N 3 %& 241 %P 241 - 273 %I Springer %C Dordrecht, Holland %@ false
[195]
N. Alon, S. Moran, and A. Yehudayoff, “Sign Rank, VC Dimension and Spectral Gaps,” Electronic Colloquium on Computational Complexity (ECCC) : Report Series, vol. 135, 2014.
Export
BibTeX
@article{DBLP:journals/eccc/AlonMY14, TITLE = {Sign Rank, {VC} Dimension and Spectral Gaps}, AUTHOR = {Alon, Noga and Moran, Shay and Yehudayoff, Amir}, LANGUAGE = {eng}, ISSN = {1433-8092}, PUBLISHER = {Hasso-Plattner-Institut f{\"u}r Softwaretechnik GmbH}, ADDRESS = {Potsdam}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, JOURNAL = {Electronic Colloquium on Computational Complexity (ECCC) : Report Series}, VOLUME = {135}, PAGES = {1--28}, }
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, VC Dimension and Spectral Gaps : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-5A64-3 %7 2014-10-23 %D 2014 %8 23.10.2014 %J Electronic Colloquium on Computational Complexity (ECCC) : Report Series %V 135 %& 1 %P 1 - 28 %I Hasso-Plattner-Institut f&#252;r Softwaretechnik GmbH %C Potsdam %@ false %U http://eccc.hpi-web.de/report/2014/135
[196]
A. Anagnostopoulos, F. Grandoni, S. Leonardi, and A. Wiese, “A Mazing 2+ε Approximation for Unsplittable Flow on a Path,” in Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), Portland, OR, USA, 2014.
Export
BibTeX
@inproceedings{DBLP:conf/soda/AnagnostopoulosGLW14, TITLE = {A Mazing 2+$\varepsilon$ Approximation for Unsplittable Flow on a Path}, AUTHOR = {Anagnostopoulos, Aris and Grandoni, Fabrizio and Leonardi, Stefano and Wiese, Andreas}, LANGUAGE = {eng}, ISBN = {978-1-61197-338-9}, DOI = {10.1137/1.9781611973402.3}, PUBLISHER = {SIAM}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, DATE = {2014}, BOOKTITLE = {Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014)}, EDITOR = {Chekuri, Chandra}, PAGES = {26--41}, ADDRESS = {Portland, OR, USA}, }
Endnote
%0 Conference Proceedings %A Anagnostopoulos, Aris %A Grandoni, Fabrizio %A Leonardi, Stefano %A Wiese, Andreas %+ External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Mazing 2+&#949; Approximation for Unsplittable Flow on a Path : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-4381-D %R 10.1137/1.9781611973402.3 %D 2014 %B Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2014-01-05 - 2014-01-07 %C Portland, OR, USA %B Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms %E Chekuri, Chandra %P 26 - 41 %I SIAM %@ 978-1-61197-338-9 %U http://dx.doi.org/10.1137/1.9781611973402.3
[197]
A. Antoniadis, N. Barcelo, M. Nugent, K. Pruhs, and M. Scquizzato, “Complexity-theoretic Obstacles to Achieving Energy Savings with Near-threshold Computing,” in 2014 International Green Computing Conference Proceedings (IGCC 2014), Dallas, TX, USA, 2014.
Export
BibTeX
@inproceedings{ABNPS14-2, TITLE = {Complexity-theoretic Obstacles to Achieving Energy Savings with Near-threshold Computing}, AUTHOR = {Antoniadis, Antonios and Barcelo, Neal and Nugent, Michael and Pruhs, Kirk and Scquizzato, Michele}, LANGUAGE = {eng}, DOI = {10.1109/IGCC.2014.7039142}, PUBLISHER = {IEEE}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, DATE = {2014}, BOOKTITLE = {2014 International Green Computing Conference Proceedings (IGCC 2014)}, ADDRESS = {Dallas, TX, USA}, }
Endnote
%0 Conference Proceedings %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 Complexity-theoretic Obstacles to Achieving Energy Savings with Near-threshold Computing : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-43DD-1 %R 10.1109/IGCC.2014.7039142 %D 2014 %B 5th International Green Computing Conference %Z date of event: 2014-11-03 - 2014-11-05 %C Dallas, TX, USA %B 2014 International Green Computing Conference Proceedings %I IEEE
[198]
A. Antoniadis, C.-C. Huang, and S. Ott, “A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State,” 2014. [Online]. Available: http://arxiv.org/abs/1407.0892. (arXiv: 1407.0892)
Abstract
We study classical deadline-based preemptive scheduling of tasks in a computing environment equipped with both dynamic speed scaling and sleep state capabilities: Each task is specified by a release time, a deadline and a processing volume, and has to be scheduled on a single, speed-scalable processor that is supplied with a sleep state. In the sleep state, the processor consumes no energy, but a constant wake-up cost is required to transition back to the active state. In contrast to speed scaling alone, the addition of a sleep state makes it sometimes beneficial to accelerate the processing of tasks in order to transition the processor to the sleep state for longer amounts of time and incur further energy savings. The goal is to output a feasible schedule that minimizes the energy consumption. Since the introduction of the problem by Irani et al. [16], its exact computational complexity has been repeatedly posed as an open question (see e.g. [2,8,15]). The currently best known upper and lower bounds are a 4/3-approximation algorithm and NP-hardness due to [2] and [2,17], respectively. We close the aforementioned gap between the upper and lower bound on the computational complexity of speed scaling with sleep state by presenting a fully polynomial-time approximation scheme for the problem. The scheme is based on a transformation to a non-preemptive variant of the problem, and a discretization that exploits a carefully defined lexicographical ordering among schedules.
Export
BibTeX
@online{DBLP:journals/corr/AntoniadisHO14, TITLE = {A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State}, AUTHOR = {Antoniadis, Antonios and Huang, Chien-Chung and Ott, Sebastian}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1407.0892}, EPRINT = {1407.0892}, EPRINTTYPE = {arXiv}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We study classical deadline-based preemptive scheduling of tasks in a computing environment equipped with both dynamic speed scaling and sleep state capabilities: Each task is specified by a release time, a deadline and a processing volume, and has to be scheduled on a single, speed-scalable processor that is supplied with a sleep state. In the sleep state, the processor consumes no energy, but a constant wake-up cost is required to transition back to the active state. In contrast to speed scaling alone, the addition of a sleep state makes it sometimes beneficial to accelerate the processing of tasks in order to transition the processor to the sleep state for longer amounts of time and incur further energy savings. The goal is to output a feasible schedule that minimizes the energy consumption. Since the introduction of the problem by Irani et al. [16], its exact computational complexity has been repeatedly posed as an open question (see e.g. [2,8,15]). The currently best known upper and lower bounds are a 4/3-approximation algorithm and NP-hardness due to [2] and [2,17], respectively. We close the aforementioned gap between the upper and lower bound on the computational complexity of speed scaling with sleep state by presenting a fully polynomial-time approximation scheme for the problem. The scheme is based on a transformation to a non-preemptive variant of the problem, and a discretization that exploits a carefully defined lexicographical ordering among schedules.}, }
Endnote
%0 Report %A Antoniadis, Antonios %A Huang, Chien-Chung %A Ott, Sebastian %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-42C2-0 %U http://arxiv.org/abs/1407.0892 %D 2014 %8 03.07.2014 %X We study classical deadline-based preemptive scheduling of tasks in a computing environment equipped with both dynamic speed scaling and sleep state capabilities: Each task is specified by a release time, a deadline and a processing volume, and has to be scheduled on a single, speed-scalable processor that is supplied with a sleep state. In the sleep state, the processor consumes no energy, but a constant wake-up cost is required to transition back to the active state. In contrast to speed scaling alone, the addition of a sleep state makes it sometimes beneficial to accelerate the processing of tasks in order to transition the processor to the sleep state for longer amounts of time and incur further energy savings. The goal is to output a feasible schedule that minimizes the energy consumption. Since the introduction of the problem by Irani et al. [16], its exact computational complexity has been repeatedly posed as an open question (see e.g. [2,8,15]). The currently best known upper and lower bounds are a 4/3-approximation algorithm and NP-hardness due to [2] and [2,17], respectively. We close the aforementioned gap between the upper and lower bound on the computational complexity of speed scaling with sleep state by presenting a fully polynomial-time approximation scheme for the problem. The scheme is based on a transformation to a non-preemptive variant of the problem, and a discretization that exploits a carefully defined lexicographical ordering among schedules. %K Computer Science, Data Structures and Algorithms, cs.DS
[199]
M. Babenko, P. Gawrychowski, T. Kociumaka, and T. A. Starikovskaya, “Computing Minimal and Maximal Suffixes of a Substring Revisited,” in Combinatorial Pattern Matching (CPM 2014), Moscow, Russia, 2014.
Export
BibTeX
@inproceedings{Gawrychowski2014d, TITLE = {Computing Minimal and Maximal Suffixes of a Substring Revisited}, AUTHOR = {Babenko, Maxim and Gawrychowski, Pawel and Kociumaka, Tomasz and Starikovskaya, Tatiana A.}, LANGUAGE = {eng}, ISBN = {978-3-319-07565-5}, DOI = {10.1007/978-3-319-07566-2_4}, PUBLISHER = {Springer}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, DATE = {2014}, BOOKTITLE = {Combinatorial Pattern Matching (CPM 2014)}, EDITOR = {Kulikov, Alexander S. and Kuznetsov, Sergei O. and Pevzner, Pavel A.}, PAGES = {30--39}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {8486}, ADDRESS = {Moscow, Russia}, }
Endnote
%0 Conference Proceedings %A Babenko, Maxim %A Gawrychowski, Pawel %A Kociumaka, Tomasz %A Starikovskaya, Tatiana A. %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Computing Minimal and Maximal Suffixes of a Substring Revisited : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-24C6-5 %R 10.1007/978-3-319-07566-2_4 %D 2014 %B 25th Annual Symposium on Combinatorial Pattern Matching %Z date of event: 2014-06-16 - 2014-06-18 %C Moscow, Russia %B Combinatorial Pattern Matching %E Kulikov, Alexander S.; Kuznetsov, Sergei O.; Pevzner, Pavel A. %P 30 - 39 %I Springer %@ 978&#8208;3&#8208;319&#8208;07565&#8208;5 %B Lecture Notes in Computer Science %N 8486
[200]
M. Babenko, P. Gawrychowski, T. Kociumaka, and T. Starikovskaya, “Wavelet Trees Meet Suffix Trees,” 2014. [Online]. Available: http://arxiv.org/abs/1408.6182. (arXiv: 1408.6182)
Abstract
We present an improved wavelet tree construction algorithm and discuss its applications to a number of rank/select problems for integer keys and strings. Given a string of length n over an alphabet of size $\sigma\leq n$, our method builds the wavelet tree in $O(n \log \sigma/ \sqrt{\log{n}})$ time, improving upon the state-of-the-art algorithm by a factor of $\sqrt{\log n}$. As a consequence, given an array of n integers we can construct in $O(n \sqrt{\log n})$ time a data structure consisting of $O(n)$ machine words and capable of answering rank/select queries for the subranges of the array in $O(\log n / \log \log n)$ time. This is a $\log \log n$-factor improvement in query time compared to Chan and P\u{a}tra\c{s}cu and a $\sqrt{\log n}$-factor improvement in construction time compared to Brodal et al. Next, we switch to stringological context and propose a novel notion of wavelet suffix trees. For a string w of length n, this data structure occupies $O(n)$ words, takes $O(n \sqrt{\log n})$ time to construct, and simultaneously captures the combinatorial structure of substrings of w while enabling efficient top-down traversal and binary search. In particular, with a wavelet suffix tree we are able to answer in $O(\log |x|)$ time the following two natural analogues of rank/select queries for suffixes of substrings: for substrings x and y of w count the number of suffixes of x that are lexicographically smaller than y, and for a substring x of w and an integer k, find the k-th lexicographically smallest suffix of x. We further show that wavelet suffix trees allow to compute a run-length-encoded Burrows-Wheeler transform of a substring x of w in $O(s \log |x|)$ time, where s denotes the length of the resulting run-length encoding. This answers a question by Cormode and Muthukrishnan, who considered an analogous problem for Lempel-Ziv compression.
Export
BibTeX
@online{BabenkoWaveletarXiv2014, TITLE = {Wavelet Trees Meet Suffix Trees}, AUTHOR = {Babenko, Maxim and Gawrychowski, Pawel and Kociumaka, Tomasz and Starikovskaya, Tatiana}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1408.6182}, EPRINT = {1408.6182}, EPRINTTYPE = {arXiv}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, ABSTRACT = {We present an improved wavelet tree construction algorithm and discuss its applications to a number of rank/select problems for integer keys and strings. Given a string of length n over an alphabet of size $\sigma\leq n$, our method builds the wavelet tree in $O(n \log \sigma/ \sqrt{\log{n}})$ time, improving upon the state-of-the-art algorithm by a factor of $\sqrt{\log n}$. As a consequence, given an array of n integers we can construct in $O(n \sqrt{\log n})$ time a data structure consisting of $O(n)$ machine words and capable of answering rank/select queries for the subranges of the array in $O(\log n / \log \log n)$ time. This is a $\log \log n$-factor improvement in query time compared to Chan and P\u{a}tra\c{s}cu and a $\sqrt{\log n}$-factor improvement in construction time compared to Brodal et al. Next, we switch to stringological context and propose a novel notion of wavelet suffix trees. For a string w of length n, this data structure occupies $O(n)$ words, takes $O(n \sqrt{\log n})$ time to construct, and simultaneously captures the combinatorial structure of substrings of w while enabling efficient top-down traversal and binary search. In particular, with a wavelet suffix tree we are able to answer in $O(\log |x|)$ time the following two natural analogues of rank/select queries for suffixes of substrings: for substrings x and y of w count the number of suffixes of x that are lexicographically smaller than y, and for a substring x of w and an integer k, find the k-th lexicographically smallest suffix of x. We further show that wavelet suffix trees allow to compute a run-length-encoded Burrows-Wheeler transform of a substring x of w in $O(s \log |x|)$ time, where s denotes the length of the resulting run-length encoding. This answers a question by Cormode and Muthukrishnan, who considered an analogous problem for Lempel-Ziv compression.}, }
Endnote
%0 Report %A Babenko, Maxim %A Gawrychowski, Pawel %A Kociumaka, Tomasz %A Starikovskaya, Tatiana %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Wavelet Trees Meet Suffix Trees : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-4A04-F %U http://arxiv.org/abs/1408.6182 %D 2014 %X We present an improved wavelet tree construction algorithm and discuss its applications to a number of rank/select problems for integer keys and strings. Given a string of length n over an alphabet of size $\sigma\leq n$, our method builds the wavelet tree in $O(n \log \sigma/ \sqrt{\log{n}})$ time, improving upon the state-of-the-art algorithm by a factor of $\sqrt{\log n}$. As a consequence, given an array of n integers we can construct in $O(n \sqrt{\log n})$ time a data structure consisting of $O(n)$ machine words and capable of answering rank/select queries for the subranges of the array in $O(\log n / \log \log n)$ time. This is a $\log \log n$-factor improvement in query time compared to Chan and P\u{a}tra\c{s}cu and a $\sqrt{\log n}$-factor improvement in construction time compared to Brodal et al. Next, we switch to stringological context and propose a novel notion of wavelet suffix trees. For a string w of length n, this data structure occupies $O(n)$ words, takes $O(n \sqrt{\log n})$ time to construct, and simultaneously captures the combinatorial structure of substrings of w while enabling efficient top-down traversal and binary search. In particular, with a wavelet suffix tree we are able to answer in $O(\log |x|)$ time the following two natural analogues of rank/select queries for suffixes of substrings: for substrings x and y of w count the number of suffixes of x that are lexicographically smaller than y, and for a substring x of w and an integer k, find the k-th lexicographically smallest suffix of x. We further show that wavelet suffix trees allow to compute a run-length-encoded Burrows-Wheeler transform of a substring x of w in $O(s \log |x|)$ time, where s denotes the length of the resulting run-length encoding. This answers a question by Cormode and Muthukrishnan, who considered an analogous problem for Lempel-Ziv compression. %K Computer Science, Data Structures and Algorithms, cs.DS,
[201]
B. Bauer, S. Moran, and A. Yehudayoff, “Internal Compression of Protocols to Entropy,” Electronic Colloquium on Computational Complexity (ECCC) : Report Series, vol. 101, 2014.
Export
BibTeX
@article{DBLP:journals/eccc/BauerMY14, TITLE = {Internal Compression of Protocols to Entropy}, AUTHOR = {Bauer, Balthazar and Moran, Shay and Yehudayoff, Amir}, LANGUAGE = {eng}, ISSN = {1433-8092}, PUBLISHER = {Hasso-Plattner-Institut f{\"u}r Softwaretechnik GmbH}, ADDRESS = {Potsdam}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, JOURNAL = {Electronic Colloquium on Computational Complexity (ECCC) : Report Series}, VOLUME = {101}, PAGES = {1--21}, }
Endnote
%0 Journal Article %A Bauer, Balthazar %A Moran, Shay %A Yehudayoff, Amir %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Internal Compression of Protocols to Entropy : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-5A77-A %7 2014-08-08 %D 2014 %8 08.08.2014 %J Electronic Colloquium on Computational Complexity (ECCC) : Report Series %V 101 %& 1 %P 1 - 21 %I Hasso-Plattner-Institut f&#252;r Softwaretechnik GmbH %C Potsdam %@ false %U http://eccc.hpi-web.de/report/2014/101
[202]
U. Bauer, M. Kerber, J. Reininghaus, and H. Wagner, “PHAT - Persistent Homology Algorithms Toolbox,” in Mathematical Software - ICMS 2014, Seoul, South Korea, 2014.
Export
BibTeX
@inproceedings{DBLP:conf/icms/BauerKRW14, TITLE = {{PHAT} -- {P}ersistent {H}omology {A}lgorithms {T}oolbox}, AUTHOR = {Bauer, Ulrich and Kerber, Michael and Reininghaus, Jan and Wagner, Hubert}, LANGUAGE = {eng}, ISBN = {978-3-662-44198-5}, DOI = {10.1007/978-3-662-44199-2_24}, PUBLISHER = {Springer}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, DATE = {2014}, BOOKTITLE = {Mathematical Software -- ICMS 2014}, EDITOR = {Hong, Hoon and Yap, Chee}, PAGES = {137--143}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {8592}, ADDRESS = {Seoul, South Korea}, }
Endnote
%0 Conference Proceedings %A Bauer, Ulrich %A Kerber, Michael %A Reininghaus, Jan %A Wagner, Hubert %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations %T PHAT - Persistent Homology Algorithms Toolbox : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-4787-0 %R 10.1007/978-3-662-44199-2_24 %D 2014 %B 4th International Congress on Mathematical Software %Z date of event: 2014-08-05 - 2014-08-09 %C Seoul, South Korea %B Mathematical Software - ICMS 2014 %E Hong, Hoon; Yap, Chee %P 137 - 143 %I Springer %@ 978-3-662-44198-5 %B Lecture Notes in Computer Science %N 8592
[203]
U. Bauer, M. Kerber, and J. Reininghaus, “Distributed Computation of Persistent Homology,” in ALENEX14, Sixteenth Workshop on Algorithm Engineering and Experiments, Portland, OR, USA, 2014.
Export
BibTeX
@inproceedings{DBLP:conf/alenex/BauerKR14, TITLE = {Distributed Computation of Persistent Homology}, AUTHOR = {Bauer, Ulrich and Kerber, Michael and Reininghaus, Jan}, LANGUAGE = {eng}, DOI = {10.1137/1.9781611973198.4}, PUBLISHER = {SIAM}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, DATE = {2014}, BOOKTITLE = {ALENEX14, Sixteenth Workshop on Algorithm Engineering and Experiments}, EDITOR = {McGeoch, Catherine C. and Meyer, Ulrich}, PAGES = {31--38}, ADDRESS = {Portland, OR, USA}, }
Endnote
%0 Conference Proceedings %A Bauer, Ulrich %A Kerber, Michael %A Reininghaus, Jan %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Distributed Computation of Persistent Homology : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-478B-8 %R 10.1137/1.9781611973198.4 %D 2014 %B Sixteenth Workshop on Algorithm Engineering and Experiments %Z date of event: 2014-01-05 - %C Portland, OR, USA %B ALENEX14 %E McGeoch, Catherine C.; Meyer, Ulrich %P 31 - 38 %I SIAM
[204]
U. Bauer, M. Kerber, and J. Reininghaus, “Clear and Compress: Computing Persistent Homology in Chunks,” in Topological Methods in Data Analysis and Visualization III, Cham: Springer International, 2014.
Export
BibTeX
@incollection{BauerKerberReininghaus2014, TITLE = {Clear and Compress: {Computing} Persistent Homology in Chunks}, AUTHOR = {Bauer, Ulrich and Kerber, Michael and Reininghaus, Jan}, LANGUAGE = {eng}, ISSN = {1612-3786}, ISBN = {978-3-319-04098-1}, DOI = {10.1007/978-3-319-04099-8_7}, PUBLISHER = {Springer International}, ADDRESS = {Cham}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, DATE = {2014}, BOOKTITLE = {Topological Methods in Data Analysis and Visualization III}, EDITOR = {Bremer, Peer-Timo and Hotz, Ingrid and Pascucci, Valerio and Peikert, Ronald}, PAGES = {103--117}, SERIES = {Mathematics and Visualization}, }
Endnote
%0 Book Section %A Bauer, Ulrich %A Kerber, Michael %A Reininghaus, Jan %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Clear and Compress: Computing Persistent Homology in Chunks : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-902C-6 %R 10.1007/978-3-319-04099-8_7 %D 2014 %B Topological Methods in Data Analysis and Visualization III %E Bremer, Peer-Timo; Hotz, Ingrid; Pascucci, Valerio; Peikert, Ronald %P 103 - 117 %I Springer International %C Cham %@ 978-3-319-04098-1 %S Mathematics and Visualization %@ false
[205]
R. Becker, “A Simple Efficient Interior Point Method for Min-cost Flow,” Universität des Saarlandes, Saarbrücken, 2014.
Export
BibTeX
@mastersthesis{BeckerMaster2014, TITLE = {A Simple Efficient Interior Point Method for Min-cost Flow}, AUTHOR = {Becker, Ruben}, LANGUAGE = {eng}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, DATE = {2014}, }
Endnote
%0 Thesis %A Becker, Ruben %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Simple Efficient Interior Point Method for Min-cost Flow : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-9406-5 %I Universit&#228;t des Saarlandes %C Saarbr&#252;cken %D 2014 %V master %9 master
[206]
R. Becker and A. Karrenbauer, “A Simple Efficient Interior Point Method for Min-cost Flow,” in Algorithms and Computation (ISAAC 2014), Jeonju, Korea, 2014.
Export
BibTeX
@inproceedings{BK2014, TITLE = {A Simple Efficient Interior Point Method for Min-cost Flow}, AUTHOR = {Becker, Ruben and Karrenbauer, Andreas}, LANGUAGE = {eng}, ISBN = {978-3-319-13074-3}, DOI = {10.1007/978-3-319-13075-0_59}, PUBLISHER = {Springer}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, DATE = {2014}, BOOKTITLE = {Algorithms and Computation (ISAAC 2014)}, EDITOR = {Ahn, Hee-Kap and Shin, Chan-Su}, PAGES = {753--765}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {8889}, ADDRESS = {Jeonju, Korea}, }
Endnote
%0 Conference Proceedings %A Becker, Ruben %A Karrenbauer, Andreas %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Simple Efficient Interior Point Method for Min-cost Flow : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-43EF-A %R 10.1007/978-3-319-13075-0_59 %D 2014 %B 25th International Symposium on Algorithms and Computation %Z date of event: 2014-12-15 - 2014-12-17 %C Jeonju, Korea %B Algorithms and Computation %E Ahn, Hee-Kap; Shin, Chan-Su %P 753 - 765 %I Springer %@ 978-3-319-13074-3 %B Lecture Notes in Computer Science %N 8889
[207]
M. A. Bender, M. Farach-Colton, M. Goswami, D. Medjedovic, P. Montes, and M.-T. Tsai, “The Batched Predecessor Problem in External Memory,” in Algorithms - ESA 2014, Wrocław, Poland, 2014.
Export
BibTeX
@inproceedings{DBLP:conf/esa/BenderFGMMT14, TITLE = {The Batched Predecessor Problem in External Memory}, AUTHOR = {Bender, Michael A. and Farach-Colton, Martin and Goswami, Mayank and Medjedovic, Dzejla and Montes, Pablo and Tsai, Meng-Tsung}, LANGUAGE = {eng}, ISSN = {0302-9743}, ISBN = {978-3-662-44776-5}, DOI = {10.1007/978-3-662-44777-2_10}, PUBLISHER = {Springer}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, DATE = {2014}, BOOKTITLE = {Algorithms -- ESA 2014}, EDITOR = {Schulz, Andreas S. and Wagner, Dorothea}, PAGES = {112--124}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {8737}, ADDRESS = {Wroc{\l}aw, Poland}, }
Endnote
%0 Conference Proceedings %A Bender, Michael A. %A Farach-Colton, Martin %A Goswami, Mayank %A Medjedovic, Dzejla %A Montes, Pablo %A Tsai, Meng-Tsung %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T The Batched Predecessor Problem in External Memory : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-4541-D %R 10.1007/978-3-662-44777-2_10 %D 2014 %B 22nd Annual European Symposium on Algorithms %Z date of event: 2014-09-08 - 2014-09-10 %C Wroc&#322;aw, Poland %B Algorithms - ESA 2014 %E Schulz, Andreas S.; Wagner, Dorothea %P 112 - 124 %I Springer %@ 978-3-662-44776-5 %B Lecture Notes in Computer Science %N 8737 %@ false
[208]
E. Berberich, “Robustly and Efficiently Computing Algebraic Curves and Surfaces,” in Mathematical Software - ICMS 2014, Seoul, South Korea, 2014.
Export
BibTeX
@inproceedings{DBLP:conf/icms/Berberich14a, TITLE = {Robustly and Efficiently Computing Algebraic Curves and Surfaces}, AUTHOR = {Berberich, Eric}, LANGUAGE = {eng}, DOI = {10.1007/978-3-662-44199-2_40}, PUBLISHER = {Springer}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, DATE = {2014}, BOOKTITLE = {Mathematical Software -- ICMS 2014}, EDITOR = {Hong, Hoon and Yap, Chee}, PAGES = {253--260}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {8592}, ADDRESS = {Seoul, South Korea}, }
Endnote
%0 Conference Proceedings %A Berberich, Eric %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Robustly and Efficiently Computing Algebraic Curves and Surfaces : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-43C1-E %R 10.1007/978-3-662-44199-2_40 %D 2014 %B 4th International Congress on Mathematical Software %Z date of event: 2014-08-05 - 2014-08-09 %C Seoul, South Korea %B Mathematical Software - ICMS 2014 %E Hong, Hoon; Yap, Chee %P 253 - 260 %I Springer %B Lecture Notes in Computer Science %N 8592
[209]
E. Berberich, “CGAL - Reliable Geometric Computing for Academia and Industry,” in Mathematical Software - ICMS 2014, Seoul, South Korea, 2014.
Export
BibTeX
@inproceedings{DBLP:conf/icms/Berberich14, TITLE = {{CGAL} -- Reliable Geometric Computing for Academia and Industry}, AUTHOR = {Berberich, Eric}, LANGUAGE = {eng}, ISBN = {978-3-662-44198-5}, DOI = {10.1007/978-3-662-44199-2_31}, PUBLISHER = {Springer}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, DATE = {2014}, BOOKTITLE = {Mathematical Software -- ICMS 2014}, EDITOR = {Hong, Hoon and Yap, Chee}, PAGES = {191--197}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {8592}, ADDRESS = {Seoul, South Korea}, }
Endnote
%0 Conference Proceedings %A Berberich, Eric %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society %T CGAL - Reliable Geometric Computing for Academia and Industry : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-43C4-8 %R 10.1007/978-3-662-44199-2_31 %D 2014 %B 4th International Congress on Mathematical Software %Z date of event: 2014-08-05 - 2014-08-09 %C Seoul, South Korea %B Mathematical Software - ICMS 2014 %E Hong, Hoon; Yap, Chee %P 191 - 197 %I Springer %@ 978-3-662-44198-5 %B Lecture Notes in Computer Science %N 8592 %U http://dx.doi.org/10.1007/978-3-662-44199-2_31
[210]
P. Berenbrink, M. Hoefer, and T. Sauerwald, “Distributed Selfish Load Balancing on Networks,” ACM Transactions on Algorithms, vol. 11, no. 1, 2014.
Export
BibTeX
@article{DBLP:journals/talg/BerenbrinkHS14, TITLE = {Distributed Selfish Load Balancing on Networks}, AUTHOR = {Berenbrink, Petra and Hoefer, Martin and Sauerwald, Thomas}, LANGUAGE = {eng}, ISSN = {1549-6325}, DOI = {10.1145/2629671}, PUBLISHER = {ACM}, ADDRESS = {New York, NY}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, DATE = {2014}, JOURNAL = {ACM Transactions on Algorithms}, VOLUME = {11}, NUMBER = {1}, PAGES = {1--29}, EID = {2}, }
Endnote
%0 Journal Article %A Berenbrink, Petra %A Hoefer, Martin %A Sauerwald, Thomas %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Distributed Selfish Load Balancing on Networks : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-4087-4 %R 10.1145/2629671 %7 2014 %D 2014 %J ACM Transactions on Algorithms %V 11 %N 1 %& 1 %P 1 - 29 %Z sequence number: 2 %I ACM %C New York, NY %@ false %U http://doi.acm.org/10.1145/2629671
[211]
P. Berenbrink, R. Elsaesser, and T. Sauerwald, “Randomised Broadcasting: Memory vs. Randomness,” Theoretical Computer Science, vol. 520, 2014.
Export
BibTeX
@article{Berenbrink2014, TITLE = {Randomised Broadcasting: Memory vs. Randomness}, AUTHOR = {Berenbrink, Petra and Elsaesser, Robert and Sauerwald, Thomas}, LANGUAGE = {eng}, ISSN = {0304-3975}, DOI = {10.1016/j.tcs.2013.08.011}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, DATE = {2014}, JOURNAL = {Theoretical Computer Science}, VOLUME = {520}, PAGES = {27--42}, }
Endnote
%0 Journal Article %A Berenbrink, Petra %A Elsaesser, Robert %A Sauerwald, Thomas %+ external external Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Randomised Broadcasting: Memory vs. Randomness : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-3DEE-8 %F ISI: 000331432800003 %R 10.1016/j.tcs.2013.08.011 %7 2013-08-28 %D 2014 %J Theoretical Computer Science %V 520 %& 27 %P 27 - 42 %I Elsevier %C Amsterdam %@ false
[212]
P. Bertrand and C. Lenzen, “The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm,” 2014. [Online]. Available: http://arxiv.org/abs/1407.8433. (arXiv: 1407.8433)
Abstract
In this work, we examine a generic class of simple distributed balls-into-bins algorithms. Exploiting the strong concentration bounds that apply to balls-into-bins games, we provide an iterative method to compute accurate estimates of the remaining balls and the load distribution after each round. Each algorithm is classified by (i) the load that bins accept in a given round, (ii) the number of messages each ball sends in a given round, and (iii) whether each such message is given a rank expressing the sender's inclination to commit to the receiving bin (if feasible). This novel ranking mechanism results in notable improvements, in particular in the number of balls that may commit to a bin in the first round of the algorithm. Simulations independently verify the correctness of the results and confirm that our approximation is highly accurate even for a moderate number of $10^6$ balls and bins.
Export
BibTeX
@online{BertrandL14, TITLE = {The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm}, AUTHOR = {Bertrand, Pierre and Lenzen, Christoph}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1407.8433}, EPRINT = {1407.8433}, EPRINTTYPE = {arXiv}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, ABSTRACT = {In this work, we examine a generic class of simple distributed balls-into-bins algorithms. Exploiting the strong concentration bounds that apply to balls-into-bins games, we provide an iterative method to compute accurate estimates of the remaining balls and the load distribution after each round. Each algorithm is classified by (i) the load that bins accept in a given round, (ii) the number of messages each ball sends in a given round, and (iii) whether each such message is given a rank expressing the sender's inclination to commit to the receiving bin (if feasible). This novel ranking mechanism results in notable improvements, in particular in the number of balls that may commit to a bin in the first round of the algorithm. Simulations independently verify the correctness of the results and confirm that our approximation is highly accurate even for a moderate number of $10^6$ balls and bins.}, }
Endnote
%0 Report %A Bertrand, Pierre %A Lenzen, Christoph %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-48B4-2 %U http://arxiv.org/abs/1407.8433 %D 2014 %8 31.07.2014 %X In this work, we examine a generic class of simple distributed balls-into-bins algorithms. Exploiting the strong concentration bounds that apply to balls-into-bins games, we provide an iterative method to compute accurate estimates of the remaining balls and the load distribution after each round. Each algorithm is classified by (i) the load that bins accept in a given round, (ii) the number of messages each ball sends in a given round, and (iii) whether each such message is given a rank expressing the sender's inclination to commit to the receiving bin (if feasible). This novel ranking mechanism results in notable improvements, in particular in the number of balls that may commit to a bin in the first round of the algorithm. Simulations independently verify the correctness of the results and confirm that our approximation is highly accurate even for a moderate number of $10^6$ balls and bins. %K Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC
[213]
P. Bertrand and C. Lenzen, “Brief Announcement: The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm,” in Distributed Computing (DISC 2014), Austin, TX, USA, 2014.
Export
BibTeX
@inproceedings{Betrand22014, TITLE = {Brief Announcement: The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm}, AUTHOR = {Bertrand, Pierre and Lenzen, Christoph}, LANGUAGE = {eng}, ISBN = {978-3-662-45173-1}, PUBLISHER = {Springer}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, DATE = {2014}, BOOKTITLE = {Distributed Computing (DISC 2014)}, EDITOR = {Kuhn, Fabian}, PAGES = {557--558}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {8784}, ADDRESS = {Austin, TX, USA}, }
Endnote
%0 Conference Proceedings %A Bertrand, Pierre %A Lenzen, Christoph %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Brief Announcement: The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0027-AA17-C %D 2014 %B 24th International Symposium on Distributed Computing %Z date of event: 2014-10-12 - 2014-10-15 %C Austin, TX, USA %B Distributed Computing %E Kuhn, Fabian %P 557 - 558 %I Springer %@ 978-3-662-45173-1 %B Lecture Notes in Computer Science %N 8784
[214]
S. Bhattacharya, S. Im, J. Kulkarni, and K. Munagala, “Coordination Mechanisms from (almost) all Scheduling Policies,” in ITCS’14, 5th Conference on Innovations in Theoretical Computer Science, Princeton, NJ, USA, 2014.
Export
BibTeX
@inproceedings{DBLP:conf/innovations/BhattacharyaIKM14, TITLE = {Coordination Mechanisms from (almost) all Scheduling Policies}, AUTHOR = {Bhattacharya, Sayan and Im, Sungjin and Kulkarni, Janardhan and Munagala, Kamesh}, LANGUAGE = {eng}, ISBN = {978-1-4503-2243-0}, DOI = {10.1145/2554797.2554811}, PUBLISHER = {ACM}, YEAR = {2014}, MARGINALMARK = {$\bullet$}, DATE = {2014}, BOOKTITLE = {ITCS'14, 5th Conference on Innovations in Theoretical Computer Science}, EDITOR = {Naor, Moni}, PAGES = {121--134}, ADDRESS = {Princeton, NJ, USA}, }
Endnote
%0 Conference Proceedings %A Bhattacharya, Sayan %A Im, Sungjin %A Kulkarni, Janardhan %A Munagala, Kamesh %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T Coordination Mechanisms from (almost) all Scheduling Policies : %G eng %U http://hdl.handle.net/11858/00-001M-0000-0024-4476-0 %R 10.1145/2554797.2554811 %D 2014 %B 5th Conference on Innovations in Theoretical Computer Science %Z date of event: 2014-01-12 - 2014-01-14 %C Princeton, NJ, USA %B ITCS'14 %E Naor, Moni %P 121 - 134 %I ACM %@ 978-1-4503-2243-0
[215]
S. Bhattacharya, J. Kulkarni, and V. S. Mirrokni, “Coordination Mechanisms for Selfish Routing over Time on a Tree,” in Automata, Languages, and Programming (ICALP 2014), Copenhagen, Denmark, 2014.