Zobrazeno 1 - 10
of 138
pro vyhledávání: '"Yamaguchi, Yutaro"'
In this paper, we consider the tractability of the matroid intersection problem under the minimum rank oracle. In this model, we are given an oracle that takes as its input a set of elements, and returns as its output the minimum of the ranks of the
Externí odkaz:
http://arxiv.org/abs/2407.03229
We investigate the tractability of a simple fusion of two fundamental structures on graphs, a spanning tree and a perfect matching. Specifically, we consider the following problem: given an edge-weighted graph, find a minimum-weight spanning tree amo
Externí odkaz:
http://arxiv.org/abs/2407.02958
Autor:
Murakami, Hitoshi, Yamaguchi, Yutaro
The exact matching problem is a constrained variant of the maximum matching problem: given a graph with each edge having a weight $0$ or $1$ and an integer $k$, the goal is to find a perfect matching of weight exactly $k$. Mulmuley, Vazirani, and Vaz
Externí odkaz:
http://arxiv.org/abs/2405.02829
Autor:
Norose, Ryoma, Yamaguchi, Yutaro
Finding a minimum-weight strongly connected spanning subgraph of an edge-weighted directed graph is equivalent to the weighted version of the well-known strong connectivity augmentation problem. This problem is NP-hard, and a simple $2$-approximation
Externí odkaz:
http://arxiv.org/abs/2404.17927
In this paper, we propose a randomized $\tilde{O}(\mu(G))$-round algorithm for the maximum cardinality matching problem in the CONGEST model, where $\mu(G)$ means the maximum size of a matching of the input graph $G$. The proposed algorithm substanti
Externí odkaz:
http://arxiv.org/abs/2311.04140
Autor:
Jüttner, Alpár, Király, Csaba, Mendoza-Cadena, Lydia Mirabel, Pap, Gyula, Schlotter, Ildikó, Yamaguchi, Yutaro
We consider the Shortest Odd Path problem, where given an undirected graph $G$, a weight function on its edges, and two vertices $s$ and $t$ in $G$, the aim is to find an $(s,t)$-path with odd length and, among all such paths, of minimum weight. For
Externí odkaz:
http://arxiv.org/abs/2308.12653
Matroid intersection is one of the most powerful frameworks of matroid theory that generalizes various problems in combinatorial optimization. Edmonds' fundamental theorem provides a min-max characterization for the unweighted setting, while Frank's
Externí odkaz:
http://arxiv.org/abs/2209.14516
Fast Primal-Dual Update against Local Weight Update in Linear Assignment Problem and Its Application
We consider a dynamic situation in the weighted bipartite matching problem: edge weights in the input graph are repeatedly updated and we are asked to maintain an optimal matching at any moment. A trivial approach is to compute an optimal matching fr
Externí odkaz:
http://arxiv.org/abs/2208.11325
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:
http://arxiv.org/abs/2202.04371
Autor:
Minato, Shin-ichi, Banbara, Mutsunori, Horiyama, Takashi, Kawahara, Jun, Takigawa, Ichigaku, Yamaguchi, Yutaro
In this paper, we propose a fast method for exactly enumerating a very large number of all lower cost solutions for various combinatorial problems. Our method is based on backtracking for a given decision diagram which represents all the feasible sol
Externí odkaz:
http://arxiv.org/abs/2201.08118