Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Kristóf Bérczi"'
Publikováno v:
Discrete Mathematics, 346 (9)
Discrete Mathematics, 346 (9)
ISSN:0012-365X
ISSN:1872-681X
ISSN:0012-365X
ISSN:1872-681X
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::89fb2ed76d48526e6a59af5dfbf381b0
https://hdl.handle.net/20.500.11850/615024
https://hdl.handle.net/20.500.11850/615024
Publikováno v:
Theoretical Computer Science. 856:68-74
Given a CNF formula $\Phi$ with clauses $C_1,\ldots,C_m$ and variables $V=\{x_1,\ldots,x_n\}$, a truth assignment $a:V\rightarrow\{0,1\}$ of $\Phi$ leads to a clause sequence $\sigma_\Phi(a)=(C_1(a),\ldots,C_m(a))\in\{0,1\}^m$ where $C_i(a) = 1$ if c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::abb9eec75785cde6c37554b21b93831d
https://doi.org/10.1016/j.tcs.2020.12.021
https://doi.org/10.1016/j.tcs.2020.12.021
Publikováno v:
SIAM Journal on Discrete Mathematics. 35:2192-2209
In the list coloring problem for two matroids, we are given matroids $M_1=(S,{\mathcal{I}}_1)$ and $M_2=(S,{\mathcal{I}}_2)$ on the same ground set $S$, and the goal is to determine the smallest nu...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f975bb1ab52139f12862453af6ef1295
https://doi.org/10.1137/20m1385615
https://doi.org/10.1137/20m1385615
One of the most important questions in matroid optimization is to find disjoint common bases of two matroids. The significance of the problem is well-illustrated by the long list of conjectures that can be formulated as special cases. B\'erczi and Sc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7b15399a989b49ea6598be2ce2822b9e
http://arxiv.org/abs/2206.11924
http://arxiv.org/abs/2206.11924
We provide a combinatorial study of split matroids, a class that was motivated by the study of matroid polytopes from a tropical geometry point of view. A nice feature of split matroids is that they generalize paving matroids, while being closed unde
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c569b349eb7ee82a0f3ecd2eed39eacf
http://arxiv.org/abs/2202.04371
http://arxiv.org/abs/2202.04371
We introduce a new class of inverse optimization problems in which an input solution is given together with $k$ linear weight functions, and the goal is to modify the weights by the same deviation vector $p$ so that the input solution becomes optimal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::09c376a10963ce209589bfd0b059018d
Publikováno v:
Omega-The International Journal of Management Science (2022)
A fundamental variant of the classical traveling salesman problem (TSP) is the so-called multiple TSP (mTSP), where a set of m salesmen jointly visit all cities from a set of n cities. The mTSP models many important real-life applications, in particu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c860c6f354d96b85d827f145ad7faf78
https://hdl.handle.net/11420/14130
https://hdl.handle.net/11420/14130
Publikováno v:
SIAM Journal on Discrete Mathematics (2022)
Technische Universität Hamburg
Technische Universität Hamburg
In the Many-visits Path TSP, we are given a set of $n$ cities along with their pairwise distances (or cost) $c(uv)$, and moreover each city $v$ comes with an associated positive integer request $r(v)$. The goal is to find a minimum-cost path, startin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::46fb5834bcd94f7582863f6f8bc0b11e
https://hdl.handle.net/11420/6891
https://hdl.handle.net/11420/6891
Publikováno v:
Information Processing Letters. 180:106340
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::29f5a7cae6762bcc9f5be592ceefd63c
https://doi.org/10.1016/j.ipl.2022.106340
https://doi.org/10.1016/j.ipl.2022.106340
Publikováno v:
Mathematical Programming. 184:411-443
We investigate the approximability of the linear 3-cut problem in directed graphs. The input here is a directed graph $$D=(V,E)$$ with node weights and three specified terminal nodes $$s,r,t\in V$$ , and the goal is to find a minimum weight subset of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::299b7e99512eb43ddf71ee18908a113f
https://doi.org/10.1007/s10107-019-01417-9
https://doi.org/10.1007/s10107-019-01417-9