2 citations · 6 across the 18 of their papers we have counts for
4 papers · 1 filter
Online Spectral Approximation in Random Order Streams
Masataka Gohda, Naonori Kakimura
This paper studies spectral approximation for a positive semidefinite matrix in the online setting. It is known in [Cohen et al. APPROX 2016] that we can construct a spectral appro…
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama +2
Motivated by adjacency in perfect matching polytopes, we study the shortest reconfiguration problem of perfect matchings via alternating cycles. Namely, we want to find a shortest…
Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising
Daisuke Hatano, Yuko Kuroki, Yasushi Kawase +3
Computational advertising has been studied to design efficient marketing strategies that maximize the number of acquired customers. In an increased competitive market, however, a m…
Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries
Charalampos E. Tsourakakis, Tianyi Chen, Naonori Kakimura +1
In the densest subgraph problem, given a weighted undirected graph , with non-negative edge weights, we are asked to find a subset of nodes that maximizes…