In the vertex cover interdiction problem, we are given an undirected graph $G=(V,E)$, two integers $t$ and $k$ and a vertex subset $B\subseteq V$, and we are asked to find a set $X \subseteq B$ with $|X|\leq t$ such that $X$ hits (i.e., intersects) all the vertex covers of $G$ of size at most $k$. Recently, Gr\"une and...
Takehiro Ito, Naonori Kakimura, N. Kamiyama et al.· 0 citations
A learning algorithm for general optimization problems with linear objective functions that eliminates the need to solve inverse optimization problems, and achieves competitive performance in terms of regret compared with existing methods, while offering improved computational efficiency for certain classes of downstre...
Yasunari Hikima, N. Kamiyama, Shinsaku Sakaue et al.· Proceedings of the Thirty-Fi...· 0 citations
This paper strengthens Agafonov and Yakovlev's result by proving that LA-MAPF is PSPACE-complete via a polynomial-time reduction from Restricted Sliding Tokens.
Mai-Dan Zhang, N. Kamiyama, Kanae Yoshiwatari· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
