49 citations · 80 across the 23 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
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…
math.CO2018★ 3 cited
Finding a Path with Two Labels Forbidden in Group-Labeled Graphs
Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi
The parity of the length of paths and cycles is a classical and well-studied topic in graph theory and theoretical computer science. The parity constraints can be extended to label…