Reconfiguration problems arise when we wish to find a step-by-step transformation between two feasible solutions of a problem such that all intermediate results are also feasible. We demonstrate thatâ€¦ (More)

The problem of computing a matching of maximum weight in a given edge-weighted graph is not known to be P-hard or in RNC. This paper presents four parallel approximation algorithms for this problem.â€¦ (More)

Decision trees are a very general computation model. Here the problem is to identify a Boolean function f out of a given set of Boolean functions F by asking for the value of f at adaptively chosenâ€¦ (More)

Algorithms used in data mining and bioinformatics have to deal with huge amount of data efficiently. In many applications, the data are supposed to have explicit or implicit structures. To developâ€¦ (More)

We give a polynomial-time approximation scheme for the unique unit-square coverage problem: given a set of points and a set of axis-parallel unit squares, both in the plane, we wish to find a subsetâ€¦ (More)

BACKGROUND
To observe the relationship between the PCDD/F and Co-PCB levels in samples of human breast milk and nearby waste incinerators in Tokyo, Japan.
METHODS
Breast milk was taken from 240â€¦ (More)