Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Jiamjitrak, Wanchote"'
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
Minimum flow decomposition (MFD) is the strongly NP-hard problem of finding a smallest set of integer weighted paths in a graph $G$ whose weighted sum is equal to a given flow $f$ on $G$. Despite its many practical applications, we lack an understand
Externí odkaz:
http://arxiv.org/abs/2409.20278
Autor:
Chalermsook, Parinya, Gupta, Manoj, Jiamjitrak, Wanchote, Pareek, Akash, Yingchareonthawornchai, Sorrachai
The access lemma (Sleator and Tarjan, JACM 1985) is a property of binary search trees that implies interesting consequences such as static optimality, static finger, and working set property. However, there are known corollaries of the dynamic optima
Externí odkaz:
http://arxiv.org/abs/2312.15426
Autor:
Chalermsook, Parinya, Gupta, Manoj, Jiamjitrak, Wanchote, Acosta, Nidia Obscura, Pareek, Akash, Yingchareonthawornchai, Sorrachai
Greedy BST (or simply Greedy) is an online self-adjusting binary search tree defined in the geometric view ([Lucas, 1988; Munro, 2000; Demaine, Harmon, Iacono, Kane, Patrascu, SODA 2009). Along with Splay trees (Sleator, Tarjan 1985), Greedy is consi
Externí odkaz:
http://arxiv.org/abs/2211.04112
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
Publikováno v:
In Electronic Notes in Discrete Mathematics August 2017 61:655-661
