Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Jiamjitrak, Wanchote Po"'
Autor:
Biktairov, Yuriy, Gąsieniec, Leszek, Jiamjitrak, Wanchote Po, Namrata, Smith, Benjamin, Wild, Sebastian
In Polyamorous Scheduling, we are given an edge-weighted graph and must find a periodic schedule of matchings in this graph which minimizes the maximal weighted waiting time between consecutive occurrences of the same edge. This NP-hard problem gener
Externí odkaz:
http://arxiv.org/abs/2411.06292
openaire: EC/H2020/759557/EU//ALGOCom In the Maximum Balanced Biclique Problem (MBB), we are given an n-vertex graph G= (V, E), and the goal is to find a balanced complete bipartite subgraph with q vertices on each side while maximizing q. The MBB pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______661::eace1b697e6d92383f71b78d95e0f3d5
https://aaltodoc.aalto.fi/handle/123456789/61842
https://aaltodoc.aalto.fi/handle/123456789/61842
openaire: EC/H2020/759557/EU//ALGOCom The long-standing dynamic optimality conjecture postulates the existence of a dynamic binary search tree (BST) that is Op1q-competitive to all other dynamic BSTs. Despite attempts from many groups of researchers,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4918536e6b9a166911797cd7c4bc359a