Zobrazeno 1 - 10
of 42
pro vyhledávání: '"Amir Nayyeri"'
Autor:
Hao Tsung Yang, Peyman Afshani, Benjamin Raichel, Jie Gao, Rik Sarkar, Haotian Wang, Maarten Löffler, Kevin Buchin, Amir Nayyeri, Mark de Berg
Publikováno v:
Algorithmic Foundations of Robotics XIV ISBN: 9783030667221
WAFR
WAFR
We consider the problem of finding patrol schedules for k robots to visit a given set of n sites in a metric space. Each robot has the same maximum speed and the goal is to minimize the weighted maximum latency of any site, where the latency of a sit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a8650c147b75678f2acc85d3e90d9089
https://doi.org/10.1007/978-3-030-66723-8_7
https://doi.org/10.1007/978-3-030-66723-8_7
Publikováno v:
The VLDB Journal. 27:369-394
It is known that annotating named entities in unstructured and semi-structured data sets by their concepts improves the effectiveness of answering queries over these data sets. As every enterprise has a limited budget of time or computational resourc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4e5f5cc4e8725dba6e27e7db1e176930
https://doi.org/10.1007/s00778-018-0501-1
https://doi.org/10.1007/s00778-018-0501-1
Publikováno v:
Theory of Computing. 13:1-47
The genus of a graph is a very basic parameter in topological graph theory, that has been the subject of extensive study. Perhaps surprisingly, despite its importance, the problem of approximating the genus of a graph is very poorly understood. It ha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7409b451a142ae73083565f3c751915c
https://doi.org/10.4086/toc.2017.v013a005
https://doi.org/10.4086/toc.2017.v013a005
We describe algorithms to efficiently compute minimum $(s,t)$-cuts and global minimum cuts of undirected surface-embedded graphs. Given an edge-weighted undirected graph $G$ with $n$ vertices embedded on an orientable surface of genus $g$, our algori
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aff7389e4b98386c959d72a3925be04b
http://arxiv.org/abs/1910.04278
http://arxiv.org/abs/1910.04278
Publikováno v:
WebDB
It is known that annotating entities in unstructured and semistructured datasets by their concepts improves the effectiveness of answering queries over these datasets. Ideally, one would like to annotate entities of all relevant concepts in a dataset
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::272121a9cf820cfd26193b4c6b7d5c02
https://doi.org/10.1145/3068839.3068841
https://doi.org/10.1145/3068839.3068841
Autor:
Amir Nayyeri, Benjamin Raichel
Publikováno v:
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf2978c3206e01b1d37dc5ea2a23d3cf
https://doi.org/10.1137/1.9781611974782.46
https://doi.org/10.1137/1.9781611974782.46
Publikováno v:
Discrete & Computational Geometry. 52:450-475
Let $$G$$G be a directed graph with $$n$$n vertices embedded on an orientable surface of genus $$g$$g with two designated vertices $$s$$s and $$t$$t. We show that computing the number of minimum $$(s,t)$$(s,t)-cuts in $$G$$G is fixed-parameter tracta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a8e9dc91071a3836131302ae3100a12
https://doi.org/10.1007/s00454-014-9623-4
https://doi.org/10.1007/s00454-014-9623-4