3 citations · 4 across the 4 of their papers we have counts for
8 papers
Hypergraph characterization of split matroids
Kristóf Bérczi, Tamás Király, Tamás Schwarcz +2
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 mat…
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem
Yuya Masumura, Taihei Oki, Yutaro Yamaguchi
We study the generalized minimum Manhattan network (GMMN) problem: given a set of pairs of two points in the Euclidean plane , we are required to find a minimum-l…
List colouring of two matroids through reduction to partition matroids
Kristóf Bérczi, Tamás Schwarcz, Yutaro Yamaguchi
In the list coloring problem for two matroids, we are given matroids and on the same ground set , and the goal is to determine the smal…
Multiple Knapsack-Constrained Monotone DR-Submodular Maximization on Distributive Lattice --- Continuous Greedy Algorithm on Median Complex ---
Takanori Maehara, So Nakashima, Yutaro Yamaguchi
We consider a problem of maximizing a monotone DR-submodular function under multiple order-consistent knapsack constraints on a distributive lattice. Since a distributive lattice i…
Stochastic Monotone Submodular Maximization with Queries
Takanori Maehara, Yutaro Yamaguchi
We study a stochastic variant of monotone submodular maximization problem as follows. We are given a monotone submodular function as an objective function and a feasible domain def…
Tight Approximation for Unconstrained XOS Maximization
Yuval Filmus, Yasushi Kawase, Yusuke Kobayashi +1
A set function is called XOS if it can be represented by the maximum of additive functions. When such a representation is fixed, the number of additive functions required to define…