This paper proposes an algorithm for online linear optimization problem over permutations; the objective of the online algorithm is to find a permutation of {1, . . . , n} at each trial so as toâ€¦ (More)

We consider an online prediction problem of combinatorial concepts where each combinatorial concept is represented as a vertex of a polyhedron described by a submodular function (base polyhedron). Inâ€¦ (More)

In this paper, we propose a fully polynomial-time randomized approximation scheme (FPRAS) for the closed Jackson network. Our algorithm is based on Markov chain Monte Carlo (MCMC) method. Thus, ourâ€¦ (More)

This paper proposes a polynomial time perfect (exact) sampling algorithm for 2 Ã— n contingency tables. The algorithm is based on monotone coupling from the past (monotone CFTP) algorithm. Theâ€¦ (More)

The rotor-router model, also known as the Propp machine, is a deterministic process analogous to a random walk on a graph [1]. Instead of distributing tokens to randomly chosen neighbors, theâ€¦ (More)

We make an attempt to understand the dominating set counting problem in graph classes from the viewpoint of polynomial-time computability. We give polynomial-time algorithms to count the number ofâ€¦ (More)

We discuss the problems to list, sample, and count the chordal graphs with edge constraints. The edge constraints are given as a pair of graphs one of which contains the other and one of which isâ€¦ (More)