Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Orgo, Ly"'
Autor:
Chalermsook, Parinya, Fomin, Fedor, Hamm, Thekla, Korhonen, Tuukka, Nederlof, Jesper, Orgo, Ly
We prove the following result about approximating the maximum independent set in a graph. Informally, we show that any approximation algorithm with a ``non-trivial'' approximation ratio (as a function of the number of vertices of the input graph $G$)
Externí odkaz:
http://arxiv.org/abs/2307.01341
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