Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Saller, Sophia"'
The traveling salesman (or salesperson) problem, short TSP, is a problem of strong interest to many researchers from mathematics, economics, and computer science. Manifold TSP variants occur in nearly every scientific field and application domain: en
Externí odkaz:
http://arxiv.org/abs/2311.00604
Autor:
Saller, Sophia, Koehler, Jana
Publikováno v:
Twentieth International Workshop on Constraint Modelling and Reformulation, ModRef, 2021
Domain-specific constraint patterns are introduced, which form the counterpart to design patterns in software engineering for the constraint programming setting. These patterns describe the expert knowledge and best-practice solution to recurring pro
Externí odkaz:
http://arxiv.org/abs/2206.02479
Autor:
McDiarmid, Colin, Saller, Sophia
Given a `genus' function $g=g(n)$, we let $\mathcal{E}^g$ be the class of all graphs $G$ such that if $G$ has order $n$ (that is, has $n$ vertices) then it is embeddable in a surface of Euler genus at most $g(n)$. Let the random graph $R_n$ be sample
Externí odkaz:
http://arxiv.org/abs/2108.07666
Autor:
McDiarmid, Colin, Saller, Sophia
Given a function $g=g(n)$ we let ${\mathcal E}^g$ be the class of all graphs $G$ such that if $G$ has order $n$ (that is, has $n$ vertices) then it is embeddable in some surface of Euler genus at most $g(n)$, and let ${\widetilde{\mathcal E}}^g$ be t
Externí odkaz:
http://arxiv.org/abs/2106.06775
Autor:
Koehler, Jana, Bürgler, Joseph, Fontana, Urs, Fux, Etienne, Herzog, Florian, Pouly, Marc, Saller, Sophia, Salyaeva, Anastasia, Scheiblechner, Peter, Waelti, Kai
Cable trees are used in industrial products to transmit energy and information between different product parts. To this date, they are mostly assembled by humans and only few automated manufacturing solutions exist using complex robotic machines. For
Externí odkaz:
http://arxiv.org/abs/2011.12862
Autor:
McDiarmid, Colin, Saller, Sophia
Publikováno v:
Random Structures & Algorithms; Jul2024, Vol. 64 Issue 4, p940-985, 46p
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.
Autor:
McDiarmid, Colin, Saller, Sophia
Publikováno v:
Combinatorial Theory. 3
Given a function $g=g(n)$ we let ${\mathcal E}^g$ be the class of all graphs $G$ such that if $G$ has order $n$ (that is, has $n$ vertices) then it is embeddable in some surface of Euler genus at most $g(n)$, and let ${\widetilde{\mathcal E}}^g$ be t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8ae450df608e73edf1ccfe1f13c40524
https://doi.org/10.5070/c63160417
https://doi.org/10.5070/c63160417
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.