
Reallocation Problems with Minimum Completion Time
Reallocation scheduling is one of the most fundamental problems in vario...
read it

Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties
Motivated by a serious issue that hospitals in rural areas suffer from s...
read it

Fair and Truthful Mechanism with Limited Subsidy
The notion of envyfreeness is a natural and intuitive fairness requirem...
read it

A 3/4 Differential Approximation Algorithm for Traveling Salesman Problem
In this paper, we consider differential approximability of the traveling...
read it

Fair Ride Allocation on a Line
With the advent of the ridesharing platform, the carpooling has become ...
read it

Envyfree Relaxations for Goods, Chores, and Mixed Items
In fair division problems, we are given a set S of m items and a set N o...
read it

Unique key Horn functions
Given a relational database, a key is a set of attributes such that a va...
read it

Generating clause sequences of a CNF formula
Given a CNF formula Φ with clauses C_1,...,C_m and variables V={x_1,...,...
read it

Online Knapsack Problems with a Resource Buffer
In this paper, we introduce online knapsack problems with a resource buf...
read it

Ranking topk trees in treebased phylogenetic networks
'Treebased' phylogenetic networks proposed by Francis and Steel have at...
read it

Approximating minimum representations of key Horn functions
Horn functions form a subclass of Boolean functions and appear in many d...
read it

Finding Sparse Solutions for Packing and Covering Semidefinite Programs
Packing and covering semidefinite programs (SDPs) appear in natural rela...
read it
Kazuhisa Makino
is this you? claim profile