16 citations · 22 across the 6 of their papers we have counts for
4 papers · 1 filter
The Secretary Problem with Predictions
Kaito Fujii, Yuichi Yoshida
The value maximization version of the secretary problem is the problem of hiring a candidate with the largest value from a randomly ordered sequence of candidates. In this work, we…
Approximation Guarantees of Local Search Algorithms via Localizability of Set Functions
Kaito Fujii
This paper proposes a new framework for providing approximation guarantees of local search algorithms. Local search is a basic algorithm design technique and is widely used for var…
An improved algorithm for the submodular secretary problem with a cardinality constraint
Kaito Fujii
We study the submodular secretary problem with a cardinality constraint. In this problem, candidates for secretaries appear sequentially in random order. At the arrival of each…
Polynomial-Time Algorithms for Submodular Laplacian Systems
Kaito Fujii, Tasuku Soma, Yuichi Yoshida
Let be an undirected graph, be the associated Laplacian matrix, and be a vector. Solving the Laplacian system $L_G x…