5 citations · 11 across the 22 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2018
The -branching problem in digraphs
Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa
In this paper, we introduce the concept of -branchings in digraphs, which is a generalization of branchings serving as a counterpart of -matchings. Here is a positive int…
cs.DM2010
Set Covering with Ordered Replacement -- Additive and Multiplicative Gaps
Friedrich Eisenbrand, Naonori Kakimura, Thomas Rothvoß +1
We consider set covering problems where the underlying set system satisfies a particular replacement property w.r.t. a given partial order on the elements: Whenever a set is in the…