Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Saeed Akhoondian Amiri"'
Autor:
Saeed Akhoondian Amiri, Ben Wiederhake
Publikováno v:
Theoretical Computer Science. 906:18-31
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::369170cace96acfd9797aa79b5c5579d
https://doi.org/10.1016/j.tcs.2022.01.001
https://doi.org/10.1016/j.tcs.2022.01.001
Autor:
Saeed Akhoondian Amiri, Ben Wiederhake
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030752415
CIAC
CIAC
We prove that the distance-\(r\) dominating set, distance-\(r\) connected dominating set, distance-\(r\) vertex cover, and distance-\(r\) connected vertex cover problems admit constant factor approximations in the CONGEST model of distributed computi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::882f662d3a19c90b21f954cb49d0c2f9
https://doi.org/10.1007/978-3-030-75242-2_3
https://doi.org/10.1007/978-3-030-75242-2_3
Autor:
Saeed Akhoondian Amiri
Publikováno v:
Information Processing Letters. 170:106123
We show that there is no subexponential time algorithm for computing the exact solution of the maximum independent set problem in d-regular graphs, unless ETH fails. We expand our method to show that it helps to provide lowerbounds for other covering
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e6614b252dbf089c6a39c60f9a9d9c46
https://doi.org/10.1016/j.ipl.2021.106123
https://doi.org/10.1016/j.ipl.2021.106123
Publikováno v:
Networking
University of Vienna-u:cris
University of Vienna-u:cris
Waypoint routing is a novel communication model in which traffic is steered through one or multiple so-called waypoints along the route from source to destination. Waypoint routing is used to implement more complex policies or to compose novel networ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3e130944f5099f617f6540c326729a7f
https://doi.org/10.23919/ifipnetworking.2018.8696560
https://doi.org/10.23919/ifipnetworking.2018.8696560
Publikováno v:
Amiri, S A, Foerster, K T, Jacob, R & Schmid, S 2018, ' Charting the algorithmic complexity of waypoint routing ', Computer Communication Review, vol. 48, no. 1, pp. 42-48 . https://doi.org/10.1145/3211852.3211859
Akhoondian Amiri, S, Förster, K-T, Jacob, R & Schmid, S 2018, ' Charting the Algorithmic Complexity of Waypoint Routing ', Computer Communications Review, vol. 48, no. 1, pp. 42-48 . https://doi.org/10.1145/3211852.3211859
Scopus-Elsevier
Akhoondian Amiri, S, Förster, K-T, Jacob, R & Schmid, S 2018, ' Charting the Algorithmic Complexity of Waypoint Routing ', Computer Communications Review, vol. 48, no. 1, pp. 42-48 . https://doi.org/10.1145/3211852.3211859
Scopus-Elsevier
Modern computer networks support interesting new routing models in which traffic flows from a source sto a destination t can be flexibly steered through a sequence of waypoints, such as (hardware) middleboxes or (virtualized) network functions (VNFs)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5721f5a6734786a2c637a3cfd5870e28
https://vbn.aau.dk/da/publications/0ae6421e-22db-4439-af71-dc257f3efeb6
https://vbn.aau.dk/da/publications/0ae6421e-22db-4439-af71-dc257f3efeb6
Publikováno v:
Information Processing Letters
41st International Symposium on Mathematical Foundations of Computer Science
41st International Symposium on Mathematical Foundations of Computer Science
We study the version of the k-disjoint paths problem where k demand pairs ( s 1 , t 1 ) , …, ( s k , t k ) are specified in the input and the paths in the solution are allowed to intersect, but such that no vertex is on more than c paths. We show t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5edd0317cd4b540976574018fa1a5b26
https://doi.org/10.1016/j.ipl.2019.105836
https://doi.org/10.1016/j.ipl.2019.105836
Publikováno v:
ACM Transactions on Algorithms
The Minimum Dominating Set (MDS) problem is one of the most fundamental and challenging problems in distributed computing. While it is well-known that minimum dominating sets cannot be approximated locally on general graphs, over the last years, ther
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::16d9a7eb5ac5f5144d3537f29a56fc85
Publikováno v:
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures
SPAA
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, Jul 2018, Vienna, France. ⟨10.1145/3210377.3210383⟩
SPAA
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, Jul 2018, Vienna, France. ⟨10.1145/3210377.3210383⟩
We provide a new constant factor approximation algorithm for the (connected) distance-$r$ dominating set problem on graph classes of bounded expansion. Classes of bounded expansion include many familiar classes of sparse graphs such as planar graphs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::759cae4624bd059c5b1d95b16387af9a
Publikováno v:
Structural Information and Communication Complexity
Amiri, S, Ludwig, A, Marcinkowski, J & Schmid, S 2016, Transiently Consistent SDN Updates : Being Greedy is Hard . in Structural Information and Communication Complexity : International Colloquium on Structural Information and Communication Complexity (SIROCCO) . Springer, Lecture Notes in Computer Science, vol. 9988, pp. 391-406, 23rd International Colloquium on Structural Information and Communication Complexity, Helsinki, Finland, 19/07/2016 . https://doi.org/10.1007/978-3-319-48314-6_25
Structural Information and Communication Complexity ISBN: 9783319483139
SIROCCO
Structural Information and Communication Complexity-23rd International Colloquium
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Structural Information and Communication Complexity
Amiri, S, Ludwig, A, Marcinkowski, J & Schmid, S 2016, Transiently Consistent SDN Updates : Being Greedy is Hard . in Structural Information and Communication Complexity : International Colloquium on Structural Information and Communication Complexity (SIROCCO) . Springer, Lecture Notes in Computer Science, vol. 9988, pp. 391-406, 23rd International Colloquium on Structural Information and Communication Complexity, Helsinki, Finland, 19/07/2016 . https://doi.org/10.1007/978-3-319-48314-6_25
Structural Information and Communication Complexity ISBN: 9783319483139
SIROCCO
Structural Information and Communication Complexity-23rd International Colloquium
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Structural Information and Communication Complexity
The software-defined networking paradigm introduces interesting opportunities to operate networks in a more flexible, optimized, yet formally verifiable manner. Despite the logically centralized control, however, a Software-Defined Network (SDN) is s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::42e0f946af98e02cbcbe0bd8c49be1c3