Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Surianarayanan, Vaishali"'
The \textsc{Capacitated $d$-Hitting Set} problem involves a universe $U$ with a capacity function $\mathsf{cap}: U \rightarrow \mathbb{N}$ and a collection $\mathcal{A}$ of subsets of $U$, each of size at most $d$. The goal is to find a minimum subse
Externí odkaz:
http://arxiv.org/abs/2410.20900
We give two new approximation algorithms to compute the fractional hypertree width of an input hypergraph. The first algorithm takes as input $n$-vertex $m$-edge hypergraph $H$ of fractional hypertree width at most $\omega$, runs in polynomial time a
Externí odkaz:
http://arxiv.org/abs/2409.20172
In the Minimum Bisection problem, input is a graph $G$ and the goal is to partition the vertex set into two parts $A$ and $B$, such that $||A|-|B|| \le 1$ and the number $k$ of edges between $A$ and $B$ is minimized. This problem can be viewed as a c
Externí odkaz:
http://arxiv.org/abs/2308.10657
In the Min $k$-Cut problem, input is an edge weighted graph $G$ and an integer $k$, and the task is to partition the vertex set into $k$ non-empty sets, such that the total weight of the edges with endpoints in different parts is minimized. When $k$
Externí odkaz:
http://arxiv.org/abs/2005.00134
In the Min k-Cut problem, the input is a graph G and an integer k. The task is to find a partition of the vertex set of G into k parts, while minimizing the number of edges that go between different parts of the partition. The problem is NP-complete,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e9f50714c2163a3d48d9074604ecdc9a
In the Dominating Set problem the input is a graph G and an integer k, the task is to determine whether there exists a vertex set S of size at most k so that every vertex not in S has at least one neighbor in S. We consider the parameterized complexi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3bced950b5a5fac501cbd518806c4bf7
We consider a multidimensional space partitioning problem, which we call Anonymity-Preserving Partition. Given a set P of n points in ���^d and a collection H of m axis-parallel hyperplanes, the hyperplanes of H partition the space into an arra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5408af5dedc22ea0351509b89963f844