Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Mathematics of computing → Matroids and greedoids"'
Autor:
Terao, Tatsuya
In the matroid partitioning problem, we are given $k$ matroids $\mathcal{M}_1 = (V, \mathcal{I}_1), \dots , \mathcal{M}_k = (V, \mathcal{I}_k)$ defined over a common ground set $V$ of $n$ elements, and we need to find a partitionable set $S \subseteq
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0ee93a74dcd1f177e979149d35b25ac6
Autor:
Tu, Ta-Wei
Given two matroids ℳ₁ = (V, ℐ₁) and ℳ₂ = (V, ℐ₂) over an n-element integer-weighted ground set V, the weighted matroid intersection problem aims to find a common independent set S^* ∈ ℐ₁ ∩ ℐ₂ maximizing the weight of S^*.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2a10bc7bc731e571a25c03dfe2314aba
http://arxiv.org/abs/2212.00508
http://arxiv.org/abs/2212.00508
An intensive line of research on fixed parameter tractability of integer programming is focused on exploiting the relation between the sparsity of a constraint matrix A and the norm of the elements of its Graver basis. In particular, integer programm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9387609f942d2a5cb0589237fd07af93
http://arxiv.org/abs/2202.05299
http://arxiv.org/abs/2202.05299
Autor:
Blikstad, Joakim
Despite a lot of recent progress in obtaining faster sequential matroid intersection algorithms, the fastest parallel poly(n)-query algorithm was still the straightforward O(n)-round parallel implementation of Edmonds' augmenting paths algorithm from
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4bbb4969a9c5d5999d69f8eb7ad4ed61
The SAT modulo Symmetries (SMS) is a recently introduced framework for dynamic symmetry breaking in SAT instances. It combines a CDCL SAT solver with an external lexicographic minimality checking algorithm. We extend SMS from graphs to matroids and u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ea2b1de4c12f255e039fc6788f1119c2
Autor:
Blikstad, Joakim
We present algorithms that break the $\tilde O(nr)$-independence-query bound for the Matroid Intersection problem for the full range of $r$; where $n$ is the size of the ground set and $r\leq n$ is the size of the largest common independent set. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::71df64df40cd0ee235e354f9b7125097
http://arxiv.org/abs/2105.05673
http://arxiv.org/abs/2105.05673
For an abelian group $��$, a $��$-labelled graph is a graph whose vertices are labelled by elements of $��$. We prove that a certain collection of edge sets of a $��$-labelled graph forms a delta-matroid, which we call a $��$-grap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::69a3d613e95c40350c53451fbf9327f7
Front Matter, Table of Contents, Preface, Conference Organization
LIPIcs, Vol. 204, 29th Annual European Symposium on Algorithms (ESA 2021), pages 0:i-0:xx
LIPIcs, Vol. 204, 29th Annual European Symposium on Algorithms (ESA 2021), pages 0:i-0:xx
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::680fffb25a506337a0daa8b00debae2e
Autor:
Ghosh, Sumanta, Gurjar, Rohit
We study the matroid intersection problem from the parallel complexity perspective. Given two matroids over the same ground set, the problem asks to decide whether they have a common base and its search version asks to find a common base, if one exis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cc45036f31f91089b989b39d2ce71f4b
LIPIcs, Volume 204, ESA 2021, Complete Volume
LIPIcs, Vol. 204, 29th Annual European Symposium on Algorithms (ESA 2021), pages 1-1340
LIPIcs, Vol. 204, 29th Annual European Symposium on Algorithms (ESA 2021), pages 1-1340
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a473de808f7f82a1dee1c640d7ddabfd