Zobrazeno 1 - 10
of 370
pro vyhledávání: '"Linear time algorithms"'
Publikováno v:
Algorithms, Vol 16, Iss 6, p 281 (2023)
We consider a problem in computational origami. Given a piece of paper as a convex polygon P and a point f located within, we fold every point on a boundary of P to f and compute a region that is safe from folding, i.e., the region with no creases. T
Externí odkaz:
https://doaj.org/article/9aed67fc9f51401b8ae60e98667e50db
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Algorithms; Volume 16; Issue 6; Pages: 281
We consider a problem in computational origami. Given a piece of paper as a convex polygon P and a point f located within, we fold every point on a boundary of P to f and compute a region that is safe from folding, i.e., the region with no creases. T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=multidiscipl::44b7119456a1ca2f1ee583e76b23d233
Publikováno v:
Algorithmica.
A planar orthogonal drawing of a planar 4-graph G (i.e., a planar graph with vertex-degree at most four) is a crossing-free drawing that maps each vertex of G to a distinct point of the plane and each edge of G to a polygonal chain consisting of hori
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ab252d841f1cb03873ded9e71eacaa8c
https://doi.org/10.1007/s00453-023-01110-6
https://doi.org/10.1007/s00453-023-01110-6
In the weighted load balancing problem, the input is an n-vertex bipartite graph between a set of clients and a set of servers, and each client comes with some nonnegative real weight. The output is an assignment that maps each client to one of its a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::29c21e9875340e5bac2da91dddbb8a5f
http://arxiv.org/abs/2301.07007
http://arxiv.org/abs/2301.07007
Autor:
Dorobisz, Andrzej, Kozik, Jakub
We investigate local computation algorithms (LCA) for two-coloring of k-uniform hypergraphs. We focus on hypergraph instances that satisfy strengthened assumption of the Lovász Local Lemma of the form 2^(1-αk) (Δ+1) e < 1, where Δ is the bound on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8fd322421068d84af996ed1192e5ca9d
We generalize the celebrated isoperimetric inequality of Khot, Minzer, and Safra (SICOMP 2018) for Boolean functions to the case of real-valued functions f:{0,1}^d → ℝ. Our main tool in the proof of the generalized inequality is a new Boolean dec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e2b6b4b262bfe86f23de165eb661c730
Autor:
Cohen Sidon, Omer, Ron, Dana
In this work, we study the problem of approximating the distance to subsequence-freeness in the sample-based distribution-free model. For a given subsequence (word) w = w_1 … w_k, a sequence (text) T = t_1 … t_n is said to contain w if there exis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::110f990e0b07ec1cf55cad01907c24b1
Partitioning the vertices of a (hyper)graph into k roughly balanced blocks such that few (hyper)edges run between blocks is a key problem for large-scale distributed processing. A current trend for partitioning huge (hyper)graphs using low computatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5be209eb978c92ec3f6c506ce8ed8f72
Autor:
Geerts, Floris, Vandevoort, Brecht
LIPIcs, Volume 255, ICDT 2023, Complete Volume
LIPIcs, Vol. 255, 26th International Conference on Database Theory (ICDT 2023), pages 1-466
LIPIcs, Vol. 255, 26th International Conference on Database Theory (ICDT 2023), pages 1-466
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::293fb00994779f2d5c23730505bad861