Výsledky vyhledávání - "Laminar family"

Akademický článek

IMPROVED FIRST PLAYER STRATEGY FOR THE ZERO-SUM SEQUENTIAL UNCROSSING GAME

Autor: Ksenia Rizhenko

Publikováno v: Ural Mathematical Journal, Vol 10, Iss 1 (2024)

This paper deals with the known uncrossing zero-sum two-player sequential game, which is employed to obtain upper running time bound for the transformation of an arbitrary subset family of some finite set to an appropriate laminar one. In this game,

Externí odkaz: https://doaj.org/article/1c20c47a4c954e05aadd682dc720653c

Zobrazit plný text záznamu

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.

A Ranged Laminar Family in Graphs and Its Application (Mathematical Optimization Theory and its Algorithm)

Autor: Nagamochi, Hiroshi, Abe, Yuusuke, Ishii, Toshimasa

Publikováno v: 数理解析研究所講究録. 1241:157-165

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=jairo_______::488646a37628ce6d742b63920b36b479
http://hdl.handle.net/2433/41639

Zobrazit plný text záznamu

Covering a laminar family by leaf to leaf links

Autor: Yael Maduel, Zeev Nutov

Publikováno v: Discrete Applied Mathematics. (13):1424-1432

The Tree Augmentation Problem (TAP) is: given a tree T=(V,E) and a set E of edges (called links) on V disjoint to E, find a minimum-size edge-subset [email protected]?E such that T+F is 2-edge-connected. TAP is equivalent to the problem of finding a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4e71abac6c5fdf2afa6dfe39e489e368

Zobrazit plný text záznamu

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.

Online Paging with Heterogeneous Cache Slots

Autor: Chrobak, Marek, Haney, Samuel, Liaee, Mehraneh, Panigrahi, Debmalya, Rajaraman, Rajmohan, Sundaram, Ravi, Young, Neal E.

It is natural to generalize the online k-Server problem by allowing each request to specify not only a point p, but also a subset S of servers that may serve it. To initiate a systematic study of this generalization, we focus on uniform and star metr

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c13d073cd79b4a7df0aca3cb2b2695fe

Zobrazit plný text záznamu

Algorithms for hierarchical and semi-partitioned parallel scheduling

Autor: Gianlorenzo D'Angelo, Vincenzo Bonifaci, Alberto Marchetti-Spaccamela

Publikováno v: Journal of Computer and System Sciences
Journal of Computer and System Sciences, Elsevier, 2021, 120, pp.116-136. ⟨10.1016/j.jcss.2021.03.006⟩
Journal of Computer and System Sciences, 2021, 120, pp.116-136. ⟨10.1016/j.jcss.2021.03.006⟩
Proceedings-IEEE International Parallel and Distributed Processing Symposium (2017): 738–747. doi:10.1109/IPDPS.2017.22
info:cnr-pdr/source/autori:Bonifaci, Vincenzo; D'Angelo, Gianlorenzo; Marchetti-Spaccamela, Alberto/titolo:Algorithms for Hierarchical and Semi-Partitioned Parallel Scheduling/doi:10.1109%2FIPDPS.2017.22/rivista:Proceedings-IEEE International Parallel and Distributed Processing Symposium/anno:2017/pagina_da:738/pagina_a:747/intervallo_pagine:738–747/volume
IPDPS

We propose a model for scheduling jobs in a parallel machine setting that takes into account the cost of migrations by assuming that the processing time of a job may depend on the specific set of machines among which the job is migrated. For the make

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4ad0cfdac60c222d4d9fe4c8d03bc012
http://hdl.handle.net/11573/1571248

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání