Zobrazeno 1 - 10
of 124
pro vyhledávání: '"Paluch, Katarzyna"'
We consider problems of finding a maximum size/weight $t$-matching without forbidden subgraphs in an undirected graph $G$ with the maximum degree bounded by $t+1$, where $t$ is an integer greater than $2$. Depending on the variant forbidden subgraphs
Externí odkaz:
http://arxiv.org/abs/2405.00429
Autor:
Paluch, Katarzyna
We consider the problem of finding a maximum size triangle-free $2$-matching in a graph $G=(V,E)$. A (simple) $2$-matching is any subset of the edges such that each vertex is incident to at most two edges from the subset. We present a fast combinator
Externí odkaz:
http://arxiv.org/abs/2311.13590
We consider three variants of the problem of finding a maximum weight restricted $2$-matching in a subcubic graph $G$. (A $2$-matching is any subset of the edges such that each vertex is incident to at most two of its edges.) Depending on the variant
Externí odkaz:
http://arxiv.org/abs/2012.15775
The problem of rectangle tiling binary arrays is defined as follows. Given an $n \times n$ array $A$ of zeros and ones and a natural number $p$, our task is to partition $A$ into at most $p$ rectangular tiles, so that the maximal weight of a tile is
Externí odkaz:
http://arxiv.org/abs/2007.14142
Autor:
Paluch, Katarzyna
In the maximum asymmetric traveling salesman problem (Max ATSP) we are given a complete directed graph with nonnegative weights on the edges and we wish to compute a traveling salesman tour of maximum weight. In this paper we give a fast combinatoria
Externí odkaz:
http://arxiv.org/abs/2005.10800
Publikováno v:
In Theoretical Computer Science 13 September 2023 972
Autor:
Ghosal, Pratik, Paluch, Katarzyna
We consider manipulation strategies for the rank-maximal matching problem. In the rank-maximal matching problem we are given a bipartite graph $G = (A \cup P, E)$ such that $A$ denotes a set of applicants and $P$ a set of posts. Each applicant $a \in
Externí odkaz:
http://arxiv.org/abs/1710.11462
Autor:
Dudycz, Szymon, Paluch, Katarzyna
Given a graph $G=(V,E)$ and for each vertex $v \in V$ a subset $B(v)$ of the set $\{0,1,\ldots, d_G(v)\}$ a $B$-matching of $G$ is any set $F \subseteq E$ such that $d_F(v) \in B(v)$ for each vertex $v$. The general matching problem asks the existenc
Externí odkaz:
http://arxiv.org/abs/1706.07418
Given a bipartite graph, where the two sets of vertices are applicants and posts and ranks on the edges represent preferences of applicants over posts, a {\em rank-maximal} matching is one in which the maximum number of applicants is matched to their
Externí odkaz:
http://arxiv.org/abs/1703.10594
Publikováno v:
In Personality and Individual Differences May 2021 174